c Programming & Data Strucutres Lab Manual

CP LAB

SARADA INSTITUTE OF TECHNOLOGY & SCIENCE

1

SARADA INSTITUTE OF TECNOLOGY & SCIENCE

SARADA NAGAR, RAGHUNADHAPALEM, KHAMMAM

‘C’ PROGRAMMING & DATA STRUCTURES LABMANUAL

FORI YEAR B.Tech

(Common to All Branches)

Department ofComputer Science & Engineering

&Information Technology

CP LAB


2

COMPUTER PROGRAMMING LAB

Objectives:

To make the student learn a programming language.

To teach the student to write programs in C solve the problems

To Introduce the student to simple linear and non linear data structures such as lists, stacks,

queues, trees and graphs.

Recommended Systems/Software Requirements:

Intel based desktop PC

ANSI C Compiler with Supporting Editors

Week l.

a) Write a C program to find the sum of individual digits of a positive integer.

b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1.

Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to

generate the first n terms of the sequence.

c) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied

by the user.

Week 2.

a) Write a C program to calculate the following Sum:

Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!

b) Write a C program toe find the roots of a quadratic equation.

Week 3

a) Write C programs that use both recursive and non-recursive functions

i) To find the factorial of a given integer.

ii) To find the GCD (greatest common divisor) of two given integers.

iii) To solve Towers of Hanoi problem.

Week 4

a) The total distance travelled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and

‘a’ are the initial velocity (m/sec.) and acceleration (m/sec2). Write C program to find the distance

travelled at regular intervals of time given the values of ‘u’ and ‘a’. The program should provide the

flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’

and ‘a’.

b) Write a C program, which takes two integer operands and one operator form the user, performs the

operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)

Week 5

a) Write a C program to find both the larges and smallest number in a list of integers.

b) Write a C program that uses functions to perform the following:

i) Addition of Two Matrices

CP LAB


3ii) Multiplication of Two Matrices

Week 6

a) Write a C program that uses functions to perform the following operations:

i) To insert a sub-string in to given main string from a given position.

ii) To delete n Characters from a given position in a given string.

b) Write a C program to determine if the given string is a palindrome or not

Week 7

a) Write a C program that displays the position or index in the string S where the string T begins, or – 1

if S doesn’t contain T.

b) Write a C program to count the lines, words and characters in a given text.

Week 8

a) Write a C program to generate Pascal’s triangle.

b) Write a C program to construct a pyramid of numbers.

Week 9

Write a C program to read in two numbers, x and n, and then compute the sum of this geometric

progression:

1+x+x2+x3+………….+xn

For example: if n is 3 and x is 5, then the program computes 1+5+25+125.

Print x, n, the sum

Perform error checking. For example, the formula does not make sense for negative exponents – if n is

less than 0. Have your program print an error message if n<0, then go back and read in the next pair of

numbers of without computing the sum. Are any values of x also illegal ? If so, test for them too.

Week 10

a) 2’s complement of a number is obtained by scanning it from right to left and complementing all the

bits after the first appearance of a 1. Thus 2’s complement of 11100 is 00100. Write a C program to find

the 2’s complement of a binary number.

b) Write a C program to convert a Roman numeral to its decimal equivalent.

Week 11

Write a C program that uses functions to perform the following operations:

i) Reading a complex number

ii) Writing a complex number

iii) Addition of two complex numbers

iv) Multiplication of two complex numbers

(Note: represent complex number using a structure.)

Week 12

a) Write a C program which copies one file to another.

b) Write a C program to reverse the first n characters in a file.

(Note: The file name and n are specified on the command line.)

CP LAB


4Week 13

Write a C program that uses functions to perform the following operations on singly linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal

Week 14

Write a C program that uses functions to perform the following operations on doubly linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways

Week 15

Write C programs that implement stack (its operations) using

i) Arrays ii) Pointers

Week 16

Write C programs that implement Queue (its operations) using

i) Arrays ii) Pointers

Week 17

Write a C program that uses Stack operations to perform the following:

i) Converting infix expression into postfix expression

ii) Evaluating the postfix expression

Week 18

Write a C program that uses functions to perform the following:

i) Creating a Binary Tree of integers

ii) Traversing the above binary tree in preorder, inorder and postorder.

Week 19

Write C programs that use both recursive and non recursive functions to perform the following

searching operations for a Key value in a given list of integers :

i) Linear search ii) Binary search

Week 20

Write C programs that implement the following sorting methods to sort a given list of integers in

ascending order:

i) Bubble sort ii) Quick sort

Week 21

Write C programs that implement the following sorting methods to sort a given list of integers in

ascending order:

i) Insertion sort ii) Merge sort

Week 22

Write C programs to implement the Lagrange interpolation and Newton- Gregory forward interpolation.

Week 23

Write C programs to implement the linear regression and polynomial regression algorithms.

Week 24

Write C programs to implement Trapezoidal and Simpson methods.

CP LAB


11. Write a C program to find the sum of individual digits of a

positive integer.

#include <stdio.h>

void main()

{

int num1=0, num2=1,no,counter,fab;

clrscr();

printf("<===========PROGRAM TO FIND THE FIBONACCI SERIES UP TO N NO. IN

SERIES=========>");

printf("\n\n\n\t\tENTER LENGTH OF SERIES (N) : ");

scanf("%d",&no);

printf("\n\n\t\t\t<----FIBONACCI SERIES---->");

printf("\n\n\t\t%d %d",num1,num2);

//LOOP WILL RUN FOR 2 TIME LESS IN SERIES AS THESE WAS PRINTED IN

ADVANCE

for(counter = 1; counter <= no-2; counter++)

{

fab=num1 + num2;

printf(" %d",fab);

num1=num2;

num2=fab;

}

getch();

}

CP LAB


2

2. A Fibonacci Sequence is defined as follows: the first and second

terms in the sequence are 0 and 1. Subsequent terms are found by

adding the preceding two terms in the sequence. Write a C program

to generate the first n terms of the sequence.

#include <stdio.h>

void main()

{

int no,counter,counter1,check;

clrscr();

printf("<-----------------------PRIME NO. SERIES------------------------>");

printf("\n\n\n\t\t\tINPUT THE VALUE OF N: ");

scanf("%d",&no);

printf("\n\nTHE PRIME NO. SERIES B/W 1 TO %d : \n\n",no);

for(counter = 1; counter <= no; counter++)

{

check = 0;

//THIS LOOP WILL CHECK A NO TO BE PRIME NO. OR NOT.

for(counter1 = counter-1; counter1 > 1 ; counter1--)

if(counter%counter1 == 0)

{

check++; // INCREMENT CHECK IF NO. IS NOT A PRIME NO.

break;

}

if(check == 0)

printf("%d\t",counter);

}

getch();

}

CP LAB


33. Write a C program to generate all the prime numbers between 1

and n, where n is a value supplied by the user

#include<stdio.h>

#include<conio.h>

void main()

{

int num, k=1, sum=0;

clrscr();

printf("Enter the number whose digits are to be added:");

scanf("%d",&num);

while(num!=0)

{

k=num%10;

sum=sum+k;

k=num/10;

num=k;

}

printf("Sum of the digits:%d",sum);

getch();

}

CP LAB


44. Write a C program to calculate the following Sum:

Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!

#include <stdio.h>

#include <math.h>

void main()

{

int counter,f_coun;

float sum=0,x,power,fact;

clrscr();

printf("<-----------------------PROGRAM FOR SUM OF EQ. SERIES----------------------->");

printf("\n\n\tEQUATION SERIES : 1- X^2/2! + X^4/4! - X^6/6! + X^8/8! - X^10/10!");

printf("\n\n\n\tENTER VALUE OF X : ");

scanf("%f",&x);

for(counter=0, power=0; power<=10; counter++,power=power+2)

{

fact=1;

//CALC FACTORIAL OF POWER VALUE

for(f_coun=power; f_coun>=1; f_coun--)

fact *= f_coun;

//EQ. FOR SUM SERIES

sum=sum+(pow(-1,counter)*(pow(x,power)/fact));

}

printf("SUM : %f",sum);

getch();

}

CP LAB


55. Write a C program toe find the roots of a quadratic equation.

#include<stdio.h>

#include<conio.h>

#include<math.h>

void main()

{

float a,b,c,root1,root2;

clrscr();

printf("\n Enter values of a,b,c for finding roots of a quadratic eq:\n");

scanf("%f%f%f",&a,&b,&c);

/*checking condition*/

if(b*b>4*a*c)

{

root1=-b+sqrt(b*b-4*a*c)/2*a;

root2=-b-sqrt(b*b-4*a*c)/2*a;

printf("\n*****ROOTS ARE*****\n");

printf("\n root1=%f\n root2=%f",root1,root2);

}

else

printf("\n Imaginary Roots.");

getch();

}

CP LAB


66. Write C programs that use both recursive and non-recursive

functions

i) To find the factorial of a given integer.

#include<stdio.h>

#include<conio.h>

unsigned int recr_factorial(int n);

unsigned int iter_factorial(int n);

void main()

{

int n,i;

long fact;

clrscr();

printf("Enter the number: ");

scanf("%d",&n);

if(n==0)

printf("Factorial of 0 is 1\n");

else

{

printf("Factorial of %d Using Recursive Function is %d\n",n,recr_factorial(n));

printf("Factorial of %d Using Non-Recursive Function is %d\n",n,iter_factorial(n));

}

getch();

}

/* Recursive Function*/

unsigned int recr_factorial(int n) {

return n>=1 ? n * recr_factorial(n-1) : 1;

}

/* Non-Recursive Function*/

unsigned int iter_factorial(int n) {

int accu = 1;

int i;

for(i = 1; i <= n; i++) {

accu *= i;

}

return accu;

}

CP LAB


7

ii) To find the GCD (greatest common divisor) of two given integers.

#include<stdio.h>

#include<conio.h>

#include<math.h>

unsigned int GcdRecursive(unsigned m, unsigned n);

unsigned int GcdNonRecursive(unsigned p,unsigned q);

int main(void)

