Bissoy.com
Doctors Medicines MCQs Q&A

If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks.

If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks. Correct Answer shared and intention-exclusive (SIX) mode

There is an intention mode associated with shared mode, and there is one with an exclusive mode.

Related Questions

If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.
If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks.
If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called
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.
Two statements are given and some conclusions are given as well. Assume the given statements to be true even if they differ from commonly known facts and decide which of the given conclusion(s) is/are logical from the given statements. Statements: I. All houses are locks. II. All locks are shoes. Conclusion: I. Some locks are houses. II. All locks are houses. III. Some shoes are houses. IV. No shoes are houses.
In a lock making factory, 5 percent of the total produced locks were found defective and 80 percent of the non-defective locks were exported. If 85500 non-defective locks were not exported, then how many locks produced? 
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
What does the below definations convey? i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1. ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.
The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.
Assume that multiplying a matrix G1 of dimension ? × ? with another matrix G2 of dimension ? × ? requires ??? scalar multiplications. Computing the product of n matrices G1G2G3…Gn can be done by parenthesizing in different ways. Define Gi Gi+1 as an explicitly computed pair for a given paranthesization if they are directly multiplied. For example, in the matrix multiplication chain G1G2G3G4G5G6 using parenthesization (G1(G2G3))(G4(G5G6)), G2G3 and G5G6 are the only explicitly computed pairs.Consider a matrix multiplication chain F1F2F3F4F5, where matrices F1, F2, F3, F4 and F5 are of dimensions 2 × 25, 25 × 3, 3 × 16, 16 × 1 and 1 × 1000, respectively. In the parenthesization of F1F2F3F4F5 that minimizes the total number of scalar multiplications, the explicitly computed pairs is/are