Database Management Systems Exam Questions and Solutions, Exams of Engineering

A collection of exam questions related to database management systems (dbms). It covers topics such as er diagrams, sql queries, relational algebra, normalization, query optimization, transaction management, and database recovery. The questions are designed to test students' understanding of fundamental dbms concepts and their ability to apply these concepts to solve practical problems. Questions from tribhuvan university's institute of engineering exams, providing valuable practice material for students preparing for similar exams. It also includes some solutions.

Typology: Exams

2025/2026

Uploaded on 09/24/2025

sohan-11
sohan-11 🇳🇵

3 documents

1 / 25

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
'fr 33 TRIBHUVAN UNIVERSITY
INSTITUTE OF ENGINEERING
Examination Control Division
2075 Bhadra
Level BE Full Marla 80
Programme BCT Pass Marks 32
Year lPart ru/II iTime 3 hrs.
{gD&9LP@3gry3gryg!-$ystem Gr6 s 2)_
Candidates are required to give their answers in their own words as far as pr:acticable.
Attempt AII questions.
The figures in the margin indicate Full Marks.
Assume suitable data if necessary.
What do you mean by scheme and instances? Mention the different levels of data
abstraction and explain. I2+2J
a) Identify relevant attributes and construct an ER diagram with proper mapping
constraints for a university which has many departnents and each departnent has
rnultiple instructors; one among them is the head of the department. An instructor
belongs to only one departrnent, each deparfinent offers multiple courses, each of
which is taught by a single instnrctor. A shrdent may enroll for many courses offered
by different deparfinents. 16l
b) Define unary relationship along with example. How you convert an ER relationship
into relation schema? Explain with examples of different cardinalities. 12+41
3. a) Consider the following relational data model. t2x4'!
Student (crn, name, address, phone, dob)
Course (courseid, cffi, duration, fee)
Enroll (enrolled, cname, courseid, enrolldata" completedata)
i) Write the SQL statements required to create the above relations, including
- appropriate versions of all primary and foreign key integrity constraints,
*./ ii) Write an expression in SQL to find cm, names and enroll data of all students urlro
have taken the course'java' (cname)
iii) Write SQL to find the names and address of all the students wtro have taken both
course java and linux.
iv) Write an expression in SQL to Create a view'student tsurse'having the athibutes
crn, name, phone, coursename, enrolldata
b) Consider the following relational database 12"4
sailor (sailorid, snarne, rating, age)
boat (boatid, boatname, color)
resetres (sailorid, boatid, date)
Write relational algebra expressions for the following:
i)t Find the names of sailor who has reserved boat number 105.
ii) Find the names of sailors who have reserved a red boat.
iii) Find the names of all sailor who have reserved either a red boat or a greenboat.
iv) Give an expression in QBE to find the sailors name and age who have reserved a
red boat.
,/
{
/
{
l.
2.
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19

Partial preview of the text

Download Database Management Systems Exam Questions and Solutions and more Exams Engineering in PDF only on Docsity!

'fr

33 TRIBHUVAN UNIVERSITY

INSTITUTE OF ENGINEERING

Examination Control Division

2075 Bhadra

Level BE^ Full Marla 80

Programme BCT Pass Marks 32 Year lPart ru/II (^) iTime 3 hrs. {gD&9LP@3gry3gryg!-$ystem Gr6^ s^ 2)_ Candidates are^ required to give^ their^ answers^ in their own words^ as^ far as^ pr:acticable.

Attempt AII questions.

The figures in the margin indicate Full Marks. Assume suitable data if^ necessary.

What do you^ mean by scheme and instances? Mention the different levels of data

abstraction and explain. (^) I2+2J a) Identify relevant attributes and construct an ER diagram with proper mapping

constraints for a university which^ has many^ departnents and each^ departnent has

rnultiple instructors; one among them is the head of the department. An instructor

belongs to^ only^ one^ departrnent, each deparfinent^ offers^ multiple^ courses, each^ of

which is taught by a^ single^ instnrctor.^ A^ shrdent^ may^ enroll^ for^ many^ courses^ offered

by different deparfinents. (^) 16l b) Define unary relationship along with^ example. How^ you convert^ an^ ER relationship into relation schema? Explain with examples of different cardinalities. (^) 12+

  1. a) Consider the following relational data model. (^) t2x4'!

Student (crn,^ name, address, phone,^ dob) Course (courseid,^ cffi, duration, fee) Enroll (enrolled,^ cname,^ courseid,^ enrolldata"^ completedata) i) Write the SQL^ statements^ required^ to^ create^ the^ above relations,^ including

  • (^) appropriate versions of all primary (^) and foreign key integrity (^) constraints,

*./ (^) ii) Write an expression in SQL to find cm, names and enroll data of all students urlro have taken the^ course'java'^ (cname)

iii) Write SQL to find the names and address^ of all^ the^ students^ wtro^ have^ taken both

course java^ and^ linux.

iv) Write an expression in SQL to Create^ a^ view'student^ tsurse'having^ the^ athibutes

crn, name, phone,^ coursename, enrolldata b) Consider the following^ relational^ database^ 12" sailor (sailorid,^ snarne,^ rating,^ age) boat (boatid,^ boatname,^ color) resetres (sailorid,^ boatid,^ date) Write relational algebra expressions^ for^ the^ following: i)t Find^ the names^ of^ sailor who^ has^ reserved boat^ number^ 105. ii) Find the names^ of^ sailors who^ have reserved^ a^ red boat.

iii) Find the names of all sailor who^ have reserved either^ a^ red boat^ or a^ greenboat.

iv) Give an expression in QBE to^ find^ the^ sailors^ name^ and^ age^ who^ have reserved^ a

red boat.

{ / {

l.

I

  1. a) Why (^) do we need normalization? Differentiate primary key (^) and foreign key. Differentiate between 3NF and BCNF. (^) [2+2+3]

b) Consider the relation Treatment with the schema: Treahnent (doctorlD, doctorName,

PatientlD, diagnosis) and functional dependencies; doctorlD+doctorName and (doctorlD, patientlD)+diagnosis.

Describe different tlpes of problem that can arise for this relation with records

Explain with diagram about process of query processing (^) in RDBMS. How are

equivalence rules for relational algebra helpful for query optimization? Explain with

example. (^) [5+3] a) Describe (^) about fxed-length record (^) and variable length record along wift examples. (^) t4l b) Describe B+ tree structure used for indexing. (^) t4l

Define transaction and explain various states of a transaction with a transition diagrarn.

Describe about two phase^ locking protocol^ for concurrent transastion along with its

limiations.

Write the different types of failures that may occur in system. Ditrereutidc between

shadow paging and log-based recovery.

a) Write about data warehouse with its components.

b) Write about spatial database.

t5l

14+

[3+3]

t4I

l2l

',}

5- a) What is a functional dependency? List the various integrity constraints and e4plain

about the referential (^) integrity (^) along with an (^) example. t3+ b) Define lNF, 2NF (^) and 3NF. Illustrate your:mswer (^) with suitable (^) example.

t6l

6- What is the task of evaluation engine in query processing? Explain cost based qu€ry

optimization and (^) Heuristic optimization. (^) ' 14+

  1. (^) a) What is the difference (^) between ordered (^) indices (^) and hash indices (^) in a database? (^) What

is the (^) advantage of using sparse (^) index?

b) Write about fixed length record and variable length record organization in DBMS?

  1. Explain (^) the possible tansaction (^) states (^) in DBMS. Explain the concept (^) of (^) conflict

searilizability with an example.

  1. Explain (^) the idea of log-based recovery.

10. a) Explain homogenous and heterogeneous disfributed database.

b) What is Spatial Database System?

