Scribd
Upload
34 views2 pages

Btech All 4 Sem Database Management System Becs2208 2018

1. This document is a past exam paper for the Database Management Systems course from BPUT University. It contains 8 questions testing various concepts related to DBMS including schema architecture, database normalization, transaction management, indexing, and more. 2. Students are required to answer question 1 which is compulsory, and any 5 other questions of their choice. The questions cover topics such as DBMS facilities, schema and subschema, normal forms, relational algebra vs calculus, concurrency control, and database recovery techniques. 3. The document provides the questions, expected answer length for each part, and maximum marks allocated. It serves as a sample exam to help students prepare for the assessment in the DBMS course

Uploaded by

pritishsamal6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views2 pages

Btech All 4 Sem Database Management System Becs2208 2018

1. This document is a past exam paper for the Database Management Systems course from BPUT University. It contains 8 questions testing various concepts related to DBMS including schema architecture, database normalization, transaction management, indexing, and more. 2. Students are required to answer question 1 which is compulsory, and any 5 other questions of their choice. The questions cover topics such as DBMS facilities, schema and subschema, normal forms, relational algebra vs calculus, concurrency control, and database recovery techniques. 3. The document provides the questions, expected answer length for each part, and maximum marks allocated. It serves as a sample exam to help students prepare for the assessment in the DBMS course

Uploaded by

pritishsamal6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

http://www.bputonline.

com

Registration No :

Total Number of Pages : 02 B.Tech.


BECS2208
4th Semester Back Examination 2017-18
DATABASE MANAGEMENT SYSTEM
BRANCH : BIOMED, BIOTECH, CHEM, ENV, FASHION, FAT, METTA, MINERAL,
MINING, MME, PLASTIC, TEXTILE
Time : 3 Hours
Max Marks : 70
Q.CODE : C994
Answer Question No.1 which is compulsory and any five from the rest.
The figures in the right hand margin indicate marks.
Answer all parts of a question at a place.

Q1 Answer the following questions : (2 x 10)


a) What are different DBMS facilities?
b) What is schema and subschema?
c) Define atomicity and aggregation ?
d) What are the primitive operations common to all record management System?
e) What is meant by query optimization?
f) What do database languages do?
g) Compare Non-clustered and clustered index.
h) Enlist the various transaction phases.
i) What is a checkpoint and When does it occur?
j) What is data dictionary?

Q2 a) Draw & explain 3-tier schema architecture of DBMS ? (5)


b) What are the factors of DBMS? (5)

Q3 a) Design an E-R diagram for Banking System. Find out the entity, attributes and (5)
relationships.
b) Check the relation is in which normal form? If required, then convert it into 2nd (5)
normal form. Relation is R(A,B,C,D,E) and functional dependencies are F={ A-
>C, B->E, AB->d }

Q4 a) Write the query using tuple calculus & domain calculus. (5)
Given 3 relations are: Emp(e#, ename, sal)
Assigned-to(e#, p#)
Project(p#, pname, chief)
(i) Display employee no(e#), employee name of those employees either
getting salary more than 5000 or their employee no is greater than
105.
(ii) Display name of the chief under whom ‘Peter’ is working.
(iii) Display employee no and Project no(p#) of those employee whose
chief is ‘Mark’.
b) How B-tree is differentiate from B+ tree? Give an example. (5)

Q5 a) Differentiate between relational algebra and relational calculus with given (5)
example.
b) Why concurrency control is needed? Explain with an example. (5)

http://www.bputonline.com
http://www.bputonline.com

Q6 a) Define & explain ARIES algorithm technique for data base recovery. (5)
b) What is shadow paging? Why it is used? (5)

Q7 Given a relation R(A,B,C,D,E) (10)


F = {A->B, AC->D, D->E, E->A}
Check whether the relation is in 3NFor not. If not decompose into 3NF. Find
out the decomposition is loss-less or lossy.

Q8 Write short answer on any TWO : (5 x 2)


a) Data base failures
b) Serializable Schedule
c) Parallel Data base
d) Data ware house & Data mining

http://www.bputonline.com

You might also like