Data Structures Lab Manual

Alva's Institute Of Engineering & Technology
Unit of Alvas Education Foundation, Moodbidri.

(Affiliated to VTU, Belgaum. Approved by AICTE, New Delhi & Recognized by Govt. of Karnataka)
Department of Computer Science and Engineering
3rd Semester B.E.

Choice Based Credit System (CBCS) scheme
Laboratory Manual
for
Data Structures with C Laboratory
(15CSL38)
Prepared By
Venkatesh Bhat., M.Tech Tahir Naquash H B., M.Tech

Associate Professor Assistant Professor
Dept. of CS&E Dept. of CS&E
2 DATA STRUCTURES WITH C LABORATORY (15CSL38)
DATA STRUCTURES WITH C LABORATORY

[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2015 -2016)
SEMESTER - III
Laboratory Code 15CSL38 IA Marks 20
Number of Lecture Hours/Week 01I + 02P Exam Marks 80
Total Number of Lecture Hours 40 Exam Hours 03
CREDITS 02
Course objectives: This laboratory course enable students to get practical
experience in design, develop, implement, analyze and evaluation/testing of
Asymptotic performance of algorithms.
Linear data structures and their applications such as Stacks, Queues and Lists
Non-Linear Data Structures and their Applications such as Trees and Graphs
Sorting and Searching Algorithms
Descriptions (if any)
Implement all the experiments in C Language under Linux / Windows environment.
Ex. Laboratory Experiments Description
No.
Introduction to Data Structures
Design, Develop and Implement a menu driven Program in C for the following Array operations
a. Creating an Array of N Integer Elements
b. Display of Array Elements with Suitable Headings
1 c. Inserting an Element (ELEM) at a given valid Position (POS)
d. Deleting an Element at a given valid Position(POS)
e. Exit.
Support the program with functions for each of the above operations.
Design, Develop and Implement a Program in C for the following operations on Strings
a. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
2 b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with
REP if PAT exists in STR. Report suitable messages in case PAT does not exist in STR
Support the program with functions for each of the above operations. Don't use Built-in functions.
Design, Develop and Implement a menu driven Program in C for the following operations on STACK
of Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element on to
Stack b. Pop an Element from
3 Stack
c. Demonstrate how Stack can be used to check Palindrome
d. Demonstrate Overflow and Underflow situations on Stack
e. Display the status of Stack
f. Exit
Support the program
Design, Develop and with appropriate
Implement functions
a Program in Cfor
foreach of the above
converting operations
an Infix Expression to Postfix
4 Expression. Program should support for both parenthesized and free parenthesized expressions with the
operators: +, -, *, /, %( Remainder), ^ (Power) and alphanumeric operands.
Design, Develop and Implement a Program in C for the following Stack Applications a. Evaluation of
5 Suffix expression with single digit operands and operators: +, -, *, /, %, ^ b. Solving Tower of Hanoi
problem with n disks
Department of Computer Science & Engineering A.I.E.T, Moodbiri

Design, Develop and Implement a menu driven Program in C for the following operations on Circular
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE
6 c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit
Support the program with appropriate functions for each of the above operations
Design, Develop and Implement a menu driven Program in C for the following operations on Singly
Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo
a. Create a SLL of N Students Data by using front insertion.
7 b. Display the status of SLL and count the number of nodes in it c. Perform Insertion and Deletion at
End of SLL
d. Perform Insertion and Deletion at Front of SLL
e. Demonstrate how this SLL can be used as STACK and QUEUE
f. Exit
Design, Develop and Implement a menu driven Program in C for the following operations on Doubly
Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation, Sal, PhNo
a. Create a DLL of N Employees Data by using end insertion.
8 b. Display the status of DLL and count the number of nodes in it
c. Perform Insertion and Deletion at End of DLL
d. Perform Insertion and Deletion at Front of DLL
e. Demonstrate how this DLL can be used as Double Ended Queue
f. Exit
Design, Develop and Implement a Program in C for the following operations on Singly Circular
Linked List (SCLL) with header nodes
a. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
9
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and store the result in
POLYSUM(x,y,z)
Design, Develop and Implement a menu driven Program in C for the following operations on Binary
Search Tree (BST) of Integers
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2 b. Traverse the BST in Inorder,
10 Preorder and Post Order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Delete an element(ELEM) from BST
a. e. Exit
Design, Develop and Implement a Program in C for the following operations on Graph(G) of Cities a.
Create a Graph of N cities using Adjacency Matrix.
11 b. Print all the nodes reachable from a given starting node in a digraph using BFS method b. c.
Check whether a given graph is connected or not using DFS method.
Given a File of N employee records with a set K of Keys(4-digit) which uniquely determine the records
in file F. Assume that file F is maintained in memory by a Hash Table(HT) of m memory locations
with L as the set of memory addresses (2-digit) of locations in HT. Let the keys in K and addresses in L
12
are Integers. Design and develop a Program in C that uses Hash function H: K L as H(K)=K mod m
(remainder method), and implement hashing technique to map a given key K to the address space L.
Resolve the collision (if any) using linear probing.

EXPERIMENT - 01
Design, Develop and Implement a menu driven program in C for the following Array operations
a) Creating Array of N Integer elements.
b) Display of Array elements with suitable headings.
c) Inserting an element (ELEM) at a given valid position (POS).
d) Deleting an element at a given valid position (POS).
e) Exit.
Support the program with functions for each of the above operations.
PROGRAM CODE
#include<stdio.h>
#include<conio.h>
/* Global variables declaration */
int a[4], n, elem, i, pos;
/*Function Prototype and Definitions*/

void create() //creating an array
{
printf("\nEnter the size of the array elements: ");
scanf("%d", &n);
printf("\nEnter the elements for the array:\n");
for(i=0; i<n; i++)
scanf("%d", &a[i]);
} //end of create()
void display() //displaying an array elements

{
int i;
printf("\nThe array elements are:\n");
for(i=0; i<n; i++)
{
printf("%d\t", a[i]);
}
} //end of display()
void insert() //inserting an element in to an array

{
printf("\nEnter the position for the new element: ");
scanf("%d", &pos);
printf("\nEnter the element to be inserted: ");
scanf("%d", &elem);
for(i=n-1; i>=pos; i--)
{
a[i+1] = a[i];

}
a[pos] = elem;
n = n+1;
} //end of insert()
void del() //deleting an array element