[2+

t4l

[4+

l6l

t4l

tzl

**:l

45 'TRIBI{UVAN^ UNIVERSITY

INSTITUTE OF ENGINEERING

Examination Control Division

2O74 Bhadra

F_y1QigS!:--_D*"ua9e_Mpgpg-en91t_lvql9-(-cI6i

{

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

Attempt All questions.

The figures in^ the^ margin indicate^ Full.^ Marks

Assume suitable data^ if^ necessary-

Mention the advantages of^ the^ DBMS^ over^ the^ file^ processing^ system and explain^ briefly. a) Define discriminator in ER^ diagram. Explain different keys^ used^ in^ database design- b) Draw the Entity-Relationship^ Diagram^ (ERD)^ with^ appropriate mapping cardinalities

for the following scenario'

A production^ company consists^ of^ a^ machining,^ fabrication^ and assembly^ department.

Employees are u"rignla to^ different^ departments. Each^ depanment^ is^ managed^ by^ a

-gir. Each^ "p1oy". has at^ most^ one recognized^ skill,^

but a given^ skill may^ be

possessed by several employees.^ An^ employee^ is^ able^ to^ operate a^ given machine-type

(e.g. lathe, grinder, welding) of^ each department. Some^ of^ the^ employees^ are^ paid

overtirne d^ ,o.^ of^ them^ are^ paid^ with^ daily^ basis.^ According^ to their^ designation

(eg. mechanic, welder) are supposed to^ maintain^ at^ least^ one^ machine-type^ of^ their

departrnent. Raw materials^ are bought from different^ vendors^ and^ fetched^ to^ the

*u.hining department.^ Parts^ from^ machining^ department^ are fetched^ to^ fabrication

depanrnent and so^ on.^ Many^ parts are assembled^ together^ to^ form^ a^ product. The^ final

products from assembly department are stored^ in^ the^ ware^ house.^ Products^ are labeled

with different specifications^ (eg,^ Product-Id,^ Producuype,^ MRP,^ etc).

Consider the^ following relational^ data^ model Employee (empid,^ ename, age, salarY) Department (deptid, dname, budget,^ managerid) Works (empid, deptid, hours) (i) (^) Write the SQL statements required to^ create the above^ relations,^ including^ appropriate versions of all primary^ and foreign^ key^ integrity constraints.

(ii) Write an expression in SQL to find^ the name^ of^ departmept whose employee^ earns^ the

maximum salary.

(iii)Write SQL to find the name of the employee, department^ name^ and^ the^ number^ of

t^ i'

t4l

t4l

t8l

aJ. 12"

hours they work

(iv)Write an expression in^ SQL^ to^ give

is in between 45 to 50 years.

  1. Consider the following relational^ database^ [2xa] Account (gggArmt-numb^ er, branch-n€une, balance) Branch (branch-narlg, branch-city, assets) Customer (cust-nanqg,^ cust-street,^ cust-city) Loan (lqan-nqglber, branch-name, amount) Depositor (cust-nam.e,^ account-number) Borrower (cust-name, lo-an-number) Write the relational^ algebra expressions^ for^ the^ following:

every employee a20Vo raise in^ salary whose^ age

", TRIBHWAN TIMVERSTTY INSTITUTE OF ENGINEERING Exarnination Control Division

2073 Magh

Programme Year lParJ Full Marks i Pass Marks Time Exarn. BE BCT 32 mlil

  • Database Management SYstem

{

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

Attempt AII questions.

The figures in the margin^ indicste^ FulI Marlu- Assume suitable data^ if^ necessary-

What do^ you^ mean^ by^ data abstraction?^ List^ the various^ level^ of^ data^ abstraction^ and

briefly explain.

a) What are data models?^ Explain^ various^ tlpes^ of^ data^ models. b) - Design an E-R diagram^ for^ a^ database^ for^ an^ airlines^ system.^ The^ darabase^ must^ keep

trackof customers and^ their^ reservations,^ flights^ and^ their^ stratus,^ seat assignments^ on

individual flights^ and^ the^ schedule and^ routing of^ future^ flights.^ Apply^ all^ the^ database

design constraints as^ much^ as^ possible. a) Consider the following^ relational^ data^ model.

name,' address, managelid)

Qgp,attment(dePti d,^ d^ n^ arne)

P*i'#ot(pi{,' tatle,^ budget, deptid)

$orks.-on(empid, pid,^ hours)

relational atgebraic expression for the^ following:

Glfid;,;the names of all^ employee^ from^ cornputer^ department

,g.ionrii,wittr tneir^ mana6df^ tiaTn€.^

.

lfti'.rpip6'the names^ of^ all the employees who works on projeot with

b,gdget more than^ 50000.^. I Find^ .the^ total^ number^ of prflects^ from each^ department^ along ttdth,the department name.

Write down the SQL^ queries^ for^ following:

i) Find the name^ of^ employees^ who works^ on^ project^ with^ the^ highest^ budgel ii) Create a^ view^ with^ empid,^ name,^ project^ title^ and budget.

iii) Update the^ budget^ of all project^ by20%^ where^ any^ employee^ works^ formore^ than

l2 [ours.

Define functional dependency.^ Explain^ partial^ and^ transitive^ functional^ dependency with example.

l.

ll+ u+

t8l

[2x3]

[2x3]

ll+

[3+4]

b)

  1. a)

b) Define decomposition^ and^ its^ desirable^ properties.^ Explain^ 3NF^ and^ BCNF.

Tl

  1. Define query processing.^ Explain^ the^ various approactes^ used^ r.o^ evaluate^ any expressio

with sitable example.

  1. a) What is RAID? Which^ RAID^ level^ would you prefer the best^ for^ safety^ of ryplication

and why? b) What is indexing? Why^ dpamic^ hashing is^ adnmtageous over static^ hashing?

  1. a)^ Define^ ACID^ properties^ of a^ transaction.^ Describe^ tlre^ concept^ of^ conflict

serializability for^ concurrent execution of^ transactions-

b) How two phase^ looking^ protocol^ helps^ in^ concurrency^ control?^ Explain.

  1. What is stable storage?^ Explain^ the^ log^ bas€d^ recovery^ mc'hanism-
  2. a) Describe briefly^ about object oriented^ database'

b) Explain^ the^ differences^ between homogenous and^ heterogenmus^ disffibutd^ database'

12+

ll+

u+ 14+

t4l

12+

t3l

t3l

:4i: .)

1

45 IRIBHUVAN^ UNIVERSITY

INSTITUTE OF ENGINEERING

Examination Control^ Division

2073 Bhadra

;;;il;;,;::1,-.;'fi:';Tl::il:::::T::J:tfr-':;,",0,; '/ Attempt All questions. ,/ (^) Thefigures in the margin indicate Futl (^) Mgfis. ,/ (^) Assume suitable data if necessary-

Why is data independence important^ in^ data^ modeling?^ Differentiate^ between^ schema and instances t4]

Differentiate total^ and partial^ participation^ with^ suitable example^ and^ draw an^ ER

diagram for the airport^ database.^ Be^ sure^ to indicate^ the various attributes^ of^ each^ entity.

Every airplane has^ a registration^ number^ and^ each airplane^ is^ of^ a^ specific model.^ The

airport accommodates a^ number^ of^ airplane^ models and^ each^ model^ is^ identifred^ by^ a

model number (eg^ DC- i 0)^ and^ has^ a^ capacity^ and^ a^ weight.^ A^ number^ of^ technician

works at the airport. You need to store the^ name, SSN,^ address, phone^ number and^ salary of each technician. Each technician is^ an^ expert on^ one^ or^ more^ plane^ model(s)^ and^ his^ or her expertise rnay overlap with^ that^ of^ other^ technicians.^ This^ information^ about

technicians must also^ be^ recorded.^ Traffic^ controllers must^ have^ an^ annual^ medical

examination. For each traffic^ controller you must^ store the^ data^ of^ the^ most recent^ exzlm.^ [4+8]

Consider the following relational^ schema

Ernptoyoe @namq, street,^ city) Works (Ename, company-.r1ame, salary)

Company r,,SqpgH-ruig^ ciqv)

Manages (lina'ine, manager-_nanre)

. a) Write the queries in Relational Algetrra. (^) [2x3]

i. Find all the empioyecs^ name^ who^ rvork in^ 'NMB^ bank', i.i, Find^ all^ the^ ernployee^ names^ who live in^ the^ same^ city^ as^ their company^ is located. iii. Find the name and city of those^ emplo,u*ees^ whose^ salary is greater^ than^30000 and

lives in 'k{ur'^ citli,':,

Q) Write^ SQL queries^ tbr^ the^ follorving.^ l2x3l j-' (^) C-reate Eruployee aqd Works relation rvith primary key and foreigr key constraints.

,ii. Find^ the^ err,rp[oyoe-;;^ fl?me^ theirtrciinpany narne and^ city^ natne^ rvhich^ ends^ lvitb^ 'pur'

,^ iii,^ Ircrease the salary^ of^ each^ em;:loyees by' 25Y, whase^ salary^ is less than 30000.

  1. a) What do you^ mean^ by^ functional^ dependencies?^ Define formally.^ What is^ BCNF? b) What is normalizatiorf? Explain INF, 2NF, 3NF and 4NF,
[3+3]

12+4J

'i (^) Explain the basic^ steps^ in^ query^ processing.^ Make^ distinctions^

between cost^ based

opiimization and^ heuristic optimization'

a) what^ is the^ use^ of RAID^ storage device?^ I{ow^

is a record searched^ from a^ sparse

sequential index?

b) Explain about^ the remote backup^ system^ with^ diagriln'

a) what^ are^ schedules?^ Describe^ the^ concept^ of view serializability for^ concurrent

executi on of^ tran^ s^ action'

b) How^ deadlocks arise^ while^ processing^ transactions?^

Expiain the deadlock prevention strategies.

write the^ different types^ of^ failures^ that^ may occurs^

in system. Differe'tiate^ between

shadow paging and^ log-based recovery'

Write short notes^ on^ the^ following:

i) Distributed^ database^ sYstem ii) Spatial database^ sYstem 14+ 12+

t3l

12+ 12+

[3+3]

[3x2]

45 TRIBHUVANI.JNIVERSITY

INSTITUTE OF ENGINEERING

Examination Control Division

2071 Bhadra

r ! .,i^ i i .i !i I !

Exam. llcgular / Bitcl.

LeVel BE^ Futl Marks 80 Programme BCT Pass Marks 32 Year / Part M/II^ Time^ 3 hrs.

Suhject: -^ Database^ Management System Gf652)

r' (^) Candidates are required to give (^) their answers in their own words as far as practicable. r' (^) Attempt All questions. '/ Thefigures^ in^ the^ margin^ indicate^ Full^ Marks. / (^) Assume suitable data if necessary.

f. Wh'at difficulties would you face if pu^ used fite system directly to implement a database

application?Whatisphysicaldataindependence?,

  1. Draw a complete ER-diagram for (^) the following case.

"A Bus Compony owns a number of busses. Each bus is allocoted to o pafticular^ route, olthough some

routes may hove seveirl busses. Each rodte posses threigh a nunber o! towns. One or more drivers -

are olloisted to.eoch stoge of o route, which corresponds to a journey^ through some ar olt of the

towns.on o route. Some of the towns have o goroge^ where busses are kept ond eoch of the btxis

ore identilied^ by the registrotion number and con carry dilferent numbers of passqngers,^ since the

vehiCles vory (^) ln size ond mn he single or doubl*decked. Each route is identified by a route number '

ond.informotion is ovaitahle on the qveroge number of passengers carried per doy for eoch riite.

Driverc hove.on^ empluyee.number, nome, address, ond sometimes o tetephane number." (^) :

What is the difference between the degree and cardinality of a relationship? [8+4]

  1. Consider the following relational database model

Em ployee (g!!, (^) no me, oddress, (^) s u pervisor_eid)

D e po rtme nt(d g!!9[^ na m e )

P roje cttpN^ titI e, d ept_i d)

Write relational algebra expressions for the following: [2X4=8]

a) List (^) the pme^ of (^) all employees from Computer department along (^) With the name oJ their supervisor. b) Find the name of alt employees who work on the 'Network monitoring" project for more than 15 hours. cl (^) Delete all projects which (^) belong to the'Electrical' department. d) Find the totai number of projects from each (^) departrnent, along with the department narne. ! I I I .i

  1. Consider the relational schema given below.

Product ( p!!, (^) ndme, price, (^) category; qnaker-cid) Purchase (buyer-ssn,^ seller-ssn, quontfu, pid) Compony (g!d,^ nome, stock price,^ eountryl Percon(g;p, nome, phond aamber, cigy).

[2X4=8f

*-<_

i I a! Write an SQL query to find the name and price of atl products of 'camera' category made in "laPan".

b) Write an SQL query^ to create a view to expose only the Buyer name, Selter name and

product (^) name from all transactions. c) Write a query ln SQL to increase the price of all products^ from DELL company by 5 %. d) Wrlte skeleton tables ln (^) QBE to flnd the name and phone number of alt persons who

purchased pl:d:.* of Laptop category with price greater than 8O000.

'-.

5. a) Explain what is referential integrity constraint along with an example? Briefly explain

cascading actlons in^ referential^ integrityconstraints.^ t3+

b) Briefly explain how to normalize (^) a database from:un-normalized form to lNF, 2NF, 3NF and (^) !$ t5l

  1. Explain the difference between cost-based and heuristics-based methods for query optimization. How can you^ optimize the following query?^ [3+5]

f\or,62(o6rpt-nome=lvrusic (^) linstrugtgrX n-r, (^) ig,ti*(teoch.es X^ cou5s:llll

1

  1. a) What is the difference between ordered indices and hash indices in a database? What is the adrrantage of using a sparse index? (^) 12+

b) What is a RAID? How would you^ choose the best RAID level for your^ database server? [1+3]

  1. Explain.Atomicity and lsolation properties^ of a databasetransaction. Describe the concept of. conflict (^) serializabillty for concurrent erecution gf^ transactions. (^) [4+4]
  2. Briefly explain the idea of a stable storage. Explain the arthitecture of a remote backup system. [3+ 10, Write short not'es^ on^ the^ following aI Typesofdistributeddatabases I3l b): oata warehousing I3I

+*t

*io

i ,l II l I l

-l , l : i I I 1 I I { I ,'!

i,i

I !

!!

:I ! I I

: -.;

iI

l

I

I

I I I i I

  1. (^) a) Explain (^) lhe necessary condition for decomposing a relational database table into^ two tables. Why
    1. txplain the process how a query^ is evaluated in *DBMS systems. How are cquivalence rules for relation algebra helpful for query optimization? [xplain with example

?. al Distinguish between dense index^ and sparse index? What is^ a secondary index? b) Briefly explain how variable length^ records are stored^ in^ databases?

  1. What do you understand by the ACID properties of transactions? Explain with examples.
    1. Explain the functions^ of Undo and Redo^ opbrations in a log-based recovery of^ database.
  2. a) Briefly explain horizontal and vertical fragmentation in distributed databases.' b| Write a short note on Data warehouse and associated applicationsi ,; . **+

&.' ..trf .,i " (^) :.t,

[4+4] {

[3+ 5l

[3+2]

irj

t8l l6]

t3l t3l

','r::. (^) i,.:.:._,.. (^) ... (^) .,_l:.:,:. " ..:,::.

45 TRIBIIWAN^ I.JNIVERSITY

INSTITUTE OF ENGINEERING

Examination Control^ Division

2070 Bhadra

Exam. Level Programme

Full 80 32 Year / Part 3 hrs.

Pass Marks Time

BCT

III / II

Sabject: - Database Management System (cT6s2)

/ (^) Candidates are required (^) to give their answers in their own vvords as (^) far as practicable. / (^) Aaempt All queslions. '/ The^ figures in^ the^ margin^ indtcate^ Full^ Morks. / (^) Assume suitable data if necessary.

1. Briefly explain different levels of data^ abstraction in a database^ system.

  1. Draw an ER-diagram for the:following mini-case. What is the difference between strong and weak entity^ sets?

Eac,h employee in an^ engineering company has at most one recognized skill, but a given

skill may be possessed^ by^ several employees.^ An employee is^ abie^ to operate given

machine-type (e.g., lathe, grinder) if he has one of several skills. but each skill is

associated with the operation of only one machine type. Possession of a given^ skill (e.g.,

mechanic, electrician) allou,s zrn employee to maintain several machine-types, although

maintenance of any given^ machine-type requires a specific skill (e.g.,^ a lathe must be

maintained by a mechanic).

  1. Consider the following relational database model:

employee (emnloyee-name, street, city)

*,orks (grnplogg:nAme, company-name, salary)

company @prn€any-name, city)

m anages (employee-name, manager-name) a) Write SQL queries^ for^ the^ following^ needs. i) Modiff the^ database so^ lhat^ Jones^ now lives^ in city Pokhara. ii) Give all employees of 'NABIL Bank' a 10 percent raise.

iii) Give all managers of 'NABIL^ Bank' a 30 percent^ raise unless the salary becomes

greater (^) than 100,000.

iv) Delete employee who has maximum amount of salary.

b) Ihe relation works^ has^ attribute^ company-name, company-name^ is^ primary key in relation company. How the relation betra'een these two relations is preserved? Explain

with solution with SQL query^ to^ achieve this relationship.

  1. a) What is a lossless-join decomposition? \Vhat is a functional <lependency? Explain. b) What is the advantage of 3NF o'ter BCNF?
  2. What do you^ mean by term functional dependency? Discuss various types of functional dependencies.
  3. I{ow can pipelining approach improve query-evaluation efficiency?
  4. a) What is the use of RAID storage device? What are the advzurtages and disadvantages

of miroring?

l4l

[8+4]

[2x4]

t4l

[4+4]

.

t4I

t6l

t4l

13+z)

r (^) 1: i.i. .r (^). - (^). i (^)!

44 TRIBHUVANTJNIVERSITY

  • INSTITUTE OF PNCTNPPNruC Examination Control Division. 2069.Bhadra

Exam. llcgular (2066 & Laler Bltch)

Level BE^ f,'ull^ l[arks^80

Programme BCT^ Pass lVlarks^32

Year/Part m/tr Time 3 hrs.

'2.

Subiect: - Database Manasement System GT6S2)

{ (^) Candidates are required to give their answers in their own words as far as practicable... { (^) AttemptAll questions. r' (^) fn"iSr6 i" the margin indicate Full Marlcs. { (^) Asstrme suitable data ifnecessry.

Briefly highlight your significant differetces between a file-processing system and^ a

DBMS.

Draw an ER-diagram for^ the following^ mini-case. What^ is^ the^ difference^ between

cardinality and degree of a relationship?

A university registrar's maintains data about the following entities: (a) Courses, including

number, title, credits, syllabus^ and^ prerequisites;^ (b)^ Course^ offerings,^ including^ course

number, year, semester, section number, instructor(s), timings and classroom;^ (c)

Students, including^ student-id,^ name,^ and^ program;^ and^ (d)^ instructors, including

identification number, name, dOpartment, and^ title.^ Further, the^ enrollment^ of^ students^ in

courses.and grades awarded^ to^ students^ in^ each^ oourse^ they^ are^ enrolled^ for^ must^ be

t4I

[8+4]
  1. (^) a. (^) Mtntion the two couditions to be satisffed by any t$ro sets for union, intersection ' (^) and set difference operation between them.

b. employee(gp,narng, srect, city)

company(gqrnpg454grng city) manqgss(mpr-talne- (^) managemame) Forthe case ofabove database schema: L Write an (^) expression in SQL to cr€ate the table employee.

II. Wfite an expression in SQL to inset a rowinto the table works.

III- Writc an expression in SQL to find the name and cities of resident of all the

. erylhlnes.u{o^ dooot^ work.for^ X:Y.?h;tt*,^

  • (^). ': -

. i'^ I^ ',ff."ffi,ftte^ an^ er(pidsrioh Rsladional^ Algebra^ to^ find^ the^ coupmy nanre,fflifiiiis^ the

higffi uunber of employees

c. Strppose you^ are ass.igned as the Database Adminiseator of a Bank. How can'you

enhance (^) the security by implementrng (^) concept ofviews on the database?

  1. What^ do you^ mean^ by^ integrity^ constrains?^ Explain^ any^ four^ constraints^ that^ can^ be enforced to database tables. 5- What^ are^ the^ advantages^ of^ normalizatiqn^ of^ database?^ Explain^ lNF,^ 2NF^ and^ 3NF.

ttl

l4x2l

t3I

t6I

r When^ database de-normalization^ is^ preferred?^ l2+3+l] 6, Explainttre^ process^ of^ query^ optimization.^ What^ is.cost-based^ optimization?^

' (^) '[6+2]

!= What do you^ mean by ordered inde;r and hash index? Explain limitation of static hashing. How extendable hashing overcom-e such limitation? (^) L2+2+

:Tl|w.qr

'iri:1 .,': ri .,

' ,, g,^ a)^ Explain^ conflict^ serializability^ with^ example.

' U)^ Differentiate^ between^ fine^ granularity and^ coarse^ granularity^ locking^ in^ multiple ,,1 (^) , granularitylockingprotocol. , "i,, 9 Explain redo phase and^ undo^ phase^ of^ log^ based^ failure^ recovery mechanism. ,1.i. 10.^ a)^ What is object-oriented^ databases?^ Explain^ briefly. ..;. b)^ Explain^ the^ benefit^ of parallel^ database?

t8I

l4l

t6l

t3I

t3I

.: , (^) tl;.

I