Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.
Your company is running IGRP using an AS of 10. You want to configure EIGRP on the network but want to migrate slowly to EIGRP and don't want to configure redistribution. What command would allow you to migrate over time to EIGRP without configuring redistribution?
To enable EIGRP, which of the following would you use?
1. Router1(config-if)# ipv6 ospf 10 area 0.0.0.0
2. Router1(config-if)# ipv6 router rip 1
3. Router1(config)# ipv6 router eigrp 10
4. Router1(config-rtr)# no shutdown
5. Router1(config-if)# ipv6 eigrp 10
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
Which of the following statements are comes for Network Critical Path? 1. The path of critical activities, which links the start and end events is critical path 2. It is the path of activities having zero float 3. It is the path of events having zero slack 4. The sum of the duration of the critical activities along a critical path gives the duration of the Project
Consider a network with nodes 1, 2, 3, 4, 5 and 6. The nodes are connected with directed arcs as shown in the table below. The respective costs (in INR) incurred while traversing the directed arcs are also mentioned. Directed arcs  1 → 2 1 → 3 2 → 4 2 → 5 3 → 2 3 → 4 3 → 5 4 → 5 4 → 6 5 → 6 Cost (in INR) 3 9 3 2 2 4 8 7 2 2 The second shortest path from node 1 to node 6 (i.e. the path that has the second least total cost and does not use any part of the shortest path) has a total cost (in INR) of
Study the following information carefully and answer the questions that follows. 5 persons Anil, Bhagat, Ishan, Deepak and Parmish use 5 different apps namely, WhatsApp, Instagram, Twitter, Facebook and LinkedIn. They all wear different brands of shoes namely, Adidas, Reebok, Nike, Puma and Vans. The person who wears Puma shoes does not uses Facebook. Parmish wear Nike shoes and uses LinkedIn app. Anil who wear Adidas shoes but neither uses Facebook nor Twitter. Ishan neither wear Vans nor Puma shoes but he uses Twitter app. The person who uses WhatsApp doesn’t wear Adidas shoes. Bhagat uses Facebook app. Deepak wear which shoes brand, and also determine who uses Instagram?
Consider the following statement associated with critical path: 1. Critical path is the most important sequence of activities which has no float and which determine the project completion period 2. Critical path is the largest path with shortest duration within which the project can be completed 3. The difference between early start time and late finish time must be equal to the activity duration 4. Cannot pass through dummy activity Which is among the above are correct statements? 
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Which is true regarding EIGRP successor routes?
1. A successor route is used by EIGRP to forward traffic to a destination.
2. Successor routes are saved in the topology table to be used if the primary route fails.
3. Successor routes are flagged as "active" in the routing table.
4. A successor route may be backed up by a feasible successor route.
5. Successor routes are stored in the neighbor table following the discovery process.