{

int a,b,iGcd;

clrscr();

printf("Enter the two numbers whose GCD is to be found: ");

scanf("%d%d",&a,&b);

printf("GCD of %d and %d Using Recursive Function is %d\n",a,b,GcdRecursive(a,b));

printf("GCD of %d and %d Using Non-Recursive Function is

%d\n",a,b,GcdNonRecursive(a,b));

getch();

}


unsigned int GcdRecursive(unsigned m, unsigned n)

{

if(n>m)

return GcdRecursive(n,m);

if(n==0)

return m;

else

return GcdRecursive(n,m%n);

}


unsigned int GcdNonRecursive(unsigned p,unsigned q)

{

unsigned remainder;

CP LAB


8remainder = p-(p/q*q);

if(remainder==0)

return q;

else

GcdRecursive(q,remainder);

}

iii) To solve Towers of Hanoi problem.

#include<conio.h>

#include<stdio.h>


void hanoiNonRecursion(int num,char sndl,char indl,char dndl)

{

char stkn[100],stksndl[100],stkindl[100],stkdndl[100],stkadd[100],temp;

int top,add;

top=NULL;

one:

if(num==1)

{

printf("\nMove top disk from needle %c to needle %c ",sndl,dndl);

goto four;

}

two:

top=top+1;

stkn[top]=num;

stksndl[top]=sndl;

stkindl[top]=indl;

stkdndl[top]=dndl;

stkadd[top]=3;

num=num-1;

sndl=sndl;

temp=indl;

indl=dndl;

dndl=temp;

goto one;

CP LAB


9

three:

printf("\nMove top disk from needle %c to needle %c ",sndl,dndl);

top=top+1;

stkn[top]=num;

stksndl[top]=sndl;

stkindl[top]=indl;

stkdndl[top]=dndl;

stkadd[top]=5;

num=num-1;

temp=sndl;

sndl=indl;

indl=temp;

dndl=dndl;

goto one;

four:

if(top==NULL)

return;

num=stkn[top];

sndl=stksndl[top];

indl=stkindl[top];

dndl=stkdndl[top];

add=stkadd[top];

top=top-1;

if(add==3)

goto three;

else if(add==5)

goto four;

}


void hanoiRecursion( int num,char ndl1, char ndl2, char ndl3)

{

if ( num == 1 ) {

printf( "Move top disk from needle %c to needle %c.", ndl1, ndl2 );

return;

}

hanoiRecursion( num - 1,ndl1, ndl3, ndl2 );

CP LAB


10 printf( "Move top disk from needle %c to needle %c.", ndl1, ndl2 );

hanoiRecursion( num - 1,ndl3, ndl2, ndl1 );

}

void main()

{

int no;

clrscr();

printf("Enter the no. of disks to be transferred: ");

scanf("%d",&no);

if(no<1)

printf("\nThere's nothing to move.");

else

printf("Non-Recursive");

hanoiNonRecursion(no,'A','B','C');

printf("\nRecursive");

hanoiRecursion(no,'A','B','C');

getch();

}

CP LAB


117. The total distance travelled by vehicle in ‘t’ seconds is given by

distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity

(m/sec.) and acceleration (m/sec2). Write C program to find the

distance travelled at regular intervals of time given the values of ‘u’

and ‘a’. The program should provide the flexibility to the user to

select his own time intervals and repeat the calculations for different

values of ‘u’ and ‘a’.

#include <stdio.h>

#include <math.h>

void main()

{

int tim_intrval, counter,time;

float accl, distance=0, velos;

clrscr();

printf("<===========PROGRAM FOR CALC TOTAL DISTANCE TRAVELED BY A

VECHIAL===========>");

printf("\n\n\n\t\t\tNO OF TIME INTERVALS : ");

scanf("%d",&tim_intrval);

for(counter = 1; counter <= tim_intrval; counter++)

{

printf("\n\t\t\tAT T%d TIME(sec) : ",counter);

scanf("%d",&time);

printf("\t\t\tVELOCITY AT %d sec (m/sec) : ",time);

scanf("%f",&velos);

printf("\t\t\tACCLERATION AT %d sec (m/sec^2): ",time);

scanf("%f",&accl);

distance += (velos*time + (accl*pow(time,2))/2);

}

printf("\n\n\n\tTOTAL DISTANCE TRAVELLED BY VEHICLE IN %d INTERVALS OF

TIME : %f",tim_intrval,distance);

getch();

}

CP LAB


128. Write a C program, which takes two integer operands and one

operator form the user, performs the operation and then prints the

result. (Consider the operators +,-,*, /, % and use Switch Statement)

#include<stdio.h>

#include<conio.h>

void main()

{

int a,b,res,ch;

clrscr();

printf("\t *********************");

printf("\n\tMENU\n");

printf("\t********************");

printf("\n\t(1)ADDITION");

printf("\n\t(2)SUBTRACTION");

printf("\n\t(3)MULTIPLICATION");

printf("\n\t(4)DIVISION");

printf("\n\t(5)REMAINDER");

printf("\n\t(0)EXIT");

printf("\n\t********************");

printf("\n\n\tEnter your choice:");

scanf("%d",&ch);

if(ch<=5 & ch>0)

{

printf("Enter two numbers:\n");

scanf("%d%d",&a,&b);

}

switch(ch)

{

case 1:

res=a+b;

printf("\n Addition:%d",res);

break;

case 2:

res=a-b;

printf("\n Subtraction:%d",res);

CP LAB


13break;

case 3:

res=a*b;

printf("\n Multiplication:%d",res);

break;

case 4:

res=a/b;

printf("\n Division:%d",res);

break;

case 5:

res=a%b;

printf("\n Remainder:%d",res);

break;

case 0:

printf("\n Choice Terminated");

exit();

break;

default:

printf("\n Invalid Choice");

}

getch();

}

CP LAB


149. Write a C program to find both the larges and smallest number in

a list of integers.

main( )

{

float largest(float a[ ], int n);

float value[4] = {2.5,-4.75,1.2,3.67};

printf("%f\n", largest(value,4));

}

float largest(float a[], int n)

{

int i;

float max;

max = a[0];

for(i = 1; i < n; i++)

if(max < a[i])

max = a[i];

return(max);

}

CP LAB


1510. Write a C program that uses functions to perform the following:

i) Addition of Two Matrices

ii) Multiplication of Two Matrices

#include<stdio.h>

void main()

{

int ch,i,j,m,n,p,q,k,r1,c1,a[10][10],b[10][10],c[10][10];

clrscr();

printf("************************************");

printf("\n\t\tMENU");

printf("\n**********************************");

printf("\n[1]ADDITION OF TWO MATRICES");

printf("\n[2]MULTIPLICATION OF TWO MATRICES");

printf("\n[0]EXIT");

printf("\n**********************************");

printf("\n\tEnter your choice:\n");

scanf("%d",&ch);

if(ch<=2 & ch>0)

{

printf("Valid Choice\n");

}

switch(ch)

{

case 1:

printf("Input rows and columns of A & B Matrix:");

scanf("%d%d",&r1,&c1);

printf("Enter elements of matrix A:\n");

for(i=0;i<r1;i++)

{

for(j=0;j<c1;j++)

scanf("%d",&a[i][j]);

}

printf("Enter elements of matrix B:\n");

for(i=0;i<r1;i++)

{

CP LAB


16 for(j=0;j<c1;j++)

scanf("%d",&b[i][j]);

}

printf("\n =====Matrix Addition=====\n");

for(i=0;i<r1;i++)

{

for(j=0;j<c1;j++)

printf("%5d",a[i][j]+b[i][j]);

printf("\n");

}

break;

case 2:

printf("Input rows and columns of A matrix:");

scanf("%d%d",&m,&n);

printf("Input rows and columns of B matrix:");

scanf("%d%d",&p,&q);

if(n==p)

{

printf("matrices can be multiplied\n");

printf("resultant matrix is %d*%d\n",m,q);

printf("Input A matrix\n");

read_matrix(a,m,n);

printf("Input B matrix\n");

/*Function call to read the matrix*/

read_matrix(b,p,q);

/*Function for Multiplication of two matrices*/

printf("\n =====Matrix Multiplication=====\n");

for(i=0;i<m;++i)

for(j=0;j<q;++j)

{

c[i][j]=0;

for(k=0;k<n;++k)

c[i][j]=c[i][j]+a[i][k]*b[k][j];

}

printf("Resultant of two matrices:\n");

write_matrix(c,m,q);

}

/*end if*/

else

CP LAB


17 {

printf("Matrices cannot be multiplied.");

}

/*end else*/

break;

case 0:

printf("\n Choice Terminated");

exit();

break;

default:

printf("\n Invalid Choice");

}

getch();

}

/*Function read matrix*/

int read_matrix(int a[10][10],int m,int n)

{

int i,j;

for(i=0;i<m;i++)

for(j=0;j<n;j++)

scanf("%d",&a[i][j]);

return 0;

}

/*Function to write the matrix*/

int write_matrix(int a[10][10],int m,int n)

{

int i,j;

for(i=0;i<m;i++)

{

for(j=0;j<n;j++)

printf("%5d",a[i][j]);

printf("\n");

}

return 0;

}

CP LAB


1811. Write a C program that uses functions to perform the following

operations:

i) To insert a sub-string in to given main string from a given

position.

#include <stdio.h>

#include <conio.h>

#include <string.h>

void main()

{

char a[10];

char b[10];

char c[10];

int p=0,r=0,i=0;

int t=0;

int x,g,s,n,o;

clrscr();

puts("Enter First String:");

gets(a);

puts("Enter Second String:");

gets(b);

printf("Enter the position where the item has to be inserted: ");

scanf("%d",&p);

r = strlen(a);

n = strlen(b);

i=0;

// Copying the input string into another array

while(i <= r)

{

c[i]=a[i];

i++;

}

s = n+r;

o = p+n;

// Adding the sub-string

CP LAB


19for(i=p;i<s;i++)

{

x = c[i];

if(t<n)

{

a[i] = b[t];

t=t+1;

}

a[o]=x;

o=o+1;

}

printf("%s", a);

getch();

}

CP LAB


