Ingrid Barbosa

A delivery driver is working in a neighborhood where the streets are one-way. He serves one restaurant and has received 6 deliveries from different customers in that neighborhood. The graph below represents the routes, respecting the directions of the streets.  The driver must be able to return to the restaurant after serving customers to receive his payment, without violating the street directions. After picking up the orders at the restaurant, and using the Kosaraju–Sharir algorithm, which of the following alternatives is correct?  (a) All customers would receive their orders. (b) Only customers C1 and C3 would receive their orders. (c) Customers C4, C5 and C6 would not receive their orders. (d) Only customer C1 and C2 would receive their order. (e) None of the alternatives. Original idea by Ingrid Barbosa

Consider the DFS time diagram below and analyze which of the graphs shown in the alternatives could correctly represent it.  a)                                                                      b)               c)                                                                       d)              e) None of the above Original idea by: Ingrid Barbosa   

Consider an undirected network, where the node degree vector is \(K = [3, 2, 2, 3, 2, 2]\), and determine if the statements are True or False. I. The maximum possible number of links in this network is 30. II. The average degree of the network is 2.33. III. This network has 6 links. IV. It is possible that the diameter of the network is 3. V. The degree distribution is \( P(2) =  \frac{4}{7} \) , and  \( P(3) =  \frac{2}{7} \). Which of the statements are correct? A) I and II B) II, III and V C) II and IV D) II only E) None of the above. Original idea by: Ingrid Barbosa