Data Stuctures Lab Manual

BIO-DATA AIM:

To write a C-program to print the bio-data. ALGORITHM:

Step:1 Start the program. Step:2 Read name, father’s name, city, age. Step:3 Enter the details. Step:4 Print the details. Step:5 Stop the program. PROGRAM:

#include #include void main() { char name, fathername, city; int age; clrscr(); printf(“Enter the name:”); scanf(“%s”,name); printf(“\n Enter the father’s name:”); scanf(“%s”,fathername); printf(\n Enter the city”); scanf(“%s”,city); printf(“\n Enter the age:”); scanf(“%d”,&age); printf(“\n Name:%s”,Name); printf(“\n Father’s Name:%s”,fathername); printf(“\n City:%s”,city); printf(“\n Age:%d”,age); getch(); } RESULT:

Thus the C-program to print the bio-data had been executed and the output was verified.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

























FLOWCHART:

START

Read name, father name, city, age

Print name, father name, city, age

STOP

OUTPUT:

Enter the name: R. Siva Kumar Enter the Father’s name: M. Rajavel. Enter the city: Tiruchengode. Enter the age:21 Name: R. Siva Kumar. Father’s Name: M. Rajavel. City: Tiruchengode. Age: 21



























AVERAGE OF ‘N’ NUMBERS AIM:

To write a C-program to find the average of ‘n’ numbers. ALGORITHM:

Step:1 Start the program. Step:2 Read n. Step:3 Enter the numbers. Step:4 Use for loop with condition i < n find its sum. Step:5 Calculate the average. Step:6 Stop the program. PROGRAM:

#include #include void main() { int a[20],i,n; float avg,s=0; printf(“Enter the number of element to be added”); scanf(“%d”,&n); printf(“\n Enter the numbers”); for(i=0;i
Thus the C-program to find the average of n numbers had been written and it is executed.



























FLOWCHART:

START

Read n

For(i=0;i
Read a[i]

For(i=0;i
s=s+a[i]

Avg=s/n

Print avg

stop

OUTPUT:

Enter the number of element: 5 Enter the numbers: 7 8 9 5 4 The average of 5 no is : 6.600000 6.600000



























LARGEST AND SMALLEST NUMBER IN AN ARRAY AIM:

To write a C-program to find the largest and smallest number in an array. ALGORITHM:

Step:1 Start. Step:2 Read ‘n’ number element of array. Step:3 Save the numbers in ascending order using temp’t’. Step:4 Print the first element (i.e) smallest end largest elements. Step:5 Stop. PROGRAM:

#include #include void main() { int n,i,j,a[15],t; clrscr(); printf(“Enter the numbers to be sort:”); scanf(“%d”,&n); for(i=1;i<=n;i++) { scanf(“%d”,&a[i]); } for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { if(a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } printf(“The minimum value is %d”,a[1]); printf(“The maximum value is %d”,a[n]); getch(); } RESULT:

Thus the C-program to print the largest and smallest of ‘N’ numbers is executed and the output is



























FLOW CHART:

start

Read n

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

For(j=i+1;j<=n;j++)

Ifa[i]>a[j ]

I=a[i] A[i]=a[j] A[j]=n

Print minimum value a[i]

Print maximum value a[j]

stop OUTPUT:





























SALES REPORT OF GIRLS AIM:

To write a ‘c’ program to find the total value of each item by each girl. ALGORITHM:

Step 1. Start the program Step 2. Read Read the no of items and girls. girls. Step 3.Use for loop to get the value of sales and value of each item and grand total. Step 4. Print the value of sales, value of each item and grand total. Step 5. Stop PROGRAM:

#include #include void main() { int b[10][10],m, a, s=0,c=0; clrscr(); printf(“ Enter m, n”); scanf(“%d%d”,&m,&n); for(i=0;i


























FLOW CHAR

T: FLOWCHART:

START

Read m,n

for(i=0;i
for(i=0;i
a=a+b[i][j]

Print a

for(j=0;j


























A

s=s+c

Print s

STOP

OUTPUT:

Enter m,n: 2 2 Enter the value of each item by 1 girl=8 Total value of each item by 2 girl=8 Total value of sales by 1 girl=5 Total value of sales by 2 girl=11 Grand total of each item sold by all girl=16



























STUDENT DETAILS AIM:

To write a ‘C’ program to print the mark details of n students.

ALGORITHM:

Step 1. Start the program Step 2. Read the marks of srudents using arrays and loops. Step 3. Find the average of 3 students by using arrays and loops. Step 4. Find the average of student . Step 5. Print average. Step 6. Find the overall average. Step 7. Print the overall average. Step 8. Stop.

PROGRAM:

#include #include void main() { int a[5][5], i, j; float avg, b, s, t=0; clrscr(); for(i=1;i<4;i++) { printf(“\n Enter the mark for %d student”,i); for(j=1;j<6;j++) { scanf(“%d”,a[i][j]); s=s+a[i][j]; } avg=s/5;



























FLOWCHART:

START

Read the marks

S=0;t=0

For(j=0;j<4;j++)

B For(j=1;j<6;j++)

s=s+a[i][j]

Avg=s/5

A





























A

Print avg

t=t+avg

b=avg/5

B Write b

STOP



























FACTORIAL OF N NUMBERS AIM:

To find the factorial of given numbers using recursive function in ‘c’ program. ALGORITHM:

Step 1: Start the program Step 2: read n Step2: Find the factorial of n numbers using recursive function Step 4: Stop the program PROGRAM:

#include #include int fact (int n) void main() { int n; clrscr(); printf(“ enter the no:”); scanf(“%d”,&n); printf(“the factorial of %d is %d” ,n ,fact(n)); getch(); } int fact (int n)



























FLOW CHART: Main program

start Read n fact

Print fact

stop

Sub program

Int fact(int n)

If

yes



























OUTPUT:

Enter the value of n: 5 The factorial of 5 is 120



























FIBONACCI SERIES AIM:

To write a C-program to print a Fibonacci series. ALGORITHM:

Step:1 Start the program Step:2 Read the value of 'n' Step:3 Executing he function int fib(int n) Step:4 Find the Fibonacci series Step:5 End program. PROGRAM:

#include include void main() { int n; int fib(int n); printf("enter n/n"); scanf("%d",&n); fib(n); } int fib(int n); {





























FLOWCHART: Main program Sub program

start Read n

F=fib(int n)

Int fib (int n)

If n< =i1

Print n

yes

no

a=0

Return n Stop

b=1



























TOWER OF HANOI AIM:

To write a C-program for solving tower of Hanoi. ALGORTHIM:

Step:1 Start the program. Step:2 If n==1,move single disc from A to C and stop. Step:3 Move the top = n-1 disc from A to B using C as auxiliary Step:4 Move remaining disc from A to C Step:5 Move the n-1 disc from B to C using A as auxiliary Step:6 Stop the program. PROGRAM.

#include #include



























FLOWCHART: Main program:

START

Read n

Tower(n,’A’,’B’,’C,)

STOP Sub-program:



























OUTPUT:

enter the no no of disc to move 3 move disc middle from A to C move disc 2 from A move disc from middle C to B move disc 1 from C to B move disc 3 from A move disc from middle C to A move disc 2 from C



























PALINDROME USING STACK AIM:

To write a C-program to check whether the given string is palindrome or not. ALGORITHM:

Step:1 Get the string. Step:2 Find the string length. Step:3 Push each character to stack Step:4 Retrieve each character from stack in reverse order and store in new variable Step:5 Compare two characters and if two strings are equal say the string is palindrome otherwise the string is not palindrome. PROGRAM:

#include





























char pop() { top=top-1; return(stack top) } RESULT:

Thus a C-program is written to check whether the given string is palindrome or not.



























FLOWCHART:

start Read the string



























CONVERSION OF PREFIX TO POSTFIX AIM:

To write a C program to convert prefix to postfix expression.. ALGORITHM:

Step:1 Start the program. Step:2 Read the given string.



























case ‘-’: while(st[top]>=1) post[j++]=pop(); push(2); break; case ‘*’: while(st[top]>=3) post[j++]=pop(); push(3); break; case ‘/’: while(st[top]>=3)



























break; case 3: e= ‘*’; break; case 4: e= ‘/’; break; case 5: e= ‘^’; break; } return(e);





























FLOWCHART:



























OUTPUT:



























IMPLEMENTATION OF STACK



























st.top--; return(item); }



























} printf("\n Do you want to continue"); ans=getchar();























































































































































































































































































































































































































































































































































































































tree *insert node (tree *btree,tree* temp)

if(btree= =NULL)

if(temp-> data> btree>data)

if(temp-> data< btree>data)

if(temp> data=btr ee>data)

Print “Data already exists”



























OUTPUT:

Program for implementing simple binary tree 1. Create 2. Inorder 3. Preorder 4. Postorder Enter your choice 1 Enter the element 5 Do you want to enter more elements? (y/n)y Enter the element 3 Do you want to enter more elements? (y/n)y Enter the element 4 Do you want to enter more elements? (y/n)y Enter the element 6 Do you want to enter more elements? (y/n)n Program for implementing simple binary tree 1. Create 2. Inorder 3. Preorder 4. Postorder Enter your choice 2 5



























SEQUENTIAL SEARCH AIM:

To write a C-program to perform the linear search operation operation on some number of elements.

ALGORITHM: Step:1 Start the program. Step:2 Read the key value Step:3 Go to the functions create and display. Step:4 If (status = = 1) print the value is present. Step:5 Else print the value is not present. Step:6 Stop the program. Sub – function.

Create ( ) i) Read the n value. ii) Read the a[i a[i]] el element ents us using fo for lo loop. Display ( ) i)

