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

Questions 31-35 of 100

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

Question 31

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

A graph traversal technique that uses a Stack or recursion is -

Answers for question 31

Question 32

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

Dijkstra's Algorithm is used for finding -

Answers for question 32

Question 33

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

Which of the following algorithms is used to find a Minimum Spanning Tree (MST) of a weighted graph?

Answers for question 33

Question 34

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

What is a Max-Heap?

Answers for question 34

Question 35

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

Which hash collision resolution strategy handles collisions by storing overflowing keys in linked lists at each bucket?

Answers for question 35
Scroll to Top