Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 76-80 of 100

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

Question 76

MCQ · Single Correct 1 mark

In double hashing, the probe position is typically determined using:

Answers for question 76

Question 77

MCQ · Single Correct 1 mark

What is the expected search time in a well-designed hash table with a controlled load factor?

Answers for question 77

Question 78

MCQ · Single Correct 1 mark

Which data structure supports efficient prefix lookup for strings?

Answers for question 78

Question 79

MCQ · Single Correct 1 mark

Which algorithm finds a pattern in text using an LPS (longest proper prefix which is also suffix) array?

Answers for question 79

Question 80

MCQ · Single Correct 1 mark

Which string-matching algorithm commonly uses a rolling hash?

Answers for question 80
Scroll to Top