#define N 5
printf("PROGRAM FOR IMPLEMENTATION OF QUEUES USING ARRAYS");
int a[N], i, k, ch;
int f=-1, r=-1;
for(i=0; i<N; i+) a[i]=0;
printf("\n Enter 1 to insert \n \t 2 to delete \n \t 3 to display \n
KEY to Questions 13 to 17 in Question bank for CAT1.
Define a stack and explain its LIFO structure.
Explain with algorithm the push and pop operations on a stack.
Define a queue and explain its FIFO structure.
Explain with al
A binary tree is a finite set of elements that is either empty or has three
- The first is a single element called the root of the tree.
- The other two subsets are themselves binary trees, called the left and right
Modification of the Databases
delete from loan;
delete from account where branch-name = Perryridge;
delete from loan where amount between 1300 and 1500;
delete from account where branch-name in ( sel
Question Bank CAT1
Course Code: ITA111
Slot / Venue : E1 / SJT G05
Course Name : Data Structures
Faculty: Dr. Indhumathi R (13118)
a. Introduction to Data Structures
c. Linked list