Bihar STET Computer Science – Data Structures & Algorithms Set 3

Questions 91-95 of 100

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

Question 91

MCQ · Single Correct 1 mark

Which hash function collision resolution method suffers from Primary Clustering?

Answers for question 91

Question 92

MCQ · Single Correct 1 mark

What is the asymptotic time complexity of finding the Minimum Spanning Tree of a graph using Prim's algorithm with a Fibonacci Heap?

Answers for question 92

Question 93

MCQ · Single Correct 1 mark

In a graph, a simple path that visits every vertex exactly once is called a:

Answers for question 93

Question 94

MCQ · Single Correct 1 mark

What is the time complexity of inserting N elements one by one into an initially empty Binary Search Tree in worst-case?

Answers for question 94

Question 95

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

What is the maximum number of leaf nodes in a binary tree of height h (where height of root is 0)?

Answers for question 95
Scroll to Top