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

Questions 96-100 of 100

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

Question 96

MCQ · Single Correct 1 mark

Which algorithm finds the maximum sum of a contiguous subarray in linear time?

Answers for question 96

Question 97

MCQ · Single Correct 1 mark

Which algorithm detects a cycle in a singly linked list using slow and fast pointers?

Answers for question 97

Question 98

MCQ · Single Correct 1 mark

What is the amortized time complexity of appending to a dynamic array that doubles its capacity when full?

Answers for question 98

Question 99

MCQ · Single Correct 1 mark

Which graph property is required for a graph to have an Euler circuit in an undirected connected graph, ignoring isolated vertices?

Answers for question 99

Question 100

MCQ · Single Correct 1 mark

For a connected undirected graph, an Euler trail that is not a circuit exists when:

Answers for question 100
Scroll to Top