1.

Develop a Program in C for the following:

a. Declare a calendar as an array of 7 elements (A dynamically Created array) to represent 7 days of a
week. Each Element of the array is a structure having three fields. The first field is the name of the
Day (A dynamically allocated String), The second field is the date of the Day (A integer), the third field
is the descrip on of the ac vity for a par cular day (A dynamically allocated String).

b. Write func ons create(), read() and display(); to create the calendar, to read the data from the
keyboard and to print weeks ac vity details report on screen.

#include <stdio.h>

#include <stdlib.h>

struct Day {

char *dayName;

int date;

char *ac vity;

};

void create(struct Day *day) {

day->dayName = (char *)malloc(sizeof(char) * 20);

day->ac vity = (char *)malloc(sizeof(char) * 100);

prin ("Enter the day name: ");

scanf("%s", day->dayName);

prin ("Enter the date: ");

scanf("%d", &day->date);

prin ("Enter the ac vity for the day: ");

scanf(" %[^\n]s", day->ac vity);

void read(struct Day *calendar, int size) {

for (int i = 0; i < size; i++) {

 prin ("Enter details for Day %d:\n", i + 1);

create(&calendar[i]);

void display(struct Day *calendar, int size) {

prin ("\nWeek's Ac vity Details:\n");

for (int i = 0; i < size; i++) {

prin ("Day %d:\n", i + 1);

prin ("Day Name: %s\n", calendar[i].dayName);

prin ("Date: %d\n", calendar[i].date);

prin ("Ac vity: %s\n", calendar[i].ac vity);

prin ("\n");

void freeMemory(struct Day *calendar, int size) {

for (int i = 0; i < size; i++) {

free(calendar[i].dayName);

free(calendar[i].ac vity);

int main() {

int size;

prin ("Enter the number of days in the week: ");

scanf("%d", &size);

struct Day *calendar = (struct Day *)malloc(sizeof(struct Day) * size);

if (calendar == NULL) {
 prin ("Memory alloca on failed. Exi ng program.\n");

return 1;

read(calendar, size);

display(calendar, size);

freeMemory(calendar, size);

free(calendar);

return 0;

OUTPUT:

Enter the number of days in the week: 7

Enter details for Day 1:

Enter the day name: Sunday

Enter the date: 1

Enter the ac vity for the day: Learning

Enter details for Day 2:

Enter the day name: Monday

Enter the date: 2

Enter the ac vity for the day: Coding

Enter details for Day 3:

Enter the day name: Tuesday

Enter the date: 3

Enter the ac vity for the day: Tes ng

Enter details for Day 4:

Enter the day name: Wednesday

Enter the date: 4

Enter the ac vity for the day: Debugging

Enter details for Day 5:

Enter the day name: Thrusday

Enter the date: 5

Enter the ac vity for the day: Publishing

Enter details for Day 6:

Enter the day name: Friday

Enter the date: 6

Enter the ac vity for the day: Marke ng

Enter details for Day 7:

Enter the day name: Saturday

Enter the date: 7

Enter the ac vity for the day: Earning

Week's Ac vity Details:

Day 1:

Day Name: Sunday

Date: 1

Ac vity: Learning

Day 2:

Day Name: Monday

Date: 2

Ac vity: Coding

Day 3:
Day Name: Tuesday

Date: 3

Ac vity: Tes ng

Day 4:

Day Name: Wednesday

Date: 4

Ac vity: Debugging

Day 5:

Day Name: Thrusday

Date: 5

Ac vity: Publishing

Day 6:

Day Name: Friday

Date: 6

Ac vity: Marke ng

Day 7:

Day Name: Saturday

Date: 7

Ac vity: Earning

2. Develop a Program in C for the following opera ons on Strings.

a. Read a main String (STR), a Pa ern String (PAT) and a Replace String (REP).

b. Perform Pa ern Matching Opera on: 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.

#include<stdio.h>

char str[50], pat[20], rep[20], res[50];

int c = 0, m = 0, i = 0, j = 0, k, flag = 0;
void stringmatch()

while (str[c] != '\0')

if (str[m] == pat[i])

i++;

m++;

if (pat[i] == '\0')

flag = 1;

for (k = 0; rep[k] != '\0'; k++, j++)

res[j] = rep[k];

i = 0;

c = m;

else

res[j] = str[c];

j++;

c++;

m = c;

i = 0;

res[j] = '\0';

void main()
{

prin ("Enter the main string:");

gets(str);

prin ("\nEnter the pat string:");

gets(pat);

prin ("\nEnter the replace string:");

gets(rep);

prin ("\nThe string before pa ern match is:\n %s", str);

stringmatch();

if (flag == 1)

prin ("\nThe string a er pa ern match and replace is: \n %s ", res);

else

prin ("\nPa ern string is not found");

OUTPUT:

**************************OUTPUT 1*******************************

Enter the main string:Designed by vtucode

Enter the pat string:vtucode

Enter the replace string:Braham

The string before pa ern match is:

Designed by vtucode

The string a er pa ern match and replace is:

Designed by Braham
**************************OUTPUT 2*******************************

Enter the main string:Designed by Developer

Enter the pat string:vtucode

Enter the replace string:Braham

The string before pa ern match is:

Designed by Developer

Pa ern string is not found

3. Develop a menu driven Program in C for the following opera ons on STACK of Integers (Array
Implementa on 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 situa ons on Stack
e. Display the status of Stack
f. Exit

#include<stdio.h>

#include<stdlib.h>

#define MAX 3

int s[MAX];

int top = -1;

void push(int item);

int pop();

void palindrome();
void display();

void main()

int choice, item;

while (1)

prin ("\n\n\n\n-----------Menu----------- : ");

prin ("\n=>1.Push an Element to Stack and Overflow demo ");

prin ("\n=>2.Pop an Element from Stack and Underflow demo");

prin ("\n=>3.Palindrome demo ");

prin ("\n=>4.Display ");

prin ("\n=>5.Exit");

prin ("\nEnter your choice: ");

scanf("%d", & choice);

switch (choice)

case 1:

prin ("\nEnter an element to be pushed: ");

scanf("%d", & item);

push(item);

break;

case 2:

item = pop();

if (item != -1)

prin ("\nElement popped is: %d", item);

break;

case 3:

palindrome();

break;

case 4:
 display();

break;

case 5:

exit(1);

default:

prin ("\nPlease enter valid choice ");

break;

void push(int item)

if (top == MAX - 1)

prin ("\n-----------Stack overflow-----------");

return;

top = top + 1;

s[top] = item;

int pop()

int item;

if (top == -1)

prin ("\n-----------Stack underflow-----------");

return -1;

}
 item = s[top];

top = top - 1;

return item;

void display()

int i;

if (top == -1)

prin ("\n-----------Stack is empty-----------");

return;

prin ("\nStack elements are:\n ");

for (i = top; i >= 0; i--)

prin ("| %d |\n", s[i]);

void palindrome()

int flag = 1, i;

prin ("\nStack content are:\n");

for (i = top; i >= 0; i--)

prin ("| %d |\n", s[i]);

prin ("\nReverse of stack content are:\n");

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

prin ("| %d |\n", s[i]);

for (i = 0; i <= top / 2; i++)

{
 if (s[i] != s[top - i])

flag = 0;

break;

if (flag == 1)

prin ("\nIt is palindrome number");

else

prin ("\nIt is not a palindrome number");

OUTPUT:

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 11

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display
=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 12

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 13

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 14

-----------Stack overflow-----------

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 4

Stack elements are:

| 13 |

| 12 |

| 11 |

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 2

Element popped is: 13

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 4

Stack elements are:

| 12 |

| 11 |

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 2

Element popped is: 12

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 2

Element popped is: 11

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 2

-----------Stack underflow-----------

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 4

-----------Stack is empty-----------

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit
Enter your choice: 1

Enter an element to be pushed: 11

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 22

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 11

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 3

Stack content are:

| 11 |

| 22 |

| 11 |

Reverse of stack content are:

| 11 |

| 22 |

| 11 |

It is palindrome number

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 2

Element popped is: 11

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display
=>5.Exit

Enter your choice: 2

Element popped is: 22

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 33

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 1

Enter an element to be pushed: 22

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo
=>4.Display

=>5.Exit

Enter your choice: 3

Stack content are:

| 22 |

| 33 |

| 11 |

Reverse of stack content are:

| 11 |

| 33 |

| 22 |

It is not a palindrome number

-----------Menu----------- :

=>1.Push an Element to Stack and Overflow demo

=>2.Pop an Element from Stack and Underflow demo

=>3.Palindrome demo

=>4.Display

=>5.Exit

Enter your choice: 5

4. Develop a Program in C for conver ng an Infix Expression to Pos ix Expression. Program should
support for both parenthesized and free parenthesized expressions with the operators: +, -, *, /,
(Remainder), ^ (Power) and alphanumeric operands.

#include<stdio.h>

#include<stdlib.h>
void evaluate();

void push(char);

char pop();

int prec(char);

char infix[30], pos ix[30], stack[30];

int top = -1;

void main()

prin ("\n Enter the valid infix expression:");

scanf("%s", infix);

evaluate();

prin ("\nThe entered infix expression is :\n %s \n", infix);

prin ("\nThe corresponding pos ix expression is :\n %s \n", pos ix);

void evaluate()

int i = 0, j = 0;

char symb, temp;

push('#');

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

symb = infix[i];

switch (symb)

case '(':

push(symb);
 break;

case ')':

temp = pop();

while (temp != '(')

pos ix[j] = temp;

j++;

temp = pop();

break;

case '+':

case '-':

case '*':

case '/':

case '%':

case '^':

case '$':

while (prec(stack[top]) >= prec(symb))

temp = pop();

pos ix[j] = temp;

j++;

push(symb);

break;

default:

pos ix[j] = symb;

j++;

}
 while (top > 0)

temp = pop();

pos ix[j] = temp;

j++;

pos ix[j] = '\0';

void push(char item)

top = top + 1;

stack[top] = item;

char pop()

char item;

item = stack[top];

top = top - 1;

return item;

int prec(char symb)

int p;

switch (symb)

case '#':

p = -1;

break;
 case '(':

case ')':

p = 0;

break;

case '+':

case '-':

p = 1;

break;

case '*':

case '/':

case '%':

p = 2;

break;

case '^':

case '$':

p = 3;

break;

return p;

OUTPUT:

Enter the valid infix expression:(a+b)*c/d^5%1

The entered infix expression is :

(a+b)*c/d^5%1

The corresponding pos ix expression is :

ab+c*d5^/1%
5. Develop a Program in C for the following Stack Applica ons.
a. Evalua on of Suffix expression with single digit operands and operators: +, -, *, /, %,^.

#include<stdio.h>

#include<stdlib.h>

#include<math.h>

int i, top = -1;

int op1, op2, res, s[20];

char pos ix[90], symb;

void push(int item)

top = top + 1;

s[top] = item;

int pop()

int item;

item = s[top];

top = top - 1;

return item;

void main()

prin ("\nEnter a valid pos ix expression:\n");

scanf("%s", pos ix);

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

{

symb = pos ix[i];

if (isdigit(symb))

push(symb - '0');

else

op2 = pop();

op1 = pop();

switch (symb)

case '+':

push(op1 + op2);

break;

case '-':

push(op1 - op2);

break;

case '*':

push(op1 * op2);

break;

case '/':

push(op1 / op2);

break;

case '%':

push(op1 % op2);

break;

case '$':

case '^':

push(pow(op1, op2));

break;
 default:

push(0);

res = pop();

prin ("\n Result = %d", res);

OUTPUT:

Enter a valid pos ix expression:

623+-382/+*2$3+

Result = 52

5 [b]. Solving Tower of Hanoi problem with n disks.

#include <stdio.h>

void tower(int n, int source, int temp, int des na on)

if (n == 0)

return;

tower(n - 1, source, des na on, temp);

prin ("\nMove disc %d from %c to %c", n, source, des na on);

tower(n - 1, temp, source, des na on);

void main()

int n;

prin ("\nEnter the number of discs: \n");

scanf("%d", & n);

tower(n, 'A', 'B', 'C');

prin ("\n\nTotal Number of moves are: %d", (int) pow(2, n) - 1);

}
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

6. Develop a menu driven Program in C for the following opera ons on Circular QUEUE of
Characters (Array Implementa on 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 situa ons on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit

#include<stdio.h>

#include<stdlib.h>

#define MAX 5

char circular_queue[MAX];

int front = -1, rear = -1;

int isEmpty()

if (front == -1 && rear == -1)

return 1;

else

return 0;
}

int isFull()

if ((rear + 1) % MAX == front)

return 1;

else

return 0;

void insertElement(char element)

if (isFull())

prin ("Circular Queue Overflow\n");

return;

else if (isEmpty())

front = rear = 0;

else

rear = (rear + 1) % MAX;

circular_queue[rear] = element;

void deleteElement()

if (isEmpty())
 {

prin ("Circular Queue Underflow\n");

return;

else if (front == rear)

front = rear = -1;

else

front = (front + 1) % MAX;

void display()

int i;

if (isEmpty())

prin ("Circular Queue is empty\n");

return;

prin ("Circular Queue elements: ");

i = front;

do

prin ("%c ", circular_queue[i]);

i = (i + 1) % MAX;

while (i != (rear + 1) % MAX);

prin ("\n");
}

int main()

int choice;

char element;

do

prin ("\n\n---- Circular Queue Menu ----\n");

prin ("1. Insert an Element\n");

prin ("2. Delete an Element\n");

prin ("3. Display Circular Queue\n");

prin ("4. Exit\n");

prin ("Enter your choice: ");

scanf("%d", &choice);

switch(choice)

case 1:

prin ("Enter element to be inserted: ");

scanf(" %c", &element);

insertElement(element);

break;

case 2:

deleteElement();

break;

case 3:

display();

break;

case 4:

prin ("Exi ng...\n");

 break;

default:

prin ("Invalid choice! Please enter a valid op on.\n");

while(choice != 4);

return 0;

OUTPUT:

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 1

Enter element to be inserted: A

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 1

Enter element to be inserted: B

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element
3. Display Circular Queue

4. Exit

Enter your choice: 1

Enter element to be inserted: C

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 3

Circular Queue elements: A B C

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 2

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 3

Circular Queue elements: B C

---- Circular Queue Menu ----

1. Insert an Element

2. Delete an Element

3. Display Circular Queue

4. Exit

Enter your choice: 4

Exi ng...

7. Develop a menu driven Program in C for the following opera ons on Singly Linked List (SLL) of
Student Data with the fields: USN, Name, Programme, Sem, PhNo.
a. Create a SLL of N Students Data by using front inser on.
b. Display the status of SLL and count the number of nodes in it
c. Perform Inser on / Dele on at End of SLL
d. Perform Inser on / Dele on at Front of SLL(Demonstra on of stack)
e. Exit

#include<stdio.h>

#include<stdlib.h>

struct node

char usn[25], name[25], branch[25];

int sem;

long int phone;

struct node * link;

};

typedef struct node * NODE;

NODE start = NULL;

int count = 0;

NODE create()

{
 NODE snode;

snode = (NODE) malloc(sizeof(struct node));

if (snode == NULL)

prin ("\nMemory is not available");

exit(1);

prin ("\nEnter the usn,Name,Branch, sem,PhoneNo of the student:");

scanf("%s %s %s %d %ld", snode -> usn, snode -> name, snode -> branch, & snode -> sem, & snode
-> phone);

snode -> link = NULL;

count++;

return snode;

NODE inser ront()

NODE temp;

temp = create();

if (start == NULL)

return temp;

temp -> link = start;

return temp;

NODE deletefront()

{
 NODE temp;

if (start == NULL)

prin ("\nLinked list is empty");

return NULL;

if (start -> link == NULL)

prin ("\nThe Student node with usn:%s is deleted ", start -> usn);

count--;

free(start);

return NULL;

temp = start;

start = start -> link;

prin ("\nThe Student node with usn:%s is deleted", temp -> usn);

count--;

free(temp);

return start;

NODE insertend()

NODE cur, temp;

temp = create();

if (start == NULL)

return temp;

}
 cur = start;

while (cur -> link != NULL)

cur = cur -> link;

cur -> link = temp;

return start;

NODE deleteend()

NODE cur, prev;

if (start == NULL)

prin ("\nLinked List is empty");

return NULL;

if (start -> link == NULL)

prin ("\nThe student node with the usn:%s is deleted", start -> usn);

free(start);

count--;

return NULL;

prev = NULL;

cur = start;

while (cur -> link != NULL)

prev = cur;
 cur = cur -> link;

prin ("\nThe student node with the usn:%s is deleted", cur -> usn);

free(cur);

prev -> link = NULL;

count--;

return start;

void display()

NODE cur;

int num = 1;

if (start == NULL)

prin ("\nNo Contents to display in SLL \n");

return;

prin ("\nThe contents of SLL: \n");

cur = start;

while (cur != NULL)

prin ("\n|%d| |USN:%s| |Name:%s| |Branch:%s| |Sem:%d| |Ph:%ld|", num, cur -> usn, cur ->
name, cur -> branch, cur -> sem, cur -> phone);

cur = cur -> link;

num++;

prin ("\n No of student nodes is %d \n", count);

}

void stackdemo()

int ch;

while (1)

prin ("\n--------Stack Demo using SLL--------\n");

prin ("\n1:Push opera on \n2: Pop opera on \n3: Display \n4:Exit \n");

prin ("\nEnter your choice for stack demo:");

scanf("%d", & ch);

switch (ch)

case 1:

start = inser ront();

break;

case 2:

start = deletefront();

break;

case 3:

display();

break;

default:

return;

return;

int main()
{

int ch, i, n;

while (1)

prin ("\n--------Menu--------");

prin ("\nEnter your choice for SLL opera on \n");

prin ("\n1:Create SLL of Student Nodes");

prin ("\n2:DisplayStatus");

prin ("\n3:InsertAtEnd");

prin ("\n4:DeleteAtEnd");

prin ("\n5:Stack Demo using SLL(Inser on and Dele on at Front)");

prin ("\n6:Exit \n");

prin ("\nEnter your choice:");

scanf("%d", & ch);

switch (ch)

case 1:

prin ("\nEnter the no of students: ");

scanf("%d", & n);

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

start = inser ront();

break;

case 2:

display();

break;

case 3:

start = insertend();

break;
 case 4:

start = deleteend();

break;

case 5:

stackdemo();

break;

case 6:

exit(0);

default:

prin ("\nPlease enter the valid choice");

OUTPUT:

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:1

Enter the no of students: 3

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21CS017

Braham

CSE

8768586443

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21CS015

Bikash

CSE

8734687996

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21AI015

Shoaib

AI&ML

6748353877

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit
Enter your choice:2

The contents of SLL:

|1| |USN:1ME21AI015| |Name:Shoaib| |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|2| |USN:1ME21CS015| |Name:Bikash| |Branch:CSE | |Sem:5| |Ph:8734687996|

|3| |USN:1ME21CS017| |Name:Braham| |Branch:CSE | |Sem:5| |Ph:8768586443|

No of student nodes is 3

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:3

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21CS068

Rajan

CSE

3426527765

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:2

The contents of SLL:

|1| |USN:1ME21AI015| |Name:Shoaib| |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|2| |USN:1ME21CS015| |Name:Bikash| |Branch:CSE | |Sem:5| |Ph:8734687996|

|3| |USN:1ME21CS017| |Name:Braham| |Branch:CSE | |Sem:5| |Ph:8768586443|

|4| |USN:1ME21CS068| |Name:Rajan | |Branch:CSE | |Sem:5| |Ph:3426527765|

No of student nodes is 4

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:4

The student node with the usn:1ME21CS068 is deleted

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:2

The contents of SLL:

|1| |USN:1ME21AI015| |Name:Shoaib| |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|2| |USN:1ME21CS015| |Name:Bikash| |Branch:CSE | |Sem:5| |Ph:8734687996|

|3| |USN:1ME21CS017| |Name:Braham| |Branch:CSE | |Sem:5| |Ph:8768586443|

No of student nodes is 3

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:4

The student node with the usn:1ME21CS017 is deleted

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:5

--------Stack Demo using SLL--------

1:Push opera on

2: Pop opera on

3: Display

4:Exit

Enter your choice for stack demo:1

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21CS005

Aman

CSE

6587594335

--------Stack Demo using SLL--------

1:Push opera on

2: Pop opera on

3: Display

4:Exit
Enter your choice for stack demo:3

The contents of SLL:

|1| |USN:1ME21CS005| |Name:Aman | |Branch:CSE | |Sem:5| |Ph:6587594335|

|2| |USN:1ME21AI015| |Name:Shoaib| |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|3| |USN:1ME21CS015| |Name:Bikash| |Branch:CSE | |Sem:5| |Ph:8734687996|

No of student nodes is 3

--------Stack Demo using SLL--------

1: Push opera on

2: Pop opera on

3: Display

4: Exit

Enter your choice for stack demo:1

Enter the usn,Name,Branch, sem,PhoneNo of the student:

1ME21CS092

Shubham

CSE

9869754354

--------Stack Demo using SLL--------

1:Push opera on

2: Pop opera on

3: Display

4:Exit
Enter your choice for stack demo:3

The contents of SLL:

|1| |USN:1ME21CS092| |Name:Shubham| |Branch:CSE | |Sem:5| |Ph:9869754354|

|2| |USN:1ME21CS005| |Name:Aman | |Branch:CSE | |Sem:5| |Ph:6587594335|

|3| |USN:1ME21AI015| |Name:Shoaib | |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|4| |USN:1ME21CS015| |Name:Bikash | |Branch:CSE | |Sem:5| |Ph:8734687996|

No of student nodes is 4

--------Stack Demo using SLL--------

1:Push opera on

2: Pop opera on

3: Display

4:Exit

Enter your choice for stack demo:2

The Student node with usn:1ME21CS092 is deleted

--------Stack Demo using SLL--------

1:Push opera on

2: Pop opera on

3: Display

4:Exit

Enter your choice for stack demo:3

The contents of SLL:

|1| |USN:1ME21CS005| |Name:Aman | |Branch:CSE | |Sem:5| |Ph:6587594335|

|2| |USN:1ME21AI015| |Name:Shoaib| |Branch:AI&ML| |Sem:5| |Ph:6748353877|

|3| |USN:1ME21CS015| |Name:Bikash| |Branch:CSE | |Sem:5| |Ph:8734687996|

No of student nodes is 3

--------Stack Demo using SLL--------

1: Push opera on

2: Pop opera on

3: Display

4: Exit

Enter your choice for stack demo:4

--------Menu--------

Enter your choice for SLL opera on

1:Create SLL of Student Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:Stack Demo using SLL(Inser on and Dele on at Front)

6:Exit

Enter your choice:6

8. Develop a menu driven Program in C for the following opera ons on Doubly Linked List (DLL) of
Employee Data with the fields: SSN, Name, Dept, Designa on, Sal, PhNo.
a. Create a DLL of N Employees Data by using end inser on.
b. Display the status of DLL and count the number of nodes in it
c. Perform Inser on and Dele on at End of DLL
d. Perform Inser on and Dele on at Front of DLL
e. Demonstrate how this DLL can be used as Double Ended Queue.
f. Exit

#include<stdio.h>
#include<stdlib.h>

struct node

char ssn[25], name[25], dept[10], designa on[25];

int sal;

long int phone;

struct node * llink;

struct node * rlink;

};

typedef struct node * NODE;

NODE first = NULL;

int count = 0;

NODE create()

NODE enode;

enode = (NODE) malloc(sizeof(struct node));

if (enode == NULL)

prin ("\n Running out of memory ");

exit(0);

prin ("\n Enter the ssn,Name,Department,Designa on,Salary,PhoneNo of the employee: \n");

scanf("%s %s %s %s %d %ld", enode -> ssn, enode -> name, enode -> dept, enode -> designa on, &
enode -> sal, & enode -> phone);

enode -> llink = NULL;

enode -> rlink = NULL;

count++;

return enode;
}

NODE inser ront()

NODE temp;

temp = create();

if (first == NULL)

return temp;

temp -> rlink = first;

first -> llink = temp;

return temp;

void display()

NODE cur;

int nodeno = 1;

cur = first;

if (cur == NULL)

prin ("\nNo Contents to display in DLL ");

while (cur != NULL)

prin ("\nENode:%d|SSN:%s| |Name:%s| |Department:%s| |Designa on:%s| |Salary:%d|

|Phone no:%ld|", nodeno, cur -> ssn, cur -> name, cur -> dept, cur -> designa on, cur -> sal, cur ->
phone);

cur = cur -> rlink;

nodeno++;

prin ("\nNo of employee nodes is %d", count);

}
NODE deletefront()

NODE temp;

if (first == NULL)

prin ("\nDoubly Linked List is empty ");

return NULL;

if (first -> rlink == NULL)

prin ("\nThe employee node with the ssn:%s is deleted ", first -> ssn);

free(first);

count--;

return NULL;

temp = first;

first = first -> rlink;

temp -> rlink = NULL;

first -> llink = NULL;

prin ("\nThe employee node with the ssn:%s is deleted ", temp -> ssn);

free(temp);

count--;

return first;

NODE insertend()

NODE cur, temp;

temp = create();
 if (first == NULL)

return temp;

cur = first;

while (cur -> rlink != NULL)

cur = cur -> rlink;

cur -> rlink = temp;

temp -> llink = cur;

return first;

NODE deleteend()

NODE prev, cur;

if (first == NULL)

prin ("\nDoubly Linked List is empty ");

return NULL;

if (first -> rlink == NULL)

prin ("\nThe employee node with the ssn:%s is deleted ", first -> ssn);

free(first);

count--;

return NULL;

}
 prev = NULL;

cur = first;

while (cur -> rlink != NULL)

prev = cur;

cur = cur -> rlink;

cur -> llink = NULL;

prin ("\nThe employee node with the ssn:%s is deleted ", cur -> ssn);

free(cur);

prev -> rlink = NULL;

count--;

return first;

void deqdemo()

int ch;

while (1)

prin ("\nDemo Double Ended Queue Opera on ");

prin ("\n1:InsertQueueFront\n 2: DeleteQueueFront\n 3:InsertQueueRear\n

4:DeleteQueueRear\n 5:DisplayStatus\n 6: Exit \n");

scanf("%d", & ch);

switch (ch)

case 1:
 first = inser ront();

break;

case 2:

first = deletefront();

break;

case 3:

first = insertend();

break;

case 4:

first = deleteend();

break;

case 5:

display();

break;

default:

return;

void main()

int ch, i, n;

while (1)

prin ("\n\n--------Menu--------");

prin ("\n1:Create DLL of Employee Nodes ");

prin ("\n2:DisplayStatus");

prin ("\n3:InsertAtEnd");

prin ("\n4:DeleteAtEnd");

prin ("\n5:InsertAtFront");
prin ("\n6:DeleteAtFront");

prin ("\n7:Double Ended Queue Demo using DLL ");

prin ("\n8:Exit \n");

prin ("\nPlease enter your choice: ");

scanf("%d", & ch);

switch (ch)

case 1:

prin ("\nEnter the no of Employees: ");

scanf("%d", & n);

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

first = insertend();

break;

case 2:

display();

break;

case 3:

first = insertend();

break;

case 4:

first = deleteend();

break;

case 5:

first = inser ront();

break;
 case 6:

first = deletefront();

break;

case 7:

deqdemo();

break;

case 8:

exit(0);

default:

prin ("\nPlease Enter the valid choice ");

OUTPUT:

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 1

Enter the no of Employees: 2

Enter the ssn,Name,Department,Designa on,Salary,PhoneNo of the employee:

1EPL

Braham
Developer

Senior

13627

8476283712

Enter the ssn,Name,Department,Designa on,Salary,PhoneNo of the employee:

2EPL

Aman

Trader

Manager

20000

2763578156

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 2

|ENode:1| |SSN:1EPL| |Name:Braham| |Department:Developer| |Designa on:Senior |

|Salary:13627| |Phone no:8476283712|

|ENode:2| |SSN:2EPL| |Name:Aman | |Department:Trader | |Designa on:Manager|

|Salary:20000| |Phone no:2763578156|

No of employee nodes is 2

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 3

Enter the ssn,Name,Department,Designa on,Salary,PhoneNo of the employee:

3EPL

Bikash

Mee ng

Manager

30000

8237462936

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 2

|ENode:1| |SSN:1EPL| |Name:Braham| |Department:Developer| |Designa on:Senior |

|Salary:13627| |Phone no:8476283712|

|ENode:2| |SSN:2EPL| |Name:Aman | |Department:Trader | |Designa on:Manager|

|Salary:20000| |Phone no:2763578156|
|ENode:3| |SSN:3EPL| |Name:Bikash| |Department:Mee ng | |Designa on:Manager|
|Salary:30000| |Phone no:8237462936|

No of employee nodes is 3

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 5

Enter the ssn,Name,Department,Designa on,Salary,PhoneNo of the employee:

4EPL

Shoaib

Digital Marke ng

Manager

40000

2835826437

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 2

|ENode:1| |SSN:4EPL| |Name:Shoaib| |Department:Digital Marke ng| |Designa on:Manager|

|Salary:40000| |Phone no:2835826437|

|ENode:2| |SSN:1EPL| |Name:Braham| |Department:Developer | |Designa on:Senior |

|Salary:13627| |Phone no:8476283712|

|ENode:3| |SSN:2EPL| |Name:Aman | |Department:Trader | |Designa on:Manager|

|Salary:20000| |Phone no:2763578156|

|ENode:4| |SSN:3EPL| |Name:Bikash| |Department:Mee ng | |Designa on:Manager|

|Salary:30000| |Phone no:8237462936|

No of employee nodes is 4

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 4

The employee node with the ssn:3EPL is deleted

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd
5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 6

The employee node with the ssn:4EPL is deleted

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 2

|ENode:1| |SSN:1EPL| |Name:Braham| |Department:Developer| |Designa on:Senior |

|Salary:13627| |Phone no:8476283712|

|ENode:2| |SSN:2EPL| |Name:Aman | |Department:Trader | |Designa on:Manager|

|Salary:20000| |Phone no:2763578156|

No of employee nodes is 2

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront
7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 7

Demo Double Ended Queue Opera on

1:InsertQueueFront

2: DeleteQueueFront

3:InsertQueueRear

4:DeleteQueueRear

5:DisplayStatus

6: Exit

Please enter your choice: 2

The employee node with the ssn:1EPL is deleted

Demo Double Ended Queue Opera on

1:InsertQueueFront

2: DeleteQueueFront

3:InsertQueueRear

4:DeleteQueueRear

5:DisplayStatus

6: Exit

Please enter your choice: 4

The employee node with the ssn:2EPL is deleted

Demo Double Ended Queue Opera on

1:InsertQueueFront

2: DeleteQueueFront

3:InsertQueueRear

4:DeleteQueueRear
5:DisplayStatus

6: Exit

Please enter your choice: 2

Doubly Linked List is empty

Demo Double Ended Queue Opera on

1:InsertQueueFront

2: DeleteQueueFront

3:InsertQueueRear

4:DeleteQueueRear

5:DisplayStatus

6: Exit

Please enter your choice: 6

--------Menu--------

1:Create DLL of Employee Nodes

2:DisplayStatus

3:InsertAtEnd

4:DeleteAtEnd

5:InsertAtFront

6:DeleteAtFront

7:Double Ended Queue Demo using DLL

8:Exit

Please enter your choice: 8

9. Develop a Program in C for the following opera ons 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).

#include<stdio.h>
#include<stdlib.h>

#include<math.h>

#define COMPARE(x, y)((x == y) ? 0 : (x > y) ? 1 : -1)

struct node

int coef;

int xexp, yexp, zexp;

struct node * link;

};

typedef struct node * NODE;

NODE getnode()

NODE x;

x = (NODE) malloc(sizeof(struct node));

if (x == NULL)

prin ("Running out of memory \n");

return NULL;

return x;

NODE a ach(int coef, int xexp, int yexp, int zexp, NODE head)

NODE temp, cur;

temp = getnode();
 temp -> coef = coef;

temp -> xexp = xexp;

temp -> yexp = yexp;

temp -> zexp = zexp;

cur = head -> link;

while (cur -> link != head)

cur = cur -> link;

cur -> link = temp;

temp -> link = head;

return head;

NODE read_poly(NODE head)

int i, j, coef, xexp, yexp, zexp, n;

prin ("\nEnter the no of terms in the polynomial: ");

scanf("%d", & n);

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

prin ("\n\tEnter the %d term: ", i);

prin ("\n\t\tCoef = ");

scanf("%d", & coef);

prin ("\n\t\tEnter Pow(x) Pow(y) and Pow(z): ");

scanf("%d", & xexp);

scanf("%d", & yexp);

scanf("%d", & zexp);

head = a ach(coef, xexp, yexp, zexp, head);

return head;
}

void display(NODE head)

NODE temp;

if (head -> link == head)

prin ("\nPolynomial does not exist.");

return;

temp = head -> link;

while (temp != head)

prin ("%dx^%dy^%dz^%d", temp -> coef, temp -> xexp, temp -> yexp, temp -> zexp);

temp = temp -> link;

if (temp != head)

prin (" + ");

int poly_evaluate(NODE head)

int x, y, z, sum = 0;

NODE poly;

prin ("\nEnter the value of x,y and z: ");

scanf("%d %d %d", & x, & y, & z);

poly = head -> link;

while (poly != head)

 {

sum += poly -> coef * pow(x, poly -> xexp) * pow(y, poly -> yexp) * pow(z, poly -> zexp);

poly = poly -> link;

return sum;

NODE poly_sum(NODE head1, NODE head2, NODE head3)

NODE a, b;

int coef;

a = head1 -> link;

b = head2 -> link;

while (a != head1 && b != head2)

while (1)

if (a -> xexp == b -> xexp && a -> yexp == b -> yexp && a -> zexp == b -> zexp)

coef = a -> coef + b -> coef;

head3 = a ach(coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

b = b -> link;

break;

if (a -> xexp != 0 || b -> xexp != 0)

switch (COMPARE(a -> xexp, b -> xexp))

case -1:
 head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

case 0:

if (a -> yexp > b -> yexp)

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

break;

else if (a -> yexp < b -> yexp)

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

else if (a -> zexp > b -> zexp)

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

break;

else if (a -> zexp < b -> zexp)

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

case 1:

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);
 a = a -> link;

break;

break;

if (a -> yexp != 0 || b -> yexp != 0)

switch (COMPARE(a -> yexp, b -> yexp))

case -1:

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

case 0:

if (a -> zexp > b -> zexp)

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

break;

else if (a -> zexp < b -> zexp)

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

case 1:

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

break;

}
 break;

if (a -> zexp != 0 || b -> zexp != 0)

switch (COMPARE(a -> zexp, b -> zexp))

case -1:

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

break;

case 1:

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

break;

break;

while (a != head1)

head3 = a ach(a -> coef, a -> xexp, a -> yexp, a -> zexp, head3);

a = a -> link;

while (b != head2)

head3 = a ach(b -> coef, b -> xexp, b -> yexp, b -> zexp, head3);

b = b -> link;

return head3;

}
void main()

NODE head, head1, head2, head3;

int res, ch;

head = getnode();

head1 = getnode();

head2 = getnode();

head3 = getnode();

head -> link = head;

head1 -> link = head1;

head2 -> link = head2;

head3 -> link = head3;

while (1)

prin ("\n--------Menu--------");

prin ("\n1.Represent and Evaluate a Polynomial P(x,y,z)");

prin ("\n2.Find the sum of two polynomials POLY1(x,y,z)");

prin ("\nEnter your choice:");

scanf("%d", & ch);

switch (ch)

case 1:

prin ("\n----Polynomial evalua on P(x,y,z)----\n");

head = read_poly(head);

prin ("\nRepresenta on of Polynomial for evalua on: \n");

display(head);

res = poly_evaluate(head);

prin ("\nResult of polynomial evalua on is : %d \n", res);

 break;

case 2:

prin ("\nEnter the POLY1(x,y,z): \n");

head1 = read_poly(head1);

prin ("\nPolynomial 1 is: \n");

display(head1);

prin ("\nEnter the POLY2(x,y,z): \n");

head2 = read_poly(head2);

prin ("\nPolynomial 2 is: \n");

display(head2);

prin ("\nPolynomial addi on result: \n");

head3 = poly_sum(head1, head2, head3);

display(head3);

break;

case 3:

exit(0);

OUTPUT:

--------Menu--------

1.Represent and Evaluate a Polynomial P(x,y,z)

2.Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z)

Enter your choice: 1

----Polynomial evalua on P(x,y,z)----

Enter the no of terms in the polynomial: 5

Enter the 1 term:

 Coef = 6

Enter Pow(x) Pow(y) and Pow(z): 2 2 1

Enter the 2 term:

Coef = -4

Enter Pow(x) Pow(y) and Pow(z): 0 1 5

Enter the 3 term:

Coef = 3

Enter Pow(x) Pow(y) and Pow(z): 3 1 1

Enter the 4 term:

Coef = 2

Enter Pow(x) Pow(y) and Pow(z): 1 5 1

Enter the 5 term:

Coef = -2

Enter Pow(x) Pow(y) and Pow(z): 1 1 3

Representa on of Polynomial for evalua on:

6x^2y^2z^1 + -4x^0y^1z^5 + 3x^3y^1z^1 + 2x^1y^5z^1 + -2x^1y^1z^3

Enter the value of x,y and z: 1 1 1

Result of polynomial evalua on is : 5

--------Menu--------

1.Represent and Evaluate a Polynomial P(x,y,z)

2.Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z)

Enter your choice: 2

Enter the POLY1(x,y,z):

Enter the no of terms in the polynomial: 5

Enter the 1 term:

Coef = 6

Enter Pow(x) Pow(y) and Pow(z): 4 4 4

 Enter the 2 term:

Coef = 3

Enter Pow(x) Pow(y) and Pow(z): 4 3 1

Enter the 3 term:

Coef = 5

Enter Pow(x) Pow(y) and Pow(z): 0 1 1

Enter the 4 term:

Coef = 10

Enter Pow(x) Pow(y) and Pow(z): 0 1 0

Enter the 5 term:

Coef = 5

Enter Pow(x) Pow(y) and Pow(z): 0 0 0

Polynomial 1 is:

6x^4y^4z^4 + 3x^4y^3z^1 + 5x^0y^1z^1 + 10x^0y^1z^0 + 5x^0y^0z^0

Enter the POLY2(x,y,z):

Enter the no of terms in the polynomial: 5

Enter the 1 term:

Coef = 8

Enter Pow(x) Pow(y) and Pow(z): 4 4 4

Enter the 2 term:

Coef = 4

Enter Pow(x) Pow(y) and Pow(z): 4 2 1

Enter the 3 term:

Coef = 30

Enter Pow(x) Pow(y) and Pow(z): 0 1 0

Enter the 4 term:

Coef = 20

Enter Pow(x) Pow(y) and Pow(z): 0 0 1

 Enter the 5 term:

Coef = 3

Enter Pow(x) Pow(y) and Pow(z): 0 0 0

Polynomial 2 is:

8x^4y^4z^4 + 4x^4y^2z^1 + 30x^0y^1z^0 + 20x^0y^0z^1 + 3x^0y^0z^0

Polynomial addi on result:

14x^4y^4z^4 + 3x^4y^3z^1 + 4x^4y^2z^1 + 5x^0y^1z^1 + 40x^0y^1z^0 + 20x^0y^0z^1 + 8x^0y^0z^0

--------Menu--------

1.Represent and Evaluate a Polynomial P(x,y,z)

2.Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z)

Enter your choice:3

10. Develop a Program in C for the following:

a. Declare a calendar as an array of 7 elements (A dynamically Created array) to represent 7 days of a
week. Each Element of the array is a structure having three fields. The first field is the name of the
Day (A dynamically allocated String), The second field is the date of the Day (A integer), the third field
is the descrip on of the ac vity for a par cular day (A dynamically allocated String).

b. Write func ons create(), read() and display(); to create the calendar, to read the data from the
keyboard and to print weeks ac vity details report on screen.

#include<stdio.h>

#include<stdlib.h>

struct BST

int data;

struct BST * lchild;

struct BST * rchild;

};

typedef struct BST * NODE;

NODE create()

NODE temp;

temp = (NODE) malloc(sizeof(struct BST));

prin ("\nEnter The value: ");

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

temp -> lchild = NULL;

temp -> rchild = NULL;

return temp;

void insert(NODE root, NODE newnode);

void inorder(NODE root);

void preorder(NODE root);

void postorder(NODE root);

void search(NODE root);

void insert(NODE root, NODE newnode)

if (newnode -> data < root -> data)

if (root -> lchild == NULL)

root -> lchild = newnode;

else

insert(root -> lchild, newnode);

if (newnode -> data > root -> data)

{
 if (root -> rchild == NULL)

root -> rchild = newnode;

else

insert(root -> rchild, newnode);

void search(NODE root)

int key;

NODE cur;

if (root == NULL)

prin ("\nBST is empty.");

return;

prin ("\nEnter Element to be searched: ");

scanf("%d", & key);

cur = root;

while (cur != NULL)

if (cur -> data == key)

prin ("\nKey element is present in BST ");

return;

if (key < cur -> data)

cur = cur -> lchild;

else

cur = cur -> rchild;

}
 prin ("\nKey element is not found in the BST ");

