Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Chapter: 8
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
Correct Answer:
D
Chapter: 9
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
Correct Answer:
B
Chapter: 9
Q163:
In which section of memory are global variables stored?
A. Heap
B. Stack
C. Code section
D. Static data section
Correct Answer:
D
Chapter: 9
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
Correct Answer:
C
Chapter: 9
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
Correct Answer:
B
Chapter: 9
Q166:
What operation is used to add an element to the rear of the queue?
A. dequeue()
B. enqueue()
C. front()
D. insert()
Correct Answer:
B
Chapter: 9
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
Correct Answer:
C
Chapter: 9
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
Correct Answer:
C
Chapter: 9
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
Correct Answer:
B
Chapter: 9
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
Correct Answer:
C
Chapter: 9
Q171:
What is the purpose of the isFull() function in a queue implemented with an array?
A. Checks if the queue is empty
B. Determines if the array has reached its limit
C. Removes an element from the queue
D. Adds a new element to the queue
Correct Answer:
B
Chapter: 9
Q172:
In C++, where are static variables declared within a function stored?
A. Stack
B. Heap
C. Code section
D. Static data section
Correct Answer:
D
Chapter: 9
Q173:
Which data structure is typically used to simulate real-world processes like bank operations?
A. Stack
B. Queue
C. Array
D. Linked list
Correct Answer:
B
Chapter: 9
Q174:
What is the primary purpose of a simulation program?
A. To simulate memory allocation
B. To model real-world phenomena
C. To optimize code execution
D. To manage stack operations
Correct Answer:
B
Chapter: 9
Q175:
What happens to the front pointer after a dequeue() operation in a linked-list queue implementation?
A. It remains the same
B. It moves to the next node
C. It points to NULL
D. It points to the last element
Correct Answer:
B
Chapter: 9
Q176:
Which function checks if a queue is empty?
A. isFull()
B. front()
C. isEmpty()
D. dequeue()
Correct Answer:
C
Chapter: 9
Q177:
What happens to the rear pointer after an enqueue() operation in a queue implemented using a linked list?
A. It remains the same
B. It moves to the previous node
C. It moves to the newly created node
D. It becomes NULL
Correct Answer:
C
Chapter: 9
Q178:
In a queue, which of the following is not a valid operation?
A. enqueue()
B. dequeue()
C. front()
D. pop()
Correct Answer:
D
Chapter: 9
Q179:
What happens to the memory allocated for a local variable after the function call is completed?
A. It remains allocated
B. It is deallocated
C. It is moved to the heap
D. It is stored in the static data section
Correct Answer:
B
Chapter: 9
Q180:
In an array implementation of a queue, what index change happens when a new element is added?
A. front increases
B. rear increases
C. front decreases
D. rear decreases
Correct Answer:
B