Dbms Merged Its Makaut Previous Year Question Set

lOMoARcPSD|26155484
DBMS merged - It's Makaut previous year question set
Computer Science and Engineering (Maulana Abul Kalam Azad University of

Technology)
Studocu is not sponsored or endorsed by any college or university

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)
lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-601/2016_17 zyxwvutsrqponm
......AW,...~......,
~
~ zyxwvutsrqponmlkjihgfedcbaZYXW
MAULANA ABUL KALAM AZAD UNIVERSITY OFzyxwvutsrqpo
TECHNOLOGY,~TBENGAL
Paper Code : CS-601
DATA BASE MANAGEMENT SYSTEM zyxwvutsrqponmlkj
Allotted: 3 Hours
TimezyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
Full Marks: 70 zyxwvutsrqpon
The figures in the margin indicate full marks.

Candidates are required to give their answers in their own
words as far as practicable.
GROVP-A
( Multiple Choice Type QuestiolUl )
1. Choose the correct alternatives for the following:
10 x 1 = 10
i) The information about data in a database is called

a) Metadata
b) Teradata
c) Hyperdata
d) none of these.
ii] What is the highest normal form for the relational
schema Bank?
a) First b) Second
c) Third d) Boycecode.
VI-600101 I Turn over

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-601/2016-17
iii) Which operator performs pattern matching in

SQL?
a) Except b) Intersect
c) Like d) All of these.
iv) Select operation in SQL is a
a) Data query language
b) Data definition languagezyxwvutsrqponmlkjihgfedcbaZYXWV
c) DML
d) DCL.
v) Serializability of concurrent transactionszyxwvutsrqponmlkj

are
ensured by
a) Locking
b) Drop
c) Both of these
d) None of these.
vi) Which index is specified on the non-ordering fields

of a file ?
a) Primary
b) Clustering
c) Secondary
d) None of these.
V!-600101 2

lOMoARcPSD|26155484
CS/B,TECH/CSE/EVEN/SEM-6/CS-601/2016_17
vii) One of the shortcomings of the file system is
a) Data availability
b) Fixed records
c) Sequential records
d) Lack of security.
viii) In the E-R diagram the term 'Cardinality' is

synonymous to
a) Attribute b) ,Degree
c) EntitieszyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONM
d) Cartesian.
ix) The employee salary should not be greater than

Rs. 20,000. This is
a) integrity constraint
b) referential constraint
c) over-defined constraint
d) feasible constraint.
x) What is the name of a trigger that triggers itself?
a) Triggering trigger
b) Cascading trigger
c) Mutating trigger
d) None of these.
VI-600101 3 [Turnover

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-601/2016-17zyxwvutsrqponmlkjihgfedcba
GROUP-BzyxwvutsrqponmlkjihgfedcbaZYX
( Short Answer Type Questions)
x 5 = 15
three of the following. 3zyxwvutsrqponmlk
Answer anyzyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONM
2. Discuss the ACIDproperties of transactions.

3. a) Distinguish between file management system and
database management system.
b) Discuss the role of DBA.

4. What is Cardinality ratio ? What is the difference
between procedural and non-procedural DML ?
Describe different types of attribute.
5. What is closure and minimal cover? What is inclusion
dependency?
6. What is 2-phase locking protocol ? How does it
guarantee serializability ?
GROUP-C
( Long Answer Type Questions)
Answer any three of.the following. 3 x 15 = 45
7. a) Find out the closure of attribute set (AD)i.e. (AD) +

in thezyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIH
R . Set of FD's F are as given below :
R = { A, B, C, D, E J,
FD= {B~ CD,D~ E, B~ A, E~ C, AD~ B}.
b) Find out the candidate keys for R.
VI-600101 4

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-60 1/20 16-17
c) Consider the followingtwo sets ofzyxwvutsrqponmlkjihgfedcba

FDs :zyxwvutsrqponmlkjihgfe
F= {A~ C,AC~D, E~AD,zyxwvutsrqponmlkjihgfedcbaZY

E~ H}
G = {A ~ CD, E ~ AH}.
Check whether they are equivalent. Justify your