void inorder(NODE root)

if (root != NULL)

inorder(root -> lchild);

prin ("%d ", root -> data);

inorder(root -> rchild);

void preorder(NODE root)

if (root != NULL)

prin ("%d ", root -> data);

preorder(root -> lchild);

preorder(root -> rchild);

void postorder(NODE root)

if (root != NULL)

postorder(root -> lchild);

postorder(root -> rchild);

prin ("%d ", root -> data);

}
}

void main()

int ch, key, val, i, n;

NODE root = NULL, newnode;

while (1)

prin ("\n-------BST MENU-------");

prin ("\n1.Create a BST ");

prin ("\n2.Search ");

prin ("\n3.BST Traversals: ");

prin ("\n4.Exit");

prin ("\nEnter your choice: ");

scanf("%d", & ch);

switch (ch)

case 1:

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

scanf("%d", & n);

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

newnode = create();

if (root == NULL)

root = newnode;

else

insert(root, newnode);

break;

case 2:

if (root == NULL)
 prin ("\nTree Is Not Created ");

else

prin ("\nThe Preorder display: ");

preorder(root);

prin ("\nThe Inorder display: ");

inorder(root);

prin ("\nThe Postorder display: ");

postorder(root);

break;

case 3:

search(root);

break;

case 4:

exit(0);

Output:

-------BST MENU-------

1.Create a BST

2.Search

3.BST Traversals:

4.Exit

Enter your choice: 1

Enter the number of elements: 12

Enter The value: 6

Enter The value: 9

Enter The value: 5

Enter The value: 2

Enter The value: 8

Enter The value: 15

Enter The value: 24

Enter The value: 14

Enter The value: 7

Enter The value: 8

Enter The value: 5

Enter The value: 2

-------BST MENU-------

1.Create a BST

2.Search

3.BST Traversals:

4.Exit

Enter your choice: 3

The Preorder display: 6 5 2 9 8 7 15 14 24

The Inorder display: 2 5 6 7 8 9 14 15 24

The Postorder display: 2 5 7 8 14 24 15 9 6

-------BST MENU-------

1.Create a BST

2.Search

3.BST Traversals:

4.Exit

Enter your choice: 2

Enter Element to be searched: 66

Key element is not found in the BST

-------BST MENU-------

1.Create a BST

2.Search

3.BST Traversals:

4.Exit

Enter your choice: 2

Enter Element to be searched: 14

Key element is present in BST

-------BST MENU-------

1.Create a BST

2.Search

3.BST Traversals:

4.Exit

Enter your choice: 4

11. Develop a Program in C for the following opera ons on Graph(G) of Ci es.
a. Create a Graph of N ci es using Adjacency Matrix.
b. Print all the nodes reachable from a given star ng node in a digraph using DFS/BFS method.

