PYQBOOK

Filter Questions

Found 475 question(s)

Q101 MCQ GATE CS Easy 1 Mark 2024
DBMS → Indexing
In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
Choose One:
Correct Answer:
Explanation:
Q102 NAT GATE CS Hard 2 Marks 2024
DBMS → Indexing
A database of fixed-length records is stored as an ordered file. It has 25,000 records, each 100 bytes, with a 15-byte primary key. The data file is block-aligned. It is indexed by a primary index file (block-aligned ordered file). Block size is 1024 bytes, and a block pointer is 5 bytes. The system uses binary search on the index file (taking ceil(log2 b) accesses for b blocks). Given a key, the number of block accesses required to identify the data block containing the record in the worst case is
Enter Numerical Answer:
Correct Answer:
Explanation:
Q103 MCQ GATE CS Easy 1 Mark 2024
DBMS → Indexing
In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
Choose One:
Correct Answer:
Explanation:
Q104 MSQ GATE CS Medium 2 Marks 2024
DBMS → Relational Design
The symbol -> indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
Choose All Applicable:
Correct Answer:
Explanation:
Q105 MSQ GATE CS Hard 2 Marks 2024
DBMS → Concurrency Control
Consider the following read-write schedule S over three transactions T1, T2, and T3: r1(z); w1(z); r2(x); r3(y); w3(y); r2(y); w2(x); w2(y). Which of the following transaction schedules is/are conflict equivalent to S?
Choose All Applicable:
Correct Answer:
Explanation: