Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ______.
Your input ____
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider a relational database containing the following schemas.
The primary key of each table is indicated by underlying the constituent fields.
SELECT s.sno, s.sname
FROM Suppliers s, Catalogue c
WHERE s.sno = c.sno AND
Cost > (SELECT AVG (cost)
FROM Catalogue
WHERE pno = ‘P4’
GROUP BY pno);
The number of rows returned by the above SQL query is
A
4
B
5
C
2
D
0
3
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?
A
Rectangles with double/bold border
B
Diamonds with double/bold border
C
Ovals that contain underlined identifiers
D
Ovals with double/bold border
4
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Consider three registers R1, R2 and R3 that store numbers in IEEE-754 single precision floating point format. Assume that R1 and R2 contain the values (in hexadecimal notation) 0x42200000 and 0xC1200000, respectively.
If R3 = $${{R1} \over {R2}}$$, what is the value stored in R3?