20ii) To delete n Characters from a given position in a given string.

#include <stdio.h>

#include <conio.h>

#include <string.h>

void delchar(char *x,int a, int b);

void main()

{

char string[10];

int n,pos,p;

clrscr();

puts("Enter the string");

gets(string);

printf("Enter the position from where to delete");

scanf("%d",&pos);

printf("Enter the number of characters to be deleted");

scanf("%d",&n);

delchar(string, n,pos);

getch();

}

// Function to delete n characters

void delchar(char *x,int a, int b)

{

if ((a+b-1) <= strlen(x))

{

strcpy(&x[b-1],&x[a+b-1]);

puts(x);

}

}

CP LAB


2112. Write a C program to determine if the given string is a

palindrome or not

#include<stdio.h>

#include<string.h>

enum Boolean{false,true};

enum Boolean IsPalindrome(char string[])

{

int left,right,len=strlen(string);

enum Boolean matched=true;

if(len==0)

return 0;

left=0;

right=len-1;

/* Compare the first and last letter,second & second last & so on */

while(left<right&&matched)

{

if(string[left]!=string[right])

matched=false;

else

{

left++;

right--;

}

}

return matched;

}

int main()

{

char string[40];

clrscr();

printf("****Program to test if the given string is a palindrome****\n");

printf("Enter a string:");

scanf("%s",string);

if(IsPalindrome(string))

printf("The given string %s is a palindrome\n",string);

CP LAB


22 else

printf("The given string %s is not a palindrome\n",string);

getch();

return 0;

}

CP LAB


2313. Write a C program that displays the position or index in the

string S where the string T begins, or – 1 if S doesn’t contain T.

#include<stdio.h>

#include<string.h>

#include<conio.h>

void main()

{

char s[30], t[20];

char *found;

clrscr();

/* Entering the main string */

puts("Enter the first string: ");

gets(s);

/* Entering the string whose position or index to be displayed */

puts("Enter the string to be searched: ");

gets(t);

/*Searching string t in string s */

found=strstr(s,t);

if(found)

printf("Second String is found in the First String at %d position.\n",found-s);

else

printf("-1");

getch();

}

CP LAB


2414. Write a C program to count the lines, words and characters in a

given text.

#include <stdio.h>

main()

{

char line[81], ctr;

int i,c,

end = 0,

characters = 0,

words = 0,

lines = 0;

printf("KEY IN THE TEXT.\n");

printf("GIVE ONE SPACE AFTER EACH WORD.\n");

printf("WHEN COMPLETED, PRESS 'RETURN'.\n\n");

while( end == 0)

{

/* Reading a line of text */

c = 0;

while((ctr=getchar()) != '\n')

line[c++] = ctr;

line[c] = '\0';

/* counting the words in a line */

if(line[0] == '\0')

break ;

else

{

words++;

for(i=0; line[i] != '\0';i++)

if(line[i] == ' ' || line[i] == '\t')

words++;

}

/* counting lines and characters */

lines = lines +1;

characters = characters + strlen(line);

}

printf ("\n");

printf("Number of lines = %d\n", lines);

printf("Number of words = %d\n", words);

printf("Number of characters = %d\n", characters);

}

CP LAB


2515. Write a C program to generate Pascal’s triangle.

#include<stdio.h>

#include<conio.h>

void main()

{

int bin,p,q,r,x;

clrscr();

bin=1;

q=0;

printf("Rows you want to input:");

scanf("%d",&r);

printf("\nPascal's Triangle:\n");

while(q<r)

{

for(p=40-3*q;p>0;--p)

printf(" ");

for(x=0;x<=q;++x)

{

if((x==0)||(q==0))

bin=1;

else

bin=(bin*(q-x+1))/x;

printf("%6d",bin);

}

printf("\n");

++q;

}

getch();

}

16. Write a C program to construct a pyramid of numbers.

#include<stdio.h>

#include<conio.h>

CP LAB


26

void main()

{

int num,i,y,x=35;

clrscr();

printf("\nEnter the number to generate the pyramid:\n");

scanf("%d",&num);

for(y=0;y<=num;y++)

{

/*(x-coordinate,y-coordinate)*/

gotoxy(x,y+1);

/*for displaying digits towards the left and right of zero*/

for(i=0-y;i<=y;i++)

printf("%3d",abs(i));

x=x-3;

}

getch();

}

CP LAB


2717. Write a C program to read in two numbers, x and n, and then

compute the sum of this geometric progression:

1+x+x2+x3+………….+xn

For example: if n is 3 and x is 5, then the program computes

1+5+25+125.

Print x, n, the sum

Perform error checking. For example, the formula does not make

sense for negative exponents – if n is less than 0. Have your program

print an error message if n<0, then go back and read in the next pair

of numbers of without computing the sum. Are any values of x also

illegal ? If so, test for them too.

#include<stdio.h>

#include<conio.h>

#include<math.h>

void main()

{

int s_sum,i,x,n;

clrscr();

printf("Enter the values for x and n:");

scanf("%d %d",&x,&n);

if(n<=0 || x<=0)

{

printf("Value is not valid\n");

}

else

{

printf("Value is valid\n");

s_sum=1;

for(i=1;i<=n;i++)

{

s_sum=s_sum+pow(x,i);

}

printf("Sum of series=%d\n",s_sum);

}

getch();

CP LAB


28}

18. 2’s complement of a number is obtained by scanning it from right

to left and complementing all the bits after the first appearance of a 1.

Thus 2’s complement of 11100 is 00100. Write a C program to find the

2’s complement of a binary number.

#include <stdio.h>

#include<conio.h>

void complement (char *a);

void main()

{

char a[16];

int i;

clrscr();

printf("Enter the binary number");

gets(a);

for(i=0;a[i]!='\0'; i++)

{

if (a[i]!='0' && a[i]!='1')

{

printf("The number entered is not a binary number. Enter the correct number");

exit(0);

}

}

complement(a);

getch();

}

void complement (char *a)

{

int l, i, c=0;

char b[16];

l=strlen(a);

for (i=l-1; i>=0; i--)

{

if (a[i]=='0')

b[i]='1';

else

b[i]='0';

}

CP LAB


29for(i=l-1; i>=0; i--)

{

if(i==l-1)

{

if (b[i]=='0')

b[i]='1';

else

{

b[i]='0';

c=1;

}

}

else

{

if(c==1 && b[i]=='0')

{

b[i]='1';

c=0;

}

else if (c==1 && b[i]=='1')

{

b[i]='0';

c=1;

}

}

}

b[l]='\0';

printf("The 2's complement is %s", b);

}

CP LAB


3019. Write a C program to convert a Roman numeral to its decimal

equivalent.

#include<stdio.h>

#include<conio.h>

#include<string.h>

#include<stdlib.h>

void main()

{

int *a,len,i,j,k;

char *rom;

clrscr();

printf("Enter the Roman Numeral:");

scanf("%s",rom);

len=strlen(rom);

for(i=0;i<len;i++)

{

if(rom[i]=='I')

a[i]=1;

else if(rom[i]=='V')

a[i]=5;

else if(rom[i]=='X')

a[i]=10;

else if(rom[i]=='L')

a[i]=50;

else if(rom[i]=='C')

a[i]=100;

else if(rom[i]=='D')

a[i]=500;

else if(rom[i]=='M')

a[i]=1000;

else

{

printf("\nInvalid Value");

CP LAB


31 getch();

exit(0);

}

}

k=a[len-1];

for(i=len-1;i>0;i--)

{

if(a[i]>a[i-1])

k=k-a[i-1];

else if(a[i]==a[i-1] || a[i]<a[i-1])

k=k+a[i-1];

}

printf("\nIts Decimal Equivalent is:");

printf("%d",k);

getch();

}

CP LAB



operations:

i) Reading a complex number

ii) Writing a complex number

iii) Addition of two complex numbers

iv) Multiplication of two complex numbers

(Note: represent complex number using a structure.)

#include<stdio.h>

#include<math.h>

void arithmetic(int opern);

struct comp

{

double realpart;

double imgpart;

};

void main()

{

int opern;

clrscr();

printf("\n\n \t\t\t***** MAIN MENU *****");

printf("\n\n Select your option: \n 1 : ADD\n 2 : MULTIPLY\n 0 : EXIT \n\n\t\t Enter your

Option [ ]\b\b");

scanf("%d",&opern);

switch(opern)

{

case 0:

exit(0);

case 1:

case 2:

arithmetic(opern);

default:

main();

}

CP LAB


33

}

void arithmetic(int opern)

{

struct comp w1, w2, w;

printf("\n Enter two Complex Numbers (x+iy):\n Real Part of First Number:");

scanf("%lf",&w1.realpart);

printf("\n Imaginary Part of First Number:");

scanf("%lf",&w1.imgpart);

printf("\n Real Part of Second Number:");

scanf("%lf",&w2.realpart);

printf("\n Imaginary Part of Second Number:");

scanf("%lf",&w2.imgpart);

switch(opern)

{

/*addition of complex number*/

case 1:

w.realpart = w1.realpart+w2.realpart;

w.imgpart = w1.imgpart+w2.imgpart;

break;

/*multiplication of complex number*/

case 2:

w.realpart=(w1.realpart*w2.realpart)-(w1.imgpart*w2.imgpart);

w.imgpart=(w1.realpart*w2.imgpart)+(w1.imgpart*w2.realpart);

break;

}

if (w.imgpart>0)

printf("\n Answer = %lf+%lfi",w.realpart,w.imgpart);

else

printf("\n Answer = %lf%lfi",w.realpart,w.imgpart);

getch();

main();

CP LAB


34}

21. Write a C program which copies one file to another.

#include <stdio.h>

#include <conio.h>

#include <process.h>

void main(int argc, char *argv[])

{

FILE *fs,*ft;

char ch;

clrscr();

if(argc!=3)

{

puts("Invalid number of arguments.");

exit(0);

}

fs = fopen(argv[1],"r");

if(fs==NULL)

{

puts("Source file cannot be opened.");

exit(0);

}

ft = fopen(argv[2],"w");

if (ft==NULL)

{

puts("Target file cannot be opened.");

fclose(fs);

exit(0);

}

while(1)

{

ch=fgetc(fs);

if (ch==EOF)

break;

else

fputc(ch,ft);

}

fclose(fs);

fclose(ft);

CP LAB


35 getch();

}

22. Write a C program to reverse the first n characters in a file.

(Note: The file name and n are specified on the command line.)

#include <stdio.h>

#include <conio.h>

#include <string.h>

#include <process.h>

void main(int argc, char *argv[])

{

char a[15];

char s[20];

char n;

int k;

int j=0;

int i;

int len;

FILE *fp;

if(argc!=3)

{

puts("Improper number of arguments.");

exit(0);

}

fp = fopen(argv[1],"r");

if(fp == NULL)

{

puts("File cannot be opened.");

exit(0);

}

k=*argv[2]-48;

n = fread(a,1,k,fp);

a[n]='\0';

len=strlen(a);

for(i=len-1;i>=0;i--)

{

s[j]=a[i];

printf("%c",s[j]);

j=j+1;

}

s[j+1]='\0';

CP LAB


36getch();

}

CP LAB



operations on singly linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal

i) Creation

#include <stdio.h>

#include <stdlib.h>

#define NULL 0

struct linked_list

{

int number;

struct linked_list *next;

};

typedef struct linked_list node; /* node type defined */

main()

{

node *head;

void create(node *p);

int count(node *p);

void print(node *p);

head = (node *)malloc(sizeof(node));

create(head);

printf("\n");

printf(head);

printf("\n");

printf("\nNumber of items = %d \n", count(head));

}

void create(node *list)

{

printf("Input a number\n");

printf("(type -999 at end): ");

scanf("%d", &list -> number); /* create current node */

if(list->number == -999)

{

list->next = NULL;

}

CP LAB


38else /*create next node */

{

list->next = (node *)malloc(sizeof(node));

create(list->next); */ Recursion occurs */

}

return;

}

void print(node *list)

{

if(list->next != NULL)

{

printf("%d-->",list ->number); /* print current item */

if(list->next->next == NULL)

printf("%d", list->next->number);

print(list->next); /* move to next item */

}

return;

}

int count(node *list)

{

if(list->next == NULL)

return (0);

else

return(1+ count(list->next));

}

ii) Insertion

node *insert(node *head)

{

node *find(node *p, int a);

node *new; /* pointer to new node */

node *n1; /* pointer to node preceding key node */

int key;

int x; /* new item (number) to be inserted */

printf("Value of new item?");

CP LAB


39scanf("%d", &x);

printf("Value of key item ? (type -999 if last) ");

scanf("%d", &key);

if(head->number == key) /* new node is first */

{

new = (node *)malloc(size of(node));

new->number = x;

new->next = head;

head = new;

}

else /* find key node and insert new node */

{ /* before the key node */

n1 = find(head, key); /* find key node */

if(n1 == NULL)

printf("\n key is not found \n");

else /* insert new node */

{

new = (node *)malloc(sizeof(node));

new->number = x;

new->next = n1->next;

n1->next = new;

}

}

return(head);

}

node *find(node *lists, int key)

{

if(list->next->number == key) /* key found */

return(list);

else

if(list->next->next == NULL) /* end */

return(NULL);

else

find(list->next, key);

}

iii) Deletion

CP LAB


40node *delete(node *head)

{

node *find(node *p, int a);

int key; /* item to be deleted */

node *n1; /* pointer to node preceding key node */

node *p; /* temporary pointer */

printf("\n What is the item (number) to be deleted?");

scanf("%d", &key);

if(head->number == key) /* first node to be deleted) */

{

p = head->next; /* pointer to 2nd node in list */

free(head); /* release space of key node */

head = p; /* make head to point to 1st node */

}

else

{

n1 = find(head, key);

if(n1 == NULL)

printf("\n key not found \n");

else /* delete key node */

{

p = n1->next->next; /* pointer to the node

following the keynode */

free(n1->next); /* free key node */

n1->next = p; /* establish link */

}

}

return(head);

}

iv) Traversal

#include <stdio.h>

#include <stdlib.h>

#define NULL 0

struct linked_list

{

CP LAB


41int number;

struct linked_list *next;

};

typedef struct linked_list node;

main ()

{

int n;

node *head = NULL;

void print(node *p);

node *insert_Sort(node *p, int n);

printf("Input the list of numbers.\n");

printf("At end, type -999.\n");

scanf("%d",&n);

while(n != -999)

{

if(head == NULL) /* create 'base' node */

{

head = (node *)malloc(sizeof(node));

head ->number = n;

head->next = NULL;

}

else /* insert next item */

{

head = insert_sort(head,n);

}

scanf("%d", &n);

}

printf("\n");

print(head);

print("\n");

}

node *insert_sort(node *list, int x)

{

node *p1, *p2, *p;

p1 = NULL;

p2 = list; /* p2 points to first node */

CP LAB


42

for( ; p2->number < x ; p2 = p2->next)

{

p1 = p2;

if(p2->next == NULL)

{

p2 = p2->next; /* p2 set to NULL */

break; /* insert new node at end */

}

}

/* key node found */

p = (node *)malloc(sizeof(node)); /* space for new node */

p->number = x; /* place value in the new node */

p->next = p2; /* link new node to key node */

if (p1 == NULL)

list = p; /* new node becomes the first

node */

else

p1->next = p; /* new node inserted after

1st node */

return (list);

}

void print(node *list)

{

if (list == NULL)

printf("NULL");

else

{

printf("%d-->",list->number);

print(list->next);

}

return;

}

CP LAB



operations on doubly linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways

#include "stdio.h"

#include "alloc.h"

typedef struct dubll

{

int data;

struct dubll *leftlink,*rightlink;

}*DUBLL;

DUBLL high,temp_node,low,last,pntr;

int flag=0;

DUBLL NodeAlloc();

DUBLL Search(int,int);

void CreateItem();

void AppendItem();

void PrintItem();

void DeleteItem();

DUBLL Search(int item,int flag);

DUBLL NodeAlloc();

void InsertItem();

void main(void)

{

int choice,Item;

high=NULL;

while(1)

{

clrscr();

printf("\n \t\t\t***** M A I N M E N U *****\n\n");

printf("\n 1: Create Linked List \n 2: Append a Node to the List \n 3: Traverse the List \n

4: Delete a Node from the List \n 5: Search a Node \n 6: Insert a Node to the List \n 7:

Close \n\n\t\t Enter your Option [ ]\b\b");

scanf("%d",&choice);

switch(choice)

{

CP LAB


44 case 1:

CreateItem();

puts("\nPress any key to go back to main menu.");

getch();

break;

case 2:

AppendItem();

break;

case 3:

PrintItem();


getch();

break;

case 4:

DeleteItem();

break;

case 5:

printf("Find an Item: ");

scanf("%d",&Item);

temp_node=Search(Item,0);

if(temp_node)

{

puts("The item is available in the Linked List.");

}

else

{

puts("The item is not found in the Linked List.");

}

getch();

break;

case 6:

InsertItem();

break;

case 7:

exit();

default:

puts("Invalid choice.");


getch();

break;

}

CP LAB


45 }

}

/* Function to Create the list*/

void CreateItem()

{

if(high==NULL)

{

printf("\n --Creating the list--");

temp_node=NodeAlloc();

printf("\n Enter starting data (as integer value) :");

scanf("%d",&temp_node->data);

high=temp_node;

}

else{ printf("\n List already created @ %d with %d as data.",high,high->data);}

}

/* Function to Append items to the list*/

void AppendItem()

{

low=high;

if(high==NULL)

{

CreateItem();

}

else

{


printf("\n Enter Item (in integer) :");


temp_node->rightlink=NULL;

while(low->rightlink!=NULL)

low=low->rightlink;

low->rightlink=temp_node;

temp_node->leftlink=low;

last=low->rightlink;

}

}

CP LAB


46/* Function to Traverse the list both ways and print the data*/

void PrintItem()

{

DUBLL temp_node;

if(high==NULL)

{

printf("\n List is not available. Please create a list first.");

getch();

CreateItem();

}

temp_node=high;

last=low->rightlink;

printf("\n--Printing The List In Forward direction--\n");

while(temp_node!=NULL) //In forward direction

{

printf("\t %d",temp_node->data);

temp_node = temp_node->rightlink;

}

printf("\n");

printf("\n--Printing The List In Backward direction--\n");

temp_node=high;

if(temp_node->rightlink==NULL){printf("%d",temp_node->data);return; }

while(last!=NULL) //In backward direction

{

printf("\t %d",last->data);

last = last->leftlink;

}

}

/* Function to Delete items of the list*/

void DeleteItem()

{

int value;

DUBLL temp_node;

if(high==NULL)

{


getch();

CreateItem();

}

CP LAB


47printf("\n Item to delete :");

scanf("%d",&value);

pntr=Search(value,1);

pntr->leftlink->rightlink=pntr->rightlink;

pntr->rightlink->leftlink=pntr->leftlink;

temp_node=pntr;

free(temp_node);

}

/* Function to Search an item from the list*/

DUBLL Search(int item,int flag)

{

temp_node = high;

if(high==NULL)

{


getch();

CreateItem();

}

while(temp_node!=NULL)

{

if(temp_node->data==item )

{

if(flag==0)

{

return(1);

}

else

{

return(temp_node);

}

}

temp_node=temp_node->rightlink;

}

}

/* Function to Allocate nodes*/

DUBLL NodeAlloc()

{

DUBLL tmep_node;

tmep_node=malloc(sizeof(struct dubll));

CP LAB


48 if(tmep_node==NULL)

{

printf("\n No memory available. Node allocation cannot be done.");

}

tmep_node->rightlink=tmep_node->leftlink=NULL;

return(tmep_node);

}

/* Function to Insert items in the middle of the list*/

void InsertItem()

{

int node;

DUBLL temp_node;

if(high==NULL)

{


getch();

CreateItem();

}


printf("Position At which node to be inserted: ___ & New Item Value: ___ ");

scanf("%d",&node);


pntr=Search(node,1);

if(pntr->rightlink==NULL){printf("\n The operation is not possible."); getch();return;}

temp_node->leftlink=pntr; //creating link to new node

temp_node->rightlink=pntr->rightlink;

pntr->rightlink->leftlink=temp_node;

pntr->rightlink=temp_node;

printf("\n Item has been Inserted.");

getch();

}

CP LAB


4925. Write C programs that implement stack (its operations) using

i) Arrays

#include<stdio.h>

#include<conio.h>

int st_arr[20];

int t=-1;

void push_ele(int ele);

int pop_ele();

void display_ele();

void main()

{

char choice,num1=0,num2=0;

while(1)

{

clrscr();

printf("======================================");

printf("\n\t\t MENU ");

printf("\n======================================");

printf("\n[1] Using Push Function");

printf("\n[2] Using Pop Function");

printf("\n[3] Elements present in Stack");

printf("\n[4] Exit\n");

printf("\n\tEnter your choice: ");

fflush(stdin);

scanf("%c",&choice);

switch(choice-'0')

{

case 1:

{

printf("\n\tElement to be pushed: ");

scanf("%d",&num1);

push_ele(num1);

break;

}

CP LAB


50

case 2:

{

num2=pop_ele(1);

printf("\n\tElement to be popped: %d\n\t",num2);

getch();

break;

}

case 3:

{

display_ele();

getch();

break;

}

case 4:

exit(1);

break;

default:

printf("\nYour choice is invalid.\n");

break;

}

}

}

/*Implementing the push() function. */

void push_ele(int ele)

{

if(t==99)

{

printf("STACK is Full.\n");

getch();

exit(1);

}

st_arr[++t]=ele;

}

/*Implementing the pop() function. */

int pop_ele()

CP LAB


51{

int ele1;

if(t==-1)

{

printf("\n\tSTACK is Empty.\n");

getch();

exit(1);

}

return(st_arr[t--]);

}

/*Implementing display() function. */

void display_ele()

{

int k;

printf("\n\tElements present in the stack are:\n\t");

for(k=0;k<=t;k++)

printf("%d\t",st_arr[k]);

}

CP LAB


52Write C programs that implement stack (its operations) using

ii) Pointers

#include<stdio.h>

#include<conio.h>

struct st_point

{

int ele;

struct st_point *l;

}

*t;

int i;

void push_ele(int j);

int pop_ele();

void display_ele();

void main()

{

char choice,num1=0,num2=0;

int i;

while(1)

{

clrscr();

printf("======================================");

printf("\n\t\t MENU ");

printf("\n======================================");

printf("\n[1] Using Push Function");

printf("\n[2] Using Pop Function");

printf("\n[3] Elements present in Stack");

printf("\n[4] Exit\n");

printf("\n\tEnter your choice: ");

fflush(stdin);

scanf("%c",&choice);

switch(choice-'0')

{

case 1:

{

CP LAB


53printf("\n\tElement to be pushed:");

scanf("%d",&num1);

push_ele(num1);

break;

}

case 2:

{

num2=pop_ele(1);

printf("\n\tElement to be popped: %d\n\t",num2);

getch();

break;

}

case 3:

{

printf("\n\tElements present in the stack are:\n\t");

display_ele();

getch();

break;

}

case 4:

exit(1);

break;

default:

printf("\nYour choice is invalid.\n");

break;

}

}

}

/*Inserting the elements using push function*/

void push_ele(int j)

{

struct st_point *m;

m=(struct st_point*)malloc(sizeof(struct st_point));

m->ele=j;

m->l=t;

t=m;

CP LAB


54 return;

}

/*Removing the elements using pop function*/

int pop_ele()

{

if(t==NULL)

{

printf("\n\STACK is Empty.");

getch();

exit(1);

}

else

{

int i=t->ele;

t=t->l;

return (i);

}

return 0;

}

/*Displaying the elements */

void display_ele()

{

struct st_point *pointer=NULL;

pointer=t;

while(pointer!=NULL)

{

printf("%d\t",pointer->ele);

pointer=pointer->l;

}

}

CP LAB


5526. Write C programs that implement Queue (its operations) using

i) Arrays

#include<stdio.h>

#include<alloc.h>

#include<conio.h>

#define size 10

#define true 1

#define false 0

struct q_arr

{

int f,r;

int num;

int a[size];

};

void init(struct q_arr* queue);

int e_que(struct q_arr* queue);

int f_que(struct q_arr* queue);

int add_ele(struct q_arr* queue,int);

int rem_ele(struct q_arr* queue);

void display_ele(struct q_arr* queue);

/*main function*/

void main()

{

int ele,k;

int ch;

struct q_arr *queue = (struct q_arr*)malloc(sizeof(struct q_arr));

init(queue);

while(1)

{

clrscr();

printf("\n\n****IMPLEMENTATION OF QUEUE USING ARRAYS****\n");

printf("============================================");

printf("\n\t\tMENU\n");

printf("============================================");

CP LAB


56 printf("\n\t[1] To insert an element");

printf("\n\t[2] To remove an element");

printf("\n\t[3] To display all the elements");

printf("\n\t[4] Exit");

printf("\n\n\t Enter your choice: ");

scanf("%d",&ch);

switch(ch)

{

case 1:

{

printf("\nElement to be inserted:");

scanf("%d",&ele);

add_ele(queue,ele);

break;

}

case 2:

{

if(!e_que(queue))

{

k=rem_ele(queue);

printf("\n%d element is removed\n",k);

getch();

}

else

{

printf("\tQueue is Empty. No element can be removed.");

getch();

}

break;

}

case 3:

{

display_ele(queue);

getch();

break;

}

case 4:

CP LAB


57exit(0);

default:

printf("\tInvalid Choice.");

getch();

break;

}

}

}

/*end main*/

void init(struct q_arr* queue)

{

queue->f = 0;

queue->r = -1;

queue->num = 0;

}

/* Function to check is the queue is empty*/

int e_que(struct q_arr* queue)

{

if(queue->num==0)

return true;

return false;

}

/* Function to check if the queue is full*/

int f_que(struct q_arr* queue)

{

if(queue->num == size)

return true;

return false;

}

/* Function to add an element to the queue*/

int add_ele(struct q_arr* queue,int j)

{

if(f_que(queue))

return false;

if(queue->r == size - 1)

CP LAB


58 queue->r = -1;

queue->a[++queue->r] = j;

queue->num++;

return true;

}

/* Function to remove an element of the queue*/

int rem_ele(struct q_arr* queue)

{

int j;

if(e_que(queue))

return -9999;

j = queue->a[queue->f++];

if(queue->f == size)

queue->f = 0;

queue->num--;

return j;

}

/* Function to display the queue*/

void display_ele(struct q_arr* queue)

{

int j;

if(e_que(queue))

{

printf("Queue is Empty. No records to display.");

return;

}

printf("\nElements present in the Queue are: ");

for(j=queue->f;j<=queue->r;j++)

printf("%d\t",queue->a[j]);

printf("\n");

}

CP LAB


59Write C programs that implement Queue (its operations) using

ii) Pointers

#define true 1

#define false 0

#include<stdio.h>

#include<conio.h>

#include<process.h>

struct q_point

{

int ele;

struct q_point* n;

};

struct q_point *f_ptr = NULL;

int e_que(void);

void add_ele(int);

int rem_ele(void);

void show_ele();

/*main function*/

void main()

{

int ele,choice,j;

while(1)

{

clrscr();

printf("\n\n****IMPLEMENTATION OF QUEUE USING POINTERS****\n");

printf("==============================================");

printf("\n\t\t MENU\n");

printf("==============================================");

printf("\n\t[1] To insert an element");

printf("\n\t[2] To remove an element");

printf("\n\t[3] To display all the elements");

printf("\n\t[4] Exit");

printf("\n\n\tEnter your choice:");

scanf("%d", &choice);

CP LAB


60

switch(choice)

{

case 1:

{

printf("\n\tElement to be inserted:");

scanf("%d",&ele);

add_ele(ele);

getch();

break;

}

case 2:

{

if(!e_que())

{

j=rem_ele();

printf("\n\t%d is removed from the queue",j);

getch();

}

else

{

printf("\n\tQueue is Empty.");

getch();

}

break;

}

case 3:

show_ele();

getch();

break;

case 4:

exit(1);

break;

default:

printf("\n\tInvalid choice.");

getch();

break;

CP LAB


61 }

}

}

/* Function to check if the queue is empty*/

int e_que(void)

{

if(f_ptr==NULL)

return true;

return false;

}

/* Function to add an element to the queue*/

void add_ele(int ele)

{

struct q_point *queue = (struct q_point*)malloc(sizeof(struct q_point));

queue->ele = ele;

queue->n = NULL;

if(f_ptr==NULL)

f_ptr = queue;

else

{

struct q_point* ptr;

ptr = f_ptr;

for(ptr=f_ptr ;ptr->n!=NULL; ptr=ptr->n);

ptr->n = queue;

}

}

/* Function to remove an element from the queue*/

int rem_ele()

{

struct q_point* queue=NULL;

if(e_que()==false)

{

int j = f_ptr->ele;

queue=f_ptr;

f_ptr = f_ptr->n;

free (queue);

return j;

CP LAB


62 }

else

{

printf("\n\tQueue is empty.");

return -9999;

}

}

/* Function to display the queue*/

void show_ele()

{

struct q_point *ptr=NULL;

ptr=f_ptr;

if(e_que())

{

printf("\n\tQUEUE is Empty.");

return;

}

else

{

printf("\n\tElements present in Queue are:\n\t");

while(ptr!=NULL)

{

printf("%d\t",ptr->ele);

ptr=ptr->n;

}

}

}

CP LAB


6327. Write a C program that uses Stack operations to perform the

following:

i) Converting infix expression into postfix expression

ii) Evaluating the postfix expression

#include<stdio.h>

#include<conio.h>

int st[100];

int st_top=-1;

int cal(char post[]);

void in_post(char in[]);

void push_item(int it);

int pop_item();

int st_ISP(char t);

int st_ICP(char t);

/*main function*/

void main()

