Question Discussion & Solution

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What can be the applications of Depth First Search?

For generating topological sort of a graph

For generating Strongly Connected Components of a directed graph

Detecting cycles in the graph

All 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

For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

May be

Can't say

Discussion

MCQ

All Graphs have unique representation on paper.

May be

Can't say

Discussion

MCQ

A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

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 Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

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 Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics