Search Header Logo

Networks revision

Authored by Tim Johnson

Mathematics

12th Grade

Used 33+ times

Networks revision
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

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

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?