BITM 4th Semester
Database Management System Board Question Paper 2021

TRIBHUVAN UNIVERSITY
FACULTY OF MANAGEMENT
Office of the Dean
August - 2021
Full Marks:40 Pass Marks:20 Time:2 hrs.
BIM /
Fourth Semester /
IT 220:
Database Management System

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks

Long Answer Questions
Section "A"

Brief Answer Questions:

[10×1=10]
1.

How the Redundancy problem in File Processing is solved by database processing ?

2.

List out the responsibility of DBA.

3.

What is the purpose of storage manager?

4.

Give example of Binary and Ternary relationship.

5.

Explain the two types of participation constraint.

6.

What is meant by lossless-join decomposition?

7.

Define deletion Anomaly.

8.

what is embedded SQL?

9.

What are two pitfalls (problem) of lock-based protocol ?

10.

Define Atomicity with example.

Section "B"

Exercise Problems:

[5×4=20]
11.

Draw ER diagram on the basis of following scenario assuming your own attributes.
This system store various information about driver, bus tickets and customer. Driver drives bus, customer travel from one place to another by bus. Driver check the ticket of each customer for validity. Each customer must have ticket to travel by the bus.

12.

Write the DDL statement to create the following table:
Table Name: Football Team

Field NameData - TypeConstraints
Team IDAlphanumericPrimary Key
Team NameCharacterNot more than 20 character
RankIntegerNo negative and NULL
Goal ScoreIntegerNo negative and NULL
GoalConsidedIntegerNO NEGATIVE NULL
No_of_playersIntegerNot less than 11 and more than 25

13.

Consider the following relation database.
Author (AID, A_Name, Age, Address, country)
Publishes (AID, BID, publisheddate)
Book (BID, B_name, page, price)
a. Find the Name of Author who is Not from 'Nepal'.
b. Find the number of books written by each author.
c. Find the name of Author who has published expensive book.
d. Insert the detail of new Author.

14.

Consider the relation scheme R={E,F,G,H,I,J,K,L,M,N} and the set of functional dependencies {{E,F}→{G},{F}→{I,J},{E,H}→{K,L},K→{M},L→{N}} ON R. what is the candidate key for R?

15.

Normalize the following relation up to BCNF.

E-IDE-nameContact NoPostSalary
E01Sushil98405,21325Manager40000
E02Basanta9846Engineer45000
E03Gopal98510,2456Manager40000
E04Rita98302Accountant30000
E05Sita986045,44534Engineer45000

Section "C"

Comprehensive Answer Questions:

[2×5=10]
16.

Explain concurrency control. suppose you have three account A=5500, B=4500 and C=2000 and transaction T1, T2 and T3. in T1 Rs.500 transfer from A to B. in of all account. manage the transaction using Two phase locking protocol for concurrency control.

17.

Explain various database Application Architecture with a suitable example.