answer. 5+5+5
8. Consider the relational database:
Employee ( person-name, street, city )
Works (person-name, company name, salary)
Company ( company name, city)
Manages (person-name, manager-name)
Write down appropriate SQ L statement for the following
queries:
a) Find the name of all employees who work for 'SBI
bank'.
b) Find name, street address, cities of residence of all
employees who work for 'UBI Bank' and earn more
than Rs. 5,00,000 per annum.
c) Find the second highest salary for employees in
'SBI bank'.
d) Find the names of all employees who live in the
same city and on the same street as do their
manager.
e) Find the company that has the most employees.
V!-600101 5 I Turn over

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-601j2016-17
9. a) What are the various states of a transaction ?
Explain with a state diagram.
b) Consider the followingschedule :
Sl: 12zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
(C), 12 (BY, W2 (B), IS (B), IS (C), rl (A),
wI (A), w3 ( B), w3 (C ), r2 ( A ), rl ( B), wi ( B),
uI2 fA).
Is the schedule serializable ?
c) What is cascadeless schedule ? Why is cascadeless

of schedule desired ?
d) Explain log based recovery. 5+5+3+2
If R - (A, B, C, D) and the FDs are

10. a)zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCB
{AB -+ CE, E -+ AB, C -+ D}. Why R is in'2 NF, but
not in 3 NF ? Explain.
b) Show that if a relation schema is in BCNF, then it

is in 3 NF but if a relation schema is in 3 NF then it
is not necessary in BCNF.Giveexamples.
c) What are metadata and data dictionary ?
d) Explain the terms candidate key, primary key,

foreign key and super key, 5+3 + 2+5
V!-600101 6

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-601/2016-17
II. Write short notee on anyzyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPON

three of the following: 3 x 5zyxwvutsr
Armlltrong', axioms
a) zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
b) Time ,tamp based protocol for concurrency

protocol
c:1 1.0&zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
bued recovery
Ordered Index
Deac:Uock.
Vl-600I01 7

lOMoARcPSD|26155484
CS1B.TECH/CSE/EVEN/SEM-6/CS-601/2015_16
hlaulana HllJIKaIam Azad l1nl~rsil)'
01 Tect>noIogy, west Sef'gal
~
~
I'
MAULANA ABUL KALAM AZAD UNIVERSITY OF I'zyx
TECHNOLOGY, WEST BENGAL

Paper Code: CS-601
DATABASE MANAGEMENT SYSTEM
Time Allotted: 3 Hours Full Marks: 70

Candidates are required to give their answers in their own
words as far as practicable.
GROUP-A
( Multiple Choice Type Questions I
1. Choose the correct alternatives for the following:
10xl=10
i) Overall logical structure of a database can be
graphically represented by
al ER diagram bl Records
cl Hierarchy d) Relation.
ii) Which key cannot be null ?
a) Unique key b) Primary key
c) Super key d) Foreign key.
iii) Relational calculus is a
a) Query language •
b) Procedural language
c) Non-procedural language
d) None of these.zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGF
6/60102 [ Turn over
-
. a u zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
= zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
..
lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN /SEM-6/CS-601/2015-16
iv) 2 NF is based on
a) full dependency
b) transitive dependency
c) functional dependency
d) partial dependency.
v) The information about data in a database is called
a) Meta data b) Hyper data
c) Tera data d) None of these.
vi) A row from a table is selected by
a) selection operator
b) projection operator
c) union operator
d) none of these.
vii) Which data type can store unstructured data ?
a) Raw b) Char
c) Numeric d) Varchar.
viii) A normal form in which every non-prime attribute
is fully dependent on prime attribute is
a) 1 NF b) 2 NF
c) 3 NF d) BCNF.
ix) Serializability of concurrent transaction is ensured
by
a) locking b) time stamping
c) both (a) and (b) d) none of these.
x) Transaction follows
a) ACID properties
b) Starvation properties
c) Preemption properties
d) Non-preemption properties.
6/60102 2

