Bissoy.com
Doctors Medicines MCQs Q&A

For the network below, the objective is to find the length of the shortest path from node P to node G. Let dij be the length of directed are from node i to node j. Let sj be the length of the shortest path from P to node j. Which of the following equations can be used to find SG ?

For the network below, the objective is to find the length of the shortest path from node P to node G. Let dij be the length of directed are from node i to node j. Let sj be the length of the shortest path from P to node j. Which of the following equations can be used to find SG ? Correct Answer S<sub>G</sub> = min {S<sub>O</sub> + d<sub>OG</sub>, S<sub>R</sub> + d<sub>RG</sub>}

There are two ways to reach the node G, first reach O and then OG or reach R then RG

∴ SG = min {SO + dOG, SR + dRG}

Related Questions

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
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.
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below. The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration ? 
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
You are the administrator of a Windows 2000 Server computer. The server contains one network adapter and is a file and print server for critical company resources. You install a second network adpater in the server and connect it to the same network subnet as the first adapter. You want to ensure that the first adapter is used for all network traffic and the second adapter is used only if the first adapter fails or is disconnected from the network. You also want to ensure that the server always has network connectivity even if one network adapter fails. What should you do?
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 full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?
Your network uses TCP/IP as the only network protocol. Devices on the network are configured to use IP address from the private 10.0.0.0 range. All the client computers on the network runs Windows 2000 Professional. The network includes Windows 2000 Server computers and UNIX servers. User's print jobs are sent to shared printers on a Windows 2000 Server computer named PrintServ that directs the print jobs to print devices attached directly to the network. You have a high-capacity print device that is attached to one of the UNIX servers. The UNIX computer uses the LPR printing protocol, and it's IP address is 10.1.1.99. The name of the printer queue is GIANT. You want users to be able to connect to this printer from their computers. What should you do?
Which statement is correct about telescope: a) The focal length of the objective lens is more than the eyepiece. b) The focal length of the eyepiece is more than the objective lens. c) The aperture of the objective lens is more than the eyepiece. d) The aperture of the eyepiece is more than the objective lens.
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?