Question Discussion & Solution

MCQ

The given Graph is regular.

data-structure-questions-answers-graph-q5

May be

Can't say

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

All trees with n vertices consists of n-1 edges.

May be

Can't say

Discussion

MCQ

Which of the following is true?

A graph may contain no edges and many vertices

A graph may contain many edges and no vertices

A graph may contain no edges and no vertices

None of the mentioned

Discussion

MCQ

If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ?

?(n)

?(1)

?(log n)

?(log (log n))

Discussion

MCQ

Time complexity to find if there is an edge between 2 particular vertices is _________

O(V)

O(E)

O(1)

O(V+E)

Discussion

MCQ

The output of Kruskal and Prims algorithm is ________________

Maximum spanning tree

Spanning tree

Minimum spanning tree

None of these

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