Question Discussion & Solution

MCQ

Prims algorithm is based on _____________ method

Divide and conquer method

Dynamic programming

Greedy method

Branch and bound

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In Depth First Search, how many times a node is visited?

Once

Twice

Equivalent to number of indegree of the node

None of the mentioned

Discussion

MCQ

Which of these adjacency matrices represents a simple graph?

[ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

[ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

[ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

Discussion

MCQ

Which of the following ways can be used to represent a graph?

Adjacency List and Adjacency Matrix

Incidence Matrix

Adjacency List, Adjacency Matrix as well as Incidence Matrix

None of the mentioned

Discussion

MCQ

When the Depth First Search of a graph is unique?

When the graph is a Binary Tree

When the graph is a Linked List

When the graph is a n-ary Tree

None of the mentioned

Discussion

MCQ

Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

Leterally connected

Widely Connected

Unliterally connected

Literally connected

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics