DOEACC Society 2006 DOEACC B Level - B2.2 Introduction to Database Management Systems ( ) - Question Paper

3.4 Closure of a set of attributes D. >ANY
3.5 The normal form of R(ABC) with
F = {A?BC, B?C}
E. Domain calculus
3.6 IN of SQL F. 2nd normal form
3.7 Having clause of SQL G. Relational algebra operation
3.8 Where clause of SQL H. External Model
3.9 The normal form of R(ABC) with
F = { A ?BC, B?A}
I. 3rd Normal form
3.10 Natural join J. Functional dependency
K. BCNF
L. =ANY
M. Used to eliminate the false tuples from a
table
B2.2-R3 Page three of five July, 2006
4. every statement beneath has a blank space to fit 1 of the word(s) or phrase(s) in
the list beneath. Enter your option in the “tear-off” ans sheet attached to the
ques. paper, subsequent instructions therein. (1 x 10)
A. B+ B. unique C. Views
D. Thomas Write Rule E. unlimited F. 3
G. BCNF H. View I. 6
J. Generalization K. Commit L. 3rd normal form
4.1 Ignoring outdated writes is termed as _______________.
4.2 The maximum number of rows returned by the subsequent SQL query is ________.
choose empno, empname from emp where salary = (select min(salary) from emp);
4.3 A technique where in attributes that are common to several kinds of an entity are
grouped into their own entity, called super kinds is termed as ___________.
4.4 Let R(ABC) be a relation schema with MVD A ?? B. If we know that the tuples
(a,b1,c1), (a,b2,c2) and (a,b3,c3) are in the current instance of R, _____ the number of
other tuples must also exist in the instance R.
4.5 _____ index can occur only 1 per table in SQL.
4.6 Every binary relation is in ____ normal form.
4.7 Range queries are faster ____ tree data structure.
4.8 A table whose rows is not explicitly stored in the database but is determined when
needed is termed as a _________.
4.9 _________ provides support for logical data independence in the relational model.
4.10 _______ primitive set of operations is needed to express division operation of relational
algebra.
B2.2-R3 Page four of five July, 2006
PART TWO
(Answer any 4 ques..)
5. Suppose you have a table for a dance studio. The attributes are dancer’s identification
number, dancer’s name, dancer’s address, dancer’s telephone number, class
identification number, day that the class meets, time that the class meets, instructor
name, and instructor identification number. presume that every dancer takes 1 class,
every class meets only once a week and has 1 instructor, and every instructor can
teach more than 1 class.
Dancer (Dancer ID, Dancer_Name, Dancer_Address, Dancer_Phone,
Class_ID, Class_Day, Class_Time, Instructor_Name, Instructor_ID)
a) Draw an entity-relationship diagram (ERD) for this database.
b) Convert into a collection of 3NF relations.
(5+10)
6.
a) State any 5 advantages of DBMS?
b) Mention any 3 advantages of views?
c) discuss the difference ranging from external, internal and conceptual schemas. How are
these various layers are related to the concepts of logical and physical and physical
data independence.
(5+3+7)
7.
a) Why is it not straightforward to integrate SQL queries with a host programming
language?
b) How cursors addresses the impedance mismatch ranging from host languages and SQL.
c) In what way dynamic SQL is various from embedded SQL?
d) elaborate ACID properties? discuss their significance in DBMS.
(3+4+3+5)
8.
a) Suppose we have a functional dependency of the form X?Y on a relation R. Specify
conditions on X and Y such that X is a candidate key for R. How would you capture an
arbitrary functional dependency X?Y in ER design.
b) Consider a relation schema R (A, B, C, D, E, F, G) and a set of functional dependencies
F = {A?ABCDEFG, CE?A, BD?E, C?B}. provide a loss-less join, dependency
preserving 3NF decomposition of R.
(7+8)
9.
a) Explain, how buffering and caching techniques are used in recovery sub system.
b) What implications would a no steal/force buffer management policy have on check
pointing and recovery?
c) What is deadlock? How does it occur?
(6+5+4)
B2.2-R3 Page five of five July, 2006

Earning:   Approval pending.