Graph data structure

Graph data structure

Professional Development

20 Qs

quiz-placeholder

Similar activities

Block Chain Technology

Block Chain Technology

Professional Development

20 Qs

STC Boot Camp Assessment

STC Boot Camp Assessment

Professional Development

15 Qs

Programming - Screening Test

Programming - Screening Test

3rd Grade - Professional Development

15 Qs

PythonDS

PythonDS

Professional Development

20 Qs

Data Validation and Organization

Data Validation and Organization

Professional Development

17 Qs

STAAR - Online Tools (English)

STAAR - Online Tools (English)

Professional Development

20 Qs

Lean Six Sigma Green Belt Exam - DEFINE

Lean Six Sigma Green Belt Exam - DEFINE

Professional Development

15 Qs

Python - Heap

Python - Heap

Professional Development

15 Qs

Graph data structure

Graph data structure

Assessment

Quiz

Professional Development

Professional Development

Hard

Created by

Pankaj Kunekar

Used 8+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

True

False

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Free graph

no cycle graph

non cycle graph

circular graph

3.

FILL IN THE BLANK QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What would be the DFS traversal of the given Graph?

ABCED

AEDCB

EDCBA

ADECB

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The topological sorting of any DAG can be done in ________ time

cubic

quadratic

linear

logarithmic

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What sequence would the BFS traversal of the given graph yield?

A F D B C E

C B A F D

A B D C F

A B C D E F

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

In adjacency list representation, space is saved for sparse graphs.

DFS and BSF can be done in O(V + E) time for adjacency list representation. These operations take O(V^2) time in adjacency matrix representation. Here is V and E are number of vertices and edges respectively.

Adding a vertex in adjacency list representation is easier than adjacency matrix representation.

All of the above

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Professional Development