lOMoARcPSD|26155484
CS/B.TECH/ CSE/EVEN /SEM-6/CS-60 1/ 20 15-16zyxwvutsrqponmlkjihgf
G R O U P -B
( S ho rt A nsw er Ty pe Questio ns )
3 x 5 = 15
three of the followingzyxwvutsrqponmlkjihgfedcbaZYXWVUTS
Answer anyzyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
2. What is Data dictionary? What do you mean by unary
I'
operations in Relational algebra? Give example. 1+ 4
"
3. Explain two-phase locking protocol.
4. Consider the relation R = { A, B, C, D, E, F, G, H. I,zyxwvutsrqponmlkjihgfedcbaZY
J}
and the set of functional dependencies:
F = { AB -> C, A -> D E , B -> F, F -> GH, D -+ IJ}
Decompose R into 3 NF.

5. Discuss the different levels of views.
6. What is Weak entity set ? Explain with suitable
example.
G R O U P -C
( Lo ng A nsw er Ty pe Questio ns)
Answer any three of the following. 3 x 15 = 45
7. a) Draw the ER diagram of a hospital management
system and explain.
b) . Consider the relation R = { A , B , C, D, E} and the
set of functional dependencies :
F= {A D -+ B , B -+ C, C-+ D}
Find out the candidate key. 10 + 5
8. a) What do you mean by transaction ? Explain the
transaction states.
b) Explain log based recovery and checkpoints.
•
c) What do you mean by shadow paging?
d) What do you mean by deadlock handling? Explain
in detail. 6 + 4 + 2 + 3
[Tum over
6/60102
,.
· .._ .-- zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA

lOMoARcPSD|26155484
CS/B.TECH/CSE/EVEN/SEM-6/CS-60 1/20 15-16
9. Consider the employee database:

Employee (empriame, street, ernpjd]
Works (ernpriame, company_name, salary)
Company (companyriame, city)
Manages (empjtame, manager_name)
Write the appropriate SQL statement on the basis of the
above table :
a) zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
Find the names and cities of residence of all
employees who work for the UBI.
b) Find the names, street addresses and cities of
residence of all employees who work for the UBI
and earn more than Rs. 50,000.
c) Find all employees in the database who do not
work for UBI.
d) Find the 2nd highest salary for employees in UBI.
e) Find the company that has the most employees.zyxwvutsrqpon
5x3
10.zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
a) What are the advantages of normalization?
b) How does BCNF differ from 3rd normal form ?
c) Explain the ACID properties of transactions.
5+5+5
11. Write short notes on any three of the following:
3 x 5 = 15
a) File indexing
b)zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
B + tree
c) Advantages of DBMS
d) Database models
e) Inner join and Outer join.
4°"
JI zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA
;)71
IU ;J:); 6/60102 4
.doo

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
Name : ……………………………………………………………
Roll No. : ………………………………………………………...
Invigilator's Signature : ……………………………………….
CS/B.Tech/CSE/New/SEM-6/CS-601/2013
2013
Time Allotted : 3 Hours Full Marks : 70
om
Candidates are required to give their answers in their own words
as far as practicable
GROUP – A
t.c
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following :
bu
10 1 = 10
i) In the relational mode , cardinality is termed as

yw
a) number of tuples
b) number of attributes
c) number of tables
m
d) number of constraints.
ii) Relational calculus is a
a) procedural language
b) non-procedural language
c) data definition language
d) high level language.
6102 [ Turn over

lOMoARcPSD|26155484
iii) Cartesian product in relational algebra is
a) a unary operator b) a binary operator
c) a ternary operator d) not defined.
iv) DML is provided for
a) description of logical structure of database
b)
om
addition of new structures in the database system
t.c
c) manipulation & processing of database
d) definition of physical structure of database

bu
system.
yw
v) In a relational model, relations are termed as
a) Tuples b) Attributes
m
c) Tables d) Rows.
vi) In case of entity integrity, the primary key may be
a) not Null b) Null
c) both Null & not Null d) any value.
6102 2

