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

Questions 81-85 of 100

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

Question 81

MCQ · Single Correct 1 mark

What is the purpose of path compression in a disjoint-set data structure?

Answers for question 81

Question 82

MCQ · Single Correct 1 mark

What is the amortized time complexity of DSU operations using path compression and union by rank?

Answers for question 82

Question 83

MCQ · Single Correct 1 mark

Which data structure is commonly used for efficient prefix-sum queries and point updates?

Answers for question 83

Question 84

MCQ · Single Correct 1 mark

Which data structure is commonly used for range queries with flexible associative operations and point updates?

Answers for question 84

Question 85

MCQ · Single Correct 1 mark

What is the time complexity of building a binary heap from an array using bottom-up heap construction?

Answers for question 85
Scroll to Top