Database Management System · End Term · May 2025 · FN

Consider a non-empty B+-tree of order 17. What are the maximum and minimum number of keys that can be placed in the root node?

Consider the table Bands given below: ID Name Genre YearEstablished 001] Pink Floyd | Progressive Rock 1964 002 | Guns N’ Roses Hard Rock 1985 003 | Black Sabbath | Heavy Metal 1968 004 | Dream Theater | Progressive Rock 1985 005 | Tron Maiden Heavy Metal 1975 006 Opeth Progressive Metal 1990 007 | Led Zeppelin Hard Rock 1968 008 Pantera Groove Metal 1981 009 | Aerosmith Blues Rock 1970 010 Slipknot Groove Metal 1995 Let hash function h(x) generate 16-bit binary hash values for the distinct elements in Genre attribute: Progressive Rock- 1100 0010 1110 0101 Hard Rock- 1000 1010 0101 1110 Heavy Metal- 0111 1100 0011 0110 Progressive Metal- 1110 0101 0000 1101 Groove Metal- 0100 1010 1111 1011 Blues Rock- 0011 1111 1010 0101 If we insert the records in the following order: Pink Floyd, Black Sabbath, Dream Theater, Aerosmith, Pantera, Opeth, Guns N’ Roses, Tron Maiden, Slipknot, Led Zeppelin. Considering bucket size as 2, using dynamic hashing technique, which one of the following denotes the correct distribution of records in hash buckets?

Consider a magnetic disk with 16 platters, 2 surfaces per platter, 1024 tracks per surface, 2048 sectors per track and 512 bytes per sector. The disk rotates at 6000 rpm. What is the disk capacity (in GB)?