Data Structures MCQs

Correct answer C. 11

Correct answer C. It finalises a vertex's distance when the vertex is removed from the queue, assuming later paths cannot be shorter

Correct answer C. 4

Correct answer B. Every level is completely filled except possibly the last, which is filled from left to right

Correct answer A. 50, 30, 20, 40, 70, 60, 80

Correct answer B. 11

Correct answer C. Floyd's tortoise and hare algorithm

Correct answer A. O(1)

Correct answer B. O(n)

Correct answer B. To remove special cases for inserting or deleting at the front of the list

Correct answer A. 4

Correct answer A. Last In, First Out (LIFO)

Correct answer D. 3, 4, 2, 5

Correct answer B. Underflow

Correct answer A. top == MAX − 1

Correct answer C. Stack

Correct answer A. A B C * + D E / −

Correct answer B. A B + C D − *

Correct answer A. 4

Correct answer B. A B C ^ ^