Bihar STET Computer Science – Data Structures & Algorithms Set 3

Questions 76-80 of 100

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

Question 76

MCQ · Single Correct 1 mark

Which data structure is suitable for implementing Least Recently Used (LRU) Cache eviction policy in O(1) time?

Answers for question 76

Question 77

MCQ · Single Correct 1 mark

In a Max-Heap with N elements, where are the leaf nodes stored in 0-based array indexing?

Answers for question 77

Question 78

MCQ · Single Correct 1 mark

What is the time complexity of a range-sum query in a standard Segment Tree containing N elements?

Answers for question 78

Question 79

MCQ · Single Correct 1 mark

Which algorithmic paradigm is used in Dijkstra's Shortest Path algorithm?

Answers for question 79

Question 80

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

How many binary heaps are sufficient to implement a priority queue?

Answers for question 80
Scroll to Top