lOMoARcPSD|26155484
vii) In an E-R diagram an entity set is represented by a
a) rectangle b) ellipse
c) diamond box d) circle.
viii) Which of the following operations is used if we are
interested in only cetain columns of a table ?
om
a) PROJECTION b) SELECTION
c) UNION d) JOIN.
t.c
ix) Which of the following is a comparison operator in
SQL ?
bu
a) = b) LIKE
yw
c) BETWEEN d) All of these.
x) Using relat onal algebra the query that finds customers,

m
who have a balance of over 1000 is
a) Customer_name( balance > 1000 (Deposit) )
b) Customer_name( balance > 1000 (Deposit) )
c) Customer_name( balance > 1000 (Borrow) )
d) Customer_name( balance > 1000 (Borrow) ).
6102 3 [ Turn over

lOMoARcPSD|26155484
GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 5 = 15
2. Explain in brief 3-schema architecture of DBMS.
3. Explain with example super key, candidate key and primary
key.
4. What is cardinality ratio ? What is the difference between
om
procedural and non-procedural DML ? What is disjointness
constraint ? 1+2+2
5. Describe three layer architecture of DBMS.

t.c
6. Indicate the advantage of DBMS over conventional file
bu
system.
GROUP – C
( Long Answe Type Questions )
yw
Answer any three of the following. 3 15 = 45
7. a) What do you mean by integrity constraint ?
b) What is lossless decompostion ?

m
c) What do you mean by closure ?
d) Suppose that we decompose the schema,
R = ( A, B, C, D ) into ( A, B, C ) and ( A, D, E ).
Show that this decomposition is lossless decomposition,
if the following set F of FDs holds —
A BC, CD E, B D, E A. 2+2+2+9
6102 4

lOMoARcPSD|26155484
8. a) State two-phase commit protocol and discuss the
implications of a failure on the part of
i) the coordinator
ii) a participant, during each of the two phases.
b) Describe the wait-die and wound-wait protocols for
deadlock prevention.
c) Define three concurrency problems : dirty read, non-
repeatable read, phantoms. om

t.c
d) Let T1, T2 and T3 be transactions that operate on the
bu
same data items A, B and C. Let r1(A) mean that T1
reads A w1(A) means that T1 writes A and so on for T2

yw
and T3.
Consider the following schedule :

m
S1 : r2(c), r2(B), w2(b), r3(B), r3(C), r1(A), w1(A), w3(B),
w3(C), r2(A), r1(B), w1(B), w2(A)
Is the schedule serializable ?
e) What are the roles of Analysis, Redo and Undo phases
in the recovery algorithm 'ARIES' ? 4+2+3+3+3
6102 5 [ Turn over

lOMoARcPSD|26155484
9. a) When do we call a relation is in 3NF ?
b) Consider the relation assignment {worker_id,
building_id, startdate, name skilltype} and FDs are
{worker_id->name, (worker_id, building_id)->startdate}.
Is the relation in 2NF ? If not, then make it in 2NF.
c) Describe Boyce-Codd normal form with example.
om
d) What is Query Tree ? Why we need query tree ?
Consider the query "SELECT EMP_NAME FROM

t.c
EMPLOYEE, WORK_ON, PROJECT WHERE
PROJECT_NAME='ASSEMBLY' AND PRJ_NO='P1'AND

bu
JPOIN_DATE='21-12-12'. Construct a query tree for
this query. 1+4+3+(1+2+4)

yw
10. a) What is trnasacton ?
b) What is ACID property ?

m
c) Explain with example serial and serializable schedule.
d) What are the problems of concurrent execution of
transaction ?
e) Explain with the help of precedence graph the conflict
and non-conflict serializability. 1+3+4+3+4
6102 6

lOMoARcPSD|26155484
11. Write short notes on any three of the following : 3 5
a) Functional dependency
b) Dead lock
c) Transaction state diagram
d) B-tree
om
e) Data Dictionary.
t.c
bu
yw
m
6102 7 [ Turn over

lOMoARcPSD|26155484
Name : ……………………………………………………………
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/B.Tech/CSE(O)/SEM-5/CS-502/2012-13
2012
om
Candidates are required to give their answers in their own words
as far as practicable
GROUP – A
t.c
1. Choose the correct alternatives for the following : 10 × 1 = 10

bu
i) Which is not a function of DBA ?
a) Schema defination
yw
b) Gran ing of authorization for data access
c) Designing security
m
d) Defination triggers.
ii) The entity integrity constraint sates that
a) no primary key value can be null
b) a part of the key may be null
c) duplicate object values are allowed
d) none of these.
5301(O) [ Turn over

lOMoARcPSD|26155484
iii) Which one of the following is correct ?

