Bihar STET Computer Science – Data Structures & Algorithms Set 2

Questions 86-90 of 100

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

Question 86

MCQ · Single Correct 1 mark

What is the time complexity of detecting a cycle in an undirected graph using DSU, including initialization of the sets?

Answers for question 86

Question 87

MCQ · Single Correct 1 mark

In a connected undirected graph (ignoring isolated vertices), an Euler trail exists if the number of odd-degree vertices is:

Answers for question 87

Question 88

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

What is the minimum number of stacks required to implement a queue?

Answers for question 88

Question 89

MCQ · Single Correct 1 mark

In a directed graph, a strongly connected component (SCC) is a maximal subgraph where:

Answers for question 89

Question 90

MCQ · Single Correct 1 mark

Which algorithm computes Strongly Connected Components (SCCs) in a directed graph using two DFS passes?

Answers for question 90
Scroll to Top