Bihar STET Computer Science – Data Structures & Algorithms Set 2

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

A specialized tree data structure used for fast string prefix searching and dictionary lookups is a:

Answers for question 26

Question 27

MCQ · Single Correct 1 mark

What is the time complexity of inserting an element into a Min-Heap of size 'n'?

Answers for question 27

Question 28

MCQ · Single Correct 1 mark

Building a heap (Heapify) from an unordered array of 'n' elements takes optimal time of:

Answers for question 28

Question 29

MCQ · Single Correct 1 mark

Which open addressing collision resolution technique calculates probing sequence as 'hash(key) + $i^2$ mod N'?

Answers for question 29

Question 30

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

In a 0-indexed array representation of a Binary Heap, the parent of a node at index 'i' (i > 0) is at:

Answers for question 30
Scroll to Top