S X i. D II. C R F V G B H N U J 210 MAN Q3) Consider the following B+ tree: M SHIV NADAR THEVERGR Discipline: Computer Science and Engineering Course Name: Introduction to Databases Time: 3:00 pm - 4:10 pm I 24 45 K Program: B.Tech, Year: 2022-2023 Date: October 10, 2022 Instructions: 1. This exam has weightage of 20% in your overall 100 points. 2. Be precise in writing your answers. 20 < O 24 65 88 65 72 ser * Suppose you are given the following requirements for a simple database for the National Hockey League (NHL): L the NHL has many teams, each team has a name, a city, a coach, a captain, and a set of players, each player belongs to only one team, each player has a name, a position (such as left wing or goalie), a skill level, and a set of injury records, a team captain is also a player, a game is played between two teams (referred to as host_team and guest_team) and has a date (such as May 11th, 1999) and a score (such as 4 to 2). Construct a clean and concise ER diagram for the NHL database and show all the constraints. (6) P XAD (Q2 Consider a disk with block size B=1024 bytes. A block pointer is p=6 bytes long and a record pointer is R-8 bytes long. A file has 40,000 students' records of fixed length. Each. record has 120 bytes. Assume that un-spanned organization is used to store records and RollNo takes 10 bytes. Suppose that the file is ordered by the key field RollNo and we want to construct a primary index on Roll No. [ ? Exam: Mid-Term Course Code: CSD317 Max. Marks: 35 gi ta li c -14 88 93 Find the number of block access required to retrieve a record from the file using single level index and binary search? Find the number of block access required to retrieve a record from the file using multi-level index? " . 1 Show the B+ tree that results after inserting 52, 59, 73, 87, 48 (in the given order). M (6) B=1024 P = 6 R = 8 file has 40,000 Each record 120 by Roll no 10 3 bytes 1 (5) retur