Bihar STET Computer Science – Data Structures & Algorithms Set 2

Questions 61-65 of 100

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

Question 61

MCQ · Single Correct 1 mark

How many total edges exist in a Complete Undirected Graph with 'n' vertices?

Answers for question 61

Question 62

MCQ · Single Correct 1 mark

Which string matching algorithm uses a Prefix Function (Pi table) to skip unnecessary character comparisons in O(n + m) time?

Answers for question 62

Question 63

MCQ · Single Correct 1 mark

The Rabin-Karp algorithm uses which technique for efficient string pattern searching?

Answers for question 63

Question 64

MCQ · Single Correct 1 mark

In a Disjoint Set Union (DSU) data structure, Path Compression optimizes which operation?

Answers for question 64

Question 65

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

A collision resolution technique in Hash Tables that attaches a linked list to each bucket slot is called:

Answers for question 65
Scroll to Top