Professional Documents
Culture Documents
MCS 023
MCS 023
pdf
02._Dec_2010 MCS-023.pdf
03._June_2011 MCS-023.pdf
05._June_2012 MCS-023.pdf
06._Dec_2012 MCS-023.pdf
07._June_2013 MCS-023.pdf
08._Dec_2013 MCS-023.pdf
09._June_2014 MCS-023.pdf
10._Dec_2014 MCS-023.pdf
11._June_2015 MCS-023.pdf
12._Dec_2015 MCS-023.pdf
13._June_2016 MCS-023.pdf
14._Dec_2016 MCS-023.pdf
15._June_2017 MCS-023.pdf
16._Dec_2017 MCS-023.pdf
17._June_2018 MCS-023.pdf
18._Dec_2018 MCS-023.pdf
19._June_2019 MCS-023.pdf
20._Dec_2019 MCS-023.pdf
21._June_2020 MCS-023.pdf
22._Dec_2020 MCS-23.pdf
23._June_2021 MCS-023.pdf
24._Dec_2021 MCS-23.pdf
25._June_2022 MCS-23.pdf
26._Dec_2022 MCS-023.pdf
No. of Printed Pages : 4 MCS-023I
MCA (Revised)
Term-End Examination
June, 2010
0 MCS-023 : DATABASE MANAGEMENT
SYSTEMS
Time : 3 hours Maximum Marks :100
(Weightage 75%)
Note : Question number 1 is compulsory. Attempt any three
questions from the rest.
R2 N2 D2 1 H1
R3 N3 D1 2 H2
R4 N4 D2 2 H2
R5 N5 Di 3 H3
R6 N6 D3 4 H4
MCS-023 1 P.T.O.
(b) Consider the following tables : 15
Working (P_name, C_name, Salary)
Living (P_name, Street, City)
Located (C_name, city)
When P_name = Professor name,
C-name = College name.
Write the SQL Queries for the following.
List the names and cities they live in,
of the professors who are working for
the college C1
Find the name, street and city of the
professors who are working for the
college C2 and are having a salary
more than 60000/-.
Find the names of professors who live
and work in the same city.
Find the names of the professors who
do not work for college C3.
Find the professors whose salaries are
less than that of all of the college C4
employees.
Display college wise total salary.
Explain the concept of data independence. 3
List and explain all the types of constraints
6
which can be violated while modifying
database values.
What is a weak entity ? Explain with the 1+2
help of an example.
Explain the hash file - organisation with the 5
help of a suitable diagram. What are its
shortcomings.
MCS-023 2
2. (a) For the following statement, draw an E-R 8
diagram. Make and state any reasonable
assumptions. "A machine shop produces
many parts which it takes on contract. It
employs many operators who operate any
of the machines. A part is produced using
only one machine. A record is kept on the
quantity of material needed for producing
each part. The production of each part is
tracked by giving a job number, start time
and end time and operator's identification".
What is a transaction ? Describe the ACID 1+4
properties of transaction.
What is a deadlock. Explain the schemes of 1+4
deadlock prevention.
(d) Define the term DML precompiler 2
MCA (Revised)
Term-End Examination
C•J June, 2011
MCS-023 1 P.T.O.
(d) A concurrent schedule of transactions T1 and T2
acting on "SUM" is given below : 6
Schedule T1 T2 Sum
- - - 100
Reads (Sum) Reads (Sum)
Sum . Sum +10 Sum . Sum + 10
Read2 (Sum) Read2 (Sum)
Writer (Sum) Writei(Sum)
Sum =Sum —10 Sum . Sum —10
Write2 (Sum) Write2 (Sum)
Analyzing the given concurrent schedule
performing following tasks.
(i) What is the final value of "SUM" ?
(ii) Verify that the given schedule is
serializable or not. Explain.
(e) Explain log based recovery scheme with the 6
help of an example.
(f) How client server databases differs from 6
Distributed Databases ? Explain with the
help of an example.
(g) Define Functional Dependency (FD). Find 6
the valid FD's in the following relation.
A B C D
al b1 ci d1
a2 b2 C2 d2
a3 b2 C3 d3
a4 b3 C4 d4
MCS-023 2
2. (a) Is it always beneficial to work with database 3
systems, or some times filebase system is a
better option ? Comment on it with suitable
arguments.
(b) Explain physical data independence and 4
logical data independence.
(c) Determine the output when following 7
operations are applied on relations R1, R2
and R3 given below.
R1: A B R2: X Y
Al B1 Al Bi empty
A2 B2 A7 B7
A3 B3 A2 B2
A4 B4 A4 B4
MCS-023 3
3. (a) What do you mean by integrity constraints ? 4
Briefly describe the various types of integrity
constraints.
(b) Explain insert, delete and update anomalies 6
for a relation (R), with examples.
(c) An ordered employee file (ordering field is 7
emp_id) has 20000 records, stored on a disk
having block size 1k. Assume that each
student record is of 100 bytes, the ordering
field is of 8 bytes and block pointer is also of
8 bytes, find how many block accesses on
average may be saved on using primary
index.
(d) List the desirable properties of 3
decomposition of a data base.
MCS-023 4 P.T.O.
(b) Explain 2 phase locking protocol. 4
(c) What is a transaction ? Briefly describe the 4
properties of the transactions.
(d) Describe the following : 4
(i) Optimistic scheduling
(ii) Disadvantages of SQL
MCS-023 5
No. of Printed Pages : 4 MCS-023
MCA (Revised)
O
Term-End Examination
00
O June, 2012
MCS-023 1 P.T.O.
(d) Decompose the relation R = (A, B, C, D, E) 4
with the set of functional dependencies
A —> BC
CD --> E
B —> D into 3NF relation
(e) What are the functions of a Database 5
Administrator.
(f) Justify the following statements 6
(i) Two phase locking leads to serializability
schedules.
(ii) A Relation in BCNF is also in 3NF.
(g) Discuss the problems associated with 6
concurrent transactions.
(h) Write down the advantages and 5
disadvantages of distributed DBMS.
MCS-023 2
3. (a) Consider the following Tables : 16
Works (Pname, Cname, salary)
LIVES (Pname, street, city)
LOCATED (Cname, city)
MANAGER (Pname, Mname)
Write queries in SQL for the following
(i) List the names of the people who work
for the company Wipro along with
the cities they live in.
(ii) Find the people who work for the
company 'Infosys' having salary
greater than Rs - 50000/-
(iii) List the names of the people, along
with the street and city addresses.
(iv) Find the persons whose salaries are
more than that of all of the 'Oracle'
employees.
(v) And the name of the persons who do
not work in 'Infosys'.
(vi) Find the average salary of the
employee in company named
`accenture'.
(vii) Create a table for the above relation
using SQL - DDL
(viii) Create a view consisting of the person
name along with their manager name
and company name.
(b) What are the problems caused by deadlock ? 4
Give a Mechanism to detect deadlock.
MCS-023 3 P.T.O.
4. (a) Explain the purpose of check points in 4
database recovery.
(b) Why is a B tree a better structure than a 5
binary search tree for implementation of an
index ?
(c) Explain the log based recovery in Database
systems.
(d) Consider the relation R (A, B, C, D, E) and
the set of functional dependencies :-
F(A —>D,{A,B} D —> E)
(i) Which of the following are candidate
keys ?
(A) (Al
(B) (A, B}
(C) {A, El
(ii) Consider the decomposition of R into 6
{R1 (A, B, C) and R2 (A, D, E)}.
Is this decomposition lossless ?
Justify ?
MCS-023 4
No. of Printed Pages : 4 MCS-023
MCA (Revised)
Term-End Examination
If) December, 2012
MCS-023 : INTRODUCTION TO DATABASE
MANAGEMENT SYSTEMS
Time : 3 hours Maximum Marks : 100
(Weightage 75%)
Note : Question No. 1 is compulsory. Attempt any three
questions from the rest.
1. (a) Design ER Diagram for the following 10
statement :
"Each Bank can have multiple branches and
each branch can have multiple accounts
and loans". Convert the ER diagram into
relational model (i.e. tables). Identify the
keys and describe the integrity constraints.
(b) How would you normalize EMP-DEPT in 10
to 3NF? EMP-DEPT(ENAME, SSN,
BDATE, ADDRESS, DNUMBER, DNAME,
DMGRSSN)
Where following dependencies are given
SSN ---> ENAME, BDATE, ADDRESS,
DNUMBER DNUMBER --> DNAME,
DMGRSSN.
(c) Consider the relation R(A,B,C,D) with the 5
following dependencies :
AB --> C, CD ---> E,DE --->B is AB a candidate
key of this relation ? Explain your answer.
MCS-023 1 P.T.O.
(d) What is a system log? What are the typical 5
kind on entries in a system catalog?
(e) Draw diagram to show the states of 5
transaction execution. Briefly discuss each
of the states, shown in the diagram.
(f) Draw the block diagram to show the 5
components of Database manager.
MCS-023 2
(b) What problems occur in the database when 7
transactions do not satisfy ACID
properties ? Explain explicitly using suitable
examples ?
(c) Consider the following relations : 2x4=8
P: Pid Pname Q : Pid Pname
001 abc 012 xyz
012 xyz 014 lmn
014 lmn 016 SSS
015 opq 017 SSD
017 SSD
MCS-023 3 P.T.O.
5. (a) What are the advantages of DDBMS over 10
centralized DBMS ? Why is data replication
and fragmentation performed in
DDBMS ? What typical units of data are
replicated ?
(b) What is two phase locking protocol ? How 5
does it guarantee serializability? Explain.
(c) Discuss the multiversion technique for 5
concurrency control.
MCS-023 4
No. of Printed Pages : 5 MCS-023
MCA (Revised)
MCS-023 1 P.T.O.
(g) List all the functional dependencies that 4
holds true for the following relation.
A B C
a1 1)1 c1
al Ill c2
a2 b1 c1
a2 1D1 c3
(h) Discuss the two-phase locking protocol in 5
concurrency control ?
ARCS-023 2
3. (a) What is an outer join ? Discuss the different 5
types of outer joins with the help of example.
MCS-023 3
(b) What are the differences between BST-Tree 4
and B tree Indexes ?
(c) Compare sequential file organisation with 5
Heap files organisation. Discuss the
advantages and disadvantages of sequential
file organisation.
(d) Explain the following terms : 6
(i) Equi Join
(ii) Data Replication
(iii) Entity Integrity Constraints.
MCS-023 5
4. (a) Consider the following relation for 10
published books :
Book (Book title, Author name, Book-type,
list price, Author-affil, Publisher)
(Author-affil referes to the affiliation of the
author.) Suppose the following depende-
ncies exist :
Book-title -4 Publisher, Book-type
Book-type y —> list price
Author-name Author-affil
(i) What normal form is the above
relation in ? Justify.
(ii) Normalize the above relation to its
highest Normal form.
(b) Discuss the different types of fragmentation 5
in distributed databases with the help of an
example.
(c) Explain the ACID properties of transactions 5
in Database system.
MCS-023 4 P.T.O.
No. of Printed Pages : 4 MCS-023J
MCA (Revised)
Term-End Examination
December, 2013
MCS-023: INTRODUCTION TO DATABASE
MANAGEMENT SYSTEMS
Time : 3 hours Maximum Marks : 100
(Weightage 75%)
Note : Question No. 1 is compulsory. Attempt any three
questions from the rest.
MCS-023 1 P.T.O.
(b) Differentiate between BCNF and 3NF. Why 7
BCNF is considered as a stronger form of
3NF ?
(c) Briefly discuss the concept of catalogs in 8
distributed databases. How catalogs are
used to maintain the consistency of
database in an distributed environment.
Use suitable example to justify your answer.
(d) Design an ER diagram for keeping track of 8
the details of your favourite sports team.
You should stone the matches played, the
score in each match and individual player
statistics for each match. Identify the
entities, relationships and also mention the
cardinality of ER diagram.
(e) List all the functional dependencies satisfied 7
by the relational instance given below :
A B C
a1 b1
a1 b1 c2
a l b1 c1
a 2 b1 c3
MCS-023 2
(i) Languages used at each level.
(ii) Data independence types, between
different levels.
(iii) SQL commands, associated with the
languages used at each level.
(b) How serial schedule is different from 7
serializable schedule ? What are the
problems associated with both schedules ?
How you will identify that a schedule is
serializable ornot, use suitable example, in
support of your answer.
(c) What are the additional functions does a 5
distributed DBMS have over centralized
DBMS?
MCS-023 3 P.T.O.
4. Discuss the differences between serial, 8
hashed and indexed sequential file
organizations. Compare their storage and
access efficiencies.
(b) What is optimistic scheduling ? Explain the 5
three phases of optimistic scheduling.
(c) Why do we normalize a database ? Write 7
statement of 21\1F. Briefly discuss the insert,
delete and update anomalies, if the relation
is not in 2NF.
MCS-023 4
No. of Printed Pages : 5 MCS-023
MCA (Revised)/BCA (Revised)
Term-End Examination
June, 2014 12574
MCS-023 : INTRODUCTION TO DATABASE
MANAGEMENT SYSTEMS
MCS-023 1 P.T.O.
(f) What is Functional Dependency (FD) ? Find 5
the valid FD's in the following relation :
A B C
i 1 2
i 1 3
j 1 4
j 1 3
k 2 5
1 4 7
MCS-023 2
(b) What is database recovery ? Explain with 5
an example, how system log is used for data-
base recovery.
MCS-023 3
4. (a) What is Data Fragmentation ? Explain 7
differences between Horizontal
Fragmentation and vertical Fragmentation
with the help of suitable example of each.
TEACHER(Teacher_ID,Dep_ID,
Name, Subject)
MCS-023 4 P.T.O.
5. (a) A file has r = 10,000 Bank Account records 10
of fixed length. Each record has the
following fields :
Name (20 bytes), Account_No(8 bytes),
address (40 bytes), Balance (15 bytes) and
Branch-Code (5 bytes).
The file is stored on a disk with the following
characteristics :
Block Size = 512 bytes, Inter Block
Gap = 128 bytes, number of block per
track = 15, Number of tracks per sector =
300.
A disk pack consist of 15 double side disks.
(i) Calculate record size R in bytes.
(ii) Calculate the blocking factor (bfr) and
the number of file blocks b, assuming
an unspanned organization.
(iii) Calculate the average time it takes to
find a record doing a linear search on
the file , in which file blocks are not
stored contiguously.
(iv) Assume that the file is ordered by
"Branch-Code", calculate the time it
takes to search for a record given its
"Branch_Code", by using a binary
search..
(b) Write short note on the following 10
(i) Concurrency Control
(ii) Database Views
MCS-023 5
02104
No. of Printed Pages : 5 MCS-023
MCS-023 1 P.T.O.
(c) What is distributed DBMS ? List the issues
involved in the design of a distributed
DBMS. Also explain the features of
distributed transaction with the help of an
example.
R1: X Y R2 : A B
Al B1 A2 B2
A2 B2 A6 B6
A3 B3 A7 B7
A4 B4 A3 B3
R3 :
► Empty
MCS-023 2
(e) What is a checkpoint ? Briefly explain its
importance. 5
MCS-023 3 P.T.O.
(b) Draw an E-R Diagram for the situation
given below : 10
An organization needs to provide Medical
facilities to its employees and their
dependents. Organization is having a list of
Doctors, Hospitals and Test centres for the
employees facility. An employee may get
Medical facility from the list of Doctors,
Hospitals and Test centres provided by the
organization to them. Employee does not
need to pay anything for the facilities
availed. The Doctors, Hospitals and Test
centres directly raise their bill to the
organization.
Note : Make necessary assumptions wherever
required for making E-R Diagram. Show
clearly weak and strong entities and their
relation in the system.
4. (a) What is Functional Dependency ? Explain
single-valued dependency with an example. 5
(b) Explain Physical DBMS architecture with
the help of a diagram. 7
(c) Explain the following in brief : 8
(i) Client-Server Databases
(ii) Log-based recovery
5. (a) Explain the following with the help of an
example : 8
(i) Loss-less decomposition of database
(ii) Deadlock and its prevention in
database system
MCS-023 4
(b) Write SQL statements to perform the
following queries on the relations given
below :
BOOK (Book_ID, Title, Publisher_ID,
Year_of Pub, Price)
AUTHOR (Author_ID, Book_ID,
Author Name)
PUBLISHER (Publisher_ID, Book_ID,
Address, Name_of Pub, No._of Copies)
(i) Find the name of authors whose books
are published by "ABC Press".
(ii) Find the name of the author and price
of the book, whose Book_ID is '100'.
(iii) Find the title of the books which are
published by Publisher_ID '20' and
are published in year 2011.
(iv) Find the address of the publisher who
has published Book_ID "500".
MCS-023 5 13,000
No. of Printed Pages : 4 I MCS-023
MCS-023 P.T.O.
Sciences, Fiction, Literature, Applications,
etc. If at all, any discounts that are there
for certain books, need to be notified on the
site (best-buy offer). To buy a book, a
customer needs to register on the site. Also
it maintains the profile of the user and also
their earlier purchases. The bookshop also
sends "Newsletter" to all the registered
users to update them about the
publications.
MCS-023 3 P.T.O.
5. Write short notes on the following : 4x5=20
(a) Locks
MCS-023 4 11,000
No. of Printed Pages : 3 I mcs-0231
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2015
MCS-023 1 P.T.O.
(d) Differentiate between Horizontal
fragmentation and Vertical fragmentation
with the help of suitable examples in Data
fragmentation of Distributed databases. 10
MCS-023 2
4. (a) With the help of an example for each,
explain Host Updates, Dirty Reads and
Unrepeatable Reads of Concurrent
transactions. 10
MCS-023 3 16,000
No. of Printed Pages : 4 I MCS-023 I
MCS-023 1 P.T.O.
(b) List all the functional dependencies that
hold true for the following relation : 10
A B
al b1 c1
al b1 c2
a2 b1 c1
a2 b1 c3
MCS-023 2
(b) What are the different types of constraints
which can be imposed on Generalization in
an E-R diagram ?
(c) How would you map the following E-R
constructs into relations ? Give suitable
examples.
(i) Aggregation
(ii) Inheritance
n-ary Relationship
MCS-023 4 10,500
No. of Printed Pages : 5 MCS-023
MCA (Revised) / BCA (Revised)
Term-End Examination
Cl6(35 December, 2016
MCS-023 1 P.T.O.
(d) Consider the following relations :
A : Pid PName B: Pid PNarne
001 abc 002 cde
002 cde 011 efg
011 efg 015 ijk
014 ghi 016 Um
015 ijk
016 klm
Find the following : 10
(i) AUB
(ii) A—B
(iii) A nB
(iv) A x B
(e) Explain briefly about Data Replication.
Give its disadvantages.
2. (a) For the following problem definition :
The book club has members. The book club
sells books to its members. The members
place orders for books, which the book club
fulfils. Each order contains one or more
than one book. The books are written by
author(s). The publisher publishes the
book. An author can write more than one
book and a book can have more than one
author. A book is published by a publisher,
but a publisher publishes many books. A
member can place more than one order.
The member also can choose not to place
an order. The book club sells many books.
Draw an ER Diagram. 10
MCS-023 2
(b) Consider the 'F' and `G' sets of functional
dependencies, where
F = —> C, —> D, E --> AD, E 111 and
G.{A—>CD,E—>AH}.
Check whether they are equivalent or not. 5
MCS-023 3 P.T.O.
(b) Discuss the wait-die and wound-wait
protocols for deadlock prevention. 7
(c) Distinguish between deferred update and
immediate update log based recovery
techniques. 8
MCS-023 4
5. (a) Discuss the anomalies due to insertion,
updation and deletion in a relation that is
not in QNF. Illustrate with the help of an
example. 5
MCS-023 5 12,000
No. of Printed Pages : 4 I MCS-023 I
MCA (Revised) / BCA (Revised)
Term-End Examination
June, 2017
1 1E L
R R2
A B A B
B1 Alva .
Al
A2 B2 A7 B7
A3 B3 A2 B2
A4 B4 A4 B4
MCS-023 2
2. (a) With the help of a suitable example,
discuss the insertion, deletion and updation
anomalies that can occur in a database.
Briefly discuss the mechanism to remove
such anomalies. 10
MCS-023 P.T.O.
4. (a) Perform the following tasks for the
relation R(A, B, C, D, E) whose functional
dependency set (FD) is given below :
FD: {AB —> C, C —> D, D —> A, BD —> E)
MCS-023 4 7,500
No. of Printed Pages : 5 MCS-023 I
MCS-023 1 P.T.O.
(b) Which of the following functional
dependencies holds for the . Relation (R)
given below ? Justify your answer.
Relation (R) :
J K L
X 1 2
X 1 3
Y 1 4
Y 1 3
Z 2 5
P 4 7
Functional Dependencies :
(i) J --> K
(ii) K —> J
J, K —> L
(c) What is the role of views in DBMS ? Can
we perform insert, delete or modify
operations, if the view contains a group
function ? Justify.
(d) Why do we do normalization of databases ?
Discuss synthesis and decomposition
approaches of normalization. Give one
example for each approach.
(e) What is the significance of checkpoints in
DBMS ? Discuss the utility of checkpoints,
with the help of suitable example.
MCS-023 2
(f) Consider the following relational database
schema :
Employer (ecode, ename, eaddress, esalary)
Project (pcode, pname, pduration)
Works for (ecode, pcode, duration)
Perform the following queries using SQL
and relational algebra :
(i) Find the name of the employees
whose salary is less than 5 lacs per
annum.
(ii) Find the details of the employees
working on the project "Clusters".
(g) Describe the utility of data replication in
distributed DBMS. Briefly discuss the
concept of complete and selective
replication. 5
Schedule T1 T2 Sum
T1 : Read Read
(Sum) 500
(Sum)
T1: Sum = sum .
Sum — 100 Sum — 100
T2 : Read Read
(Sum) (Sum)
T2 : Sum = Sum =
SuM + 200 Sum + 200
T1 : Write Write
(Sum) (Sum) .
T2 : Write Write
(Sum) (Sum)
Referring to the schedule given above,
answer the following questions with
justification : 10
(i) Which property of transactions is
violated ?
(ii) What is the final status of 'SUM' ?
(iii) Is the schedule serializable ?
(iv) Which problem in database is
contributed by the schedule given ?
(b) What is the need of indices in a database
system ? Mention the categories of indices
available in a DBMS. Which data structure
is suitable for creating indices and why ? 10
MCS-023 4
4. Differentiate between the following : 4x5=20
(a) DBMS and File base systems
(b) 2-Phase locking and 2-Phase commit
(c) DDBMS and Centralized DBMS
(d) Serial schedule and Serializable schedule
MCS-023 11,000
No. of Printed Pages : 4 MCS-023 I
MCA (Revised) / BCA. (Revised)
Term-End Examination
June, 2018
MCS-023 2
Now, perform the following :
(i) Determine the highest normal form of
the relation SUPPLIER. 2
(ii) Normalize the relation SUPPLIER to
the next higher normal form.
(iii) Discuss the Deletion and Insertion
anomalies, which can occur in the
relation SUPPLIER. 2
(c) Construct an ER diagram for the loan
management system of a finance company.
Loans are given on the purchase of various
items with different interest rates. The
company keeps track of defaulters and
takes appropriate steps against them.
Make and state suitable assumptions (if
any). 7
MCS-023 4 10,000
No. of Printed Pages : 4 I mcs-0231
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2018
Del e.19'
MCS-023 2
(b) What do you understand by the term
closure of a relation (R) with functional
dependency set (F) ? Compute the closure
for relation R(/, m, n, o, p) with functional
dependency set F as given below :
F{/ —> mn; no —> p; m —> o; p l}
Identify the candidate keys for the
relation (R). 10
[5]
MCS-023 [P.T.O.]
(b) Which precedence graph for the following
schedule is correct ? State whether the schedule
is serializable or out : [5]
Schedule T1 T2
Read X Read X
Add 500 Add 500
Read X Read X
Write X Write X
Read Y Read Y
Read Y Read Y
Substract-200 Substract 200
Display X+Y Display X+Y
Write Y Write Y
MCS-023 (2)
(c) Consider the following relational schema: [4]
[3]
A B X
Al B1 Al B1
R1: A2 B2 R2 A7 B7
A3 B3 A2 B2
A4 B4 A4 B4
(i) R, n R2
(ii) R , — R2
(iii) R2
MCS-023 (4)
(c) Differentiate between the Basic 2PL and Strict
2PL with respect to atomicity, concurrency and
deadlock. [7]
[5] operatins?
SSN e _ name
MCS-023/12000
(b) XYZ bank manages four types of accounts : Loan,
Current/Saving, Recurring and Deposits. It
operates number of branches and a customer of
the bank can have any number of accounts :
Schedule A
T1 T2
Read (x)
Read (x)
Write (y)
Write y
Commit
Commit
MCS-023/12000 (2)
(e) Explain database recovery using a system log
with the help of an example. [6]
[5]
MCS-023/12000 ( 3 [RIO]
3. (a) What is a binary lock ? How does it solve a
concurrency related problem ? Explain through
an example. [7]
MCS-023/12000 (4)
(d) What is a B + tree ? Why is a 13 + tree better
structure than a B-Tree for implementation of an
index sequential file ? [4]
MCS-023/12000 ( 5)
No. of Printed Pages : 4 MCS-023
P. T. O.
[2 I MCS-023
(i) Select
(ii) Project
(iii) Join
P. T. O.
[4] MCS-023
MCS-023 1 P.T.O.
(b) How do weak entities differ from strong
entities ? Discuss with the help of an
example. Briefly discuss the role of keys in
identification of the entity type, i.e. weak
or strong. 5
J K L
x 1 2
x 1 3
y 1 4
y 1 3
z 2 5
p 4 7
(i) JK
(ii) KJ
(iii) J, K L
(iv) K, L J
MCS-023 2
(d) List the properties of concurrent
transactions. Consider the concurrent
schedule of the transactions T1 and T2
given below :
MCS-023 4
5. (a) Can we use Binary Search Tree (BST) as
Indexes ? Justify. If we use BST as Index,
then what can be the possible problems ?
What will be the solution for those
problems ? 10
(b) Consider ‘‘Library Management System’’
which keeps the following tables :
Book (isbn_no, title, author, publisher,
edition, year)
Book_Access (access_no, isbn_no,
date_of_purchase)
Member (m_name, m_id, m_address,
m_phone)
Issue_Return (access_no, m_id,
expected_return_date, actual_return_date)
Specify the following queries in SQL : 10
(i) Find m_id and m_name of the
members who have got at least one
book issued to themselves.
(ii) List the book details for the books
which were purchased after January
2017.
(iii) List all the books on title
‘‘Databases’’. This list should be
sorted on author’s name.
(iv) Find the members who have not got
any book issued.
MCS-023 5 P.T.O.
[2] MCS-023
P. T. O.
[3] MCS-023 [4] MCS-023
2. (a) Draw an ER diagram for the situation 4. (a) Explain database recovery using system
given below : 10 log, with the help of an example. Compare
“A company has many employees, working the backward recovery with forward
on several projects. A project is controlled recovery with the help of an example of
by a manager who is an emloyee of the each. 10
company.” Perform the following tasks for (b) Discuss the role of database manager of a
the description given above : DBMS. Draw diagram to show the
(i) Identify entities, attributes, important components of database
relationships, cardinalities, and draw manager. Explain the role of each
an ER diagram. component shown in the diagram. 10
(ii) Convert the ER diagram into tables 5. Explain any five of the following : 5×4=20
and show relationship among the
tables as per the ER diagram. (a) 2-phase locking protocol
(b) Describe the relationship between data (b) Deadlock prevention protocol
security and data integrity, with the help (c) Data fragmentation in DDBMS
of a diagram. 5
(d) Cartesian product and division operations
(c) Compare strong and weak entities in the in relational algebra
context of ER diagram with the help of an
(e) Inverted file organisation
example. 5
(f) Client-server databases
3. (a) What are concurrent transactions ? Briefly
discuss the problems encountered by
concurrent transactions. 10
(b) Briefly discuss the term normalization in
DBMS. Write statement for Second Normal
Form (2NF) and discuss the insert, delete
and update anomalies associated with
2NF. 10 MCS–023
P. T. O.
No. of Printed Pages : 6 MCS-023
Sales_order
Order_No Date Cust_No
OD10 1/6/19 C10
OD11 1/7/19 NULL
OD12 11/7/19 C12
NULL 1/8/19 C11
The underlined attributes are primary
keys. State with proper reasoning which, if
any, of the entity integrity rules are
violated for each of the above tuples (row)
in Sales_order relation. 8
MCS-023 1 P.T.O.
(b) Define the serializable schedule. State with
proper explanation whether the following
schedule is serializable or not : 6
T1 T2
read (X);
read (X);
write (Y);
write (Y);
commit
commit
MCS-023 2
Write the queries using SQL : 6
(i) Find the details of Official_Tour
relation whose expenses exceed
< 5000.
(ii) Find the total official tour expenses
incurred by sales executives from
Dept_No = DN1.
(iii) Find the SEID’s of sales executives
who took trips to Bangalore for seven
days with expenses ranging between
< 5000 and < 9000.
MCS-023 4
3. (a) With the help of an example for each,
explain the following : 23=6
MCS-023 5 P.T.O.
5. (a) Describe the following client-server
architecture with the help of a
diagram : 25=10
(i) 2-tier
(ii) 3-tier
MCS-023 6
No. of Printed Pages : 4 MCS-023
MCS-023 1 P.T.O.
(e) Compare BCNF and 3NF. Discuss insert,
delete and update anomalies in 3NF, with
a suitable example of each. 10
(f) Discuss the role of views in DBMS ? Can
we perform insert, delete or modify
operations, if the view contains a group
function ? Justify. 5
(g) Explain the terms data replication and
data fragmentation, with the help of a
suitable example. 5
MCS-023 2
3. (a) What is Normalization ? Compare the
Synthesis and Decomposition approach of
Normalization. Discuss Lossless
decomposition and Dependency preserving
decomposition, with a suitable example of
each. 10
MCS-023 3 P.T.O.
4. Differentiate between the following (give example
for each) : 45=20
(a) Client-Server vs. Distributed Database
(b) Centralized DBMS vs. Distributed DBMS
(c) DBMS vs. File Base Systems
(d) 2-Phase Locking vs. 2-Phase Commit
MCS-023 4
No. of Printed Pages : 11 MCS-023
M. C. A. (REVISED)/B. C. A. (REVISED)
Term-End Examination
December, 2022
MCS-023 : INTRODUCTION TO DATABASE
MANAGEMENT SYSTEMS
Time : 3 Hours Maximum Marks : 100
Weightage : 75%
P. T. O.
[2] MCS-023
Sales-Order
Order- Cust-
Date
No No
T1 T2
read (X);
write (X);
read (X);
write (Y);
Commit
Commit
[3] MCS-023
P. T. O.
[4] MCS-023
(i) R1 ∪ R2
(ii) R1 ∩ R2
R1 : Eid Ename
Eid1 N1
Eid2 N2
Eid3 N3
Eid4 N4
Eid5 N5
R2 : Eid Ename
Eid2 N2
Eid4 N4
Eid5 N5
P. T. O.
[6] MCS-023
Employee Table
E- Salary
ID Age Department
Name (`)
ID1 N1 20,000 30 D1
ID2 N2 15,000 35 D2
ID3 N3 25,000 40 D2
ID4 N4 30,000 35 D3
ID5 N5 22,000 45 D4
ID6 N6 27,000 42 D4
School of studies : 6
Student
ID1 M. C. A. D1
ID2 M. C. A. D1
ID3 B. Sc. D2
ID4 M. A. D3
School_f_studies
D2 Science D-Block
P. T. O.
[8] MCS-023
1 LOCK X
[9] MCS-023
2 LOCK Y
3 READ X
4 X = X + 50
5 Write X
6 Unlock X
7 Lock X
8 Lock Y
9 READ Y
10 Y = Y – 40
11 Write Y
12 UNLOCK Y
13 READ X
14 READ Y
15 Output = X
+Y
16 Display
Output
17 UNLOCK X
18 UNLOCK Y
P. T. O.
[ 10 ] MCS-023
MCS–023
P. T. O.