Print the elements.

Search ( ) i) If (a[i] = = k) return 1. ii) Else return 0.

PROGRAM: #include #include #define max 10 int a[max] , n , i; void create ( ) { printf (“ \n how many elements”); scanf (“%d”,&n); printf (“\n enter the elements”);



























printf (“\n the elements are”); for (i=0;i


























Thus the c – program to perform the linear search operation on some number of elements had been executed and verified.

FLOW CHART: Main program:

Enter the limit

for(i=0;i
Enter the element

linearsearch()

if search = =-1

Print the output





























Sub-program: linearsearch()

for(i=0;i
if a[i]= =k

return 1

OUTPUT: How many elements 5 Enter the elements 23 36 56 48 79 Enter the element you wish to search 48 The element is present



























QUICKSORT AIM:

To write a C-program to sort the elements by quick sort. ALGORITHM:

Step:1 Read the total number of elements in the list, say n. Step:2 Store the elements in the array. Step:3 Take the first element from the array and call it as the pivoted element. Step:4 Now find all elements which are less than the pivoted pivoted element and place them before the pivoted element. Thus the array will be divided in the lesser elements ,pivoted elements and elements greater than the pivoted element. Step:5 Repeat step 4 each time placing the pivoted element at the proper position. Thus the complete list will get sorted. Step:6 Stop. PROGRAM:

#include #include #include #define MAX 10 void main() { int n,i,x[MAX]; void quick(int x[],int,int); clrscr(); printf(“How many elements do you wish to sort?\n”); scanf(“%d”,&n);



























int partition(int x[MAX],int lb,int ub); if(lb
Thus a C-program is written to sort the elements by quick sort.



























FLOW CHART:

START Print “How many elements”

Read n

for(i=0;i
Print “Enter the elements”

Read x[i]

Next i

Quick(x,0,n-1)

Print “The sorted elements are “



























Enter the elements:55 Enter the elements:44 Enter the elements:33 Enter the elements:22 Enter the elements:11 The sorted elements are 11 22 33 44 55

BUBBLE SORT AIM:

To write a C-program to perform sorting by bubble sort. ALGORITHM:

Step:1 Read the total number of element, n. Step:2 .Store the elements in the array. Step:3 Set i=0. Step:4 Compare the adjacent elements. Step:5 Repeat step 4 for all n elements. Step:6 Increment the value of i by 1 and repeat step 4,5 for i
#include #include #include void bubblesort(int a[20],int n); void bubblesort(int a[20],int n); { int i,j,temp; for(i=0;ia[j+1]) {





























scanf(“%d”,&n); printf(“Enter the number of elements in the array”); for(i=0;i
Thus a C-program is written to perform sorting by bubble sort.



























FLOW CHART: Main program:

Sub-program:

Start Bubble(a,n)

Enter the elements

For(i=o;i
int swapped=TRUE

i=0

Read

Elements

whil e j
stop j=0

Whil



























After sorting 10 30 50

IMPLEMENTATION OF DOUBLY LINKED LIST AIM:

To write and execute a program to implement the operation in double linked list. ALGORITHM:

Step:1 Start. Step:2 Read. Step:3 If c==1,create new node. Step:4 If c==2,insert new node at specific location. Step:5 If c==3,delete a particular node. Step:6 If c==4,display the list. Step:7 If c==5,exit. Step:8 Stop. PROGRAM:

#include #include #include struct node



























case 1:add() break; case 2:delete() break; case 3:display() break; case 4:printf("enter no to be search:"); scanf("%d",&num); temp=start; while((temp!=NULL)&&(found==0)) found=find(num); if(found) printf("\n no is present"); break; case 5:exit(0) } printf("\n do u want to continue?"); ans=getch(); } while(ans=='y'||ans=='Y') getch(); } void add(void) { clrscr(); New=get_node(); printf("\n\n\tEnter the element:"); scanf("%d",&New->data); if(first==1) {



























printf("\n double linked list is empty"); else { while(temp!=NULL) { printf("%d",temp->data); temp=temp->next; } printf("NULL"); } getch(); } int find(int num) { if(temp->data==num) return(1) else temp=temp>next; return 0; } void delete(void) { int num,flag=0; int found; int least=0; clrscr(); temp=start; if(temp==NULL) printf("\n sorry dll not created"); else





























last=1; else last=0; (temp->next)->prev=temp->prev; (temp->prev)->next=temp->next; temp->prev=NULL; free(temp); if(last) printf("\n the last node is deleted"); else printf("\n the intermediate node is deleted"); } } } } RESULT:

Thus,a program to implement double linked list was written,executed and output was verified.



























START

Print program for various operation on doubly linked list 1.create 2.display 3.search 4.insert 5.delete 6.exit

Read choice



























f  data=num i next=null r  prev=r qnext=r

Return



























CONVERSION OF PREFIX TO POSTFIX AIM:

To write a C program to convert prefix to postfix expression.. ALGORITHM: Step:1 Start the program. Step:2 Read the given string. Step:3If the input symbol read is ‘c’ push it into the stack. Step:4 If the input symbol read is an operand then place it in the expression Step:5 If the input symbol read is an operator,then a)check the precedence of the operator read. If it has a higher precedence then remove it from the stack and place it in the postfix expression. Repeat 5a) till operator in the stack has a higher precedence than that being read. Step:6 If the input symbol read is closing parenthesis then pop all the operators from the stack and place them in the postfix expression till the opening parenthesis is encountered. Step:7 Stop the program. PROGRAM: #include #include #include



























case ‘*’: while(st[top]>=3) post[j++]=pop(); push(3); break; case ‘/’: while(st[top]>=3) post[j++]=pop(); push(4); break; case ‘^’: while(st[top]>=1) post[j++]=pop(); push(5); break; case ‘(’: push(0); break; case ‘)’: while(st[top]!=0) post[j++]=pop();





























e= ‘/’; break; case 5: e= ‘^’; break; } return(e); } RESULT: Thus a C program to convert the prefix expression to postfix expression was written, executed and the output was verfied.



























FLOWCHART: Main program

START

Read input

Pre 2 post

STOP



























OUTPUT:

Enter the expreesion: +ab The postfix expression is ab+





















































int delcirq(struct node**,struct node**); void cirq_display(struct node*); void main() struct node *front,*rear; front=rear=NULL; addcirq(&front,&rear,10); addcirq(&front,&rear,17); addcirq(&front,&rear,18); addcirq(&front,&rear,23); addcirq(&front,&rear,12); clrscr(); printf(“\n Before deletion:\n”);





























return(item); } return Null;





















































typedef struct SLL { int data;



























node*temp,*new,*head; int val, flag; char ans=’Y’;



























} printf(“%d->”,temp->data); temp=temp->next;



































































































Data Stuctures Lab Manual

Recommend Documents