Question

QUE-1

Consider the directed graph on 8 vertices given by the following set of adjacency lists.
1 -> [3]
2 -> [5,7,8]
3 -> [4,7]
4 -> [1,5,6]
5 -> [6,8]
6 -> [2]
7 -> [8]
8 -> [7]
How many strongly connected components does the graph have?


OPT:

A). 3
B). 4
C). 5
D). 8


QUE.-2

There are 20 cities in Fuschia, with several direct flights each day between the cities. Due to new environmental regulations, the government has limited each airport to at most 50 flights taking off or landing in a day. (That is, the sum of takeoffs and landings in a day cannot exceeed 50.) What is the maximum number of direct flights possible daily between the cities in Fuschia?

A). 400
B). 500
C). 1000
D). 2500

Que- 3

10 rooms, numbered 1 to 10, need to be rewired, but there are constraints on the order in which this can get done.

Rooms 5 and 8 must be rewired before starting on 6
Room 1 must be rewired rewired before starting on 7 and 9
Rooms 4 and 5 must be rewired before starting on 2
Rooms 8 and 10 must be rewired before starting on 5
Room 3 must be rewired rewired before starting on 1 and 4
Rooms 9 and 7 must be rewired before starting on 10
Rooms 9 and 10 must be rewired before starting on 8

Rewiring a room takes one full day. In a day, any number of rooms can be rewired simultaneously provided the constraints above are met. What is the minimum number of days required to complete the rewiring?

A). 10
B). 9
C). 8
D). 7

Answer 1

tá muito difícil n da pra responder

Answer 2

hahahhahahahahahahahahahahahahahah