BPSC TRE – Data Structures & Algorithms | Full Subject Test 1 ⋆ CSE Study247

BPSC TRE – Data Structures & Algorithms | Full Subject Test 1

Questions 21-25 of 100

0% completed (0/100 answered)

Question 21

MCQ · Single Correct 1 mark

Previous Year Question BPSC TRE 3.0 PYQ

Which statements correctly describe stack underflow during a pop operation?

A In the common array implementation with top initialized to -1, the condition is top == -1 B A pop is attempted when there is no element available C It occurs when the stack is empty D More than one of the above E None of the above

Question 22

MCQ · Single Correct 1 mark

Previous Year Question BPSC TRE 2.0 PYQ

Convert the infix expression 'A + B * C' to its equivalent postfix (RPN) notation.

A A B C * + B A B + C * C * B C + A D More than one of the above E None of the above

Question 23

MCQ · Single Correct 1 mark

Previous Year Question BPSC TRE 1.0 PYQ

Evaluate the postfix expression: '6 3 2 + * 5 -'

A 20 B 15 C 25 D More than one of the above E None of the above

Question 24

MCQ · Single Correct 1 mark

For a circular queue of capacity N using the conventional full condition (rear + 1) mod $N = front$, which listed condition is the full condition?

A rear == N - 1 B rear == front C rear == N D More than one of the above E None of the above

Question 25

MCQ · Single Correct 1 mark

Which data structure allows insertion and deletion of elements from both ends?

A Stack B Double-Ended Queue (Deque) C Priority Queue D More than one of the above E None of the above

Question 21

Question 22

Question 23

🔢 Step-by-Step Solution

Question 24

Question 25