Graph

Graph

Professional Development

8 Qs

quiz-placeholder

Similar activities

PKN dan IPS PPPK

PKN dan IPS PPPK

Professional Development

10 Qs

Strategi Pembelajaran SD Modul 7

Strategi Pembelajaran SD Modul 7

University - Professional Development

10 Qs

company profile & Gen Pro

company profile & Gen Pro

Professional Development

10 Qs

ECG

ECG

University - Professional Development

12 Qs

BÀI TẬP_KIỂU DỮ LIỆU VÀ KHAI BÁO BIẾN

BÀI TẬP_KIỂU DỮ LIỆU VÀ KHAI BÁO BIẾN

Professional Development

10 Qs

QUIZ EMPRESA NOVIEMBRE 2020

QUIZ EMPRESA NOVIEMBRE 2020

Professional Development

11 Qs

Post Test Payfazz 12 Oktober

Post Test Payfazz 12 Oktober

Professional Development

10 Qs

Social Media & Education

Social Media & Education

Professional Development

10 Qs

Graph

Graph

Assessment

Quiz

Professional Development

Professional Development

Practice Problem

Hard

Created by

Purushotham M

Used 7+ times

FREE Resource

AI

Enhance your content in a minute

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

8 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

What would be the number of zeros in the adjacency matrix of the given graph?

10

6

16

0

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which of these adjacency matrices represents a simple graph?

[ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

[ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

[ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What would be the DFS traversal of the given Graph?

AEDCB

ABCED

EDCBA

ADECB

4.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r, u) and d(r, v) be the lengths of the shortest paths from r to u and v respectively, in G. lf u is visited before v during the breadth-first traversal, which of the following statements is correct?

d(r, u) < d (r, v)

d(r, u) > d(r, v)

d(r, u) <= d (r, v)

None of the above

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

Consider the following undirected graph with edge weights as shown:

The number of minimum-weight spanning trees of the graph is ___________

2.5

3.4

1.6

0.7

6.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

Consider the following C++ code

0 1 3 2

0 2 3 1

0 1 2 3

0 2 1 3

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph ?

Depth First Search

Breadth First Search


Prim's Minimum Spanning Tree Algorithm

Kruskal's Minimum Spanning Tree Algorithm

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