Bihar STET Computer Science – Data Structures & Algorithms Set 3

Questions 26-30 of 100

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

Question 26

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

Which algorithm is used to find the Single Source Shortest Path in a weighted graph with non-negative edge weights?

Answers for question 26

Question 27

MCQ · Single Correct 1 mark

In quadratic probing hash collision resolution, what is the sequence of probe offsets for key k?

Answers for question 27

Question 28

MCQ · Single Correct 1 mark

What is the time complexity to find the median of an unsorted array of N elements using QuickSelect (Hoare's algorithm)?

Answers for question 28

Question 29

MCQ · Single Correct 1 mark

Which operation in a Fibonacci Heap takes O(1) amortized time?

Answers for question 29

Question 30

MCQ · Single Correct 1 mark

In a Directed Acyclic Graph (DAG), topological sorting is possible if and only if:

Answers for question 30
Scroll to Top