Andhra University 2002 M.Sc Computer Science RELATIONAL DATABASE MANAGEMENT SYSTEMS - Question Paper

M.Sc Degree exam
Second Year - 1st Semester Computer Science

RELATIONAL DATABASE MANAGEMENT SYSTEMS


Time: 3 hours
Maximum: 75 marks

First ques. is compulsory
ans any 4 from the remaining ques.
All ques. carry equal marks
Write all the bits of the 1st ques. at 1 place.

1.
a. Candidate key
b. DBA (Data Base Administrator)
c. Pitfalls in database design
d. Domain Relational Calculus

2.
(a) discuss what the Buffer Manager must do to process a learn request for a page. What happens if the requested page is in the pool but not printed?

(b) discuss about data abstraction.

3.
discuss what is meant by:
(a) Repetition of info
(b) Loss of info
(c) Inability to represent info

discuss why any 1 of the these properties may indicate a bad relational database design.

4. (a) explain briefly about join dependably.

(b) Distinguish ranging from the sparse and dense indexes.

5.
Consider the relation database:
Lives (person-name, street, city)
Works(person-name, company-name, salary)
Located-in(company-name-city)
Manager(person-name, manager-name)

(a) obtain the name of the employer, street, city of all employees who work for 1st Bank Corporation and earn more than $10,000

(b) obtain all employers who earn more than every employee of small bank corporation

(c) obtain all employee name who lives in the identical city as that of manager of 1st Bank Corporation

(d) Delete all the tapes in the works relation employees of Small Bank Corporation

6.
(a) What is the difference ranging from B and B+ trees? explain

(b) Construct a B+ tree for the subsequent set of key values:

2,9,12, 16, 17, 22, 27, 35, 43, 45.

7.
(a) discuss briefly about security specification in SQL.

(b) elaborate disadvantages of database systems?

8.
(a) elaborate the basic consistency issues in transaction management?

(b) elaborate the different kinds of Access Control Mechanisms?

Earning:   Approval pending.