Question Discussion & Solution

MCQ

Breadth first search __________

Scans each incident node along with its children.

Scans all incident edges before moving to other node.

Issame as backtracking

Scans all the nodes in random order.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is the number of edges present in a complete graph having n vertices?

(n*(n+1))/2

(n*(n-1))/2

Information given is insufficient

Discussion

MCQ

Maximum degree of any vertex in a simple graph of vertices n is

2n - 1

n + 1

n - 1

Discussion

MCQ

Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

The number of paths of length K from vertex Vi to vertex Vj.

Shortest path of K edges from vertex Vi to vertex Vj.

Length of a Eulerian path from vertex Vi to vertex Vj.

Length of a Hamiltonian cycle from vertex Vi to vertex Vj.

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

If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.

May be

Can't say

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