Bihar STET Computer Science – Data Structures & Algorithms Set 2

Questions 46-50 of 100

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

Question 46

MCQ · Single Correct 1 mark

Counting Sort achieves linear O(n + k) running time under which specific condition?

Answers for question 46

Question 47

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

Which auxiliary data structure is fundamentally used in Depth-First Search (DFS) or function recursion?

Answers for question 47

Question 48

MCQ · Single Correct 1 mark

What is the average and worst-case time complexity of Binary Search on a sorted array of 'n' elements?

Answers for question 48

Question 49

MCQ · Single Correct 1 mark

For Binary Search to achieve O(log n) time, which condition is required?

Answers for question 49

Question 50

MCQ · Single Correct 1 mark

What is the time complexity of finding the maximum element in a Max-Heap of size 'n'?

Answers for question 50
Scroll to Top