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

Questions 26-30 of 100

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

Question 26

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

Average and Worst-case time complexity of Merge Sort is -

Answers for question 26

Question 27

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

Which sorting algorithm repeatedly passes through the list, compares adjacent elements, and swaps them if out of order?

Answers for question 27

Question 28

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

Which sorting algorithm builds the final sorted array one item at a time, similar to playing card insertion?

Answers for question 28

Question 29

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

The minimum number of comparisons needed to find the minimum element in an unsorted array of size N is -

Answers for question 29

Question 30

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

A graph traversal technique that uses a Queue data structure is -

Answers for question 30
Scroll to Top