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

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

Which sorting algorithm is comparison-based and guarantees O(n log n) worst-case time while sorting in-place?

Answers for question 61

Question 62

MCQ · Single Correct 1 mark

What is the lower bound for comparison-based sorting in the worst case?

Answers for question 62

Question 63

MCQ · Single Correct 1 mark

Which sorting algorithm can run in O(n + k) time when keys are integers in a bounded range of size k?

Answers for question 63

Question 64

MCQ · Single Correct 1 mark

Which algorithm is suitable for finding a shortest path in an unweighted graph?

Answers for question 64

Question 65

MCQ · Single Correct 1 mark

What is the time complexity of BFS using an adjacency list representation?

Answers for question 65
Scroll to Top