Which data structure does a program’s run-time system use to manage function calls and recursion?
Correct answer C. Stack
Subject / 609 questions
Programming MCQs
Page 13 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 13 of 31
What is the postfix form of the infix expression A + B * C − D / E?
Correct answer A. A B C * + D E / −
What is the postfix form of the infix expression (A + B) * (C − D)?
Correct answer B. A B + C D − *
Advertisement
What is the value of the postfix expression 8 2 3 * − 4 2 / + ?
Correct answer A. 4
What is the value of the postfix expression 9 3 / 2 ^ 1 + , where ^ means exponentiation?
Correct answer D. 10
What is the postfix form of A ^ B ^ C, where ^ is exponentiation and is right-associative?
Correct answer B. A B C ^ ^
Which data structure is most suitable for checking whether the brackets in an expression such as {} are balanced?
Correct answer A. Stack
In a circular queue implemented with an array of size n, using front and rear indices with one slot always left empty, which condition means the queue is full?
Correct answer D. (rear + 1) % n == front
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
Advertisement
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
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
Advertisement
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
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