a) All functional dependencies are many-to-many
relationships
b) All functional dependencies are many-to-one
relationships
c) All functional dependencies are one-to-one-
relationships
d) None of these.
iv) What does an attribute mean ?
a) Property of an entity
b) Something about which we collect data
om
c) Something which relates the existing entities
d) Relation of two entities.
v) Which of the following problems do concurrency
t.c
controls deal with ?
a) Lost updates
b) Inconsistent retrievals
bu
c) Uncommitted dependency
d) All of these.
vi) In 2-phase lo king a transaction must
yw
a) release all it locks at the same time

b) NOT obtain any new locks once it has started
releasing locks
m
c only obtain locks on items not used by any other

transactions
d) ensure that deadlocks will never occur.
vii) Which one of the following is not true about a B-tree ?
a) All nodes including the root must be at least half
full
b) All leaf nodes must be at the same level
c) All nodes with k keys except the leaves must have
k + 1 descendents
d) The height of the tree grows when the root splits.
5301(O) 2

lOMoARcPSD|26155484
viii) Which one of the following is not an indexing

technique ?
a) Primary index b) Secondary index
c) Multilevel index d) Sequential index.
ix) Which one of the following is true about domains in
SQL ?
a) SQL domains are user-defined data types
b) SQL domains must be used in data definition
c) SQL domains provide strong typing
d) SQL domains are only synthetic shorthand for
om
system-defined data type.
x) Which one of the following does not always have the
same list of attributes that the operands have ?
a) Project b) Select
t.c
c) Union d) Difference.
GROUP – B
bu
Answer any three of the following. 3 × 5 = 15

2. Discuss the advantages and disadvantages of using DBMS
approach as compared to using a conventional file system. 5
yw
3. Define the concep of generalization, specialization and

aggregation. 5
4. What is closure and minimal cover ? What is inclusion
m
dependency ? 3+2
5. What is 2-phase locking protocol ? How does it guarantee
serializability ? 2+3
GROUP – C
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45
6. a) Discuss the external view, internal view and conceptual
view in three-tier database architecture. How are these
different schema layers related to concepts of logical
and physical data independence ? 6+3
5301(O) 3 [ Turn over

lOMoARcPSD|26155484
b) Write the difference between procedural and non-

procedural DML. 4
c) What do you mean by functional dependency ? 2
7. a) Explain the terms 'partial functional dependency' and
'non-transitive dependency' with example. 4
b) With suitable examples show how recovery in a
database system can be done using LOG file with :
i) immediate updation
ii) differed updation. 6
om
c) What are the ACID properties of a transaction ? Explain.
5
8. a) Define BCNF. How does it differ from 3 NF ? Why is it
considered as stronger than 3 NF ? 5
t.c
b) What is metadata and wh t is data dictionary ? 5
c) Explain the terms candidate key, primary key, foreign
bu
key and super key. 5

9. Write down short notes on any three of the following : 3×5
a) Time-stamp based protocol for concurrency control
yw
b) Wait-Die and wound-wait protocol for dead lock

prevention
c) B + Tree file organisation
m
d) Theta-join
e) Armstrong's axioms
f) Insertion and deletion anamalies
g) Vertical and horizontal fragmentation.
5301(O) 4

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
om
t.c
bu
yw
m

lOMoARcPSD|26155484
Name : ……………………………………………………………
Roll No. : ……………………………………………..…………..
Invigilator's Signature : ………………………………………..
CS/B.TECH(CSE)/SEM-5/CS-502/2011-12
2011
DATABASE MANAGEMENT SYSTEMS
om
The figures in the margin indicate full marks
Candidates are required to give their answers in their own words as
far as practicable.
t.c
GROUP – A
bu
1. Choose the correct alternat ves for any ten of the following :
yw
10 × 1 = 10
i) A top-to bottom relationship among the items in a