{

char in[100],post[100];

clrscr();

printf("\n\tEnter the Infix Expression: ");

gets(in);

in_post(in);

getch();

}

/*end main*/

void push_item(int it)

{

if(st_top==99)

{

printf("\n\n\t*STACK is Full*");

getch();

exit(1);

}

st[++st_top]=it;

}

CP LAB


64

int pop_item()

{

int it;

if(st_top==-1)

{

getch();

}

return(st[st_top--]);

}

/*Function for converting an infix expression to a postfix expression. */

void in_post(char in[])

{

int x=0,y=0,z,result=0;

char a,c, post[100];

char t;

push_item('\0');

t=in[x];

while(t!='\0')

{

if(isalnum(t))

/*For checking whether the value in t is an alphabet or number. */

{

post[y]=t;

y++;

}

else if(t=='(')

{

push_item('(');

}

else if(t==')')

{

while(st[st_top]!='(')

{

c=pop_item();

post[y]=c;

y++;

}

c=pop_item();

}

CP LAB


65 else

{

while(st_ISP(st[st_top])>=st_ICP(t))

{

c=pop_item();

post[y]=c;

y++;

}

push_item(t);

}

x++;

t=in[x];

}

while(st_top!=-1)

{

c=pop_item();

post[y]=c;

y++;

}

printf("\n\tThe Postfix Expression is:");

for(z=0;z<y;z++)

printf("%c",post[z]);

printf("\n\nDo you want to evaluate the Result of Postfix Expression?(Y/N):");

scanf("%c",&a);

if(a=='y' || a=='Y')

{

result=cal(post);

printf("\n\n\tResult is: %d\n",result);

getch();

}

else if(a=='n' || a=='N')

{

exit(0);

}

}

/*Determining priority of inside elements*/

int st_ISP(char t)

{

CP LAB


66 switch(t)

{

case '(':return (10);

case ')':return (9);

case '+':return (7);

case '-':return (7);

case '*':return (8);

case '/':return (8);

case '\0':return (0);

default: printf("Expression is invalid.");

break;

}

return 0;

}

/*Determining priority of approaching elements*/

int st_ICP(char t)

{

switch(t)

{








default: printf("Expression is invalid.");

break;

}

return 0;

}

/*Evaluating the result of postfix expression*/

int cal(char post[])

{

int m,n,x,y,j=0,len;

len=strlen(post);

while(j<len)

{

CP LAB


67 if(isdigit(post[j]))

{

x=post[j]-'0';

push_item(x);

}

else

{

m=pop_item();

n=pop_item();

switch(post[j])

{

case '+':x=n+m;

break;

case '-':x=n-m;

break;

case '*':x=n*m;

break;

case '/':x=n/m;

break;

}

push_item(x);

}

j++;

}

if(st_top>0)

{

printf("Number of Operands are more than Operators.");

exit(0);

}

else

{

y=pop_item();

return (y);

}

return 0;

}

CP LAB


6828. Write a C program that uses functions to perform the following:

i) Creating a Binary Tree of integers

ii) Traversing the above binary tree in preorder, inorder and

postorder.

#include<stdio.h>

#include <stdlib.h>

#include<conio.h>

struct treenode

{

int ele;

struct treenode *l_child, *r_child;

};

struct treenode *insert_node(struct treenode *t,int a);

void TraverseInorder(struct treenode *t);

void TraversePreorder(struct treenode *t);

void TraversePostorder(struct treenode *t);

/*main function*/

void main()

{

struct treenode *root_node = NULL;

int num,value;

int choice;

clrscr();

printf("----------------------------------------------------\n");

printf("\t\t\tMENU\n");

printf("-----------------------------------------------------\n");

printf("[1] Create a Binary Tree and Use Inorder Traversal\n");

printf("[2] Create a Binary Tree and Use Preorder Traversal\n");

printf("[3] Create a Binary Tree and Use Postorder Traversal\n");

printf("-----------------------------------------------------\n");

printf("Enter your choice:");

scanf("%d",&choice);

if(choice>0 & choice<=3)

{

CP LAB


69 printf("\nEnter the number of nodes:");

scanf("%d",&num);

while(num-- > 0)

{

printf("\n\nEnter the data value:");

scanf("%d",&value);

root_node = insert_node(root_node,value);

}

switch(choice)

{

case 1:

printf("\n\nBinary tree using Inorder Traversal : ");

TraverseInorder(root_node);

getch();

break;

case 2:

printf("\n\nBinary tree using Preorder Traversal : ");

TraversePreorder(root_node);

getch();

break;

case 3:

printf("\n\nBinary tree using Postorder Traversal : ");

TraversePostorder(root_node);

getch();

break;

default:

printf("Invalid Choice");

break;

}

}

}

/*end main*/

/* Function to create a Binary Tree of integers data */

struct treenode *insert_node(struct treenode *t,int a)

{

CP LAB


70 struct treenode *temp_node1,*temp_node2;

if(t == NULL)

{

t = (struct treenode *) malloc(sizeof(struct treenode));

if(t == NULL)

{

printf("Value cannot be allocated.\n");

exit(0);

}

t->ele = a;

t->l_child=t->r_child=NULL;

}

else

{

temp_node1 = t;

while(temp_node1 != NULL)

{

temp_node2 = temp_node1;

if( temp_node1 ->ele > a)

temp_node1 = temp_node1->l_child;

else

temp_node1 = temp_node1->r_child;

}

if( temp_node2->ele > a)

{

temp_node2->l_child = (struct treenode*)malloc(sizeof(struct treenode));

temp_node2 = temp_node2->l_child;

if(temp_node2 == NULL)

{


exit(0);

}

temp_node2->ele = a;

temp_node2->l_child=temp_node2->r_child = NULL;

}

else

{

temp_node2->r_child = (struct treenode*)malloc(sizeof(struct treenode));

temp_node2 = temp_node2->r_child;

CP LAB


71 if(temp_node2 == NULL)

{


exit(0);

}

temp_node2->ele = a;

temp_node2->l_child=temp_node2->r_child = NULL;

}

}

return(t);

}

/* Function for Traversing the binary tree in inorder. */

void TraverseInorder(struct treenode *t)

{

if(t != NULL)

{

TraverseInorder(t->l_child);

printf("%d\t",t->ele);

in_order(t->r_child);

}

}

/* Function for Traversing the binary tree in preorder. */

void TraversePreorder(struct treenode *t)

{

if(t != NULL)

{

printf("%d\t",t->ele);

TraversePreorder(t->l_child);

TraversePreorder(t->r_child);

}

}

/* Function for Traversing the binary tree in postorder. */

void TraversePostorder(struct treenode *t)

{

if(t != NULL)

{

TraversePostorder(t->l_child);

TraversePostorder(t->r_child);

CP LAB


72 printf("%d\t",t->ele);

}

}

CP LAB


7329. Write C programs that use both recursive and non recursive

functions to perform the following searching operations for a Key

value in a given list of integers :

i) Linear search ii) Binary search

i) Linear search

#include <stdio.h>

#define MAX_LEN 10

void l_search_recursive(int l[],int num,int ele);

void l_search(int l[],int num,int ele);

void read_list(int l[],int num);

void print_list(int l[],int num);

void main()

{

int l[MAX_LEN], num, ele;

int ch;

clrscr();

printf("======================================================");

printf("\n\t\t\tMENU");

printf("\n=====================================================");

printf("\n[1] Linary Search using Recursion method");

printf("\n[2] Linary Search using Non-Recursion method");

printf("\n\nEnter your Choice:");

scanf("%d",&ch);

if(ch<=2 & ch>0)

{

printf("Enter the number of elements :");

scanf("%d",&num);

read_list(l,num);

printf("\nElements present in the list are:\n\n");

print_list(l,num);

printf("\n\nElement you want to search:\n\n");

scanf("%d",&ele);

switch(ch)

{

CP LAB


74 case 1:printf("\n**Recursion method**\n");

l_search_recursive(l,num,ele);

getch();

break;

case 2:printf("\n**Non-Recursion method**\n");

l_search_nonrecursive(l,num,ele);

getch();

break;

}

}

getch();

}

/*end main*/

/* Non-Recursive method*/

void l_search_nonrecursive(int l[],int num,int ele)

{

int j, f=0;

for(j=0;j<num;j++)

if( l[j] == ele)

{

printf("\nThe element %d is present at position %d in list\n",ele,j);

f=1;

break;

}

if(f==0)

printf("\nThe element is %d is not present in the list\n",ele);

}

/* Recursive method*/

void l_search_recursive(int l[],int num,int ele)

{

int f = 0;

if( l[num] == ele)

{

printf("\nThe element %d is present at position %d in list\n",ele,num);

f=1;

}

else

CP LAB


75 {

if((num==0) && (f==0))

{

printf("The element %d is not found.",ele);

}

else

{

l_search(l,num-1,ele);

}

}

getch();

}

void read_list(int l[],int num)

{

int j;

printf("\nEnter the elements:\n");

for(j=0;j<num;j++)

scanf("%d",&l[j]);

}

void print_list(int l[],int num)

{

int j;

for(j=0;j<num;j++)

printf("%d\t",l[j]);

}

CP LAB


76ii) Binary search

#include <stdio.h>

#define MAX_LEN 10

/* Non-Recursive function*/

void b_search_nonrecursive(int l[],int num,int ele)

{

int l1,i,j, flag = 0;

l1 = 0;

i = num-1;

while(l1 <= i)

{

j = (l1+i)/2;

if( l[j] == ele)

{

printf("\nThe element %d is present at position %d in list\n",ele,j);

flag =1;

break;

}

else

if(l[j] < ele)

l1 = j+1;

else

i = j-1;

}

if( flag == 0)

printf("\nThe element %d is not present in the list\n",ele);

}

/* Recursive function*/

int b_search_recursive(int l[],int arrayStart,int arrayEnd,int a)

{

int m,pos;

if (arrayStart<=arrayEnd)

{

m=(arrayStart+arrayEnd)/2;

if (l[m]==a)

return m;

else if (a<l[m])

CP LAB


77 return b_search_recursive(l,arrayStart,m-1,a);

else

return b_search_recursive(l,m+1,arrayEnd,a);

}

return -1;

}

