Concurrency in Index Structures Quiz Questions and Answers PDF - 293

MCQ 1461: For dealing with the not-prevented deadlocks, the system constructs

1. Wait-wound graph
2. Wait-for graph
3. Wound-for graph
4. Wound-wait graph

MCQ 1462: A selection operation involving conjunction or a disjunction can be implemented using the algorithm

1. A8
2. A9
3. A10
4. All of the Above

MCQ 1463: A query for finding the names of all instructors, is

1. Define name from instructor;
2. Define name about instructor;
3. Select name about instructor;
4. select name from instructor;

MCQ 1464: In hashing file organization, a hash function is calculated on some

1. Attribute of each record
2. Attribute of Method
3. Attribute of relation
4. Attribute of sequence

MCQ 1465: Under embedded SQL, the SQL statements are identified at compile time using

1. Runtime
2. Compile time
3. Initiating time
4. Preprocessor