Computer Engineering (Semester 4)
TOTAL MARKS: 80
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
1(a) List four significant difference between file processing system and database management system.(5 marks)
1(b) Explain shadow page recovery.(5 marks)
1(c)
Explain the terms. Total participation and partial participation' with example.
(5 marks)
1(d) Explain lossless join decomposition and dependency preserving decomposition.(5 marks)
2(a) Explain conflict serializability and view serializability with examples.(10 marks)
2(b) Construct an ER diagram and relational model for hospital with a set of patients and a set of medical doctors. Patients are treated in a single ward by the doctors assigned to them.Each patient will be treated by a single doctor.Healthcare assistants also attend to the patients, a number of these are associated with each ward. Patient undergoes various tests. Account department managers patient treatment bill and staff payment.Some staff are paid part time and doctor and care assistance work varying amounts of overtime at varying rates(subject to grade).(10 marks)
3(a) What is an attributes? Explain different types of attributes with examples.
(10 marks)
3(b) Write SQL queries for the given database.
Sailor(sid,sname,rating,age)
Boat(bid,bname,color)
Reserves(sid,bid,date)
i) Find the names of sailors who have reserved 'red' boat.
ii) Find the sailor name with highest rank
ii)i Find the average age of sailor.
iv) Find the age of youngest sailor for each rating level.
v) Add the new boat to the database. Assume any values for required attributes.
(10 marks)
4(a) Explain the term super key,primary key,candidate key and foreign key giving suitable examples.(10 marks)
4(b) What is normalization ?Explain 1NF,2NF,3NF,BCNF with suitable examples.(10 marks)
5(a) Explain domain constraints and referential integrity constraints.(10 marks)
5(b) Explain sort-merge join algorithm in query processing.(10 marks)
6(a) Explain following relational algebra operational with examples:
i) set intersection
ii) generalized projection
iii) natural join
iv) Division operator
(10 marks)
6(b) Describe the overall architecture of DBMS with suitable diagram(10 marks)
and 5 others joined a min ago.
teamques10
★ 68k
pedsangini276
• 4.8k