Bihar STET Computer Science – Full-Length Mock Test 5

Questions 21-25 of 150

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

Question 21

MCQ · Single Correct 1 mark

Which hash collision resolution technique resolves collisions by storing all colliding elements in a linked list at the hash table index?

Answers for question 21

Question 22

MCQ · Single Correct 1 mark

What is the worst-case space complexity of Depth-First Search (DFS) on a graph with maximum depth d?

Answers for question 22

Question 23

MCQ · Single Correct 1 mark

Which algorithm finds All-Pairs Shortest Paths in a weighted directed graph using dynamic programming?

Answers for question 23

Question 24

MCQ · Single Correct 1 mark

In a Queue data structure implementation using a fixed array, what condition indicates a Queue Full state in a Circular Queue?

Answers for question 24

Question 25

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

Which memory management scheme allows the physical address space of a process to be non-contiguous?

Answers for question 25
Scroll to Top