2018

CS601
mc Allotted: 3 Ilours 70
Thefigures in the margin indicatcful/ marks.
Candidates arc required to give their answers in their words as far as practicab/c

GROUP - A
(Short Answer Type Questions)
Answer any TEN of the follov,ing. 100=10
. Relational calculus is a
z) procedural language b) non-procedural language
c) data definition language d) high level language
1.Normalization is a process of
a) decomposing a set of relations b) successive reduction of relation schema
c) Deciding which attributes in a relation to be grouped together .d)All of These
11.In a relational model, relations are termed as
a) Tuples b) Attributes c) Tables d) Rows.
[v. Which of the .followingoperationsis used if we are interestedin only certain columnsof a
table?
a) Projection b) Selection c) Union d) Join.
v. The relation R={A,B,C} and set of functional dependencies
F={A->B, B->C}. R is decomposed in two different ways:

a) lossless join decomposition b) dependencypreserving

c) Both (a) & (b) d) None of these

The candidate keys are

a) J and K c) only J d) JK and JL
vii. In 2-phase locking a transaction must
a) release all it locks at the same time
b) NOT obtain any new locks once it has started releasing locks
c) only obtain locks on items not used by any other tansactions
d) ensure that deadlocks will never occur.
viii. DML provides following function access to the databae:
a) Retrieve data and / or records b) Add ( or insert ) records
c) Delete records from database files
{x. Which of the following istrue?
a) A super key is always a candidate key 3NFschema is also in BCNF
 is a bottom-up design approach d) None of these.
of concunent transactions are ensured by
b) time-stamping c) both of these d) none of these.
M. of the following is true about domains in SQL?
SQL domains are user-defined data types
SQL domains must be used in data definition
SQL domains provide strong typing
SQL domains are only synthetic shorthand for system-defined data type.
the to modify the intemal schema without causing any change to external schema is
phyical data independence b) logical data independence
extemal data independence d) none of these

GROUP - B
(Short Answer Type Questions)
Answer any THREE of the following. 3x5=1i

is View? View does not take any memory space. —Justify

wait-die and wound-wait protocols for deadlock prevention.
4, is v,eak entity? What will be the schema for representingsuch entity type in a databli

Explain the concept of a trigger with suitable example.

O, do you mean by integrity constraint?
"Primary Key is one type of integrity constraint" - Explain.

GROUP - C
(Long Answer Type Questions)
Answer any THREE of the following.

i) Construct the E-R diagram for Online CoursePortal Svstem

2. What is Vievv2View does not take any memory space. —Justify
3. Explain wait-die and wound-wait protocols for deadlock prevention.
such entity type in a
4, What is weak entity? will be the schema for representing
table?
S. Explain the concept of a trigger with suitable example.
6. What do you mean by integrity constraint?
"Prinmarykey is one tipe of integrity constraint" - Explain.

GROUP - C
(Long Answer Type Questions)
Answer any THREE of the following.

7. i) Construct the E-R diagram for Online Course Portal System using at-least 7 entity seta
state all assumptions that you make.
ii) is the difference between the logical data independence and physical data

8. Consider the following relations:

HOTEL ( hotelno, name, address )
ROOM ( roomno, hotelno, type, price_pn )
BOOKING ( hotelno, guestno, bookid, dateform, dateto, roomno )
GUEST ( guestno, name, address )
SVherethe underlined column names are primary keys
i) »jrite down expressions in relational algebra for the following queries:
a) lisl all the hotels which are situated in Kolkata.

Page.
 Sem-V1/CS601/2018

I}.lech 'CSI i
one of these. b) list all single rooms with a charge below Rs•.1 per
c) list the names of all guests who are going to stay at I
January.
d) list the price per night and type of all rooms at Grand
e) list all guests currently staying at Taj Hotel.
ta type. ii) What is a referential integrity constraint?
eternal schema is iii) What is safe expression in tuple relational calculus?

9. i) Consider the following relational database and answer the queries

EMP (Empno, Ename, Job, Mgr, Hiredate, Sal, Coram, [)eptno)
DEPT ( Deptno, Dname, Loc)
SALGRADE (Grade, Losal, Hisal)
3x5=15 a) Show all employee whose salary is greater than any ones of
b) Show all employees who are eaming the highest salary tn each
c) Show all employees along with their manager.
d) Show the grade of the employee whose name is of exactly 4 char,wters-
ii) What are the different database users?
typein a database
iii) Explain briefly different kinds of Outer Join.

10) i) Explain the following terms:

