UTpaper

Free mock tests & test series

Question 101Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

Which of the following is NOT a graph traversal algorithm?

  1. AGreedy
  2. BDivide and Conquer
  3. CDynamic Programming
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (D) More than one of the above

Explanation

Greedy, Divide and Conquer and Dynamic Programming are algorithm design paradigms, not graph traversal algorithms (BFS and DFS are), so more than one option is correct.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 101 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.