Menu

Question Discussion & Solution

MCQ
Q.
The maximum degree of any vertex in a simple graph with n vertices is

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
If locality is a concern, you can use ................ to traverse the graph.
forum Discussion
MCQ
2.
A graph with all vertices having equal degree is known as a __________
forum Discussion
MCQ
3.
The Hamiltonian cycles problem uses the following line of code to generate a next vertex, provided x[ ] is a global array and kth vertex is under consideration:
forum Discussion
MCQ
4.
Minimum number of spanning tree in a connected graph is
forum Discussion
MCQ
5.
For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs