Bihar STET Computer Science – Data Structures & Algorithms Set 3

Questions 86-90 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 86

MCQ · Single Correct 1 mark

Which data structure is inherently used when executing a recursive function?

Answers for question 86

Question 87

MCQ · Single Correct 1 mark

What is the time complexity of topological sort on a DAG with V vertices and E edges using Kahn's algorithm (In-Degree Queue)?

Answers for question 87

Question 88

MCQ · Single Correct 1 mark

In dynamic programming, storing results of subproblems in a lookup table during recursive calls is known as:

Answers for question 88

Question 89

MCQ · Single Correct 1 mark

What is the minimum possible height of a binary tree with 7 nodes, when the root is at height 0?

Answers for question 89

Question 90

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 04.11.2025 (Shift-I) PYQ

Which data structure is best suited for evaluating postfix expressions?

Answers for question 90
Scroll to Top