(Please write your Roll No.

immediately)

Roll No. ..................................

First-Term Examination
Fifth Semester [B.Tech] - September 2005 Paper Code : ETCS 309 Subject : Database Management Systems Time : 11/2 Hours Maximum Marks : 30 Note : Attempt any 3 questions in all. Q1 is compulsory. Each question carries 10 marks. Q1 ( a ) What is the primary goal of DBMS? 5x2 ( b ) What are the components of query processor? ( c ) Distinguish between a weak entity set and a strong entity set. ( d ) Define the concept of aggregation with an example. ( e ) Differentiate between DDL and DML. Q2 ( a ) What are the five main functions of database administrator? 5 ( b ) What is a storage manager? List and explain the main components of a storage 5 manager. Q3 ( a ) Distinguish between primary key, candidate key and super key. 3 ( b ) How are composite and multi-valued attributes represented in an ER diagram? 2 ( c ) A database is being constructed to keep track of the teams and games of a 5 sports league. A team has a number of players, not all of whom participate in each game. It is desired to keep track of the players participating in each game for each team, the position they played in that game and the result of the game. Design an ER diagram for this application stating clearly the assumptions made. Choose your favorite game (baseball, cricket...). Q4 ( a ) Consider the following relations for a database that keeps track of business 3x2 trips of salespersons in a sales office: Salesperson (SSN, Name, Start-year, Dept-no) Trip (SSN, From-city, To-city, Departure-date, Return-date, Trip-id) Expense (Trip-id, Account#, Amount) Specify the following queries in relational algebra: a) Give the details (all attributes of trip relation) for trips that exceed Rs 2000/- in expenses. b) Print the SSN of the salesmen who took trips to 'Nepal'. c) Print the total trip expenses incurred by the salesman with SSN='200' ( b ) What are the commonly used aggregate functions used in Relational Algebra? ( c ) Explain the following expressions in relational algebra: 1) Outer join 2) Natural join

2 1+1

(Please write your Roll No. immediately)

Roll No. ..................................

Second-Term Examination\
Fifth Semester [B.Tech] - November 2005 Paper Code : ETCS 309 Subject : Database Management System Time : 11/2 Hours Q1 ( a ) Define the following terms: 1. 2. 3. 4. Normalization Full functional dependency Trivial join dependency Boyce-Codd Normal form 4 2 2 2 Maximum Marks : 30 Note : Attempt any 3 questions in all. Q1 is compulsory. Each question carries 10 marks.

( b ) Describe briefly any two desirable properties of a transaction. ( c ) What is a lossless decomposition? ( d ) Name the different input/output data constraints in SQL. Q2 ( a ) Find the minimal set of functional dependencies from the following given set: PQ --> R PS --> Q QS --> P PR --> Q S --> R ( b ) Consider the following relation: Book (Book-title, Author-name, Book-type, List-price, Author-affiliation, Publisher) Suppose the following functional dependencies exist: Book-title --> Publisher, Book-type Book-type --> List-price Author-name --> Author-affiliation 1. What normal form is the relation in? Explain your answer. (2) 2. Apply normalization until you cannot decompose the relations futher. State the reasons behind each decomposition. (4) Q3 ( a ) Consider the following database. The priamry keys are underlined. Person(driver-id#, name, address) Car(licence, model, year) Accident(report-number, date, location) Owns(driver-id#, license) Participated(driver-id#, licence, report-number, damage-amount)

Construct the following SQL queries for this database: 1. Find the total number of people who owned cars that were involved in accidents in 1990. (2) 2. Find the number of accidents in which the cars belonging to "Ram" were involved. (2) 3. Add a new accident to the database; assume any values for the required attributes. (1) 4. Update the damage amount for the car with the license number "A123" in the accident with the report number "20" to Rs. 5000. ( b ) Differentiate between the working of time stamping techniques and locking techniques of concurrency control. Q4 ( a ) Let the following relational schema be given: EMPLOYEE(SSN, NAME, AGE, DNO) SALARY(SSN, SALARY) WORKS_ON(PROJECT#, SSN) PROJECT(PROJECT#, PROJECT-NAME, PLOCATION) For each of the following queries, give an expression in QUEL and QBE. 1. Display the names of projects at "Delhi". 2. Find the salaries of employees by Name. 3. Retrieve the name and SSN of employees working on Project# A100. 6 ( b ) Explain the following terms: 1. Serializability of schedules 2. Shadow paging 4 Back to top.