void read_list(int l[],int n)

{

int i;

printf("\nEnter the elements:\n");

for(i=0;i<n;i++)

scanf("%d",&l[i]);

}

void print_list(int l[],int n)

{

int i;

for(i=0;i<n;i++)

printf("%d\t",l[i]);

}

/*main function*/

void main()

{

int l[MAX_LEN], num, ele,f,l1,a;

int ch,pos;

clrscr();

printf("======================================================");

printf("\n\t\t\tMENU");

printf("\n=====================================================");

printf("\n[1] Binary Search using Recursion method");

printf("\n[2] Binary Search using Non-Recursion method");

printf("\n\nEnter your Choice:");

scanf("%d",&ch);

if(ch<=2 & ch>0)

{

printf("\nEnter the number of elements : ");

CP LAB


78 scanf("%d",&num);

read_list(l,num);

printf("\nElements present in the list are:\n\n");

print_list(l,num);

printf("\n\nEnter the element you want to search:\n\n");

scanf("%d",&ele);

switch(ch)

{

case 1:printf("\nRecursive method:\n");

pos=b_search_recursive(l,0,num,ele);

if(pos==-1)

{

printf("Element is not found");

}

else

{

printf("Element is found at %d position",pos);

}

getch();

break;

case 2:printf("\nNon-Recursive method:\n");

b_search_nonrecursive(l,num,ele);

getch();

break;

}

}

getch();

}

CP LAB


7930. Write C programs that implement the following sorting methods

to sort a given list of integers in ascending order:

i) Bubble sort ii) Quick sort

i) Bubble sort

#include <stdio.h>

#define MAX 10

void swapList(int *m,int *n)

{

int temp;

temp = *m;

*m = *n;

*n = temp;

}

// Function for Bubble Sort

void bub_sort(int list[], int n)

{

int i,j;

for(i=0;i<(n-1);i++)

for(j=0;j<(n-(i+1));j++)

if(list[j] > list[j+1])

swapList(&list[j],&list[j+1]);

}

void readlist(int list[],int n)

{

int j;

printf("\nEnter the elements: \n");

for(j=0;j<n;j++)

scanf("%d",&list[j]);

}

// Showing the contents of the list

void printlist(int list[],int n)

{

int j;

for(j=0;j<n;j++)

printf("%d\t",list[j]);

CP LAB


80}

void main()

{

int list[MAX], num;

clrscr();

printf("\n\n\n***** Enter the number of elements [Maximum 10] *****\n");

scanf("%d",&num);

readlist(list,num);

printf("\n\nElements in the list before sorting are:\n");

printlist(list,num);

bub_sort(list,num);

printf("\n\nElements in the list after sorting are:\n");

printlist(list,num);

getch();

}

CP LAB


81ii) Quick sort

#include <stdio.h>

#define MAX 10

void swap(int *m,int *n)

{

int temp;

temp = *m;

*m = *n;

*n = temp;

}

int get_key_position(int x,int y )

{

return((x+y) /2);

}

// Function for Quick Sort

void quicksort(int list[],int m,int n)

{

int key,i,j,k;

if( m < n)

{

k = get_key_position(m,n);

swap(&list[m],&list[k]);

key = list[m];

i = m+1;

j = n;

while(i <= j)

{

while((i <= n) && (list[i] <= key))

i++;

while((j >= m) && (list[j] > key))

j--;

if( i < j)

swap(&list[i],&list[j]);

}

swap(&list[m],&list[j]);

quicksort(list,m,j-1);

quicksort(list,j+1,n);

CP LAB


82 }

}

// Function to read the data

void read_data(int list[],int n)

{

int j;

printf("\n\nEnter the elements:\n");

for(j=0;j<n;j++)

scanf("%d",&list[j]);

}

// Function to print the data

void print_data(int list[],int n)

{

int j;

for(j=0;j<n;j++)

printf("%d\t",list[j]);

}

void main()

{

int list[MAX], num;

clrscr();

printf("\n***** Enter the number of elements Maximum [10] *****\n");

scanf("%d",&num);

read_data(list,num);

printf("\n\nElements in the list before sorting are:\n");

print_data(list,num);

quicksort(list,0,num-1);

printf("\n\nElements in the list after sorting are:\n");

print_data(list,num);

getch();

}

CP LAB


8331. Write C programs that implement the following sorting methods

to sort a given list of integers in ascending order:

i) Insertion sort ii) Merge sort

i) Insertion sort

#include<stdio.h>

#include<conio.h>

void inst_sort(int []);

void main()

{

int num[5],count;

clrscr();

printf("\nEnter the Five Elements to sort:\n");

for (count=0;count<5;count++)

scanf("%d",&num[count]);

inst_sort(num);

printf("\n\nElements after sorting: \n");

for(count=0;count<5;count++)

printf("%d\n",num[count]);

getch();

}

// Function for Insertion Sorting

void inst_sort(int num[])

{

int i,j,k;

for(j=1;j<5;j++)

{

k=num[j];

for(i=j-1;i>=0 && k<num[i];i--)

num[i+1]=num[i];

num[i+1]=k;

}

}

CP LAB


84ii) Merge sort

#include <stdio.h>

#include <stdlib.h>

#define MAX_ARY 10

void merge_sort(int x[], int end, int start);

int main(void) {

int ary[MAX_ARY];

int j = 0;

printf("\n\nEnter the elements to be sorted: \n");

for(j=0;j<MAX_ARY;j++)

scanf("%d",&ary[j]);

/* array before mergesort */

printf("Before :");

for(j = 0; j < MAX_ARY; j++)

printf(" %d", ary[j]);

printf("\n");

merge_sort(ary, 0, MAX_ARY - 1);

/* array after mergesort */

printf("After Merge Sort :");

for(j = 0; j < MAX_ARY; j++)

printf(" %d", ary[j]);

printf("\n");

getch();

}

/* Method to implement Merge Sort*/

void merge_sort(int x[], int end, int start) {

int j = 0;

const int size = start - end + 1;

int mid = 0;

CP LAB


85int mrg1 = 0;

int mrg2 = 0;

int executing[MAX_ARY];

if(end == start)

return;

mid = (end + start) / 2;

merge_sort(x, end, mid);

merge_sort(x, mid + 1, start);

for(j = 0; j < size; j++)

executing[j] = x[end + j];

mrg1 = 0;

mrg2 = mid - end + 1;

for(j = 0; j < size; j++) {

if(mrg2 <= start - end)

if(mrg1 <= mid - end)

if(executing[mrg1] > executing[mrg2])

x[j + end] = executing[mrg2++];

else


else


else


}

}

CP LAB


8632. Write C programs to implement the Lagrange interpolation and

Newton- Gregory forward interpolation.

Lagrange interpolation:

#include<stdio.h>

#include<conio.h>

#define MaxN 90

void main()

{

float arr_x[MaxN+1], arr_y[MaxN+1], numerator, denominator, x, y=0;

int i, j, n;

clrscr();

printf("Enter the value of n: \n");

scanf("%d", &n);

printf("Enter the values of x and y: \n");

for(i=0; i<=n; i++)

scanf("%f%f", &arr_x[i], &arr_y[i]);

printf("Enter the value of x at which value of y is to be calculated: ");

scanf("%f", &x);

for (i=0; i<=n; i++)

{

numerator=1;

denominator=1;

for (j=0; j<=n; j++)

if(j!=i)

{

numerator *= x-arr_x[j];

denominator *= arr_x[i]-arr_x[j];

}

y+=(numerator/denominator)*arr_y[i];

}

printf("When x=%4.1f y=%7.1f\n",x,y);

getch();

}

CP LAB


87Newton- Gregory forward interpolation.:

#include<stdio.h>

#include<conio.h>

#define MaxN 100

#define Order_of_diff 4

void main ()

{

float arr_x[MaxN+1], arr_y[MaxN+1], numerator=1.0, denominator=1.0, x, y, p, h,

diff_table[MaxN+1][Order_of_diff+1];

int i,j,n,k;

clrscr();

printf("Enter the value of n \n");

scanf("%d",&n);

printf("Enter the values of x and y");

for(i=0; i<=n; i++)

scanf("%f%f", &arr_x[i], &arr_y[i]);

printf("Enter the value of x at which value of y is to be calculated");

scanf("%f", &x);

h=arr_x[1]-arr_x[0];

for(i=0; i<=n-1; i++)

diff_table[i][1]=arr_y[i+1]-arr_y[i];/*Creating the difference table and calculating first order

differences*/

for(j=2; j<=Order_of_diff; j++)/*Calculating higher order differences*/

for(i=0; i<=n-j; i++)

diff_table[i][j]=diff_table[i+1][j-1] - diff_table[i][j-1];

i=0;

while(!(arr_x[i]>x)) /* Finding x0 */

i++;

i--;

p=(x-arr_x[i])/h;

y=arr_y[i];

for (k=1; k<=Order_of_diff; k++)

{

CP LAB


88 numerator *=p-k+1;

denominator *=k;

y +=(numerator/denominator)*diff_table[i][k];

}

printf("When x=%6.1f, y=%6.2f\n",x, y);

getch();

}

CP LAB


8933. Write C programs to implement the linear regression and

polynomial regression algorithms

#include<stdio.h>

#include<conio.h>

#include<math.h>

#include<string.h>

float mean(float *a, int n);

void deviation(float *a, float mean, int n, float *d, float *S);

void main()

{

float a[20],b[20],dx[20],dy[20];

float sy=0,sx=0,mean_x=0,mean_y=0,sum_xy=0;

float corr_coff=0,reg_coff_xy=0, reg_coff_yx=0;

char type_coff[7];

int n=0,i=0;

clrscr();

printf("Enter the value of n: ");

scanf("%d",&n);

printf("Enter the values of x and y:\n");

for(i=0;i<n;i++)

scanf("%f%f",&a[i],&b[i]);

mean_x=mean(a,n);

mean_y=mean(b,n);

deviation(a,mean_x,n,dx,&sx);

deviation(b,mean_y,n,dy,&sy);

for(i=0;i<n;i++)

sum_xy=sum_xy+dx[i]*dy[i];

corr_coff=sum_xy/(n*sx*sy);

printf("Enter the type of regression coefficient as 'x on y' or 'y on x': ");

fflush(stdin);

gets(type_coff);

if(strcmp(type_coff,"x on y")==1)

{

CP LAB


90reg_coff_xy=corr_coff*(sx/sy);

printf("\nThe value of linear regression coefficient is %f",reg_coff_xy);

}

else if(strcmp(type_coff,"y on x")==1)

{

reg_coff_yx=corr_coff*(sy/sx);

printf("\nThe value of linear regression coefficient is %f",reg_coff_yx);

}

else

printf("\nEnter the correct type of regression coefficient.");

getch();

}

float mean(float *a, int n)

{

float sum=0, i=0;

for(i=0;i<n;i++)

sum=sum+a[i];

sum=sum/n;

return (sum);

}

void deviation(float *a, float mean, int n, float *d, float *s)

{

float sum=0,t=0;

int i=0;

for(i=0;i<n;i++)

{

d[i]=a[i]-mean;

t=d[i]*d[i];

sum=sum+t;

}

sum=sum/n;

*s=sqrt(sum);

}

CP LAB


9134. Write C programs to implement Trapezoidal and Simpson

methods.

Trapezoidal:

#include<stdio.h>

#include<conio.h>

#include<math.h>

char postfix[80];

float stack[80];

char stack1[80];

int top=-1,top1=-1;

float eval(char postfix[], float x1);

void infix_postfix(char infix[]);

main()

{

float x0, xn, h, s,e1,e2;

char exp[80], arr[80];

int i,n,l=0;

clrscr();

printf("\nEnter an expression: ");

gets(exp);

puts("Enter x0, xn and number of subintervals");

scanf("%f%f%d", &x0, &xn, &n);

h=(xn-x0)/n;

if(exp[0]=='l'&& exp[1]=='o'&& exp[2]=='g')

{

l=strlen(exp);

for(i=0;i<l-3; i++)

arr[0]=exp[i+3];

arr[i]='\0';

infix_postfix(arr);

e1=eval(postfix,x0);

e2=eval(postfix,xn);

s=log(e1)+log(e2);

for (i=1;i<=n-1;i++)

s+=2*log(eval(postfix,x0+i*h));

}

CP LAB


92else

{

infix_postfix(exp);

s=eval(postfix,x0)+eval(postfix,xn);

for (i=1;i<=n-1;i++)

s+=2*eval(postfix,x0+i*h);

}

printf("Value of the integral is %6.3f\n",(h/2)*s);

return(0);

}

/*Inserting the operands in a stack. */

void push(float item)

{

if(top==99)

{

printf("\n\tThe stack is full");

getch();

exit(0);

}

else

{

top++;

stack[top]=item;

}

return;

}

/*Removing the operands from a stack. */

float pop()

{

float item;

if(top==-1)

{

printf("\n\tThe stack is empty\n\t");

getch();

}

item=stack[top];

top--;

return (item);

}

void push1(char item)

{

CP LAB


93if(top1==79)

{


getch();

exit(0);

}

else

{

top1++;

stack1[top1]=item;

}

return;

}


char pop1()

{

char item;

if(top1==-1)

{

printf("\n\tThe stack1 is empty\n\t");

getch();

}

item=stack1[top1];

top1--;

return (item);

}

/*Converting an infix expression to a postfix expression. */

void infix_postfix(char infix[])

{

int i=0,j=0,k;

char ch;

char token;

for(i=0;i<79;i++)

postfix[i]=' ';

push1('?');

i=0;

token=infix[i];

while(token!='\0')

{

if(isalnum(token))

{

CP LAB


94postfix[j]=token;

j++;

}

else if(token=='(')

{

push1('(');

}

else if(token==')')

{

while(stack1[top1]!='(')

{

ch=pop1();

postfix[j]=ch;

j++;

}

ch=pop1();

}

else

{

while(ISPriority(stack1[top1])>=ICP(token))

{

ch=pop1();

/*Assigning the popped element into the postfix array. */

postfix[j]=ch;

j++;

}

push1(token);

}

i++;

token=infix[i];

}

while(top1!=0)

{

ch=pop1();

postfix[j]=ch;

j++;

}

postfix[j]='\0';

}

CP LAB


95int ISPriority(char token)

{

switch(token)

{







case '?':return (0);

default: printf("Invalid expression");

break;

}

return 0;

}

/*Determining the priority of elements that are approaching towards the stack. */

int ICP(char token)

{

switch(token)

{









break;

}

return 0;

}

/*Calculating the result of expression, which is converted in postfix notation. */

float eval(char p[], float x1)

{

float t1,t2,k,r;

int i=0,l;

l=strlen(p);

while(i<l)

{

CP LAB


96if(p[i]=='x')

push(x1);

else

if(isdigit(p[i]))

{

k=p[i]-'0';

push(k);

}

else

{

t1=pop();

t2=pop();

switch(p[i])

{

case '+':k=t2+t1;

break;

case '-':k=t2-t1;

break;

case '*':k=t2*t1;

break;

case '/':k=t2/t1;

break;

default: printf("\n\tInvalid expression");

break;

}

push(k);

}

i++;

}

if(top>0)

{

printf("You have entered the operands more than the operators");

exit(0);

}

else

{

r=pop();

return (r);

}

return 0;

}

CP LAB


97

CP LAB


98Simpson methods:

#include<stdio.h>

#include<conio.h>

#include<math.h>

char postfix[80];

float stack[80];

char stack1[80];

int top=-1,top1=-1;

float eval(char postfix[], float x1);

void infix_postfix(char infix[]);

main()

{

float x0, xn, h, s,e1,e2, e3;

char exp[80], arr[80];

int i,n,l=0;

clrscr();

printf("\nEnter an expression: ");

gets(exp);

puts("Enter x0, xn and number of sub-intervals: ");

scanf("%f%f%d", &x0, &xn, &n);

h=(xn-x0)/n;

if(exp[0]=='l'&& exp[1]=='o'&& exp[2]=='g')

{

l=strlen(exp);

for(i=0;i<l-3; i++)

arr[0]=exp[i+3];

arr[i]='\0';

infix_postfix(arr);

e1=eval(postfix,x0);

e2=eval(postfix,xn);

e3=4*eval(postfix, x0+h);

s=log(e1)+log(e2)+log(e3);

for (i=3;i<=n-1;i+=2)

s+=4*eval(postfix,x0+i*h)+2*eval(postfix, x0+(i-1)*h);

}

else

{

CP LAB


99 infix_postfix(exp);

s=eval(postfix,x0)+eval(postfix,xn)+4*eval(postfix, x0+h);

for (i=3;i<=n-1;i+=2)

s+=4*eval(postfix,x0+i*h)+2*eval(postfix, x0+(i-1)*h);

}

printf("The value of integral is %6.3f\n",(h/3)*s);

return(0);

}

/*Inserting the operands in a stack. */

void push(float item)

{

if(top==99)

{


getch();

exit(0);

}

else

{

top++;

stack[top]=item;

}

return;

}


float pop()

{

float item;

if(top==-1)

{

printf("\n\tThe stack is empty\n\t");

getch();

}

item=stack[top];

top--;

return (item);

}

void push1(char item)

{

if(top1==79)

{

CP LAB


100 printf("\n\tThe stack is full");

getch();

exit(0);

}

else

{

top1++;

stack1[top1]=item;

}

return;

}


char pop1()

{

char item;

if(top1==-1)

{

printf("\n\tThe stack1 is empty\n\t");

getch();

}

item=stack1[top1];

top1--;

return (item);

}

/*Converting an infix expression to a postfix expression. */

void infix_postfix(char infix[])

{

int i=0,j=0,k;

char ch;

char token;

for(i=0;i<79;i++)

postfix[i]=' ';

push1('?');

i=0;

token=infix[i];

while(token!='\0')

{

if(isalnum(token))

{

postfix[j]=token;

j++;

CP LAB


101 }

else if(token=='(')

{

push1('(');

}

else if(token==')')

{

while(stack1[top1]!='(')

{

ch=pop1();

postfix[j]=ch;

j++;

}

ch=pop1();

}

else

{

while(ISPriority(stack1[top1])>=ICP(token))

{

ch=pop1();

postfix[j]=ch;

j++;

}

push1(token);

}

i++;

token=infix[i];

}

while(top1!=0)

{

ch=pop1();

postfix[j]=ch;

j++;

}

postfix[j]='\0';

}

/*Determining the priority of elements that are placed inside the stack. */

int ISPriority(char token)

{

switch(token)

CP LAB


102{







case '?':return (0);


}

return 0;

}

/*Determining the priority of elements that are approaching towards the stack. */

int ICP(char token)

{

switch(token)

{









}

return 0;

}

/*Calculating the result of expression, which is converted in postfix notation. */

float eval(char p[], float x1)

{

float t1,t2,k,r;

int i=0,l;

l=strlen(p);

while(i<l)

{

if(p[i]=='x')

push(x1);

else

if(isdigit(p[i]))

CP LAB


103 {

k=p[i]-'0';

push(k);

}

else

{

t1=pop();

t2=pop();

switch(p[i])

{

case '+':k=t2+t1;

break;

case '-':k=t2-t1;

break;

case '*':k=t2*t1;

break;

case '/':k=t2/t1;

break;

default: printf("\n\tInvalid expression");

}

push(k);

}

i++;

}

if(top>0)

{

printf("You have entered the operands more than the operators");

exit(0);

}

else

{

r=pop();

return (r);

}

return 0;

}

CP LAB


104

REFERENCES:

1. C programming and Data Structures, P. Padmanabham, Third Edition, BS

Publications

2. Data Structures: A pseudo code approach with C, second edition R.F.

Gilberg and B.A. Forouzan

3. Programming in C, P.Dey & M. Ghosh, Oxford Univ.Press.

4. C and Data Structures, E Balaguruswamy, TMH publications.

Documents

c Programming & Data Strucutres Lab Manual