Gujarat University 2007 B.E Computer Engineering-Database Management System - Question Paper
2/60 Candidate's Seal No _
GUJARAT UNIVERSITY B. E. Sem IJI (C.E.) (Old) Examination Database Management System Thursday, 3rd January, 2008} [Time : 3 Hours
Max.. Marks : 100
Instructions : (1) Attempt all questions.
(2) Answer to the two sections must be written in separate answer hooks.
(3) Assume suitable data if required.
(4) Figures to the right indicate lull marks.
SECTION I
1 Answer Followings: (Any Five) *0
a) Give definition of DBMS.
*
b) Explain instances and schemas
c) Explain data manipulation and DML.
d) Give functions of DBA.
e) What is Data Miodels.
f) Explain components of Query processor.
2 Give difference between DBMS and File System, 5
OR
2 Explain Specialization and Generalization for B-R Diagrams. 5
3 A university registrars office maintains data about following entities : 8
a) courses including number,credits, syllabus
b) courses offerings, including course number,year,semester,sectiun-number,instr ucto r.
c) students including std-id.name and program.
d) instructors including identification number ..name,department and title Construct B-R diagram.cxpalin all assumption you make about mapping constraints.
4 A) Consider the employee database given below. Give expression in SQL for 12
following queries.(Any Four) (assume values).
a) employee(emp-iiame>strcet,cityj b) company (cpny-name,city)
c) works( emp-na me,cp uy-name, salary )d) m ana ge(emp-name .mng-name)
a) Find the names of all employees who work for SBS.
b) Find all employee who live in same cities as the companies for which they works.
c) Find all employees who earn more Ilian each employee of SBS. tl) Find company that has smallesl payroll.
e) Find those company whose employee earn a higher salary, on average, than the average salarv at SBS.
B) Answer Followings.
a) Explain difference between weak and strong entity set.
b) Explain distinctions among the terms primary key, candidate key and 2 super key.
5 (A) Compute Closure of the following set F of functional dependencies for 5
relation schemas R~(A,B,C,D,E).
A-> BC,CD-> E,B-> D, E-->A.
1 List candidate keys for R.
(B) Explain First, second and Third Normal form. 5
OR
(B) Explain why 4NF is a normal form more desirable than BCNF. 5
6 Explain Followings. (Any Five)
a) conflict serializabi I i ly.
b) Two-Phase Locking Protocol.
o) Deadlock prevention Techniques.
d) Immediate database modification.
e) Sequential file organization.
f) Primary index, Dense and Sparse indices.
7 Explain Adi) properly of Transaction.
8 Answer Followings.(Any Five)
a) What is RAID.
b) Explain steps of query processing.
c) Give Overview of Query Optimization, cl) Explain cache and main memory.
e) Explain Access lime3Seek lime,Dala Transfer rale for performance measures of Disk.
|
Attachment: |
| Earning: Approval pending. |
