Noalchali Science and Technology: University Department of Computer Science «nd Telecommunieation Fngincering 3" Year 1 Term B.Se. (Engg.) Final Examination-2024 Course Code: CSTE 3105 Course Title: Database Management System Time: 4 hours. Total Marks: 70 [Answer any seven of the following questions. Figures in the right-hand margin indicate full marks} ¢ a) _ List four significant differences between a file-processing system and a DBMS. 4 b) What are the primary responsibilities of a database administrator (DBA)? 2 3) Discuss about DDL and DML. Write about different types of Data Models. 22 © Ja) “Relations ina relational database must conform eight rules” — Write down the rules. 4 by” Consider the relation employee (emp_id, emp_name, SSN,passport_num, licence_num, 4 dept_id) and department(dept_id, dept_name). = . Define and identify Candidate Key, Super Key, Foreign Key, Alternate Key. ‘c)} Describe foreign key constraints. 2 TA, a Considering the relations from 2(b) write a sql query find the list of all departments along 3 with the number of employees in each department using scalar subquery. b)~ Display all the employees of all departments where number of employees are less than 2. Suppose, you need to attach an instructor including the attributes [D,name,-deptname with — 3 a salary of'$1800 for each student of Music’) department who has earned’ 144 credit/hour’. (Hints: Inset operation) > > List two reasons why null values might be introduced into the database. « 2 K a) Why is view used in DBMS? Classify and explain the yiews in database? b) Explain granting and revoking of privileges to the users with SQL exampler N any Consider the following RDBMS schema: Employee {e_name, street, city} Works{e_name, company_name, salary, city} Company {company_name, city} Manages {e_name, manager_name} Solve the following query using SQL: i) Find the names of employees who are both managed by “Alice” and work for "Bangladesh Bank." ii) Find all employees in the database who earn more than each employee of Sonali bank. 5. 8) The Motor Vehicle Branch administers driving tests and issues driver's licenses. Any person 7 the wens a driver's license must take a Jearer's exam at any Motor Vehicle Branch in the province. If he/she fails the exam, he ear take the exam again any Fine after a week of the aie exam date, at any bsanch. If he passes the exam, he is issued a license (ype = leamer's) weitk sale ligense number. A learner's license may contain a single resrition fo uss it The peso mayetake his driver's exam at ani branch any time before the Ienmsf's Hess cupity date (which is usually set at six months afte the license issue date), cs the exam, the branch issues him a driver's license. A driver's license must also record if the Griver has completed driver's education, for insurance purposes. Create an E-R diagram following these StEPS: ind the entities tio 1 tie entities. 2, Find out the relationships amon’ ee aa Le %%G 5 Figure ut attributes of the entities and (ifany) of the relationship: : ° Page Lofa,4, Figure out constraints between entities and relationships. aes ‘4 by Desoribe strong entity and weak entity set with example and appropriate notion. Convert the E-R diagram ito relational schema indicating all primary keys and foreign 7 COED GRD a GERD) it LecTURER ances [Gae COURsS IO, i Defirie Disjoint and Overlapping with example in Specialization. 3 ia) ‘What are multivalued dependencies, and how do they affect normalization? Explain how to 2+2 deal with multivalued dependencies during the normalization process. | Discuss the significance of normalization in reducing redundancy and improving data integrity. Assume a retail store maintains a database of customer purchases without _ normalization. The following table is used: e Customer ID___|_Customer Name. 001 Emily Davis \ 002, David Smith 001) Emily Davis Purchased Items Purchase Date Laptop, Mouse, Keyboard | 2024-01-15 Smartphone, Laptop 2024-01-20 _| Monitor 2024-01-25 | ‘Normalize this table through INF, 2NF, and 3NF, and explain any assumptions made, ‘What are-the rules for maintaining balance in a B+ Tree during insertions and deletions? 341 How do these rules ensure efficient search operations? Consider inserting the values 15, 25, 35, 45, and 55 into a B+ Tree of order 4. Describe how 343 the tree changes with each insertion, including any necessary splits. What does the final tree look like? ~ a) Consider the following two transactions: ~ TH: Read(A); Read(B); IfA=O then B= B+; Write(B); 12: Read(B); * Read(A); IEB= 0 then Az= A+; Write(A); v Let te consistency requirement be A=O B=0, with A=B=D the:niial values 2 Seow int Sy ail execution involving these two transactions preserves the ‘ . ana execution of T] and 12 that produces a nonserializable schedule, perties of a transaction ‘How do deadlocks occur in a trans 3 ction management system, and what strategies can be 3 employed to detect and resolve them? : ee