Posts

13th Quiz Question for Graph Algorithms-Network Sciences (13Q-2S2022)

Image
  Q: Consider the directed graph given below and each edge has a capacity and a flow, except for three edges where flow value is missing and mentioned with x, y, z instead of flow value. which option given below contains the correct missing flow values of x, y, and z? x=3, y=6, z=14 x=2, y=5, z=13 x=4, y=7, z=11 x=6, y=8, z=12 None of the above Original idea by: Meer Muhammad Khan

12th Quiz Question for Graph Algorithms-Network Sciences (12Q-2S2022)

Image
  Q: Consider the undirected graph G given below and the possible prime cliques (complete subgraphs) in this undirected graph G are? 2 4 6 8 None of the above Original idea by: Meer Muhammad Khan

11th Quiz Question for Graph Algorithms-Network Sciences (11Q-2S2022)

  Q: Consider the given statments below: For a power-law network under random failures, the critical threshold fc decreases as γ increases The Mollay-Reed criterion is applicable to any network The removal of a fraction of nodes leaves us with a smaller giant component than the removal of an f fraction of links The critical threshold fc is different for random links removals and random nodes removal in random network   Now select the option that contains exactly the True statements: 1 and 2 are True 1 and 4 are True 1,2 and 3 are True 1 and 3 are True None of the above Original idea by: Meer Muhammad Khan

10th Quiz Question for Graph Algorithms-Network Sciences (10Q-2S2022)

  Q: Consider the directed graph G is given below: {1,2} {3,4} {7,8} {4,1} {3,5} {8,9} {5,6} {2,3} {6,7} {8,5} How many strongly connected components are there in this directed graph G? 1 2 3 4 None of the above Original idea by: Meer Muhammad Khan

9th Quiz Question for Graph Algorithms-Network Sciences (9Q-2S2022)

  Q: By considering the Bianconi–Barabási model for a scale-free network, We have two nodes A and B. The node B has twice the fitness from the fitness of node A. Node B joined the network at time t=100 and node A joned the network at time t=10. And also when a new node joins the network the degree of the nodes increases for every time unit t, What will be possible minimum value of the time unit t starting from which the degree of node B would always be greater than the degree of node A. Select best option from below? t > 100 t > 1000 t > 10000 t > 100000 None of the above Original idea by: Meer Muhammad Khan

8th Quiz Question for Graph Algorithms-Network Sciences (8Q-2S2022)

  Q: By considering the Barabási–Albert model for a network, the degree of a node is k=50, and it joined the network at time t=10, what will be the degree of another node which joined the network at time t=100? 10.53 15.81 21.09 26.37 None of the above Original idea by: Meer Muhammad Khan

7th Quiz Question for Graph Algorithms-Network Sciences (7Q-2S2022)

  Q: The degree of given differential equation y' + y = 5/y' will be? 2 3 5 7 None of the above Original idea by: Meer Muhammad Khan