Related InterviewSolutions

• The set of ________ in a precedence graph consists of all the transactions participating in the schedule(a) Vertices(b) Edges(c) Directions(d) None of the mentioned
• Which of the following is a measure of reliability of a disk?(a) Seek time(b) Average latency time(c) Mean time to failure(d) Average seek time
• Which of the following is a part of the Magnetic disk assembly?(a) Spindle(b) Read write head(c) Arm(d) All of the mentioned
• If on every legal database instant, the two expressions generate the same set of tuples, the expressions are called as(a) Equal(b) Equivalent(c) Similar(d) Identical
• Which of the following joins preserves the tuples of the relation on the left side of the operator?(a) Left outer join(b) Natural join(c) Right outer join(d) None of the mentioned
• If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are(a) Non conflict equivalent(b) Equal(c) Conflict equivalent(d) Isolation equivalent
• Search algorithms that use an index are referred to as _________(a) Index scans(b) Search scans(c) Primary scans(d) Equality scans
• The blocks residing on the disk are referred to as ___________(a) Physical blocks(b) Buffer blocks(c) Disk blocks(d) Disk buffer
• If the operations do not wait to produce tuples, then it is called as _________(a) Demand driven pipeline(b) Producer driven pipeline(c) Query driven pipeline(d) None of the mentioned
• A ________ ensures that any conflicting read and write operations are executed in timestamp order(a) Organizational protocol(b) Timestamp ordering protocol(c) Timestamp execution protocol(d) 802-11 protocol