a) Normalization
2+3—5 b) Full functional dependency
c) Transitive dependency
d) Partial dependency
ii) Explain different types of normal form with examples (upto 5 NF)
 ssjon In tuple relational calculus?

9. i) Consider the following relational database and answer the

queries in SQL.
EMP (Empno, Ename, Job, Mgr, Hiredate, Sal, Comm. Deptno)
DEPT ( Deptno, Dname, Loc)
SALGRADE (Grade, Losal, Hisal)
a) Show all employee whose salary is greater than any one's salary of department IO
b) Show all employees who are earning the highest salary in each department.
c) Show all employees along with their manager.
d) Show the grade of the employee whose name is of exactly 4 characters.
ii) What are the different database users?
iii) Explain briefly different kinds of Outer Join.

10) i) Explain the following terms:

a) Normalization
b) Full functional dependency
c) Transitive dependency
d) Partial dependency
5 NV)
ii) Explain different types of normal form with examples (upto
45 iii) Give with Fds A->C, c->D)
consider the decomposition of R into RI väth FD
and with FD {C->D)
preserving? Explain.
is this decomposition lossless and dependency

the following:
11. Write short notes on any Three of
15
i) Aggregation
ii) Armstrong's axioms
iii) Multivalued Dependency
iv) Query Optimization
v) Clustering
 MAULANA ABUL KALAM
AZAD UNIVERSITYOF
TECHNOLOGY, WEST BENGAL
Paper code : CS-601
DATABASE MANAGEMENTSYSTEM
TimeAllotted: 3 Hours
Full Marks: 70
Thefigures in the margin indicatefull
marks.
Candidates are required to give their
answers in their own words
as far as practicable.

Group —A
(Multiple Choice Type Questions)
1. Choose the correct alternative for the following:
(i) Which of the following is not a property of transaction?
(a) Atomicity (b) Concurrency
(c) Isolation (d) Durability
(ii) Check points are part of
(a) Recoverymeasure (b) Security measure
(c) Concurrency measure (d) Authorization measure
(iii) Tree structures are used to store data in
(a) Network model (b) Relational model
(c) Hierarchical model (d) file based system
(iv) The language that requires a user to specify the data to be retrieved without specifying how to get
it is
(a) ProceduralDML (b) Non procedural DML
(c) ProceduralDDL (d) Non-procedural DDL

(v) The rule that a value of a foreign key must appear as a value of some specific table is called a
(a) Referential constraint (b) Index
(c) Integrity constraint (d) Functional Dependency

Turn
CVA IS
result Should be sorted in ascendinv
(VI) nie clause in SQL tbnt evecificsthat the query is
column
ordet based on the values of one ot more
(b) order by
(a) view
(d) having
(c) group by
(vii) Conflict serializability can be detectedby
(b) precedence graph
(a) WFG
(d) None of these
(c) spanning tree
intermediate level is called
(viii) According to the levels of abstractions the schema at the
(a) Logical schema (b) Physical schema
(c) Subschema (d) Super schema
algebra
(ix) The operation which is not considered as basic operation in relational
(a) Join (b) Selections
(c) Union (d) Cross product
—(x)At is an abstraction through which relationships are treated as higher level entities?
(a) Generalisation (b) Specialisation
(c) Aggregation (d) Inheritence

Group —B
(Short Answer Type Questions)
Answer any three of the following:

2. Describe different 2PL protocol in brief.

3. Consider the following database y,'itbprimary keys underlined

Project (ENQ, P - Name,P - incharge)

Employee E - name)

Assigned —To(E no,

Write relational algebra expression

(a) List detan ofemployee ail

(b) List

4. Whatis
 s mad read if A B •rite (BY.

T2 : read read (A); if B 0, then A A 1; write (AV.

Add lock and unlock instructions to

transaction Tl and T2. Is there any dead lock observed?

6. Explain Armstrong axiom in brief.

Group —C

(Long Answer Type Questions)

Answer any three of the following: 15x3=45

7. (a) Why do we need normalisation?

(b) What are the advantages of database over traditional file system?

(c) Explain the role of database administrator.

(d) Relation assignment (worker-id, building -id, start-date, name, skill).

FD's are —{worker-id —iname, {worker-id, building-id) start date, name -9 skill). Is the relation
in 3 NF, if not then make it in 3NF.
3+4+3+5=15

8. (a) What is the utility of Query Tree?

(b) Describe different phase of a Query Tree.

(c) Consider the employee query "Select work-on, e-name, from

employee, proj-assign project
where p-name -— "ASSEMBLY' and p-no — "PI" and Join-Date
- "21-12-17" and
employee. eno = proj-assign. eno and proj-assign, pno = project. p-no.

(d) 'Trimary keys are candidate keys but reverse is not true."—explain.
3+4+6+2=15

9. (a) What is deadlock? What are necessary' and sufficient condition

for deadlock?
(b) What are the necessary measurement for deadlock avoidance?

3
CUB.

(c) Let Tl, Tz and T, be transactions that operate on the same data items A, B, and C. Let
that Tl read A, WI (A) means that writes A and so on for T2 and T3. Consider the
schedule:

st : rz(C),rz(B), WI : r2(A), (B), WI

Is the schedule serializable?

10. Answer the following queries in SQL using given database schema:
EMP (E no, E name, E add, B date, super-no)
DEPT (D no, D name, mgrno)

PROJECT (P no. P mune, D no, Plocation)

Work-on (E no, D no, Hours)
(a) List E no, E name, E add, mgrno of all employee who work in "Research" department.
(b) For all project in "Kolkata" list p-no, controlling department name. manager
name. address
birth date.
(c) List all project number, project name, manager name which belongs
to "Product" department
(d) List all employee name who works more than 40 hours
in Qseueh" d.artmenc

11, Answer any three questions:

(a) Time stamp ba.cd concurreoeyasntrol
(b) B + tree file organisatioo

Ptimary Index
 6tc.8 i7

MAULANAABUL KALAMAZAD UNIVERSITY OF

TECHNOLOGY, WEST BENGAL
Paper Code : CS-601
DATA BASE MANAGEMENT SYSTEM
Time Allotted : 3 Hours Marks : 70
Thefigures in the margin indicatefull marks.
Candidates are required to give their answers in their own
words as far as practicable.

GROUP - A
( Multiple Choice Type Questions )
I. Choose the correct alternatives for the following.
10x 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) Boyce code.

VI-600101 I Turn over

 CS/B.TECH/CSE/EVEN/SEM-6/CSOOi /

iii) Which operator performs pattern matching in vii) One of the shortcomings of the file system
SQL ?
a) Data availability
a) Except b) Intersect
b) Fixed records
c) Like d) All of these.
c) Sequential records
iv) Select operation in SQLis a
d) Lack of security.
a) Data query language
viii) In the E-R diagram the term
b) Data definition language
synonymous to
c) DML
a) Attribute b) Degree
d) DCL.
c) Entities d) Cartesian.
v) Serializability of concurrenttransactions
•are
ix) The employeesalary should not be grater
ensured by
Rs. 20,000. This is
a) Locking
a) integrity constraint
b) Drop
b) referential constraint
c) Both of these
c) over-defined constraint
d) None of these.
d) feasible constraint.
vi) Which index is specified on the non-ordering fields
x) What is the name of a triggerthat triaers
of a file ?
a) Triggering trigger
a) Primary
b) Cascading trigger
b) Clustering
c) Mutating trigger
c) Secondary
d) None of these.
d) None of these.
VI-600101 3
2
 TCHfCSE/EVEN/SEM-6/CS-601/2016-17
CS/B.TECH/CSE/ EVEN/ /'20
GROUP - B
)
( Short Answer Type Questions c) Consider the following two sets of FDs
3 x 5=15
Answer any three of the following. {A — C, AC —D, E AD, E — H
the ACID properties of transactions. CD, E —yAH}.
a! Distinguish between filenanagement syStem and Check whether they are equivalent. Jusufy
database management system. answer.
Discuss the role of DBA. 8. Consider the relational database :
Employee ( person-name, street, city )
What is Cardinality ratio ? What is the difference
between procedural and non-procedural DML ? Works ( person-name, company name, salary )
Describe different types of attribute. Company ( company name, city )

S What is closure and minimal cover ? What is inclusion Manages ( person-name, manager-name )
dependency ? Write down appropriate SQL statement for the foiiowung
queries :
What is 2-phase locking protocol ? How does it
a) Find the name of all employeeswho work for SBI
guarantee serializability?
bank'.

b) Find name, street address, cities of residence 01 ali

GROUP - C
employees who work for 'UBI Bank*and earn
( Long Answer Type Questions )
than Rs. per annum.
Answer any three of the following. 3 x 15 = 45
c) Find the second highest salary for employees in
Find out the closure of attribute set (AD)i.e. (AD)
'SBI bank'.
in the R , Set of FDs Fare as given below : in the
d) Find the names of all employees who live
same city and on the same street as do
Fry-I B—CD, D. E, A, E -y C, AD— B}. manager.
employees.
Find out the candidate keys for R. e) Find the company that has the most
5 Turt
4 VI-600101
 /2016-17
