Question Discussion & Solution

MCQ

A connected graph T without any cycles is called ........

free graph

no cycle graph

non cycle graph

circular graph

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.

May be

Can't say

Discussion

MCQ

In a graph if e=[u, v], Then u and v are called

endpoints of e

adjacent nodes

neighbors

all of above

Discussion

MCQ

. If every node u in G is adjacent to every other node v in G, A graph is said to be

isolated

complete

finite

strongly connected

Discussion

MCQ

A connected graph T without any cycles is called

a tree graph

free tree

a tree

All of above

Discussion

MCQ

When the Breadth 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

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