What's New-Given Below
technicalsymposium
technicalsymposium
technicalsymposium

College Lab Codings/Project Codings-Download


DataStructure-string functions.

#include <stdio.h>
#include <conio.h>
#include <string.h>
#include <alloc.h>
int search ( char *, char ) ;
int isequals ( char *, char * ) ;
int issmaller ( char *, char * ) ;
int isgreater ( char *, char * ) ;
char * getsub ( char *, int, int ) ;
char * leftsub ( char *, int n ) ;
char * rightsub ( char *, int n ) ;
void upper ( char * ) ;
void lower ( char * ) ;
void reverse ( char * ) ;
int replace ( char *, char, char ) ;
int setat ( char *, char, int ) ;
void main( )
{
char s1[ ] = "Hello" ;
char s2[ ] = "Hello World" ;
char s3[ ] = "Four hundred thirty two" ;
char ch, *s ;
int i ;
clrscr( ) ;
printf ( "\nString s1: %s", s1 ) ;
/* check for the first occurrence of a character */
printf ( "\nEnter character to search: " ) ;
scanf ( "%c", &ch ) ;
i = search ( s1, ch ) ;
if ( i != -1 )
printf ( "The first occurrence of character %c is found at index no. %d\n", ch, i ) ;
else
printf ( "Character %c is not present in the list.\n", ch ) ;
printf ( "\nString s2: %s", s2 ) ;
/* compares two strings s1 and s2 */
i = isequals ( s1, s2 ) ;
if ( i == 1 )
printf ( "\nStrings s1 and s2 are identical" ) ;
else
printf ( "\nStrings s1 and s2 are not identical") ;
i = issmaller ( s1, s2 ) ;
if ( i == 1 )
printf ( "\nString s1 is smaller than string s2" ) ;
else
printf ( "\nString s1 is not smaller than string s2" ) ;
i = isgreater ( s1, s2 ) ;
if ( i == 1 )
printf ( "\nString s1 is greater than string s2\n" ) ;
else
printf ( "\nString s1 is not greater than string s2\n" ) ;
/* extract characters at given position */
printf ( "\nString s3: %s", s3 ) ;
s = getsub ( s3, 5, 7 ) ;
printf ( "\nSub string: %s", s ) ;
free ( s ) ;
/* extract leftmost n characters */
s = leftsub ( s3, 4 ) ;
printf ( "\nLeft sub string: %s", s ) ;
free ( s ) ;
/* extract rightmost n characters */
s = rightsub ( s3, 3 ) ;
printf ( "\nRight sub string: %s", s ) ;
free ( s ) ;
/* convert string to uppercase */
upper ( s3 ) ;
printf ( "\nString in upper case: %s", s3 ) ;
/* convert string to lowercase */
lower ( s3 ) ;
printf ( "\nString in lower case: %s", s3 ) ;
/* reverse the given string */
reverse ( s3 ) ;
printf ( "\nReversed string: %s", s3 ) ;
/* replace first occurrence of one char with new one */
replace ( s1, 'H' , 'M' ) ;
printf ( "\nString s1: %s", s1 ) ;
/* sets a char at a given position */
i = setat ( s1, 'M', 3 ) ;
if ( i )
printf ( "\nString s1: %s", s1 ) ;
else
printf ( "\nInvalid position." ) ;
getch( ) ;
}
/* check for the first occurrence of a character */
int search ( char *str, char ch )
{
int i = 0 ;
while ( *str )
{
if ( *str == ch )
return i ;
str++ ;
i++ ;
}
return -1 ;
}
/* checks whether two strings are equal */
int isequals ( char *s, char *t )
{
while ( *s || *t )
{
if ( *s != *t )
return 0 ;
s++ ;
t++ ;
}
return 1 ;
}
/* checks whether first string is less than second */
int issmaller ( char *s, char *t )
{
while ( *t )
{
if ( *s != *t )
{
if ( *s < *t )
return 1 ;
else
return 0 ;
}
t++ ;
s++ ;
}
return 0 ;
}
/* checks whether first string is greater than second */
int isgreater ( char *s, char *t )
{
while ( *s )
{
if ( *s != *t )
{
if ( *s > *t )
return 1 ;
else
return 0 ;
}
s++ ;
t++ ;
}
return 0 ;
}
/* extracts the character at given position */
char * getsub ( char *str, int spos, int n )
{
char *s = str + spos ;
char *t = ( char * ) malloc ( n + 1 ) ;
int i = 0 ;
while ( i < n )
{
t[i] = *s ;
s++ ;
i++ ;
}
t[i] = '\0' ;
return t ;
}
/* extracts leftmost n characters from the string */
char * leftsub ( char *s, int n )
{
char *t = ( char * ) malloc ( n + 1 ) ;
int i = 0 ;
while ( i < n )
{
t[i] = *s ;
s++ ;
i++ ;
}
t[i] = '\0' ;
return t ;
}
/* extracts rightmost n characters from the string */
char * rightsub ( char *str, int n )
{
char *t = ( char * ) malloc ( n + 1 ) ;
int l = strlen ( str ) ;
char *s = str + ( l - n ) ;
int i = 0 ;
while ( i < n )
{
t[i] = *s ;
s++ ;
i++ ;
}
t[i] = '\0' ;
return t ;
}
/* converts string to uppercase */
void upper ( char *s )
{
while ( *s )
{
if ( *s >= 97 && *s <= 123 )
*s -= 32 ;
s++ ;
}
}
/* converts string to lowercase */
void lower ( char *s )
{
while ( *s )
{
if ( *s >= 65 && *s <= 91 )
*s += 32 ;
s++ ;
}
}
/* reverses a string */
void reverse ( char *str )
{
int l = strlen ( str ) ;
char ch, *t = ( str + l - 1 ) ;
int i = 0 ;
while ( i < l / 2 )
{
ch = *str ;
*str = *t ;
*t = ch ;
str++ ;
t-- ;
i++ ;
}
}
/* replaces the first occurrence of char with new char */
int replace ( char *str, char oldch, char newch )
{
while ( *str )
{
if ( *str == oldch )
{
*str = newch ;
return 1 ;
}
str++ ;
}
return 0 ;
}
/* sets a char at a given position */
int setat ( char *str, char ch, int i )
{
if ( i < 0 || strlen ( str ) < i )
return 0 ;
* ( str + i ) = ch ;
return 1 ;
}

technicalsymposium

Technicalsymposium.com-A Complete Website for Engineering Students & Engineering Faculties.All Useful Links & Contents Given Below

technicalsymposium

Free Email Alerts
Get free email alerts-Fresher’s Jobs/Conference/Symposium/Exams Alerts-Click here to Subscribe.

Free Event Publishing
Publish your college technical symposium/free events in our website & Attract more targeted audience- Click here to Get

Conference/Symposium
All engineering colleges /Premier Institutions (IIT,IISC,NIT,etc.,) Conferences/Workshop details-Click here to Get

Fresher’s Jobs/Scholarships Details
Freshers Software Jobs/Government Jobs and Student Internships/Scholarships Details- Click here to Get

Placement Papers
All Software Companies previous placement papers/Govt Competitive exam previous papers/Tech Materials free download-Click her to get.

Lab Programs/Lab Manuals
All Branches of Lab Programs/Lab Manuals for all branches of Engineering-Click here to Get

University Previous Question Papers
Anna university/All leading universities previous question papers year wise and Semester wise- Click here to Get

GATE Question Papers
GATE Previous Question Papers –All Branches by year wise-Click here to Get

Indian Engineering Services (IES) Question Papers
IES Previous Question Papers –All Branches by year wise-Click here to Get

Anna University Syllabus
Anna University all branches syllabues free download for all B.E(All Branches)/B.Tech(All Branches)/M.E/M.Tech/MCA/MBA- Click here to Get

GATE/ All Entrance Exam Syllabus
GATE/ All Leading Entrance Exam Syllabus free download-Click here to Get

Competitive Exam Syllabuses
Bank/Railway/SSC,all kind of Competitive Exam syllabuses free Download-Click here to get

Civil Engineering Lecture Notes
Civil engineering lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Electronics & Communication Engineering (ECE) Lecture Notes
Electronics & Communication Engineering (ECE) by semester wise and Lab Programs/Manuals-Click here to get

Electronics & Electronics Engineering (EEE) Lecture Notes
Electronics & Electronics Engineering (EEE) lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Mechanical Engineering (MECH) Lecture Notes
Mechanical Engineering (MECH) lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Computer Science Engineering (CSE) Lecture Notes
Computer Science Engineering (CSE) lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Information Technology Lecture Notes
Information Technology lecture notes by semester wise and Lab Programs/Manuals-Click here to get

MCA Lecture Notes
MCA lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Automobile Engineering Lecture Notes
Automobile Engineering lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Aeronautical Engineering Lecture Notes
Aeronautical Engineering lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Bio-Medical Engineering Lecture Notes
Bio-Medical Engineering lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Bio-Technology Lecture Notes
Bio-Technology lecture notes by semester wise and Lab Programs/Manuals-Click here to get

MBA Lecture Notes
MBA lecture notes by semester wise and Lab Programs/Manuals-Click here to get

Hosting by Yahoo!

About-Us    Contact-Us    Site-map

©copyright 2009 All rights are reserved to technicalsymposium.com