Why is a circular queue preferred over a simple linear array queue?
Correct answer D. It reuses array slots freed by dequeues, so space at the front is not wasted
Subject / 421 questions
Programming MCQs
Page 4 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 4 of 22
A circular queue of capacity 5 (indices 0 to 4) starts empty with front = 0 and rear = −1. Five elements are enqueued, two are dequeued and one more is enqueued. What are front and rear now?
Correct answer D. front = 2, rear = 0
What is a deque?
Correct answer B. A queue that allows insertion and deletion at both ends
Advertisement
Which data structure is commonly used to implement a priority queue efficiently?
Correct answer C. Binary heap
A queue is implemented with two stacks, where enqueue pushes onto stack S1 and dequeue pops from S2, refilling S2 from S1 only when S2 is empty. What is the amortised cost of each operation?
Correct answer A. O(1)
In a binary tree where the root is at level 0, what is the maximum number of nodes at level 4?
Correct answer A. 16
What is the maximum number of nodes in a binary tree of height 3, where height is the number of edges on the longest root-to-leaf path?
Correct answer D. 15
A tree has 25 nodes. How many edges does it have?
Correct answer C. 24
A full binary tree, in which every node has either 0 or 2 children, has 10 internal nodes. How many leaves does it have?
Correct answer B. 11
Advertisement
Which description defines a complete binary tree?
Correct answer B. Every level is completely filled except possibly the last, which is filled from left to right
A binary search tree is built by inserting 50, 30, 70, 20, 40, 60, 80 in that order. What is its preorder traversal?
Correct answer A. 50, 30, 20, 40, 70, 60, 80
What does an abstract data type (ADT) specify?
Correct answer D. The operations on the data and their behaviour, without fixing the implementation
Which of the following is a non-linear data structure?
Correct answer B. Tree
Which statement best distinguishes a static data structure from a dynamic one?
Correct answer A. A static structure has a size fixed when it is created, while a dynamic one can grow or shrink at run time
What is the time complexity of accessing the element at a given index in an array?
Correct answer C. O(1)
Advertisement
If an algorithm takes 3n² + 5n + 20 steps for an input of size n, what is its Big-O complexity?
Correct answer D. O(n²)
Which growth rate is the slowest for large values of n?
Correct answer C. O(log n)
What does the space complexity of an algorithm measure?
Correct answer A. How the memory it needs grows with the input size
Which notation gives an asymptotic lower bound on an algorithm’s running time?
Correct answer B. Big-Omega (Ω)
What is the time complexity of searching for a value in an unsorted array of n elements?
Correct answer D. O(n)