Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q161: In the function call stack, what is pushed after the return address?
- A: First argument
- B: Second argument
- C: All arguments in order
- D: Last argument
View Answer
D
Q162: What does the code section of a memory process contain?
- A: Static data
- B: Binary version of the program
- C: Stack pointers
- D: Global variables
View Answer
B
Q163: In which section of memory are global variables stored?
- A: Heap
- B: Stack
- C: Code section
- D: Static data section
View Answer
D
Q164: When are local variables of a function removed from the stack?
- A: Before the function is called
- B: During the function call
- C: After the function execution
- D: They are never removed
View Answer
C
Q165: How does a queue differ from a stack in terms of data handling?
- A: Both use LIFO
- B: Queue uses FIFO, Stack uses LIFO
- C: Both use FIFO
- D: Queue uses LIFO, Stack uses FIFO
View Answer
B
Q166: What operation is used to add an element to the rear of the queue?
- A: dequeue()
- B: enqueue()
- C: front()
- D: insert()
View Answer
B
Q167: What does the dequeue() function return?
- A: The rear element of the queue
- B: The next element to be added
- C: The front element of the queue
- D: NULL
View Answer
C
Q168: In the linked-list implementation of a queue, where are new elements added?
- A: Front of the list
- B: Middle of the list
- C: End of the list
- D: Random position
View Answer
C
Q169: What does the front() function return in a queue implementation?
- A: The last element
- B: The first element
- C: The total number of elements
- D: NULL
View Answer
B
Q170: In a circular array implementation of a queue, what is the main advantage?
- A: Allows infinite elements
- B: Prevents overflow
- C: Utilizes empty spaces in the array
- D: Removes all elements automatically
View Answer
C