Computer Science Medium PPSC Uploaded: 13 Aug 2026

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

Correct Answer: Option D — Dijkstra's Algorithm

Explanation:

Dijkstra's Algorithm is a well-known graph algorithm used to find the shortest path between nodes in a weighted graph.

0 views Back to Computer Science

Submitted by: PaperMCQs

What is a Trojan horse in computing?

Which of the following is used to structure content on a webpage?

Which of the following represents a kilobyte?

What is the main function of an operating system?

What does ACID stand for in database transactions?

What does MS Word primarily deal with?

What is a variable in programming?

What does LAN stand for?

What is a binary tree?

Which of the following is a markup language, not a programming language?