DS UNIT 1

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

• Queue
• Graph
• C
• Tree

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

• Linked List
• Hash Table
• Graph
• C. Stack

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

• E. Displays queue size
• B. Checks if queue is empty
• F. Removes all elements
• G. Retrieves front element

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

• LIFO
• FILO
• LILO
• B. FIFO

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

• F. Hash Table
• E. Tree
• C. Queue
• G. Set

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;

• array int arr[5];
• int arr(5);
• int arr = {1,2,3};
• B. int arr[] = {1,2,3};

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

• A. integer
• C. stack
• D. array
• B. string

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

• strcpy
• calloc
• B. malloc
• fopen

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

• C. Data structure is a synonym for data type
• A. Data type can only be numeric; data structure can be any type
• D. Data type is only used in programming languages
• B. Data structure organizes data; data type defines data

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

• D. HashMap
• C. Array
• B. int
• B. String