Department of Computer Science and Engineering

University of Rajshahi
Sample Question 2
Course Title; Database Management System Course code: CSE 301`
Full marks:100 Time:4 Hours

1 Define DBMS. What are the disadvantages in File Processing System? What is metadata? 3+5+2+
What are instance and schema? What are the functions of database administrator? 3+7
2(a) Design an ER diagram for an IT training group database that will meet the information needs 10
for its training program. Clearly indicate the entities, relationships and the key constraints. The
description of the environment is as follows :
The company has 12 instructors and can handle upto 100 trainees for each training session. The
company offers 5 Advanced technology courses, each of which is taught by a team of 2 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
(b) Simplify the E-R diagram of Fig 1, Fig 2(a) and Fig 2(b). 6
(c) Derive the table for relationship set and entity set from Fig 3 and 4, respectively 4

3(a) Express the operation of Deletion, Insertion and updating in relational algebra. 6
(b) What is view? How does view definition differ from relational algebra assignment operation? 4
Discuss the problem with view if express update or insertion with it.
(c) A relation s of schema (A,B,C,D) has three tuples: (1,2,3,4), (5,6,7,8), 9,10,11,12), another 10
relation r of schema (B,C) has a tuple (2,3). Find the r÷s, show output of each operation
(Natural join, Projection etc) involved in r÷s.

4(a) Consider the relation bbc(name, region, area, population, gdp). Write SQL command for (a) list 16
each country name where the population is larger than ‘Bangladesh’, (b) Which country has a
populations that is more that Japan but less than India (c) find the largest country in each
region, show the region, name and population (d) Which countries have gdp greater than any
country in Europe?
(b) Explain The Object Oriented Model. What are the approaches to be established to make 4
transient objects persistent?

5(a) What are tests those must be made in order to preserve the following referential integrity 9+2
constraint (r2)  K (r1) for Insert, Delete and Update operation. What is Triggers?
(b) What is Assertions? Create an assertion to handle the constraint that The sum of all loan 5
amounts for each branch must be less than the sum of all account balances at the branch. The
relevant relations are branch (branch_name, branch_city, assets, account (account_number,
branch_name, balance) and loan (loan_number, branch_name, amount)
(c) In the authorization-grant graph as shown in Fig. 5, what poosible attemp may be occur to 4
defeat authorization revocation and how to prior care to prevent that.

6(a) What are the different states of transaction? Give some example of non-ACID Transactions. 3+2
(b) What will happen if transaction T1 is followed by T2 instead of as described in 9
schedule 1. Expain if there is any problem or inconstancy may occur in schedule, 2,
and 3. (in Fig, 6, 7 and 8 respectively)
(c) What are software RAID and hardware RAID? How can you measure the performance of 2+4
storage disk?

7(a) What is an Elevator Disk-arm–scheduling algorithm? When multiple disks are used, explain 3+4+4
how can bit-level striping and Block-level striping improve transfer rate? Explain, where RAID
level 1 better than RAID level 5 or vice-versa.
(b) Consider the following sale relation schema (shown in Fig 9) : SaleForm(SaleID, SaleDate, 9
CustomerID, FirstName, LastName, Address, City, State, ZIPCode, (ItemID, Description,
ListPrice, Quantity, QuantityOnHand) with some tyical tuples. Decompose the relation in First
9Normal Form, Second Normal Form and Third Normal Form

8(a) Show that decomposition of R1 = ({A, B, C}, {A→B, C→B}) into R2 = ({A, B}, {A→B}) 3
and R3 = ({B, C}, {C→B}) is not lossless.
(b) Is B → G in F+ where R = {A, B, C, D, E} and F = {B → CD, E → F, D → E, B →A, 4
AD → B, F →G}
(c) Consider the following set F of functional dependencies on schema (A,B,C): A →BC, B → C, 5
A →B, AB → C, compute the canonical cover for F.
(d) R = (A, B, C), F = {A  B, B  C), R1 = (A, B), R2 = (A, C) is Lossless-join decomposition 4
but is not dependency preserving.
(e) R = (A, B, C, G, H, I), F = {A  B, A  C, CG  H, CG  I, B  H}, Is AG a 4
candidate key?
 Fig 1 (E-R diagram) Fig 2(a) (E-R diagram)

Fig 2(b) (E-R diagram)

Fig 3 (E-R diagram) Fig 4 (E-R diagram)

Student Advisor Professor

Major GPA Dept Name

Fig. 5 (Authorization Fig. 6 (Schedule 1) Fig 7. (Schedule 2) Fig 8. (Schedule 3)

U1

DBA U2

U3

Fig. 9 (relation sate)

SaleID Date CID FirstName LastName Address City State ZIP ItemID Description ListPrice Quantity QOH

11851 7/15 15023 Mary Jones 111 Elm Chicago IL 60601 15 Air Tank 192.00 2 15
27 Regulator 251.00 1 5
32 Mask 155 65.00 1 6
11852 7/15 63478 Miguel Sanchez 222 Oro Madrid 15 Air Tank 192.00 4 15
33 Mask 2020 91.00 1 3
11853 7/16 15023 Mary Jones 111 Elm Chicago IL 60601 41 Snorkel 71 44.00 2 15
75 Wet suit-S 215.00 1 3
11854 7/17 94552 Madeline O’Reilly 333 Tam Dublin 75 Wet suit-S 215.00 2 3
32 Mask 1557 65.00 1 6
57 Snorkel 95 83.00 1 17