Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter



Download Model question papers & previous years question papers

Posted By: Girish Patil       Member Level: Diamond       Posted Date: 31 May 2008

2006 ICFAI University B.E Database Management System Question paper



Course: B.E   University: ICFAI University




Database Management System
Paper Code : ETCS – 309

Note : Attempt any 3 questions in all. Q1 is compulsory. Each question carries 10 marks.

Time : 11/2 Hours
Maximum Marks : 30

Q1


( a )


Define the following terms:

1. Normalization
2. Full functional dependency
3. Trivial join dependency
4. Boyce-Codd Normal form



4

( b )
Describe briefly any two desirable properties of a transaction. 2
( c ) What is a lossless decomposition? 2
( d ) Name the different input/output data constraints in SQL. 2

Q2


( a )


Find the minimal set of functional dependencies from the following given set:
PQ --> R
PS --> Q
QS --> P
PR --> Q
S --> R


4

( 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. 4

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






Return to question paper search

Next Question Paper: B.B.A DEGREE EXAMINATION, MAY 2008 = DISTANCE EDUCATION

Previous Question Paper: Telecommunication Networks

Related Question Papers:


  • Data Structures and Algorithm Analysis (MC211) : October 2007


  • Financial Accounting – I (MB 131) : April 2007


  • Data Communication and Computer Networks (MC241) : January 2008


  • Object Oriented Programming and Java (MC221) : January 2008


  • GROUP 'C' QUANTIATIVE METHODS MB151 OCT 2005


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Editors    Privacy Policy    Terms Of Use   

    ISC Technologies. 2006 - 2008 All Rights Reserved.