Q1. Write a program to implementation of Queue.
Q1. Write a program to implementation of Queue.
Embedded Files
BRABU 2nd, 4th and 6th Examination Schedule Out
#include <stdio.h>
#include <stdio.h>
#include <conio.h>
#include <conio.h>
#define size 10
#define size 10
int rear = -1, front = -1;
int rear = -1, front = -1;
int queue[size];
int queue[size];
void insert();
void insert();
void delete();
void delete();
void display();
void display();
void main()
void main()
{
{
int op;
int op;
while (op != 4)
while (op != 4)
{
{
printf("-------------------------------");
printf("-------------------------------");
printf("\n1.Insert \n2.Delete\n3.Display\n4.Exit");
printf("\n1.Insert \n2.Delete\n3.Display\n4.Exit");
printf("\n-----------------------------------------");
printf("\n-----------------------------------------");
printf("\n\tEnter your Options:");
printf("\n\tEnter your Options:");
scanf("%d", &op);
scanf("%d", &op);
switch (op)
switch (op)
{
{
case 1:
case 1:
insert();
insert();
break;
break;
case 2:
case 2:
delete();
delete();
break;
break;
case 3:
case 3:
display();
display();
break;
break;
case 4:
case 4:
printf("\nProgram Exit successfuly");
printf("\nProgram Exit successfuly");
break;
break;
default:
default:
printf("\nInvalid Options");
printf("\nInvalid Options");
}
}
printf("\nAre you want to continue press 1 and Exit press 4:");
printf("\nAre you want to continue press 1 and Exit press 4:");
scanf("%d", &op);
scanf("%d", &op);
}
}
}
}
void insert()
void insert()
{
{
int no;
int no;
if (rear == size - 1)
if (rear == size - 1)
{
{
printf("\nQueue Overflow");
printf("\nQueue Overflow");
return;
return;
}
}
printf("\nEnter an element: ");
printf("\nEnter an element: ");
scanf("%d", &no);
scanf("%d", &no);
if (front == -1)
if (front == -1)
front = 0;
front = 0;
rear++;
rear++;
queue[rear] = no;
queue[rear] = no;
}
}
void delete()
void delete()
{
{
int no;
int no;
if (front == -1 || front > rear)
if (front == -1 || front > rear)
{
{
printf("\nQueue is Empty");
printf("\nQueue is Empty");
return;
return;
}
}
no = queue[front];
no = queue[front];
printf("\nDeleted element is %d", no);
printf("\nDeleted element is %d", no);
front++;
front++;
if (front > rear)
if (front > rear)
{
{
front = -1;
front = -1;
rear = -1;
rear = -1;
}
}
}
}
void display()
void display()
{
{
int i, no;
int i, no;
if (front > rear)
if (front > rear)
{
{
printf("Queue is empty");
printf("Queue is empty");
return;
return;
}
}
printf("\nQueue elements are:");
printf("\nQueue elements are:");
for (i = front; i <= rear; i++)
for (i = front; i <= rear; i++)
{
{
printf("%5d", queue[i]);
printf("%5d", queue[i]);
}
}
}
}
Q2. Write a program to implementation of Stack.
Q2. Write a program to implementation of Stack.
#include <stdio.h>
#include <stdio.h>
#include <conio.h>
#include <conio.h>
#define size 10
#define size 10
int stack[size], top = -1;
int stack[size], top = -1;
void push();
void push();
void pop();
void pop();
void display();
void display();
void main()
void main()
{
{
int ch;
int ch;
while (ch != 4)
while (ch != 4)
{
{
printf("---------------------------------------");
printf("---------------------------------------");
printf("\n1.Push\n2. Poo\n3. Display\n4. Exit");
printf("\n1.Push\n2. Poo\n3. Display\n4. Exit");
printf("\n--------------------------------------");
printf("\n--------------------------------------");
printf("\n\tEnter Your options:");
printf("\n\tEnter Your options:");
scanf("%d", &ch);
scanf("%d", &ch);
switch (ch)
switch (ch)
{
{
case 1:
case 1:
push();
push();
break;
break;
case 2:
case 2:
pop();
pop();
break;
break;
case 3:
case 3:
display();
display();
break;
break;
case 4:
case 4:
printf("\nProgram Exit Successfuly");
printf("\nProgram Exit Successfuly");
break;
break;
default:
default:
printf("\nInvalid Options");
printf("\nInvalid Options");
}
}
printf("\nAre you want to continue Press 1 and Exit press 0:\t");
printf("\nAre you want to continue Press 1 and Exit press 0:\t");
scanf("%d", &ch);
scanf("%d", &ch);
}
}
}
}
void push()
void push()
{
{
int no;
int no;
if (top == size - 1)
if (top == size - 1)
{
{
printf("Stack is Overflow");
printf("Stack is Overflow");
return;
return;
}
}
printf("\nEnter a elements:");
printf("\nEnter a elements:");
scanf("%d", &no);
scanf("%d", &no);
stack[top] = no;
stack[top] = no;
top++;
top++;
}
}
void pop()
void pop()
{
{
int no;
int no;
if (top == -1)
if (top == -1)
{
{
printf("\nSatck is empty");
printf("\nSatck is empty");
return;
return;
}
}
no = stack[top];
no = stack[top];
top--;
top--;
printf("\nPoped elements is %d", no);
printf("\nPoped elements is %d", no);
}
}
void display()
void display()
{
{
int i;
int i;
if (top == -1)
if (top == -1)
{
{
printf("Stack is empty");
printf("Stack is empty");
return;
return;
}
}
printf("\n\tElements of Stack are:");
printf("\n\tElements of Stack are:");
for (i = 0; i <= top; i++)
for (i = 0; i <= top; i++)
{
{
printf("%5d", stack[i]);
printf("%5d", stack[i]);
}
}
}
}
Q3. Write a program to implementation of Linked List.
Q3. Write a program to implementation of Linked List.
#include <stdio.h>
#include <stdio.h>
#include <conio.h>
#include <conio.h>
#include <stdlib.h>
#include <stdlib.h>
void create();
void create();
void display();
void display();
void insert_first();
void insert_first();
void insert_last();
void insert_last();
void insert_middle();
void insert_middle();
void delete_first();
void delete_first();
void delete_last();
void delete_last();
void delete_middle();
void delete_middle();
struct node
struct node
{
{
int data;
int data;
struct node *add;
struct node *add;
};
};
struct node *start = NULL, *new1, *temp, *prev, *next;
struct node *start = NULL, *new1, *temp, *prev, *next;
void main()
void main()
{
{
int ch;
int ch;
while (ch != 9)
while (ch != 9)
{
{
printf("\n----------Linked List Menu--------------------");
printf("\n----------Linked List Menu--------------------");
printf("\n1. Create a Linked List");
printf("\n1. Create a Linked List");
printf("\n2. Display a Linked List");
printf("\n2. Display a Linked List");
printf("\n3. Insert at first");
printf("\n3. Insert at first");
printf("\n4. Insert at last");
printf("\n4. Insert at last");
printf("\n5. Inser at Specific place");
printf("\n5. Inser at Specific place");
printf("\n6. Delete from first");
printf("\n6. Delete from first");
printf("\n7. Delete from last");
printf("\n7. Delete from last");
printf("\n8. Delete from specific place");
printf("\n8. Delete from specific place");
printf("\n9.Exit");
printf("\n9.Exit");
printf("\n--------------------------------------------");
printf("\n--------------------------------------------");
printf("\n Enter your choice:");
printf("\n Enter your choice:");
scanf("%d", &ch);
scanf("%d", &ch);
switch (ch)
switch (ch)
{
{
case 1:
case 1:
create();
create();
break;
break;
case 2:
case 2:
display();
display();
break;
break;
case 3:
case 3:
insert_first();
insert_first();
break;
break;
case 4:
case 4:
insert_last();
insert_last();
break;
break;
case 5:
case 5:
insert_middle();
insert_middle();
break;
break;
case 6:
case 6:
delete_first();
delete_first();
break;
break;
case 7:
case 7:
delete_last();
delete_last();
break;
break;
case 8:
case 8:
delete_middle();
delete_middle();
break;
break;
case 9:
case 9:
printf("\nProgram exit successfuly");
printf("\nProgram exit successfuly");
break;
break;
default:
default:
printf("\n Invalid Choice");
printf("\n Invalid Choice");
}
}
printf("\nAre you want to continue? press 1 \n& if you want to exit, press 9:\t \n");
printf("\nAre you want to continue? press 1 \n& if you want to exit, press 9:\t \n");
}
}
}
}
void create()
void create()
{
{
int no;
int no;
char ch;
char ch;
printf("\nEnter an elements:");
printf("\nEnter an elements:");
scanf("%d", &no);
scanf("%d", &no);
start = (struct node *)(malloc(sizeof(struct node)));
start = (struct node *)(malloc(sizeof(struct node)));
start->data = no;
start->data = no;
start->add = NULL;
start->add = NULL;
temp = start;
temp = start;
printf("\nWant to continue");
printf("\nWant to continue");
ch = getche();
ch = getche();
while (ch == 'y' || ch == 'Y')
while (ch == 'y' || ch == 'Y')
{
{
printf("\nEnter next elements:");
printf("\nEnter next elements:");
scanf("%d", &no);
scanf("%d", &no);
new1 = (struct node *)(malloc(sizeof(struct node)));
new1 = (struct node *)(malloc(sizeof(struct node)));
new1->data = no;
new1->data = no;
new1->add = NULL;
new1->add = NULL;
temp->add = new1;
temp->add = new1;
temp = temp->add;
temp = temp->add;
printf("Wnat to continue");
printf("Wnat to continue");
ch = getche();
ch = getche();
}
}
}
}
void display()
void display()
{
{
if (start == NULL)
if (start == NULL)
{
{
printf("List not found");
printf("List not found");
return;
return;
}
}
printf("\n Elements of Linked List:");
printf("\n Elements of Linked List:");
temp = start;
temp = start;
while (temp != NULL)
while (temp != NULL)
{
{
printf("\t%d", temp->data);
printf("\t%d", temp->data);
temp = temp->add;
temp = temp->add;
}
}
}
}
void insert_first()
void insert_first()
{
{
int no;
int no;
printf("\nEnter a Elements:");
printf("\nEnter a Elements:");
scanf("%d", &no);
scanf("%d", &no);
new1 = (struct node *)(malloc(sizeof(struct node)));
new1 = (struct node *)(malloc(sizeof(struct node)));
new1->data = no;
new1->data = no;
new1->add = NULL;
new1->add = NULL;
new1->add = start;
new1->add = start;
start = new1;
start = new1;
}
}
void insert_last()
void insert_last()
{
{
int no;
int no;
if (start == NULL)
if (start == NULL)
{
{
printf("List not found");
printf("List not found");
return;
return;
}
}
printf("\nEnter a elements:");
printf("\nEnter a elements:");
scanf("%d", &no);
scanf("%d", &no);
new1 = (struct node *)(malloc(sizeof(struct node)));
new1 = (struct node *)(malloc(sizeof(struct node)));
new1->data = no;
new1->data = no;
new1->add = NULL;
new1->add = NULL;
temp = start;
temp = start;
while (temp->add != NULL)
while (temp->add != NULL)
{
{
temp = temp->add;
temp = temp->add;
}
}
temp->add = new1;
temp->add = new1;
}
}
void insert_middle()
void insert_middle()
{
{
int no, pos, i = 1;
int no, pos, i = 1;
if (start == NULL)
if (start == NULL)
{
{
printf("\nList is not found");
printf("\nList is not found");
return;
return;
}
}
printf("Enter elements:");
printf("Enter elements:");
scanf("%d", &no);
scanf("%d", &no);
new1 = (struct node *)(malloc(sizeof(struct node)));
new1 = (struct node *)(malloc(sizeof(struct node)));
new1->data = no;
new1->data = no;
new1->add = NULL;
new1->add = NULL;
printf("\nEnter your positions:");
printf("\nEnter your positions:");
scanf("%d", &pos);
scanf("%d", &pos);
next = start;
next = start;
while (i < pos)
while (i < pos)
{
{
prev = next;
prev = next;
next = next->add;
next = next->add;
i++;
i++;
}
}
prev->add = new1;
prev->add = new1;
new1->add = next;
new1->add = next;
}
}
void delete_first()
void delete_first()
{
{
if (start == NULL)
if (start == NULL)
{
{
printf("\nList not found");
printf("\nList not found");
return;
return;
}
}
temp = start;
temp = start;
start = start->add;
start = start->add;
printf("\nDelete Node is %d", temp->data);
printf("\nDelete Node is %d", temp->data);
free(temp);
free(temp);
}
}
void delete_last()
void delete_last()
{
{
if (start == NULL)
if (start == NULL)
{
{
printf("\n List Not found");
printf("\n List Not found");
return;
return;
}
}
temp = start;
temp = start;
while (temp->add != NULL)
while (temp->add != NULL)
{
{
prev = temp;
prev = temp;
temp = temp->add;
temp = temp->add;
}
}
prev->add = NULL;
prev->add = NULL;
printf("\nDelete node is %d", temp->data);
printf("\nDelete node is %d", temp->data);
free(temp);
free(temp);
}
}
void delete_middle()
void delete_middle()
{
{
}
}
void delete_middel()
void delete_middel()
{
{
int pos, i = 1;
int pos, i = 1;
if (start == NULL)
if (start == NULL)
{
{
printf("\n List not found");
printf("\n List not found");
return;
return;
}
}
printf("\n Enter the positions:");
printf("\n Enter the positions:");
scanf("%d", &pos);
scanf("%d", &pos);
temp = start;
temp = start;
while (i < pos)
while (i < pos)
{
{
prev = temp;
prev = temp;
temp = temp->add;
temp = temp->add;
i++;
i++;
}
}
next = temp->add;
next = temp->add;
prev->add = next;
prev->add = next;
printf("Delete node is %d", temp->data);
printf("Delete node is %d", temp->data);
free(temp);
free(temp);
}
}
Q4. Write a program to additiom of two Array.
Q4. Write a program to additiom of two Array.
#include <stdio.h>
#include <conio.h>
#define SIZE 10
void input(int a[][SIZE], int r, int c);
void show(int a[][SIZE], int r, int c);
void add(int a[][SIZE], int b[][SIZE], int c[][SIZE],
int r1, int c1, int r2, int c2);
int main()
{
int a[SIZE][SIZE], b[SIZE][SIZE], c[SIZE][SIZE];
int r1, r2, c1, c2;
printf("\nEnter the row and column of first matrix: ");
scanf("%d%d", &r1, &c1);
if (r1 > SIZE || c1 > SIZE || r1 <= 0 || c1 <= 0)
{
printf("\nInvalid size of first matrix");
return 0;
}
input(a, r1, c1);
printf("\nEnter the row and column of second matrix: ");
scanf("%d%d", &r2, &c2);
if (r2 > SIZE || c2 > SIZE || r2 <= 0 || c2 <= 0)
{
printf("\nInvalid size of second matrix");
return 0;
}
input(b, r2, c2);
printf("\nElements of First Matrix:\n");
show(a, r1, c1);
printf("\nElements of Second Matrix:\n");
show(b, r2, c2);
add(a, b, c, r1, c1, r2, c2);
getch();
return 0;
}
void input(int a[][SIZE], int r, int c)
{
int i, j;
printf("\nEnter the elements of matrix:\n");
for (i = 0; i < r; i++)
{
for (j = 0; j < c; j++)
{
scanf("%d", &a[i][j]);
}
}
}
void show(int a[][SIZE], int r, int c)
{
int i, j;
for (i = 0; i < r; i++)
{
for (j = 0; j < c; j++)
{
printf("%5d", a[i][j]);
}
printf("\n");
}
}
void add(int a[][SIZE], int b[][SIZE], int c[][SIZE],
int r1, int c1, int r2, int c2)
{
int i, j;
if (r1 == r2 && c1 == c2)
{
for (i = 0; i < r1; i++)
{
for (j = 0; j < c1; j++)
{
c[i][j] = a[i][j] + b[i][j];
}
}
printf("\nResultant Matrix:\n");
show(c, r1, c1);
}
else
{
printf("\nMatrix Addition is not possible.");
printf("\nBoth matrices must have the same order.");
}
}
Google Sites
Report abuse