Loading subject questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Exams

SSC CGL
UPSC CSE PRELIMS
IBPS PO
RRB NTPC
CDS

Subjects

Mathematics
Physics
General Knowledge
English
Reasoning

Resources

Current Affairs
Search MCQs
Practice Sets

Company

About Us
Contact
Privacy Policy
Terms of Use
Disclaimer
Copyright

Practice library for exams, subjects, and daily revision. For learning purposes only.

© 2026 ObjectiveMcq.ComAll rights reserved

algorithms Previous Year Asked Questions with Answers (English) - ObjectiveMcq

algorithms

Browse

Topics

Graph
- Shortest Path

Subjectsalgorithms

algorithms : PYQs with Answers

Explore topic-wise algorithms questions.

1 questions · Page 1 of 1

GATE CSE 2025 Graph

1.

Which algorithm finds the shortest path from a single source in a weighted graph with non-negative edge weights?

A

Bellman-Ford

B

Floyd-Warshall

C

Dijkstra's algorithm

D

BFS

Correct Answer:

C — Dijkstra's algorithm

Explanation:

Dijkstra's algorithm finds the shortest path from a single source in O((V + E) log V) for non-negative weights. Bellman-Ford handles negative weights but is slower.