#include<stdio.h>

#include<stdlib.h>

int a[50][50], n, visited[50];

int q[20], front = -1, rear = -1;

int s[20], top = -1, count = 0;

void bfs(int v)

int i, cur;
 visited[v] = 1;

q[++rear] = v;

while (front != rear)

cur = q[++front];

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

if ((a[cur][i] == 1) && (visited[i] == 0))

q[++rear] = i;

visited[i] = 1;

prin ("%d ", i);

void dfs(int v)

int i;

visited[v] = 1;

s[++top] = v;

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

if (a[v][i] == 1 && visited[i] == 0)

prin ("%d ", i);

dfs(i);

}
int main()

int ch, start, i, j;

prin ("\nEnter the number of ver ces in graph:");

scanf("%d", & n);

prin ("\nEnter the adjacency matrix:\n");

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

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

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

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

visited[i] = 0;

prin ("\nEnter the star ng vertex: ");

scanf("%d", & start);

prin ("\n==>1. BFS: Print all nodes reachable from a given star ng node");

prin ("\n==>2. DFS: Print all nodes reachable from a given star ng node");

prin ("\n==>3:Exit");

prin ("\nEnter your choice: ");

scanf("%d", & ch);

switch (ch)

case 1:

prin ("\nNodes reachable from star ng vertex %d are: ", start);

bfs(start);

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

{
 if (visited[i] == 0)

prin ("\nThe vertex that is not reachable is %d", i);

break;

case 2:

prin ("\nNodes reachable from star ng vertex %d are:\n", start);

dfs(start);

break;

case 3:

exit(0);

default:

prin ("\nPlease enter valid choice:");

OUTPUT:

*************************case-1*************************

Enter the number of ver ces in graph:4

Enter the adjacency matrix:

0101

0010

0001

0000

Enter the star ng vertex: 1

==>1. BFS: Print all nodes reachable from a given star ng node

==>2. DFS: Print all nodes reachable from a given star ng node

==>3:Exit

Enter your choice: 1

Nodes reachable from star ng vertex 1 are: 2 4 3

*************************case-2*************************

Enter the number of ver ces in graph:4

Enter the adjacency matrix:

0101

0010

0001

0000

Enter the star ng vertex: 2

==>1. BFS: Print all nodes reachable from a given star ng node

==>2. DFS: Print all nodes reachable from a given star ng node

==>3:Exit

Enter your choice: 1

Nodes reachable from star ng vertex 2 are: 3 4

The vertex that is not reachable is 1

*************************case-3*************************

Enter the number of ver ces in graph:4

Enter the adjacency matrix:

0101

0010

0001

0000

Enter the star ng vertex: 1

==>1. BFS: Print all nodes reachable from a given star ng node

==>2. DFS: Print all nodes reachable from a given star ng node
==>3:Exit

Enter your choice: 2

Nodes reachable from star ng vertex 1 are: 2 3 4

*************************case-4*************************

Enter the number of ver ces in graph:4

Enter the adjacency matrix:

0101

0010

0001

0000

Enter the star ng vertex: 2

==>1. BFS: Print all nodes reachable from a given star ng node

==>2. DFS: Print all nodes reachable from a given star ng node

==>3:Exit

Enter your choice: 2

Nodes reachable from star ng vertex 2 are: 3 4

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
loca ons with L as the set of memory addresses (2-digit) of loca ons in HT. Let the keys in K and
addresses in L are Integers. Develop a Program in C that uses Hash func on 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.

#include<stdio.h>

#include<stdlib.h>

int key[20], n, m;

int * ht, index;

int count = 0;
void insert(int key)

index = key % m;

while (ht[index] != -1)

index = (index + 1) % m;

ht[index] = key;

count++;

void display()

int i;

if (count == 0)

prin ("\nHash Table is empty");

return;

prin ("\nHash Table contents are:\n ");

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

prin ("\n T[%d] --> %d ", i, ht[i]);

void main()

int i;

prin ("\nEnter the number of employee records (N): ");

scanf("%d", & n);

 prin ("\nEnter the two digit memory loca ons (m) for hash table: ");

scanf("%d", & m);

ht = (int * ) malloc(m * sizeof(int));

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

ht[i] = -1;

prin ("\nEnter the four digit key values (K) for N Employee Records:\n ");

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

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

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

if (count == m)

prin ("\n-----Hash table is full. Cannot insert the record %d key-----", i + 1);

break;

insert(key[i]);

display();

OUTPUT:

Enter the number of employee records (N) :10

Enter the two digit memory loca ons (m) for hash table:15

Enter the four digit key values (K) for N Employee Records:

4020

4560

9908
6785

0423

7890

6547

3342

9043

6754

Hash Table contents are:

T[0] --> 4020

T[1] --> 4560

T[2] --> 7890

T[3] --> 423

T[4] --> 6754

T[5] --> 6785

T[6] --> -1

T[7] --> 6547

T[8] --> 9908

T[9] --> -1

T[10] --> -1

T[11] --> -1

T[12] --> 3342

T[13] --> 9043

T[14] --> -1