
Networks: Flow, matching and scheduling problems
Authored by Akhtar Shamim
Mathematics
11th - 12th Grade
Used 5+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
What is the capacity of the Cut 1
10
12
22
23
2.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
What is the capacity of Cut 3
32
24
19
22
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What does the cut means?
The cut means to break the network
The cut means maximum flow
The cut means to separate source and sink
The cut means to draw a dotted line.
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The maximum flow of this network is
18
19
20
21
5.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
The maximum flow of this network is
22
20
15
13
6.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
p = Earliest starting time for activity P
q = the completion time of the network
r = Latest starting time of activity Q.
The value of r , p and q in the network shown are.
7.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
The immediate predecessor activities for activity D are.
G and F
E and C
C and F
A and C
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?