{
printf("\nEnter the position of the element to be deleted: ");
scanf("%d", &pos); elem = a[pos]; for(i=pos; i<n-1; i++)
{
a[i] = a[i+1];
}
n = n-1;
printf("\nThe deleted element is = %d", elem);
}//end of delete()
void main()
{
int ch; clrscr(); do{
printf("\n\n--------Menu-----------\n");
printf("1.Create\n 2.Display\n 3.Insert\n 4.Delete\n 5.Exit\n");
printf("-------------------------------"); printf("\nEnter your choice: "); scanf("%d", &ch);
switch(ch)
{
case 1: create();
break;
case 2: display();
break;
case 3: insert();
break;
case 4: del();
break;
case 5: exit(0);
break;
default: printf("\nInvalid choice:\n");
break;
}
}while(ch!=5);
getch();
}// end of main

SAMPLE OUTPUT:
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit
Enter your choice: 1
Enter the size of the array elements: 5
Enter the elements for the array:
10 20 30 40 50
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit

The array elements are:
10 20 30 40 50
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit
Enter the position for the new element: 2
Enter the element to be inserted: 90
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit

10 20 90 30 40 50
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit
Enter the position of the element to be deleted: 5
The deleted element is = 50
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit

10 20 90 30 40
--------Menu-----------
1.Create
2.Display
3.Insert
4.Delete
5.Exit

EXPERIMENT - 02
Design, Develop and Implement a program in C for the following operations on Strings a. Read
a) Main String (STR), a Pattern String (PAT) and a Replace String (REP).
b) Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR
withREP if PAT exists in STR. Repost suitable messages in case PAT does not exist in STR.
Support the program with functions for each of the above operations. Dont use built-in
functions.
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
//Declarations
char str[100], pat[50], rep[50], ans[100];
int i, j, c, m, k, flag=0;
void stringmatch()
{
i = m = c = j = 0;
while(str[c] ! = '\0')
{
if(str[m] = = pat[i]) // ...... matching
{
i++; m++;
if(pat[i] = = '\0') //.....found occurrences.
{
flag = 1;
//.... copy replace string in ans string.
for(k = 0; rep[k] != '\0'; k++, j++)
ans[j] = rep[k];
i = 0;
c = m;
}
} // if ends.
else //... mismatch
{
ans[j] = str[c];
j++;
c++;
m = c;
i = 0;
}//else ends
} //end of while ans[j] = '\0';
} //end stringmatch()
void main()
{
clrscr();
printf("\nEnter a main string \n");
gets(str);
printf("\nEnter a pattern string \n");
flushall();
gets(pat);
printf("\nEnter a replace string \n");
flushall();
gets(rep);
stringmatch();
if(flag = = 1)
printf("\nThe resultant string is\n %s" , ans);
else
printf("\nPattern string NOT found\n");
getch();
} // end of main
SAMPLE OUTPUT: RUN 1:

Enter a main string
Test
Enter a pattern string
Te
Enter a replace string
Re
The resultant string is
Rest
RUN 2:
Enter a main string
This is Data Structure lab
Data Structure
Data structure with C
The resultant string is
This is Data structure with C lab
RUN 3:
Enter a main string
This is Data Structure lab
Date
DATA
Pattern string NOT found
EXPERIMENT - 03
Design, Develop and Implement a menu driven program in C for the following operations on
STACK of integers (Array implementation of stack with maximum size MAX)
a) Push an element on to stack
b) Pop an element from stack.
c) Demonstrate how stack can be used to check palindrome.
d) Demonstrate Overflow and Underflow situations on stack.
e) Display the status of stack.
f) Exit.
Support the program with appropriate functions for each of the above operations.
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
#define MAX 4
int stack[MAX], item;
int ch, top = -1, count = 0, status = 0;
/*PUSH FUNCTION*/
void push(int stack[], int item)
{
if (top == (MAX-1))
printf("\n\nStack is Overflow");
else
{
stack[++top] = item;
status++;
}
}
/*POP FUNCTION*/
int pop(int stack[])
{
int ret;
if(top == -1)
printf("\n\nStack is Underflow");
else
{
ret = stack[top--];
status--;
printf("\nPopped element is %d", ret);
}
return ret;
/* FUNCTION TO CHECK STACK IS PALINDROME OR NOT */

void palindrome(int stack[])
{
int i, temp; temp = status; for(i=0; i<temp; i++)
{
if(stack[i] == pop(stack))
count++;
}
if(temp==count)
printf("\nStack contents are Palindrome");
else
printf("\nStack contents are not palindrome");
/*FUNCTION TO DISPLAY STACK*/

void display(int stack[])
{
int i;
printf("\nThe stack contents are:");
if(top == -1)
printf("\nStack is Empty");
else{
for(i=top; i>=0; i--)
printf("\n ------\n| %d |", stack[i]);
printf("\n");
}
}
/*MAIN PROGRAM*/
void main()
{
clrscr();
do{
printf("\n\n----MAIN MENU----\n");
printf("\n1. PUSH (Insert) in the Stack");
printf("\n2. POP (Delete) from the Stack");
printf("\n3. PALINDROME check using Stack");
printf("\n4. Exit (End the Execution)");
printf("\nEnter Your Choice: ");
scanf("%d", &ch);
switch(ch){
case 1: printf("\nEnter a element to be pushed: ");

scanf("%d", &item); push(stack, item); display(stack);
break;
case 2: item=pop(stack);
display(stack);
break;
case 3: palindrome(stack);
break;
case 4: exit(0);
break;
default:printf("\nEND OF EXECUTION");
}//end switch
}while (ch != 4);
getch();
}
SAMPLE OUTPUT:
----MAIN MENU----
1. PUSH (Insert) in the Stack
2. POP (Delete) from the Stack
3. PALINDROME check using Stack
4. Exit (End the Execution)
Enter Your Choice: 1
(-------- AFTER THE 4 TIMES PUSH OPERATION -------)

----MAIN MENU----
4. Exit (End the Execution) Enter Your Choice: 1
(-------- AFTER THE 4 TIMES POP OPERATION -------)

----MAIN MENU----
4. Exit (End the Execution)
(-------- CHECKING FOR PALINDROME OR NOT USING STACK-------)

----MAIN MENU----
Enter an element to be pushed: 1
The stack contents are:

-----
|1|
----MAIN MENU----

------
|2|
------|
1|
----MAIN MENU----
Enter a element to be pushed: 1

------
|1|
------|
2|
------|
1|
----MAIN MENU----
Stack contents are is Palindrome
(-------- CHECKING FOR PALINDROME OR NOT USING STACK-------)

----MAIN MENU----


-----|
1|
(AFTER 3 TIMES PUSH)

----MAIN MENU----

------
|3|
------|
2|
------|
1|
----MAIN MENU----
Stack contents are not Palindrome

EXPERIMENT - 04
Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix
Expression. Program should support for both parenthesized and free parenthesized expressions
with the operators: +, -, *, /, %( Remainder), ^ (Power) and alphanumeric operands.
PROGRAM CODE:
#include<stdio.h>
#include<string.h>
#include<conio.h>
int F(char symbol)

{
switch(symbol)
{
case '+' :
case '-':return 2;
case *:
case /:return 4;
case '^':
case '$': return 5;
case '(': return 0;
case '#': return -1;
default: return 8;
}
}
int G(char symbol)

{
switch(symbol)
{
case '+':
case '-':return 1;
case *:
case /:return 3;
case '^':
case '$': return 6;
case '(': return 9;
case ')': return 0;
default: return 7;
}
}

void infix_postfix(char infix[], char postfix[])

{
int top, j, i;
char s[30], symbol;
top = -1; s[++top] = '#'; j = 0;
for(i=0; i < strlen(infix); i++)
{
symbol = infix[i];
while(F(s[top]) > G(symbol))
{
postfix[j] = s[top--];
j++;
}
if(F(s[top]) != G(symbol))
s[++top] = symbol;
else
top--;
}
while(s[top] != '#')
{
postfix[j++] = s[top--];
}
postfix[j] = '\0';
}
void main()
{
char infix[20], postfix[20];
clrscr();
printf("\nEnter a valid infix expression\n");
flushall();
gets(infix);
infix_postfix(infix,postfix);
printf("\nThe infix expression is:\n");
printf ("%s",infix);
printf("\nThe postfix expression is:\n");
printf ("%s",postfix);
getch();
}
SAMPLE OUTPUT:
Enter a valid infix expression
(a+(b-c)*d)
The infix expression is: (a+(b-c)*d)
The postfix expression is: abc-d*+
EXPERIMENT - 05
Design, Develop and Implement a Program in C for the following Stack Applications
a) Evaluation of Suffix expression with single digit operands and operators: +, -, *, /, %, ^
b) Solving Tower of Hanoi problem with n disks.
PROGRAM CODE: PROGRAM 5A:

