Bihar STET Computer Science – Data Structures & Algorithms Set 3

Questions 36-40 of 100

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

Question 36

MCQ · Single Correct 1 mark

Which algorithm finds All-Pairs Shortest Paths in a graph with negative edge weights (but no negative cycles)?

Answers for question 36

Question 37

MCQ · Single Correct 1 mark

What is the worst-case search time complexity in a Skip List with N elements?

Answers for question 37

Question 38

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

Which traversal of a Binary Search Tree (BST) containing distinct keys produces the keys in strictly increasing order?

Answers for question 38

Question 39

MCQ · Single Correct 1 mark

What is the time complexity of Kosaraju's algorithm for finding Strongly Connected Components (SCCs)?

Answers for question 39

Question 40

MCQ · Single Correct 1 mark

In a Min-Heap implemented as an array, what is the index of the left child of node at index i (0-based indexing)?

Answers for question 40
Scroll to Top