m
database is established by a
a) hierarchical schema
b) relational schema
c) network schema
d) all of these.
5301 [ Turn over

lOMoARcPSD|26155484
ii) In relational model, degree of a relation is
a) No. of rows b) schema
c) No. of attributes d) No. of key attributes.
iii) Relational calculus is a
a) procedural language
om
b) non-procedural language
c) query language
t.c
d) normalization technique.
bu
iv) Domain can be d fined as

yw
a) the value of a field b) value of a tuple
c) value of a table d) none of these.

m
v) For R = { J, K, L } F = { JK –>L L –> K }
the candidate keys are
a) J and K b) JK
c) only J d) JK and JL.
5301 2

lOMoARcPSD|26155484
vi) Additional schema for a relationship set is essential in
case of
a) one-to-many relationship
b) many-to-one relationship
c) many-to-many relationship
d) one of these.
vii) Which of the following is true ?
om
a) A super key is always a candidate key
b) Every 3NF schema is also in BCNF

t.c
c) Generalization is a b ttom-up design approach
d) None of these.
bu
viii) Serializability of oncurrent transactions are ensured by
a) locking b) time-stamping
yw
c) both of these d) none of these.
ix) Which of the following is not a DDL statement ?

m
a) ALTER b) DROP
c) CREATE d) SELECT.
x) Which index is specified on the non-ordering fields of a
file ?
a) Primary b) Clustering
c) Secondary d) None of these.
5301 3 [ Turn over

lOMoARcPSD|26155484
xi) A transaction is said to be atomic, if and only if
a) transaction is partially completed
b) transaction is fully completed
c) transaction does not take place
d) none of these.
GROUP – B
om
Answer any three of the following 3 × 5 = 15
2. What is weak entity type ? What will be the schema for

t.c
1 1
representing such entity type i a database table ? 2 +2
2 2
3. Consider the following relations for a database that keeps

bu
track of business trips of salesperson in a sales office :
SALESPERSON ( SSN Name, Start_ Year, Dept_No )

yw
TRIP (SSN, From_City, To_City, Departure_Date, Return_Date,

Trip ID )
m
EXPENSE ( Trip ID, Account#,. Amount )
Specify the following queries in either relational algebra or in

SQL :
a) Give the details ( all attributes of TRIP relation ) for trip

that exceeded Rs. 2,000 in expenses.
b) Print SSN of salesman who took trips to 'Andaman'.
1 1
2 +2
2 2
5301 4

lOMoARcPSD|26155484
4. What is the difference between immediate updation and
deferred updation of database ? Write down the utility of
check point mechanism in log based recovery. 2+3
5. What is functional dependency ? Define foreign key. 2+3
6. In joining two relations when will you prefer merge
algorithm ? Explain, how secondary indexing can help in
om
join operation. 2+3
GROUP – C
t.c
( Long Answer Type Questions )
Answer any three of he following. 3 × 15 = 45
bu
7. Consider the following tab es DEPT ( DCODE, DNAME ),

EMP ( ECODE, ENAME, BASIC, DCODE, DT_JN )
yw
Write down the SQL statements for the following :
a) For each department, show DNAME and total basic of

the employees in the department.
m
b) Find out the name of the departments where no person

is working.
c) Find out the name of the employees who are working in

the department named as 'ABC'.
d) Find out the maximum basic among the employees who

has joined after year 2000. 5+5+3+2
5301 5 [ Turn over

lOMoARcPSD|26155484
8. a) Why is normalization done ? Describe the anomalies.

b) Consider each order has unique order_id for each
order, following information are stored :
order_id, order_dt, customer name, customer address,
salesman name, salesman address and for each
requested item store itemcode, itename, quantity and
rate.
Further assume, following functional dependencies :
salesman name → salesman address
customer name → customer address
om
order_id → order_dt, salesman name, customer name.
order_id, icode → quantity
icode → iname, rate
Normalize the data structure up to 3 µF, showing the
t.c
steps. Indicate PK & FK also. 6+9
9. The IT Training Group ( Kolkata ) has contacted you to create
a conceptual model by using the Entity — Relationship data
bu
model for a database that will meet the information needs for
its training program. Th Company Director has provided the
following description of the training group's operating
yw
environment. The Company has twelve instructors and can