#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<string.h>
double compute(char symbol, double op1, double op2)

{
switch(symbol)
{
case '+': return op1 + op2;
case' -': return op1 - op2;
case '*': return op1 * op2;
case '/': return op1 / op2;
case '$':
case '^': return pow(op1,op2);
default: return 0;
}
}
void main()
{
double s[20], res, op1, op2;
int top, i;
char postfix[20], symbol;
clrscr();
printf("\nEnter the postfix expression:\n");
flushall();
gets(postfix);
top=-1;
for(i=0; <strlen(postfix); i++)
{
symbol = postfix[i];
if(isdigit(symbol))
s[++top] = symbol - '0';
else
{
op2 = s[top--];
op1 = s[top--];
res = compute(symbol, op1, op2);

s[++top] = res;
}
}
res = s[top--];
printf("\nThe result is : %f\n", res);
getch();
}
SAMPLE OUTPUT:
RUN1:
Enter the postfix expression:
23+
The result is: 5.000000
RUN2:
Enter the postfix expression:
23+7*
The result is: 35.000000

PROGRAM 5B:
#include<stdio.h>
#include<conio.h>
void tower(int n, int source, int temp,int destination)
{
if(n == 0)
return;
tower(n-1, source, destination, temp);
printf("\nMove disc %d from %c to %c", n, source, destination);
tower(n-1, temp, source, destination);
}
void main()
{
int n;
clrscr();
printf("\nEnter the number of discs: \n");
scanf("%d", &n);
tower(n, 'A', 'B', 'C');
printf("\n\nTotal Number of moves are: %d",
(int)pow(2,n)-1);
getch();
}
SAMPLE OUTPUT:
Enter the number of discs:

3
Move disc 1 from A to C Move disc 2 from A to B Move disc 1 from C to B Move disc 3 from A to
C Move disc 1 from B to A Move disc 2 from B to C Move disc 1 from A to C
Total Number of moves are: 7"

EXPERIMENT - 06
Design, Develop and Implement a menu driven Program in C for the following operations on
Circular QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a) Insert an Element on to Circular QUEUE
b) Delete an Element from Circular QUEUE
c) Demonstrate Overflow and Underflow situations on Circular QUEUE
d) Display the status of Circular QUEUE
e) Exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
#define MAX 4
int ch, front = 0, rear = -1, count=0;
char q[MAX], item;
void insert()
{
if(count == MAX)
printf("\nQueue is Full");
else {
rear = (rear + 1) % MAX;
q[rear]=item;
count++;
}
}
void del()
{
if(count == 0)
printf("\nQueue is Empty");
else
{
if(front > rear && rear==MAX-1)
{
front=0;
rear=-1;
count=0;
}
else
{
item=q[front];
printf("\nDeleted item is: %c",item);

front = (front + 1) % MAX;
count--;
}
}
}
void display()
{
int i, f=front, r=rear;
if(count == 0)
printf("\nQueue is Empty");
else
{
printf("\nContents of Queue is:\n");
for(i=f; i<=r; i++)
{
printf("%c\t", q[i]);
f = (f + 1) % MAX;
}
}
}
void main()
{
clrscr();
do
{
printf("\n1. Insert\n2. Delete\n3. Display\n4. Exit");
printf("\nEnter the choice: ");
scanf("%d", &ch);
flushall();
switch(ch)
{
case 1: printf("\nEnter the character / item to be inserted: ");
scanf("%c", &item);
insert();
break;
case 2: del();
break;
case 3: display();
break;
case 4: exit(0);
break;
}
}while(ch!=4);
getch();
}
SAMPLE OUTPUT:
1. Insert 2. Delete 3. Display 4. Exit
Enter the choice: 1
Enter the character / item to be inserted: A

Enter the choice: 1
Enter the character / item to be inserted: B

Enter the choice: 1
Enter the character / item to be inserted: C

Enter the choice: 1
Enter the character / item to be inserted: D

Enter the choice: 3
Contents of Queue is: A B C D

Enter the choice: 1
Enter the character / item to be inserted: F
Queue is Full

Enter the choice: 2
Deleted item is: A

Enter the choice: 2
Deleted item is: B

Enter the choice: 3
Contents of Queue is: C D

Enter the choice: 1
Enter the character / item to be inserted: K
1. Insert 2. Delete
Enter the choice: 3
Contents of Queue is: C D K

1. Insert 2. Delete
Enter the choice: 4

EXPERIMENT - 07
Singly Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo
a) Create a SLL of N Students Data by using front insertion.
b) Display the status of SLL and count the number of nodes in it
c) Perform Insertion and Deletion at End of SLL
d) Perform Insertion and Deletion at Front of SLL
e) Demonstrate how this SLL can be used as STACK and QUEUE
f) Exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
int MAX=4, count;
struct student
{
char usn[10], name[30], branch[5], phno[10];
int sem;
struct student *next; //Self referential pointer.
};
typedef struct student NODE;
int countnodes(NODE *head)

{
NODE *p;
count=0;
p=head;
while(p!=NULL)
{
p=p->next;
count++;
}
return count;
}
NODE* getnode(NODE *head)

{
NODE *newnode;
newnode=(NODE*)malloc(sizeof(NODE)); //Create first NODE
printf("\nEnter USN, Name, Branch, Sem, Ph.No\n");
flushall();
gets(newnode->usn);
flushall();
gets(newnode->name);
flushall();
gets(newnode->branch);
scanf("%d",&(newnode->sem));
flushall();
gets(newnode->phno);
newnode->next=NULL; //Set next to NULL... head=newnode;
return head;
}
NODE* display(NODE *head)

{
NODE *p;
if(head == NULL)
printf("\nNo student data\n");
else
{
p=head;
printf("\n----STUDENT DATA----\n");
printf("\nUSN\tNAME\t\tBRANCH\tSEM\tPh.NO.");
while(p!=NULL)
{
printf("\n%s\t%s\t\t%s\t%d\t%s", p->usn, p->name, p->branch, p->sem,
p->phno);
p = p->next; //Go to next node...
}
printf("\nThe no. of nodes in list is: %d",countnodes(head));
}
return head;
}
NODE* create(NODE *head)

{
NODE *newnode;
if(head==NULL)
{
newnode=getnode(head);
head=newnode;
}
else
{
newnode->next=head;
head=newnode;
}
return head;
}
NODE* insert_front(NODE *head)

{
if(countnodes(head)==MAX)
printf("\nList is Full / Overflow!!");
else
head=create(head); //create()insert nodes at front.
return head;
}
NODE* insert_rear(NODE *head)

{
NODE *p, *newnode;
p=head;
if(countnodes(head) == MAX)
printf("\nList is Full(QUEUE)!!");
else
{
if(head == NULL)
{
head=newnode; //set first node to be head
}
else
{
while(p->next!=NULL)
{
p=p->next;
}
p->next=newnode;
}
}
return head;
}
NODE* insert(NODE *head)

{
int ch;
do
{
printf("\n1.Insert at Front(First)\t2.Insert at End(Rear/Last)\t3.Exit");
printf("\nEnter your choice: ");
scanf("%d", &ch);
switch(ch)
{
case 1: head=insert_front(head);
break;
case 2: head=insert_rear(head);
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
NODE* delete_front(NODE *head)

{
NODE *p;
if(head==NULL)
printf("\nList is Empty/Underflow (STACK/QUEUE)");
else
{
p=head;
head=head->next; //Set 2nd NODE as head
free(p);
printf("\nFront(first)node is deleted");
}
return head;
}
NODE* delete_rear(NODE *head)

{
NODE *p, *q;
p=head;
while(p->next!=NULL)
{
p=p->next; //Go upto -1 NODE which you want to delete
}
q=p->next;
free(q);//Delete last NODE...
p->next=NULL;
printf("\nLast(end) entry is deleted");
return head;
NODE* del(NODE *head)

{
int ch;
do{
printf("\n1.Delete from Front(First)\t2. Delete from End(Rear/Last))\t3.Exit");
scanf("%d",&ch);
switch(ch)
{
case 1: head=delete_front(head);
break;
case 2: head=delete_rear(head);
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
NODE* stack(NODE *head)

{
int ch;
do
{
printf("\nSSL used as Stack...");
printf("\n 1.Insert at Front(PUSH) \t 2.Delete from Front(POP))\t3.Exit");
scanf("%d", &ch);
switch(ch)
{
break;
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}

NODE* queue(NODE *head)

{
int ch;
do
{
printf("\nSSL used as Queue...");
printf("\n 1.Insert at Rear(INSERT) \t 2.Delete from Front(DELETE))\t3.Exit");
scanf("%d", &ch);
switch(ch)
{
case 1: head=insert_rear(head);
break;
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
void main()
{
int ch, i, n; NODE *head; head=NULL; clrscr();
printf("\n*----------Studednt Database-----------*");
do
{
printf("\n 1.Create\t 2.Display\t 3.Insert\t 4.Delete\t 5.Stack\t 6.Queue\t
7.Exit");
scanf("%d", &ch);
switch(ch)
{
case 1: printf("\nHow many student data you want to create: ");
scanf("%d", &n);
for(i=0;i<n;i++)
head=create(head);//Call to Create NODE...
break;
case 2: head=display(head); //Call to Display...
break;
case 3: head=insert(head); //Call to Insert...
break;
case 4: head=del(head); //Call to delete
break;
case 5: head=stack(head);
break;
case 6: head=queue(head);
break;
case 7: exit(); //Exit...
}
}while(ch!=7);
}
SAMPLE OUTPUT:
1. Create 2. Display 3. Insert 4. Delete 5. Stack 6.Queue 7. Exit
How many student data you want to create: 2
Enter USN, Name, Branch, Sem, Ph.No
1kt12cs001 kumar cs 3 9900099000
1kt12is002 ravi is 3 9900099111
----STUDENT DATA----
USN NAME BRANCH SEM Ph.NO.
1kt12is002 ravi is 3 9900099111
1kt12cs001 kumar cs 3 9900099000
The no. of nodes in list is: 2
1.Insert at Front(First) 2.Insert at End(Rear/Last) 3.Exit

1kt12cs003 suresh cs 3 99000992222
1kt12cs003 suresh cs 3 99000992222
1kt12is002 ravi is 3 9900099111
1kt12cs001 kumar cs 3 9900099000
1kt12is004 naresh is 3 99000993333
1kt12cs003 suresh cs 3 99000992222
1kt12is002 ravi is 3 9900099111
1kt12cs001 kumar cs 3 9900099000
1kt12is004 naresh is 3 99000993333

1. Delete from Front (First) 2. Delete from End (Rear/Last) 3.Exit
Front (first) node is deleted
USN
1kt12is002 NAME
ravi BRANCH
is SEM
3 Ph.NO.
9900099111
1kt12cs001 kumar cs 3 9900099000
1kt12is004 naresh is 3 99000993333
Last (end) node is deleted
1kt12is002 ravi is 3 9900099111
1kt12cs001 kumar cs 3 9900099000

SSL used as Stack...
1.Insert at Front(PUSH) 2.Delete from Front(POP)) 3.Exit
1kt12is010 vikky is 3 9900011111
1kt12is010 vikky is 3 9900011111
1kt12is002 ravi is 3 9900099111
1kt12cs001 kumar cs 3 9900099000

EXPERIMENT - 08
Doubly Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation, Sal,
PhNo.
a) Create a DLL of N Employees Data by using end insertion.
b) Display the status of DLL and count the number of nodes in it
c) Perform Insertion and Deletion at End of DLL
d) Perform Insertion and Deletion at Front of DLL
e) Demonstrate how this DLL can be used as Double Ended Queue
f) Exit
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
int MAX=4, count;
struct emp
{
int ssn;
char name[20]; char dept[10]; char desig[15];
int sal;
char phno[10];
struct emp *left;
struct emp *right;
};
typedef struct emp NODE;
int countnodes(NODE *head)

{
NODE *p; count=0; p=head;
while(p!=NULL)
{
p=p->right;
count++;
}
return count;
}
NODE* getnode(NODE *head)

{
NODE *newnode;
newnode=(NODE*)malloc(sizeof(NODE));
newnode->right=newnode->left=NULL;
printf("\nEnter SSN, Name, Dept, Designation, Sal, Ph.No\n");

scanf("%d",&newnode->ssn);
flushall();
gets(newnode->name);
flushall();
gets(newnode->dept);
flushall();
gets(newnode->desig);
scanf("%d",&newnode->sal);
flushall();
gets(newnode->phno);
head=newnode;
return head;
}
NODE* display(NODE *head)

{
NODE *p;
if(head==NULL)
printf("\nNo Employee data\n");
else
{
p=head;
printf("\n----EMPLOYEE DATA----\n");
printf("\nSSN\tNAME\tDEPT\tDESINGATION\tSAL\t\tPh.NO.");
while(p!=NULL)
{
` p->sal, p->phno);
}
printf("\n%d\t%s\t%s\t%s\t\t%d\t\t%s", p->ssn, p->name, p->dept, p->desig);
p = p->right; //Go to next node...
printf("\nThe no. of nodes in list is: %d",countnodes(head));
}
return head;
}
NODE* create(NODE *head)// creating & inserting at end.

{
NODE *p, *newnode; p=head; if(head==NULL)
{
head=newnode;
}
else
{
while(p->right!=NULL)
{
p=p->right;
}
p->right=newnode;
newnode->left=p;
}
return head;
}
NODE* insert_end(NODE *head)

{
printf("\nList is Full!!");
else
head=create(head);
return head;
}
NODE* insert_front(NODE *head)

{
NODE *p, *newnode;
printf("\nList is Full!!");
else
{
if(head==NULL)
{
head=newnode; //set first node to be head
}
else
{
newnode->right=head;
head->left=newnode;
head=newnode;
}
}
return head;
}

NODE* insert(NODE *head)

{
int ch;
do
{
printf("\n 1.Insert at Front(First) \t 2.Insert at End(Rear/Last)\t3.Exit");
scanf("%d", &ch);
switch(ch)
{
break;
case 2: head=insert_end(head);
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
NODE* delete_front(NODE *head)

{
NODE *p;
if(head==NULL)
printf("\nList is Empty (QUEUE)");
else
{
p=head;
head=head->right;
head->right->left=NULL;
free(p);
printf("\nFront(first)node is deleted");
}
return head;
}
NODE* delete_end(NODE *head)

{
NODE *p, *q;
p=head;
while(p->right!=NULL)
{
p=p->right; //Go upto -1 node which you want to delete
}
q=p->left;
q->right=NULL;
p->left=NULL;
free(p);//Delete last node...
printf("\nLast(end) entry is deleted");
return head;
}
NODE *del(NODE *head)

{
int ch;
do {
printf("\n1.Delete from Front(First)\t2. Delete from End(Rear/Last))\t3.Exit");
scanf("%d", &ch);
switch(ch)
{
break;
case 2: head=delete_end(head);
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
NODE* queue(NODE *head)

{
int ch, ch1, ch2;
do
{
printf("\nDLL used as Double Ended Queue"); printf("\n1.QUEUE- Insert at Rear &
Delete from Front"); printf("\n2.QUEUE- Insert at Front & Delete from Rear");
printf("\n3.Exit");
scanf("%d", &ch);
switch(ch)
{
case 1: do{
printf("\n1.Insert at Rear\t2.Delete from From Front\t3.Exit");
scanf("%d", &ch1);
switch(ch1)
{
case 1: head=insert_end(head);
break;
break;
case 3: break;
}
}while(ch1!=3);
break;
case 2: do{
printf("\n1.Insert at Front\t2.Delete from Rear\t3.Exit");
scanf("%d", &ch2);
switch(ch2)
{
break;
case 2: head=delete_end(head);
break;
case 3: break;
}
}while(ch2!=3);
break;
case 3: break;
}
head=display(head);
}while(ch!=3);
return head;
}
void main()
{
int ch, i, n; NODE *head; head=NULL; clrscr();
printf("\n----------Employee Database-----------");
do
{
printf("\n1.Create\t2.Display\t3.Insert\t4.Delete\t5.Queue\t6.Exit");
scanf("%d", &ch);
switch(ch)
{
case 1: printf("\nHow many employees data you want to create: ");
scanf("%d", &n);
for(i=0;i<n;i++)
head=create(head);//Call to Create node...

break;
case 2: head=display(head); //Call to Display...
break;
case 3: head=insert(head); //Call to Insert...
break;
case 4: head=del(head); //Call to delete break;
case 5: head=queue(head);
break;
case 6: exit(0); //Exit...
break;
}
}while(ch!=6);
}
SAMPLE OUTPUT:
----------Employee Database-----------
1. Create 2. Display 3. Insert 4. Delete 5. Queue 7. Exit
How many employees data you want to create: 2

Enter SSN, Name, Dept, Designation, Sal, Ph.No
1 KUMAR CSE INSTRUCTOR 8000 900099000

2 RAVI ISE INSTRUCTOR 9000 900099111

----EMPLOYEE DATA----
SSN NAME DEPT DESINGATION SAL Ph.NO.
2 RAVI ISE INSTRUCTOR 9000 900099111

1. Insert at Front (First) 2.Insert at End (Rear/Last) 3.Exit


3 JIM CSE ATTENDER 6000 900099333
----EMPLOYEE DATA----
SSN NAME DEPT DESINGATION SAL Ph.NO.

3 JIM CSE ATTENDER 6000 900099333
2 JIM CSE INSTRUCTOR 9000 900099111
1. Insert at Front (First) 2.Insert at End (Rear/Last) 3.Exit


DLL used as Double Ended Queue
1.QUEUE- Insert at Rear & Delete from Front
2.QUEUE- Insert at Front & Delete from Rear
3.Exit


EXPERIMENT - 09
Design, Develop and Implement a Program in C for the following operations on Singly Circular
Linked List (SCLL) with header nodes
a) Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
b) Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and store the result in
POLYSUM(x,y,z)
PROGRAM CODE:
#include<stdio.h>
#include<alloc.h>
#include<math.h>
struct node
{
int cf, px, py, pz; int flag;
struct node *link;
};
typedef struct node NODE;
NODE* getnode()
{
NODE *x; x=(NODE*)malloc(sizeof(NODE));
if(x==NULL)
{
printf("Insufficient memory\n"); exit(0);
}
return x;
}
void display(NODE *head)

{
NODE *temp;
if(head->link==head)
{
printf("Polynomial does not exist\n"); return;
}
temp=head->link;
printf("\n");
while(temp!=head)
{
printf("%d x^%d y^%d z^%d",temp->cf,temp->px,temp->py,temp->pz);
if(temp->link != head)
printf(" + ");
temp=temp->link;
}
printf("\n");
}
NODE* insert_rear(int cf,int x,int y,int z,NODE *head)

{
NODE *temp,*cur;
temp=getnode();
temp->cf=cf;
temp->px=x;
temp->py=y;
temp->pz=z;
cur=head->link;
while(cur->link!=head)
{
cur=cur->link;
}
cur->link=temp;
temp->link=head;
return head;
}
NODE* read_poly(NODE *head)

{
int px, py, pz, cf, ch; printf("\nEnter coeff: ");
scanf("%d",&cf);
printf("\nEnter x, y, z powers(0-indiacate NO term): ");
scanf("%d%d%d", &px, &py, &pz);
head=insert_rear(cf,px,py,pz,head);
printf("\nIf you wish to continue press 1 otherwise 0: ");
scanf("%d", &ch);
while(ch != 0)
{
printf("\nEnter coeff: ");
scanf("%d",&cf);
printf("\nEnter x, y, z powers(0-indiacate NO term): ");
scanf("%d%d%d",&px, &py, &pz);
head=insert_rear(cf,px,py,pz,head);
printf("\nIf you wish to continue press 1 otherwise 0: ");
scanf("%d", &ch);
}
return head;
}

NODE* add_poly(NODE *h1,NODE *h2,NODE *h3)

{
NODE *p1,*p2;
int x1,x2,y1,y2,z1,z2,cf1,cf2,cf;
p1=h1->link;
while(p1!=h1)
{
x1=p1->px;
y1=p1->py;
z1=p1->pz;
cf1=p1->cf;
p2=h2->link;
while(p2!=h2)
{
x2=p2->px;
y2=p2->py;
z2=p2->pz;
cf2=p2->cf;
if(x1==x2 && y1==y2 && z1==z2)
break;
p2=p2->link;
}
if(p2!=h2)
{
cf=cf1+cf2; p2->flag=1; if(cf!=0)
h3=insert_rear(cf,x1,y1,z1,h3);
}
else
h3=insert_rear(cf1,x1,y1,z1,h3);
p1=p1->link;
}
p2=h2->link;
while(p2!=h2)
{
if(p2->flag==0)
h3=insert_rear(p2->cf,p2->px,p2->py,p2->pz,h3);
p2=p2->link;
}
return h3;
}
void evaluate(NODE *h1)

{
NODE *head;
int x, y, z;
float result=0.0;
head=h1;
printf("\nEnter x, y, z, terms to evaluate:\n");
scanf("%d%d%d", &x, &y, &z);
while(h1->link != head)
{
result = result + (h1->cf * pow(x,h1->px) * pow(y,h1->py) * pow(z,h1->pz));
h1=h1->link;
}
result = result + (h1->cf * pow(x,h1->px) * pow(y,h1->py) * pow(z,h1->pz));
printf("\nPolynomial result is: %f", result);
}
void main()
{
NODE *h1,*h2,*h3;
int ch;
clrscr();
h1=getnode();
h2=getnode();
h3=getnode();
h1->link=h1;
h2->link=h2;
h3->link=h3;
while(1)
{
printf("\n\n1.Evaluate polynomial\n2.Add two polynomials\n3.Exit\n");
printf("Enter your choice: ");
scanf("%d", &ch);
switch(ch)
{
case 1: printf("\nEnter polynomial to evaluate:\n");
h1=read_poly(h1);
display(h1);
evaluate(h1);
break;
case 2: printf("\nEnter the first polynomial:");
h1=read_poly(h1);
printf("\nEnter the second polynomial:"); h2=read_poly(h2);
h3=add_poly(h1,h2,h3);
printf("\nFirst polynomial is: ");
display(h1);
printf("\nSecond polynomial is: ");
display(h2);
printf("\nThe sum of 2 polynomials is: ");
display(h3);
break;
case 3:exit(0);
break;
default:printf("\nInvalid entry");
break;
} getch();
}
}
SAMPLE OUTPUT:
1. Evaluate polynomial P(x,y,z) = 6x2y2z-

4yz5+3x3yz+2xy5z-2xyz3 2. Add two polynomials
3. Exit
Enter polynomial to evaluate: Enter coeff:

6
Enter x, y, z powers (0-indiacate NO term:

2 2 1
If you wish to continue press 1 otherwise 0:
1 Enter coeff: -4
Enter x, y, z powers (0-indiacate NO term: 0
1 5
1
Enter coeff: 3
Enter x, y, z powers (0-indiacate NO term: 3 1 1
If you wish to continue press 1 otherwise 0: 1

Enter coeff: 2
Enter coeff: -2
Polynomial is:
6 x^2 y^2 z^1 + -4 x^0 y^1 z^5 + 3 x^3 y^1 z^1 + 2 x^1 y^5 z^1 + -2 x^1 y^1 z^3
Enter x, y, z, terms to evaluate: 1 1 1

Polynomial result is: 5.000000

3. Exit
Enter 1st polynomial:
Enter coeff: 4
If you wish to continue press 1

otherwise 0: 1 Enter coeff: 3
Enter x, y, z powers (0-indiacate NO term: 1
1
2
Enter 2nd polynomial:
Enter coeff: 6
Enter x, y, z powers (0-indiacate NO term:

2 2 2
0
Polynomial is:
1st Polynomial is:
4 x^2 y^2 z^2 + 3 x^1 y^1 z^2
2nd Polynomial is: 6 x^2 y^2 z^2
Added polynomial: 10 x^2 y^2 z^2 + 3 x^1 y^1 z^2

3. Exit

EXPERIMENT - 10
a) Binary Search Tree (BST) of Integers
b) Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
c) Traverse the BST in Inorder, Preorder and Post Order
d) Search the BST for a given element (KEY) and report the appropriate message
e) Delete an element (ELEM) from BST
f) Exit
PROGRAM CODE:
#include <stdio.h>
#include <stdlib.h>
struct BST
{
int data;
struct BST *left;
struct BST *right;
};
typedef struct BST NODE; NODE *node;

NODE* createtree(NODE *node, int data)
{
if (node == NULL)
{
NODE *temp;
temp= (NODE*)malloc(sizeof(NODE));
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
if (data < (node->data))
{
node->left = createtree(node->left, data);
}
else if (data > node->data)
{
node -> right = createtree(node->right, data);
}
return node;
}

NODE* search(NODE *node, int data)

{
if(node == NULL)
printf("\nElement not found");
else if(data < node->data)
{
node->left=search(node->left, data);
}
else if(data > node->data)
{
node->right=search(node->right, data);
}
else
printf("\nElement found is: %d", node->data);
return node;
}
void inorder(NODE *node)

{
if(node != NULL)
{
inorder(node->left);
printf("%d\t", node->data);
inorder(node->right);
}
}
void preorder(NODE *node)

{
if(node != NULL)
{
preorder(node->left);
preorder(node->right);
}
}
void postorder(NODE *node)

{
if(node != NULL)
{
postorder(node->left);
postorder(node->right);
}
NODE* findMin(NODE *node)

{
if(node==NULL)
{
return NULL;
}
if(node->left)
return findMin(node->left);
else
return node;
NODE* del(NODE *node, int data)

{
NODE *temp;
if(node == NULL)
{
printf("\nElement not found");
}
else if(data < node->data)
{
node->left = del(node->left, data);
}
else if(data > node->data)
{
node->right = del(node->right, data);
}
else
{ /* Now We can delete this node and replace with either minimum element in the right
sub tree or maximum element in the left subtree */
if(node->right && node->left)
{ /* Here we will replace with minimum element in the right sub tree */
temp = findMin(node->right);
node -> data = temp->data;
/* As we replaced it with some other node, we have to delete that node
*/
node -> right = del(node->right,temp->data);
}
else
{ /* If there is only one or zero children then we can directly remove it
from the tree and connect its parent to its child */
temp = node;
if(node->left == NULL)
node = node->right;
else if(node->right == NULL)
node = node->left;
free(temp); /* temp is longer required */
}
}
return node;
}
void main()
{
int data, ch, i, n; NODE *root=NULL; clrscr();
while (1)
{
printf("\n1.Insertion in Binary Search Tree");
printf("\n2.Search Element in Binary Search Tree");
printf("\n3.Delete Element in Binary Search Tree");
printf("\n4.Inorder\n5.Preorder\n6.Postorder\n7.Exit");
scanf("%d", &ch);
switch (ch)
{
case 1: printf("\nEnter N value: " );
scanf("%d", &n);
printf("\nEnter the values to create BST like
(6,9,5,2,8,15,24,14,7,8,5,2)\n");
for(i=0; i<n; i++)
{
scanf("%d", &data);
root=createtree(root, data);
}
break;
case 2: printf("\nEnter the element to search: ");
scanf("%d", &data);
root=search(root, data);
break;
case 3: printf("\nEnter the element to delete: ");
scanf("%d", &data);
root=del(root, data);
break;
case 4: printf("\nInorder Traversal: \n");
inorder(root);
break;
case 5: printf("\nPreorder Traversal: \n");
preorder(root);
break;
case 6: printf("\nPostorder Traversal: \n");
postorder(root);
break;
case 7: exit(0);
default:printf("\nWrong option");
break;
}
}
getch();
}
SAMPLE OUTPUT:
1. Insertion in Binary Search Tree
2. Search Element in Binary Search Tree 3. Delete Element in Binary Search Tree 4. Inorder
5. Preorder
6.
Postorder
7. Exit
Enter N value: 12
Enter the values to create BST like(6,9,5,2,8,15,24,14,7,8,5,2)
6 9 5 2 8 15 24 14 7 8 5 2

5. Preorder
6. Postorder
7. Exit
Inorder Traversal:
2 5 6 7 8 9 14 15 24

5. Preorder
6. Postorder
7. Exit
Preorder Traversal:
6 5 2 9 8 7 15 14 24


5. Preorder
6. Postorder
7. Exit
Postorder Traversal:
2 5 7 8 14 24 15 9 6

EXPERIMENT - 11
Design, Develop and Implement a Program in C for the following operations on Graph(G) of Cities
a) Create a Graph of N cities using Adjacency Matrix.
b) Print all the nodes reachable from a given starting node in a digraph using BFS method
c) Check whether a given graph is connected or not using DFS method.
PROGRAM CODE:
#include<stdio.h>
#include<conio.h>
int a[10][10], n, m, i, j, source, s[10], b[10];

int visited[10];
void create()
{
printf("\nEnter the number of vertices of the digraph: ");
scanf("%d", &n);
printf("\nEnter the adjacency matrix of the graph:\n");
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
scanf("%d", &a[i][j]);
}
void bfs()
{
int q[10], u, front=0, rear=-1;
printf("\nEnter the source vertex to find other nodes reachable or not: ");
scanf("%d", &source); q[++rear] = source; visited[source] = 1;
printf("\nThe reachable vertices are: ");
while(front<=rear)
{
u = q[front++];
for(i=1; i<=n; i++)
{
if(a[u][i] == 1 && visited[i] == 0)
{
q[++rear] = i;
visited[i] = 1;
printf("\n%d", i);
}
}
}
}
void dfs(int source)

{
int v,
top = -1;
s[++top] = 1;
b[source] = 1;
for(v=1; v<=n; v++)
{
if(a[source][v] == 1 && b[v] == 0)
{
printf("\n%d -> %d", source, v);
dfs(v);
}
}
}
void main()
{
int ch;
clrscr();
while(1)
{
printf("\n1.Create Graph\n2.BFS\n3.Check graph connected or
not(DFS)\n4.Exit");
scanf("%d", &ch);
switch(ch)
{
case 1: create();
break;
case 2: bfs();
for(i=1;i<=n;i++)
if(visited[i]==0)
printf("\nThe vertex that is not rechable %d" ,i);
break;
case 3: printf("\nEnter the source vertex to find the connectivity: ");
scanf("%d",&source);
m=1;
dfs(source);
for(i=1;i<=n;i++)
{
if(b[i]==0)
m=0;
}
if(m==1)
printf("\nGraph is Connected");
else
printf("\nGraph is not Connected");
break;
default: exit(0);
}
}
}
SAMPLE OUTPUT:
1. Create Graph 2.BFS 3.Check graph connected or not (DFS) 4.Exit

Enter the number of vertices of the digraph: 4
Enter the adjacency matrix of the graph:

0 0 1 1
0 0 0 0
0 1 0 0
0 1 0 0

Enter the source vertex to find other nodes reachable or not: 1

3
4
2

Enter the source vertex to find the connectivity: 1

1 -> 3
3 -> 2
1 -> 4
Graph is Connected


EXPERIMENT - 12
Given a File of N employee records with a set K of Keys(4-digit) which uniquely determine the
records in file F. Assume that file F is maintained in memory by a Hash Table(HT) of m memory
locations with L as the set of memory addresses (2-digit) of locations in HT. Let the keys in K and
addresses in L are Integers.
Design and develop a Program in C that uses Hash function H: K L as H(K)=K mod m (remainder
method), and implement hashing technique to map a given key K to the address space L. Resolve
the collision (if any) using linear probing.
PROGRAM CODE:
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
struct employee
{
int id;
char name[15];
};
typedef struct employee EMP;
EMP emp[MAX];
int a[MAX];
int create(int num)

{
int key;
key = num % 100;
return key;
}
int getemp(EMP emp[],int key)

{
printf("\nEnter emp id: ");
scanf("%d",&emp[key].id);
printf("\nEnter emp name: ");
flushall();
gets(emp[key].name);
return key;
}
void display()
{
int i, ch;
printf("\n1.Display ALL\n2.Filtered Display");

printf("\nEnter the choice: ");
scanf("%d",&ch);
if(ch == 1)
{
printf("\nThe hash table is:\n");
printf("\nHTKey\tEmpID\tEmpName");
for(i=0; i<MAX; i++)
printf("\n%d\t%d\t%s", i, emp[i].id, emp[i].name);
}
else
{
printf("\nThe hash table is:\n");
printf("\nHTKey\tEmpID\tEmpName");
for(i=0; i<MAX; i++)
if(a[i] != -1)
{
printf("\n%d\t%d\t%s", i, emp[i].id, emp[i].name);
continue;
}
}
}
void linear_prob(int key, int num)

{
int flag, i, count = 0;
flag = 0;
if(a[key] == -1)
{
a[key]=getemp(emp, key);
}
else
{
printf("\nCollision Detected...!!!\n");
i = 0;
while(i < MAX)
{
if (a[i] != -1)
count++;
else
i++;
}
printf("\nCollision avoided successfully using LINEAR PROBING\n");
if(count == MAX)
{
printf("\n Hash table is full");

display(emp);
exit(1);
}
for(i=key; i<MAX; i++)
if(a[i] == -1)
{
i = 0;
a[i] = num;
flag = 1;
break;
}
while((i < key) && (flag == 0))
{
if(a[i] == -1)
{
a[i] = num;
flag=1;
break;
}
i++;
} // end while
} // end else
} // end linear_prob()
void main()
{
int num, key, I, ans = 1;
clrscr();
printf("\nCollision handling by linear probing: ");
for (i=0; i < MAX; i++)
a[i] = -1;
do
{
printf("\nEnter the data: ");
scanf("%d", &num);
key=create(num);
linear_prob(key,num);
printf("\nDo you wish to continue? (1/0): ");
scanf("%d",&ans);
}while(ans);
display(emp);
getch();
}

SAMPLE OUTPUT:
RUN1:
Enter the data: 2
Enter emp id: 100
Enter emp name: Anand
Do you wish to continue?

(1/0): 1
Enter the data: 4

Enter emp id: 101
Enter emp name:
Kumar
Do you wish to continue? (1/0): 0
1.Display ALL
2.Filtered Display Enter the choice: 1
The hash table is:
EmpName
Anand
Kumar
RUN2:
Enter the data: 2
Enter emp id: 100
Enter emp name: Anand
Do you wish to continue? (1/0):1
Enter the data: 4

Enter emp id: 101
Enter emp name: Kumar
Do you wish to continue? (1/0):0

The hash Table is:
HTKey EmpID EmpName

2 100 Anand
4 101 Kumar

Data Structures Lab Manual

Uploaded by

Data Structures Lab Manual

Uploaded by

Alva's Institute Of Engineering & Technology

Unit of Alvas Education Foundation, Moodbidri.

Department of Computer Science and Engineering

3rd Semester B.E.

Venkatesh Bhat., M.Tech Tahir Naquash H B., M.Tech

DATA STRUCTURES WITH C LABORATORY

Department of Computer Science & Engineering A.I.E.T, Moodbiri

Department of Computer Science & Engineering A.I.E.T, Moodbiri

/*Function Prototype and Definitions*/

void display() //displaying an array elements

void insert() //inserting an element in to an array

Department of Computer Science & Engineering A.I.E.T, Moodbiri

void del() //deleting an array element

Department of Computer Science & Engineering A.I.E.T, Moodbiri

Enter your choice: 2

The array elements are:

The array elements are:

Department of Computer Science & Engineering A.I.E.T, Moodbiri

SAMPLE OUTPUT: RUN 1:

/* FUNCTION TO CHECK STACK IS PALINDROME OR NOT */

/*FUNCTION TO DISPLAY STACK*/

case 1: printf("\nEnter a element to be pushed: ");

(-------- AFTER THE 4 TIMES PUSH OPERATION -------)

(-------- AFTER THE 4 TIMES POP OPERATION -------)

(-------- CHECKING FOR PALINDROME OR NOT USING STACK-------)

The stack contents are:

The stack contents are:

The stack contents are:

(-------- CHECKING FOR PALINDROME OR NOT USING STACK-------)

Department of Computer Science & Engineering A.I.E.T, Moodbiri

Enter an element to be pushed: 1

(AFTER 3 TIMES PUSH)

The stack contents are:

Department of Computer Science & Engineering A.I.E.T, Moodbiri

int F(char symbol)

int G(char symbol)

Department of Computer Science & Engineering A.I.E.T, Moodbiri

void infix_postfix(char infix[], char postfix[])

PROGRAM CODE: PROGRAM 5A:

double compute(char symbol, double op1, double op2)

res = compute(symbol, op1, op2);

Department of Computer Science & Engineering A.I.E.T, Moodbiri

Enter the number of discs:

Total Number of moves are: 7"

Department of Computer Science & Engineering A.I.E.T, Moodbiri

printf("\nDeleted item is: %c",item);

1. Insert 2. Delete 3. Display 4. Exit

Enter the character / item to be inserted: B

1. Insert 2. Delete 3. Display 4. Exit

1. Insert 2. Delete 3. Display 4. Exit

1. Insert 2. Delete 3. Display 4. Exit

Contents of Queue is: A B C D

1. Insert 2. Delete 3. Display 4. Exit

1. Insert 2. Delete 3. Display 4. Exit

Deleted item is: A

1. Insert 2. Delete 3. Display 4. Exit

Deleted item is: B

1. Insert 2. Delete 3. Display 4. Exit

Contents of Queue is: C D

1. Insert 2. Delete 3. Display 4. Exit

Contents of Queue is: C D K

Department of Computer Science & Engineering A.I.E.T, Moodbiri

typedef struct student NODE;

int countnodes(NODE *head)

NODE* getnode(NODE *head)

NODE* display(NODE *head)

NODE* create(NODE *head)

NODE* insert_front(NODE *head)

NODE* insert_rear(NODE *head)

NODE* insert(NODE *head)

NODE* delete_front(NODE *head)

NODE* delete_rear(NODE *head)

NODE* del(NODE *head)

NODE* stack(NODE *head)

Department of Computer Science & Engineering A.I.E.T, Moodbiri

NODE* queue(NODE *head)

/Function Prototype and Definitions/

/FUNCTION TO DISPLAY STACK/