CS/B.TECH/CSE/EVEN/SEM-6/CS-601/2016-17
transaction ?
the various states of a 11. Write short notes on
any three of the following :
•4th Astate diagram. a) Armstrong's axioms
the followingschedule : b) Time stamp based protocol
for concurrency
protocol
c) Log based recovery
d) Ordered Index
e) Deadlock.
the schedule serializable?

What is cascadeless schedule ? Why is cascadeless

schedule desired ?

Expiam log based recovery. 5+5+3+2

A. B, C D ) and the are

CEOE — AB, C— D). Why R is in 2 NE, but

in 3 NP? Explain.

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

in 3 but if a relation schema is in 3 NFthen it
necessary in BCNF,Give examples.

What are metadata and data dictionary ?

terms candidate key, primary key,

key and super key, 5+3+2+5
VI-600101 7
6
 6;cg 601 / 20 i 16

MAULANAABUL KALAM AZAD UNIVERSITY OF

TECHNOLOGY, WEST BENGAL
Paper Code : CS-601
DATABASE MANAGEMENT SYSTEM
TimeAllotted
:3 Hours Full Marks : 70

Thefigures in the margin indicate full marks.

Candidates are required to give their answers in their own
words as far as practicable.

GROUP - A
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following :
10x 1=10
i) Overall logical structure of a database can be
graphically represented by
a). ER diagram b) Records
c) 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.
6/60102 Turn over
 :EVEN/SEM-6/CS-601/2015-16
'CSF CS/B.TECH/CSE/EVEN/SF.V

on GROUP - B
iv) 2 NFts based
( Short Answer Type Questions )
full dependency Answer anv three of the lotto'*
transitive dependency
2. What is Data dictionary ? What do
functi01haldependency
operations in Relational algebra ? ('live
d) partial dependency.
data in a database is 3. Explain two-phase locking protocol
v) The information about
a) Meta data b) Hyper data 4. Consider the relation R = A. B. C, D, E, F
c) Tera data d) None of these. and the set of functional dependenctes
A row from a table is selected by
a) selection operator Decompose R into 3 NF.
b) projection operator 5. Discuss the different levels of vtews
c) union operator 6. What is Weak entity set ? Explaitl
d) none of these. example.
vti) Which data type can store unstructured data ?
a) Raw b) Char
GROUP - C
c) Numeric d) Varchar. ( Long Answer Type Questions )
viii) A normal form in which every non-prime attrib Answer any three of the
is fully dependent on prime attribute is 7. a) Draw the ER diagram of a hospital
a) system and explain.
d) BCNF. b) Consider the relation R A, B, C, l). E
Serializabilityof concurrenttransaction is ensur set of functional dependenctes
by
a) locking b) . time stamping Find out the candidate key.
c) both (a)and (b) d) none of these. 8. a) What do you mean by transaction ?
Transaction follows transaction states.
a) ACID properties b) Explain log based recovery and checkpoent*
b) Starvation properties c) What do you mean by shadow paging
c) Preemption properties d) What do you mean by deadlock handhng
d) Non-preemption properties. in detail.

6/00102 6/60102 3
2
 TECH/CSE/EVLN/SF.M.6/CS.601/201tY16

9. Consider the employecdatabase .

Employee (cmp_name, street, cmp_id)
Works (emp_name, company_name, salary)
Company (company_name, city)
Manages (emp_name, manager_name)
Write the appropriate SQLstatement on the basis of the
above table :
a) 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 employeeswho 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 companythat has the most employees.

10. a) What are the advantages of normalization ?

b) How does BCNF differ from 3rd normal form ?
c) Explain the ACIDproperties of transactions.
5+5+5
Write short notes on any three of the following:

a) File indexing
b) B+ tree
c) Advantages of DBMS
d) Database models
e) Inner join and Outer join.
 ERSVTYOF TECMSOLOGY

cs-601
DATABASE MANAGE MENT SYSTEM
Allotted: 3 Hours Full Marks: 70

The questions are ofequal value.

Thefigures in the margin indicatefull marks.
Candidates are required to give their answers in their own words asfar as practicable.

GROUP A
(Multiple Choice Type Questions)
1. Answer any ten questions. = 10
(i) Check-pointing is associated with
(A) log based recovery (B) non-log based recovery
(C) both (A) & (B) (D) none of these
(ii) The different levels of data abstraction are
(A) Physical level (B) Logical level
(C) View level (D) all of these
(iii) The strategy for processing a query is improved by
(A) query evaluation (B) decomposition
(C) query optimization (D) none of these
(iv) View is a
(A) temporary table (B) virtual table
(C) SQL statement (D) query
(v) DML stands for
(A) Data Manipulation Language (B) Data Media Language
(C) Both (A) & (B) (D) None

