adplus-dvertising
frame-decoration

Question

The time required to find shortest path in a graph with n vertices and e edges is:

a.

O(e)

b.

O(n)

c.

O(e^2)

d.

O(n^2)

Answer: (d).O(n^2)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The time required to find shortest path in a graph with n vertices and e edges is:

Similar Questions

Discover Related MCQs

Q. Pre order is also known as:

Q. The equivalent post fix expression for d/(e+f) + b*c is:

Q. Which algorithm has same average, worst case and best case time?

Q. Application of data structure in queue is:

Q. The number of edges in a complete graph with N vertices is equal to:

Q. Which algorithm has same average, worst case and best case time?

Q. Binary search tree is an example of:

Q. What is the time required to insert an element in a stack with linked implementation?

Q. The equivalent postfix expression for d/(e+f) + b*c:

Q. Which one of the following is a physical data structure ?

Q. Which of the following statement is false ?

Q. If the postfix form of a string is ABC+-D*, the actual string is:

Q. Application of data structure queue is:

Q. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

Q. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

Q. A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

Q. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

Q. Which traversal technique lists the nodes of a binary search tree in ascending order?

Q. What is the time required to insert an element in a stack with linked implementation ?

Q. Which of the following statement is false ?