Login / Signup

Question

Which of the following statements about Dijkstra’s algorithm is true?

A Works with negative-weight edges but no negative cycles

B Finds shortest paths for directed graphs with negative edges

C Requires all edge weights to be non-negative to guarantee correctness

D Is an algorithm for minimum spanning tree

E Has worst-case time O(E^2) irrespective of data structures

Practice Next

More Algorithms Questions

In a relational database, what is the purpose of a foreign key?
Which of the following describes the difference between Windows and Unix/Linux file systems?
Which of the following best describes the importance of digital signatures?
In the context of inter-process communication (IPC), which of the following mechanisms is used to ensure that only one process accesses a resource at a tim...
Which of the following is a characteristic of a Brute Force Attack?
Which of the following is NOT one of the OWASP Top 10 web security risks?
In a Data Analytics pipeline, which of the following is an advantage of using Dimensional Modelling?
Which command is TCL command
Which of the following is true for a min-heap?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?

Hey! Ask a query

ask-question