1_2A Graph representation

1_2A Graph representation

University

7 Qs

quiz-placeholder

Similar activities

NLP quiz II

NLP quiz II

University

10 Qs

Pre Test - BIJ Software Solution Training - 13 Aug 2020

Pre Test - BIJ Software Solution Training - 13 Aug 2020

University

10 Qs

ข้อสอบวิชาการใช้เทคโนโลยีดิจิทัลเพื่อการศึกษา (ชุดที่2)

ข้อสอบวิชาการใช้เทคโนโลยีดิจิทัลเพื่อการศึกษา (ชุดที่2)

University

10 Qs

HCI-U1-L3

HCI-U1-L3

University

10 Qs

DBMS - Concurrency Control

DBMS - Concurrency Control

University

10 Qs

R variable Data Type and Flow Control Quiz

R variable Data Type and Flow Control Quiz

University

12 Qs

Computer Arch [Basic Input Output Device]

Computer Arch [Basic Input Output Device]

10th Grade - University

10 Qs

COMPUTER HARDWARE OUTPUT

COMPUTER HARDWARE OUTPUT

1st Grade - Professional Development

10 Qs

1_2A Graph representation

1_2A Graph representation

Assessment

Quiz

Computers

University

Hard

Created by

Kinga Pusztai

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

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

7 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What kind of graph do you see in the picture?

directed weighted

undirected weighted

directed unweighted

undirected unweighted

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What kind of graph do you see in the picture?

complete graph

Hamiltonian cycle

cycle but not Hamiltonian

disconnected graph

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

What kind of representation can be seen in the picture?

Textual description

Adjacency matrix

Adjacency list

4.

OPEN ENDED QUESTION

3 mins • 1 pt

Media Image

Enter row 4 of the adjacency matrix of the graph shown in the figure! Separate the numbers with a space!

Evaluate responses using AI:

OFF

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Is it true that in a tree: number of edges= number of vertices+1

True

False

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Is it true that the advantage of adj matrix representation that we can decide in constant time whether there is an edge between i and j.

True

False

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Is it true that the adjacency matrix of a weighted graph contains the weights, infinite or 0.

True

False