DS UNIT 1

Which structure is best for implementing undo operations?
A. Queue
B. Tree
C. Stack
D. Graph

Which of these is used to implement recursion?
A. Queue
B. Array
C. Stack
D. Tree

What is the function of isEmpty() in a queue?
A. Deletes element
B. Checks if queue is empty
C. Inserts element
D. Shows rear element

Queue follows which principle?
A. LIFO
B. FIFO
C. FILO
D. LILO

Which data structure uses both front and rear for operations?
A. Stack
B. Array
C. Queue
D. Linked List

What is the correct array declaration in C?
A. int arr();
B. int arr[] = {1,2,3};
C. arr int[5];
D. int[5] arr;

Which of these is a non-primitive data structure?
A. float
B. boolean
C. stack
D. char

Which function is used to allocate memory at runtime in C?
A. scanf
B. malloc
C. printf
D. define

What is the key difference between data type and data structure?
A. Data type stores data; data structure doesn’t
B. Data structure organizes data; data type defines data
C. Both are the same
D. Data type is a type of data structure

Which of the following is a primitive data structure?
A. Linked List
B. int
C. Queue
D. Tree