Computer Science Hard css fpsc

Which algorithm is commonly used to find the shortest path in a weighted graph?

  • A Bubble Sort
  • B Dijkstra's Algorithm
  • C Binary Search
  • D Depth First Search
Correct Answer: Option B — Dijkstra's Algorithm
Explanation: Dijkstra's Algorithm finds shortest paths in weighted graphs with non-negative edge weights and is widely used in navigation systems.
0 views Back to Computer Science
Related MCQs

What is polymorphism in object-oriented programming?

Click to view answer →

Which device is responsible for connecting different networks together?

Click to view answer →

Which scheduling algorithm gives each process a fixed time slice?

Click to view answer →

What is the purpose of a foreign key?

Click to view answer →

What is the purpose of a firewall?

Click to view answer →
MCQ Details
SubjectComputer Science
DifficultyHard
Exam Typescss, fpsc
CorrectOption B
Practice More
More Computer Science MCQs Take Quick Test