toi
 Trangaettcmfollows
(A) Acid propenies (B) Non-preemption property
(C) Preemption property (D) Starvation ptopcrty
be in
(vii) Relations produced from an ER-model will always
(C) 3NF (D) 4NF
(A) INF (B) 2NF
(ix) BCNF stands for
(A) Boyle Codd Normalization Form (B) Boyce Cold Normal Form
(C) Boyce Codd Normal Form (D) None of these
(x) Which of the following guarantees that, "A transaction is either
performed in its entirety or not performed at all"?
(A) Consistency (B) Durability
(C) Isolation (D) Atomicity
(xi) Which of the following is true?
(A) a super key is always a candidate key
(B) every 3NF schema is also in BCNF
(C) generalization is a bottom-up design approach
(D) none of these

GROUP B
(Short Answer Type Questions)
Answer any three questions. 3x5
i.(a) What do you mean by degree, cardinalityof
relationship? 2
(b) What do you mean by data abstraction?Explain
abstraction? three levels of data

Discuss the ACID properties of a Database

transactiom
(a) What is Data
(b) What do you mean by unary and
algebra? Give example. binary operations in Relational
 Explain with example "BCNF is stricter than ANF" 5

Blicfly explain two phase locking protocol. 5

GROUP C
(Long Answer Type Questions)
Answer any three questions.
Consider the following employee database, primary keys are 2+3+3+3+4
underlined.
Employee(employee-name, street, city)
Works(employee-name, company-name, salary)
Company(company-name, city)
Manages(employee-name,manager-name)
Write SQL's for the queries given below:
(i) Find the names of all employees who work for XYZ.
(ii) Find all employees in the database who live in the same cities as the
companies for which they work.
(iii) Find all employees in the database who live in the same cities and
on the same streets as do their managers.
(iv) Find all employees who earn more than the average salary of all
employees of their company.
(v) Find the company that has the smallest payroll.

(a) Consider the following two sets of functional dependencies 4+3+2+343

X = {A—c, AC-+D, E—AD, and Y = {A—CD,E—AH}.
Check whether or not they are equivalent.
(b) ConsiderR (A, B, C, D, E) and set of functionaldependencies
CD--•E, E—+A)to answer the following questions:
(i) List the candidate keys for R.
(ii) Show that the followingdecompositionof the schema R into
(A,B,C) and (A, D, E) is lossless-join decomposition if the above
given set F of functional dependencies holds.
(iii) Compute the canonical cover FC
'c) What normal form is the foik»sing relation in? Discuss stuff (P, Q, N,

are DO—NICRY. CR-.D.

 manufacture products like pressure cookers, cook
9. Supreme products
food processors etc. The company markets its
wares. watcr purifiers,
all over the country and dealers sell them to
product to wholesalers Sales persons
customer. company has five regional offices. contact
offered, pairing programs
dealers and explain about products, incentives
etc.
Dealers place
for wholesalersand demonstrationfor customers
regional office of their
orders with the sales persons attached with the
which may be in
location. After receiving goods they make payments,
installments. Companywould like to develop a system to monitor sale
of different products, performance of salespersons and order from
wholesalers. Do the following:-
(i) Identify entities, attributes and relationship
(ii) Draw an E-R diagram
(iii) Convert this to relational tables

10.(a) Explain the purpose of the checkpoint mechanism. How often should
checkpoints be performed?
(b) How does 'strict two-phase' and 'conservative two-phase' locking
protocol differ.
(c) Construct a B+ tree for the following set ofkey values —(3, 4, 6, 8, 12,
17, 19, 23, 29, 31) assume that the tree is initially empty, values are
added in ascending order and the number of pointer in one node is 3.
Also perform the following operations on B+ tree: (i) insert 10
(ii) insert I I (iii) delete 29

11 (a) Describe Three-Schemaarchitectureof DBMS, Define physical data

independence and logical data independence,
(b) Explain with examples the term super key, candidate key, primary key
and alternate key.
(c) Considerthe file with r records(fixed length) of size R 100
I bytes stored on a disk with block size B 1024 bytes. Supposeeach
index entry in index file takes 15 bytes (9 bytes value, 5 bytes
for pointer). What is the munber of x:cessing blocks clustering
index?