Algorithms-Greedy Approach (GATE Computer Science): Questions 8 - 9 of 9

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

Question number: 8

» Algorithms » Greedy Approach

MCQ▾

Question

Bellman –ford-algorithm is based on -

Choices

Choice (4) Response
a.

A Path

b.

A single-source shortest path

c.

A spanning tree

d.

All pair short algorithm

Question number: 9

» Algorithms » Greedy Approach

MCQ▾

Question

Removing a cycle edge________ disconnect a graph.

Choices

Choice (4) Response
a.

Can

b.

Cannot

c.

May be cannot and can

d. None of the above

Sign In