0 ratings 0% found this document useful (0 votes) 43 views 8 pages Dbms
The document is a compilation of examination questions for a Database Management System course, covering various topics such as DBMS characteristics, schema architecture, SQL queries, and normalization. It includes specific questions from different modules, requiring students to demonstrate their understanding of database concepts and operations. Additionally, it emphasizes the importance of using electronic resources to save trees and promote environmental sustainability.
AI-enhanced title and description
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Go to previous items Go to next items
Save trees use e-Question Paper
DOWNLOAD THIS FREE AT www.viuresource.com
MIE 30, wb wate a malpractice.
‘Ay even onto. pelo evlistr and ot eons Wate
rut Noe: | On completing you mers compaoriy dem diagonal ror nes on he remain blank popes.
BES Scheme
aie LO 16/17MCA:
‘Second Semester MCA Degree Examination, June/July 2018
Database Management System
Time: 3s Mangia: 80g
Note: Answer FIVE fll questions, choosing ome all question from each
Module-t
1a. Define DBMS. Disus the characteris oT Dlabse approach ets)
B. Des nee schema architects, witha nat gram (essinns)
Discuss in Jel about he avenages of DBMS over touisongli womens)
on
2 a. iste component modules ofa DBMS ad their interact Mgt et dingra
‘ne aes)
b. Brel expan any 2 types ofatibues in ER mod fomns)
tng te flowing ems
Emig so 1) Cardinal ao Aveaketiy. (oma)
Module:
3. Summarize in opentins rein (ossias)
Consider te flowing atonal schol anger ie flowing queries using relational
Stee
EMPLOYEE. oy Sex [Saka | Super SSa] Dns |
DEPARTMENT (Dre Dugg Mar SS grat
rover [Fane — Ng roption TDmam]
wowas.on (Seige)
gj of all employes who work fr
Ae cho weron al he poets catoled by Baume
Bin Staton list the project no controling Deparment
inagers, sae inh ate
employees who hav no departments (ests)
on
4. Denon Reaional mapping ego, with an example, (8 Mah
&. qlusite nay relational operon, with ppropdate ymax ond example. 8 Mars)
« Module-3
5 he difrent clauses of SELECT = FROM ~ WHERE ~ GROUP HAVING with
etl foreach (osx
Ian st membeeship and et comparison operation for nested sub queries, (tent)
on
Lot?
Go green
BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS
A Viuresource Go Green initiativeSave trees use e-Question Paper Go green
DOWNLOAD THIS FREE AT www.viuresource.com
16/17MCA23
Write a shor note on granting and revoking of privileges in SQL. cosntfins)
Consider the following schema and solve the following queries in SQL. {osm
BRANCH (Branchid , Branchname , HOD)
STUDENT (USN, Name, Address, Branch, Sem)
BOOK (Bookid, Bookname , Authorid, Publisher, Branchid) @
AUTHOR Authorid, Authorname, Country, Age)
BORROW (USN, Booki, Bonowed_Date)
i) List the student details who are all studying in 2™ sem MCA.
{iy Display the student detais who borrowed more than 2 books.
i Bigs et oe cha ig ue
Saco RN xis,
Give a brief explanation on embedded SQL. (Os Marks)
Module-4
Demonstrate the insinrual design guidelines for the relation sch (08 Marks)
Define Functional Dependency. List out the six infere@Qyules ofifiRctional dependency.
(04 Marks)
Define Triggers. Brief about Triggers with syn (04 Marks)
ith example. (d0Mtarks)
(06.tarks)
Define Transaction. Expl sof transaction, (08 Marks)
Explain how to deal in concurrent control mechanisin, (on starks)
What isa dock? Exp late 2P (os Marks)
~
20f2
BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS
A Viuresource Go Green initiativeSave trees use e-Question Paper
DOWNLOAD THIS FREE AT www.viuresource.com
a
i
i
1
E
I
G3GS Scname
TL
I Ls -
Second Semester MCA Degree Examination, Dec.2017/Jan.201
Database Management System
‘Te: 3h. ri
Note: Answer FIVE full questions, choosing one full question from
Modute-t
‘4. What are the advantages of DBMS over Traditional File System ff xplain. (or maris)
Explain 3—schema Architecture, What do you mean by Dai infpendenc MME Nolan briefly
about different types a i 08 Marks)
Dias i min ohuracarnn of Deaios apne differs from Traditional
File system, What ar the main fnetions of DBA? (osmaria)
b, Explain the centralized , Two Tier, Three ~ Tiggand N—WClient Server Architectures
for DBMS, (08 Marts)
Define the term Relational Al
ein in detail shout compete set of
Relational Algebres Operations with exam (on Nari)
1b. Write ER “To Relational mappingalgor cxample (os mars)
Consider the following schema U6 mse)
EMPLOYEE (Frame, Minit. /aadross. Gender Salary -Super sn, Dro}
DEPARTMENT (Dname, Dr
DEPT_LOCATIONS (Drum
PROJECT (Prame, Pnombgr, Main, Dien)
WORKS_ON (Fssn, Pi
DEPENDENT (Ess.
igr_Start date)
Gender, Bdate, Relationship)
jswer al ofthe following queries im Relational Algebra
ofall employees who work forthe "Researeh: Deparment.
. Forevery project loeMhin Stafford’ ist the project number the controlling department
number an managers last name, address and bin date
©. Fin the projects controlled by department number
5.
4. Ms rojeet numbers for projects that involve an employee whose lastname is
ssa ‘worker ors a manager ofthe department that contols the project.
se of al employees with two oF more dependents.
names of employees who have no dependents.
nanagers whe have atleast one dependent
social security numbers ofall employees win eitter wor inthe departnent no
5 ordiectl supervise an employee who works in department no 5.
Madute:3
erentate anested sub query and correlated sub query. What are the sel operations of
L? Discus. (08 Marks)
Explain about all integrity constraints with examples (08 Marks)
Vol?
Go green
BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS
A Viuresource Go Green initiativeSave trees use e-Question Paper Go green
DOWNLOAD THIS FREE AT www.viuresource.com
oR
‘Consider the following schema
Department (Dept name, Building , Budget)
‘Course (Course id, Title, Dept name, Credits)
Instructor (Ud. Name, Dept name, Salary)
Seotion (Course_}d, Sec_id. Semester, Year. Building , Room number, Tint id
“Teaches (id. Coumse_id. Ses_i, Semester. Year)
‘The key fields ate underlined. Answer all of the following queries iffQL.
42) Fin the set ofall courses taught inthe fall 2009 as well asin sing 201
b) Find the numberof Instructors in each department who te in YP sping 2010
semester.
2) Seletthe names of instructors whose names are neither “MQART” Nor “EINSTEIN”.
<4) Bind the deparments that have the highest average
©) Pind all courses taught in bath the fal 2009 semester a
cconstact
1) Find all students who have taken all courses off
2) Find all courses that were offered at most on
Ih) Give a $% salary rise to instuctors whe
tne ng 2010 by using exists
Department
@ Giveall four informa design guide yemas. (8 mats)
1. Define Functional Dependency. 5 ‘Sirong's inference rules. (08 Marks)
What is Normalisation? Defeats ve— Cod Normal forms (08 marks)
Explain about Database fad functions. Define minimal cover. (08 Marks)
4. Discuss about Transaffien 1d Durability, What do you mean by Serializabiliy?
i (08 Marks)
b, ssstion Isolation, do you have? How do you implement Isolation
(08 Macks)
oR
a ut al Lock ~ Based Protocols (08 Marks)
b lure classification and Recovery Algorithm. (08 marks)
2082
BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS
A Viuresource Go Green initiativeSave trees use e-Question Paper
DOWNLOAD THIS FREE AT www.viuresource.com
Go green
Lit Td 20M;
vs [TTT TTT IT
Second Semester MCA Degree Examination, July/August 2
Database Management System
‘Time: 3 hs Max. Mark
Note: Answer any FIVE full questions, choosing ONE full question fr ot
E Module-1,
1 a. What is Database Management System? Explain Actors on tyne rkers behind
5 the scene ‘10 Mavis)
i 'b. Describe the three ~ Schema architecture of DBMS with agialjiym. (10 Marks),
42 on
2. a. Explhin Database system environment with a dng (10 meren
: vooar)
3a a0stanty
$ iantans)
ae ‘10 tats
b Whettsa need or wealiza tiomtess
$a, What is Dataype? Expl omens
8. Faptnn contrans in 3 mre (omnes
on
6 a. Explain aggrene Mons I with an example (iors
: clauses with on exer tio srt
re conta
5 ee
ee cane ooeenay toe
:. ine rh on cea comeas
Module-5
9. & Deine Transaction: Explain ACID propetss ih examples omens
Expl sto phase lneking techniques wih an exampke cama
or
Ei cari a ain cca ang eh tip dao ats
‘Whar i recover? Explain recovery in uliaubase syst costa)
BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS
A Vturesource Go Green initiativei
usN LILO) 2MCA21
‘Second Semester MCA Degree Examination, June/July 2023
Database Management System
‘Time: 3 hs. Max. Marks: 100
Note: Answer any FIVE fll questions, choaling ONE full question fom each module.
Modules
1a. Explin the Database System Envnonment with neat digray coins
1b Discuss the charactrstcsandgvaages of Database Apaches, (1oMtara,
oR
2a. Explain with proper dng, the 3 ~ schema architecture of DBMS, costs
1b Wha are the diferent ypes of arbutes? Explain h example. osns
Module2
3. a, Explain Unary Opeation SELECT (o) and prove itis commutative. fonts
Explain Scheme Update Operation, witha suitable examples. ‘aostans
on
4 4. Witha sntible example, explap Sv and division opera in lations algebra 10Mars)
1 Exphinin detail ER = t= Relational Mapping algonwigh ‘oMans)
Module
5 a. Exphin ith suitable expe the basi tustarC SQL. query. omy
What are Views in SQU? Explain oxi
on
{6 a. In SQL how oltdle the Agaregieinctions with gfOup by and having clauses? With
czars (sats
‘What are Aadtegne functions? Explain with an examples, (esata
Explain bearchtecture of JDBC main component types of rivers rnin
Modules
7) a._Discis infra desig uieline for rei schema aoytans)
‘hoWhat is Nomaliation? What arc it avafinges? Discuss INF, 2NF and NF. (Marks)
oR
8 a. Explain withan éxample the Boye Codd Normal Form (BCNP) ‘ooMars)
Discus the diferent ference for functional dependences ‘omar
Modutess
9 a. Explain ACID propeigsafansacton in details oom)
1b Discus the charactrizitip schedules bused on recoverbiiy ‘ooMtars)
on
10 a. Discuss a Lok} ied concurrency conto issue in DBMS trnsction procesing,
'b. Describe Gratlarty of dat items and Mukiple Granary locking ost
20GBS Schstls
Li }
Semester MCA Degree Examination, Dee.2023/Jan.2024
Database Management System
22MCA2
Max, Marks: 100
"Nate: Answer any FIVE fl questions choosing ONE fall question rom each mole
2M Marks, L Bloom's feel, C* Cours comes
Module 1 Le
Ta | Discuss te main charsstrses of the Database Approach,
[Po Tie and explain various data odes uso for Daubase design. ~~ 6 «(2 | COW
Taplin in deal abou the tire — er schema ahiecareoT DBMS, @ | LE COT)
oR
‘iacuss de dvaniages of DBNS.
~~}. Liat ane explain diferent ypes of Database Uses © cor
‘Explain fn dtl bout DBMS languages and interfaces © 12 cor
— cor
Tb. Descibe about he Unaryand Bina laional pation wih example.) 10 | LZ
on — |
Qa [a | Explain about the various notation used WER diagram with example. [10] 12 | COZ
1, Wika net emp, esos ie elatonal neg consi. ——*| 1/2 | CO
—— ‘Modale—3
QS [| Explaimabout he ws of DDL in SOL statement
By Dessibe SOL Datatype and domains with aa sample
on =|
OE apinaoar ie ae eae oT sor en WAT Sas [TOT TZ| CO
1: Desi dia i ac HO io /i2co8
yi
Noda —
OF Ja Dee at el sins or aia a Toyz cos
[i ap ropa a sts apne wak ae iw cor
[eens Sess ores csnDESESEDSC2MCA2L
‘GH | List and expan various pe of Functional Dependencies in DBMS. 10] L2[ COs
‘b. | Define Normalization. Explain about INF , 2NF and 3NF. 10) 12] Cor
E Siege == —
= Daas Tamarion apm about Alb pops anacion Ty] W]e
Tih. What is Lock? Describe the two — phase locking protocol. 10) 12) cos
ih z camer timate —
— Seen
0 |: Daribe he sneranyemnolban on Tine iw) 12 cos
6:7 amy ofl wor and Maile Gry king 19] EF COS]
2of?