Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

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.
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 ?
Consider the following statements regarding the complete incidence matrix (A) of order n × b (a) The elements aij of A = 1, if branch j is associated with node i and orientation is towards node i (b) The element aij of A = -1, if the branch j is the cut set i and the orientation coincide (c) The element aij of A = 1­, if the branch j is associated with node i and orientation is away from node i (d) The element aij of A = 0, if the branch j is not associated with node i Which of the above statements are correct?
Find the node voltage VA.
Branch, Loop and Node Analyses mcq question image
Find the node voltage VA.
Branch, Loop and Node Analyses mcq question image
A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?
There are multiple routes to reach from node 1 to node 2, as shown in the network. The cost of travel on an edge between two nodes is given in rupees. Nodes ‘a’, ‘b’, ‘c’, ‘d’, ‘e’, and ‘f’ are toll booths. The toll price at toll booths marked ‘a’ and ‘e’ is Rs. 200, and is Rs. 100 for the other toll booths. Which is the cheapest route from node 1 to node 2?
Suppose on performing reduced error pruning, we collapsed a node and observed an improvement in the prediction accuracy on the validation set. Which among the following statements are possible in light of the performance improvement observed? (a) The collapsed node helped overcome the effect of one or more noise affected data points in the training set (b) The validation set had one or more noise affected data points in the region corresponding to the collapsed node (c) The validation set did not have any data points along at least one of the collapsed branches (d) The validation set did have data points adversely affected by the collapsed node
The number of distinct nodes the following struct declaration can point to is . . . . . . . .
struct node{ struct node *left; struct node *centre; struct node *right;};
What is the voltage drop across R1?
Branch, Loop and Node Analyses mcq question image