UTpaper

Free mock tests & test series

Question 131Asked in DSSSB TGT Computer Science, 24 Jun 2023, Shift 3 (4:30 PM)

Which of the following is NOT the application of Divide and Conquer?

  1. ABinary Search
  2. BAll Pairs Shortest Path Problem
  3. CQuick Sort
  4. DStrassen's Matrix Multiplication
Show answerHide answer

Correct answer: (B) All Pairs Shortest Path Problem

Explanation

All-pairs shortest path (Floyd-Warshall) is solved by dynamic programming. Binary search, quick sort and Strassen's multiplication are divide and conquer algorithms.

From DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4:30 PM)

This is question 131 of DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4:30 PM). 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.