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

Questions 21-25 of 100

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

Question 21

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

What is the worst-case time complexity of Binary Search?

Answers for question 21

Question 22

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

Which condition must be met before executing Binary Search on an array?

Answers for question 22

Question 23

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

Worst-case time complexity of Linear Search is -

Answers for question 23

Question 24

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

Which sorting algorithm works on the Divide and Conquer strategy?

Answers for question 24

Question 25

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

With a first-element or last-element pivot strategy, which input arrangement can cause Quick Sort to reach its worst-case time complexity?

Answers for question 25
Scroll to Top