0% found this document useful (0 votes)
84 views

Database Management System.2pdf

Uploaded by

ADHITAVO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
84 views

Database Management System.2pdf

Uploaded by

ADHITAVO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
COLLEGE OF ENGINEERING, PUNE (An Autonomous Institute of Government of Maharashtra.) SHIVAJI NAGAR, PUNE - 411 005 END Semester Examination (CT-09003) Database Management System Course: B.Tech Branch: Computer Engineering Semester: Sem V Year: 2014-2015 Max. Marks:60 Duration: 3Hours Time- 9 bo 5 p” pate ZS NU 2014 Instructions: weno [TT TT TTI . Figures to the right indicate the full marks. OnRwON= ai Mobile phones and programmable calculators are strictly prohibited. . Writing anything on question paper is not allowed Exchange/Sharing of anything like stationery, calculator is not allowed. Assume suitable data if necessary. . Write your MIS Number on Question Paper Choose the correct alternative for the following questions (each question carries 1. 10 marks). A table has fields F1, F2, F3, F4, and F5 with the following functional dependencies: F1>F3, F2>F4 (F1,F2)>F5 in terms of normalization, this table is in (a)1NF (b) 2NF (c) 3NF (d) None of these Which of the following is TRUE? (a) Every relation in 2NF is also in BCNF (b) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R (c) Every relation in BCNF is also in 3NF (d) No relation can be in both BCNF and 3NF Four DML commands are (a) CREATE, UPDATE, DELETE, SELECT (b) INSERT, UPDATE, DROP, SELECT (c) CREATE, ALTER, DELETE, SELECT (d) INSERT, MODIFY, DELETE, SELECT (e) INSERT, UPDATE, DELETE, SELECT Consider the table Employees (empno, first_name, last_name,total_sales) To list the names and total sales for the employees with the highest TOTAL_SALES (not null value) within the EMPLOYEES tables which is true for the above statement as (a) SELECT first_name, last_name, total_sales FROM employees WHERE total_sales = (SELECT MAX(total_sales) FROM employees); (b) SELECT first_name, last_name, total_sales FROM employees WHERE total_sales >= ALL (SELECT total_sales FROM employees); (c) Both are true (d) None of the above are true An MN relationship can decomposed into (a) two 1:1 relationships (b) a 1:1 relationship and a 1:M relationship (c) two 4:N relationships (d) None of the above If N' number of tables joined should have a (a) Maximum of ‘N-1" join clauses (b) Minimum of ‘1’ join clause (c) Maximum of ‘N’ join clauses (d) Minimum of ‘N-1 join clauses Consider the following relational schema pertaining to a student's database: Students (rolino, name, address ) Enroll( rolino, courseno, coursename) Where primary keys are shown in italics. The number of tuples in the student and Enroll tables are 120 and 8 respectively. What are the maximum and minimum number of tuples that can be present in (Student *Enroll), where * denotes natural join? (2) 8.8 (b) 120,8 (c) 960,8 (d) 960,120 Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? 1. 2 phase locking 2. Time stamp ordering (a) 1 only (b) 2 only (c) both 1 and 2 (d) neither 4 nor 2 A clustering index is defined on the fields which are of type. (a) non key and ordering (b) non key and non-ordering (c) key and ordering (d) key and non-ordering Consider the following schedules involving two transactions. Which one of the following statements is true? $4: 11(X); 11(¥); 12(X); 2); w2(V); WAX) S2: r4(X); F2(X); r2(¥); w2(Y); r1(¥); wA(X) (a) st is conflict serializable and s2 is not conflict serialazable (b) both s1 and s2 are conflict serializable (c) s1 is not conflict serializable and s2 is conflict serializable (d) both s1 and s2 are not conflict serializable What is the difference between DATA BASE MANAGEMENT SYSTEM and 2 RDBMS? What are advantages of DATA BASE MANAGEMENT SYSTEM? 2 Explain how data retrieval, insertion, and deletion are done using B tree or B+ tree indices 6 OR List out various types of Database architecture and explain any one in details. A Driver should own a license to drive. License has license no, license class, license expiry. License can be of type learner license and driver license. Learner license records driver's education. Driver license records restrictions. Driver has the attributes - driver serial number, driver name, driver birth date, driver address, driver city, driver postal code, driver phone. License is issued by branch after taking a4 Qs examination. A branch has branch id, branch name, branch address, branch phone, branch city, branch postal code. Examination taken by driver at a branch records exam date, exam score, exam type. The date when branch issues license is recorded. Construct a clean and concise ER diagram driving license office. List your 6 assumptions and clearly indicate the cardinality mappings as well as any role indicators in your ER diagram. Generate from the E-R diagram the corresponding relational schema using underline 4 for keys. [Sid a Sname Rating ___ | Age eames [48 | Jones 30 (a onan 6 22 | Ahab, aa [ies eaamees Moby _ [Null Assailors instances Consider the following query for above sailors table: Find the names of sailors with a higher rating than all sailors with age < 21. The following two SQL queries attempt to obtain the answer to this question. Do they both compute the result? If not, explain why. Under what conditions would they compute the same result? 1) SELECT S.sname FROM Sailors S WHERE NOT EXISTS ( SELECT * FROM Sailors S2 WHERE S2.age < 21 AND S. rating <= $2.rating ) 2) SELECT * FROM Sailors S WHERE S.rating > ANY ( SELECT S2.rating FROM Sailors S2 WHERE S2.age < 21 ) Consider the relational database as below, where the primary keys are underlined. 5 Employee (PersonName, Street, City) Works (PersonName, CompanyName, Salary) Company (CompanyName, City) Manages (PersonName, ManagerName) Give an expression in the relational algebra and SQL for each of the following queries: (First query is compulsory, Answer any two from rest of three) (i) Find the names of all employees in this database who do not work for BO! (ii) Find the names, street address, and cities of residence of all employees who work for BO! and eam more than $10,000 per annum. (iil) Find the names of all employees in this database who live in the same city as the ‘company for which they work. (iv) Find the names of all employees who earn more than every employee of BO! Discuss the ACID properties of a database transaction Discuss the various types of 2 phase locking protocols. OR In a given schedule with 4 transactions executed concurrently. The order of their operations is given in the table. List out all the conflict operations among all operations and find out whether the given schedule is serializable or not? If not then give valid reason with explanation and graph. a6 Commit wy) Commit {73 14 __] | | wz) | Riz) R(x) | Wy) | | | Wow) | R(x) | wy) | Commit | | Commit | Discuss the insertion, deletion and modification anomalies. Why are they considered 3 bad? Illustrate with an example. Define the first, second and third normal form and convert below table up to 3NF and 7 underline the candidate keys. Project | Project | Project | Project | Employee | Employee | Dept | Dept | Hourly | Code le | Manager | Budget | _No. Namo | No. | Name | Rate PCOI0 | Pensions | M | 24500 | S10001 | ASmith Lood| iT | 22.00 | System _| Philips | _ L PCO10 | Pensions | M 24500 | $10030 | LJones | L023 | Pensions | 18.50 | system_| Phillips 7 _ PCOTO | Pensions; M | 24500 | S2i010 | PLewis Looa{ fT | 21.00 System_| Philips a | PCO4S | Salaries | HMartin | 17400 | Si0010 | BJones [L004] IT | 21.75 System | __ - - | PCOS | Salaries | HMariin | 17400 | S10001 | ASmith [O04] IT | 18.00 | System | - - PCO4S | Salaries | HMarlin | 17400 | S31002 | T Gilbert | L028 | Database | 25.50 |__| system — = | PC04S | Salaries | HMariin | 17400 | S13210 W | L008} Salary | 17.00 ja System Richards | peoes | HR | KLewis | 12250 | S31002 | T Gilbert [L028 | Database | 23.25 System | Pc064 HR Klewis | 12250 | S21010 | PLewis | L004 Tv 17.50 System | Poo6s | HR | KLewis | 12250 | S10034 | BJames | L009 | HR System a i eee ¥f

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy