# Data Structures :: Graphs

Home > Technical Aptitude > Data Structures > Graphs > General Questions
NA
SHSTTON
71
Solv. Corr.
67
Solv. In. Corr.
138
Attempted
0 M:3 S
Avg. Time

1 / 12

Choose the correct option.

Which of the following is an invalid path for the following graph?

AC B A

BC D E F G

CC D A C B A

DC D A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
75
Solv. Corr.
97
Solv. In. Corr.
172
Attempted
1 M:28 S
Avg. Time

2 / 12

Choose the correct option.

An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

AO(n)

BO(e)

CO(e+n)

DO(e^2)

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
28
Solv. Corr.
120
Solv. In. Corr.
148
Attempted
0 M:9 S
Avg. Time

3 / 12

Choose the correct option.

A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are

Amore than n

Bmore than n+1

Cmore than (n+1)/2

Dmore than n(n-1)/2

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
71
Solv. Corr.
98
Solv. In. Corr.
169
Attempted
0 M:0 S
Avg. Time

4 / 12

Choose the correct option.

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

An-1

Bn+1

C2n-1

Dn

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
35
Solv. Corr.
104
Solv. In. Corr.
139
Attempted
0 M:0 S
Avg. Time

5 / 12

Choose the correct option.

A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

Agreater than n-1

Bless than n(n-1)

Cgreater than n(n-1)/2

Dless than (n^2)/2

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
27
Solv. Corr.
78
Solv. In. Corr.
105
Attempted
0 M:0 S
Avg. Time

6 / 12

Choose the correct option.

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

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

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

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

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

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
46
Solv. Corr.
84
Solv. In. Corr.
130
Attempted
0 M:0 S
Avg. Time

7 / 12

Choose the correct option.

For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

A2n

B(2n-1)/2

C2e

D(e^2)/2

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
49
Solv. Corr.
98
Solv. In. Corr.
147
Attempted
0 M:10 S
Avg. Time

8 / 12

Choose the correct option.

An adjacency matrix representation of a graph cannot contain information of :

Anodes

Bedges

Cdirection of edges

Dparallel edges

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
94
Solv. Corr.
65
Solv. In. Corr.
159
Attempted
0 M:0 S
Avg. Time

9 / 12

Choose the correct option.

In Breadth First Search of Graph, which of the following data structure is used?

AStack.

BQueue.

DNone of these.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
75
Solv. Corr.
50
Solv. In. Corr.
125
Attempted
0 M:0 S
Avg. Time

10 / 12

Choose the correct option.

For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

Ane

B2n

C2e

De^n

Explanation:

Here is no explanation for this answer

Workspace

## Data Structures Graphs Questions and Answers pdf

At Data Structures topic Graphs, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Graphs, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Graphs MCQs practice question, and one after solving all the question of the respective level, you can refer back your Graphs quiz result any time or you can download it as pdf for reference.

## Data Structures Quiz Online Test

The details of the Data Structures quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures that you see and keep them in mind while answering questions.

## Data Structures MCQs Practice Questions with Answer

On this section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Data Structures Question Quickly. It contains all the Data Structures topic Graphs questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Graphs topic based quiz.

## Data Structures solved examples question

You can get here fully solved Graphs examples with a detailed answer and description. You can solve Graphs problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Graphs. Graphs became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Graphs Examples, Graphs sample questions. You can Evaluate your level of preparation in Graphs by Taking the Q4Interivew Graphs Online Mock Test based on most important questions. All the Graphs practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

## Why Data Structures Graphs?

In this practice section, you can practice Data Structures Questions based on "Graphs" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

## Where can I get Data Structures Graphs questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Graphs) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Graphs quiz questions with answers as PDF files and eBooks.

## Where can I get Data Structures Graphs Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Graphs questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.