Networks revision

Networks revision

12th Grade

10 Qs

quiz-placeholder

Similar activities

Make a decision!

Make a decision!

11th - 12th Grade

12 Qs

Discrete HW Lesson 37: Review of Unit 4

Discrete HW Lesson 37: Review of Unit 4

8th - 12th Grade

15 Qs

Math 45 Final Exam

Math 45 Final Exam

9th Grade - University

9 Qs

Graphs and Networks

Graphs and Networks

11th - 12th Grade

14 Qs

AQR: Unit 7 Activity 4, 6, & 7 Quiz

AQR: Unit 7 Activity 4, 6, & 7 Quiz

11th - 12th Grade

15 Qs

Hamiltonian Circuits - Discrete Ch 2

Hamiltonian Circuits - Discrete Ch 2

11th - 12th Grade

15 Qs

Graph Review

Graph Review

12th Grade

14 Qs

DMU4D4 Skill Check Euler Path and Circuits

DMU4D4 Skill Check Euler Path and Circuits

11th - 12th Grade

10 Qs

Networks revision

Networks revision

Assessment

Quiz

Mathematics

12th Grade

Hard

Created by

Tim Johnson

Used 32+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 5 pts

Media Image

How do we find the maximum flow from source to sink in a network?

find the minimum cut

find the shortest path

use the Hungarian algorithm

find the minimum spanning tree

2.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

Media Image

How do we find a minimal spanning tree for a network?

highlight the smallest available edge until a spanning tree is created

find the shortest path from one vertex to another

use the Hungarian algorithm

identify the longest path from start to finish

3.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

The Hungarian algorithm is used for:

making an allocation which minimises time or cost

finding the shortest path between two points

finding the minimal spanning tree

finding the maximum flow through a network

4.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

Media Image

The first 3 steps of the Hungarian algorithm, in order, are:

column reduction, row reduction, crossing out

crossing out, row reduction, column reduction

crossing out, column reduction, row reduction

row reduction, column reduction, crossing out

5.

MULTIPLE SELECT QUESTION

1 min • 5 pts

Media Image

In an activity network, how do we find the critical path? (More than one correct answer)

find the shortest path from start to finish

find the longest path from start to finish

find the activities with no slack time (float time)

reduce the duration of an activity

6.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

Media Image

What is an Euler trail?

A journey which uses every vertex exactly once

A journey which uses every edge exactly once

A journey which starts and finishes at the same vertex

7.

MULTIPLE CHOICE QUESTION

45 sec • 5 pts

How do we know if a network has an Euler trail?

there are exactly two even degree vertices

there are an odd number of vertices

there are exactly two odd degree vertices

all vertices have odd degree

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?