handle up to one hundred trainees per training session. The
Compa y offers five advanced technology courses, each of
m
which is taught by a teaching team of two or more

instructors. Each instructor is assigned to a maximum of two
teaching teams or may be assigned to do research. Each
trainee undertakes one advanced technology course per
training session.
a) Draw an ER diagram for IT Training Group ( Kolkata )
based on the preceding information.
b) Distinguish between Single-valued vs Multi-valued and
Stored vs Derived attributes. 10 + 5
5301 6

lOMoARcPSD|26155484
10. a) Describe ACID properties of a transaction.
b) In a concurrent schedule, when do two instructions

conflict ?
c) Deadlock cannot occur in time stamp based protocol.

Why ?
d) What is cascading rollback ? 4+4+4+3
11. Write short notes on the following :
om
a) Security features in DBMS.
b) Advantages of Database Management system over File

processing system.
t.c
c) Spurious tuples and Dangling tuples. 5+5+5
bu
yw
m
5301 7 [ Turn over

Dbms Merged Its Makaut Previous Year Question Set

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Dbms Merged Its Makaut Previous Year Question Set

Uploaded by

Copyright:

Available Formats

lOMoARcPSD|26155484

DBMS merged - It's Makaut previous year question set

Computer Science and Engineering (Maulana Abul Kalam Azad University of

Studocu is not sponsored or endorsed by any college or university

The figures in the margin indicate full marks.

i) The information about data in a database is called

VI-600101 I Turn over

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

iii) Which operator performs pattern matching in

c) Like d) All of these.

iv) Select operation in SQL is a

a) Data query language

b) Data definition languagezyxwvutsrqponmlkjihgfedcbaZYXWV

v) Serializability of concurrent transactionszyxwvutsrqponmlkj

vi) Which index is specified on the non-ordering fields

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

vii) One of the shortcomings of the file system is

viii) In the E-R diagram the term 'Cardinality' is

ix) The employee salary should not be greater than

x) What is the name of a trigger that triggers itself?

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

2. Discuss the ACIDproperties of transactions.

b) Discuss the role of DBA.

7. a) Find out the closure of attribute set (AD)i.e. (AD) +

FD= {B~ CD,D~ E, B~ A, E~ C, AD~ B}.

b) Find out the candidate keys for R.

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

CS/B.TECH/CSE/EVEN/SEM-6/CS-60 1/20 16-17

c) Consider the followingtwo sets ofzyxwvutsrqponmlkjihgfedcba

F= {A~ C,AC~D, E~AD,zyxwvutsrqponmlkjihgfedcbaZY

Check whether they are equivalent. Justify your

V!-600101 5 I Turn over

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

9. a) What are the various states of a transaction ?

Explain with a state diagram.

b) Consider the followingschedule :

wI (A), w3 ( B), w3 (C ), r2 ( A ), rl ( B), wi ( B),

Is the schedule serializable ?

c) What is cascadeless schedule ? Why is cascadeless

d) Explain log based recovery. 5+5+3+2

If R - (A, B, C, D) and the FDs are

{AB -+ CE, E -+ AB, C -+ D}. Why R is in'2 NF, but

b) Show that if a relation schema is in BCNF, then it

c) What are metadata and data dictionary ?

d) Explain the terms candidate key, primary key,

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

II. Write short notee on anyzyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPON

b) Time ,tamp based protocol for concurrency

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

TECHNOLOGY, WEST BENGAL

The figures in the margin indicate full marks.

6/60102 [ Turn over

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

CS/B.TECH/ CSE/EVEN /SEM-6/CS-60 1/ 20 15-16zyxwvutsrqponmlkjihgf

Decompose R into 3 NF.

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

CS/B.TECH/CSE/EVEN/SEM-6/CS-60 1/20 15-16

9. Consider the employee database:

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)

Downloaded by aritra ghosh (aritraghosh.burd@gmail.com)