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.
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance: function OWNRESOURCES(Resource R) Acquire lock L / / a global lock if R is available then Acquire R Release lock L else if R is owned by another process P then Terminate P, after releasing all resources owned by P Acquire R Restart P Release lock L end if end if end function Which of the following choice(s) about the above scheme is/are correct?
If needed to split a node or coalesce it with its siblings, or redistribute key values between siblings, the crabbing protocol locks the parent of the node in ____________ mode.
If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
Post office protocol (POP) is a message access protocol which is used to extract message for client. In this regard, which of the following are true ? (A) POP has two modes, Delete mode and keep (B) In Delete mode, mail is deleted from mail box after each retrival (C) In Delete mode, mail is deleted from mail box before each retrieval (D) In keep mode, mail is deleted before retrival (E) In keep mode, mail remains in mail box after retrival Choose the correct answer from the options given below:
Let transaction T1 has obtained a shared mode lock S on data item Q and transaction T2 has obtained an exclusive mode lock X on data item R  Consider the following statement. I: T1 can read Q but cannot write Q. II. T2 can read R but cannot write R. Which of the above statements is / are valid?
In crabbing protocol to inset or delete a key value the leaf node has to be locked in ___________ mode.
A multithreaded program P executes with x number of threads used y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-re-entrant. i.e. if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of p can result in a deadlock are:
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?
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 ?