IGNOU BCA Introduction to Database Management Systems Previous Year Unsolved Papers MCS 023

Chapter 1: Term-End Examination, June, 2010

MCS-023: Database Management Systems

Time: 3 Hours

Maximum Marks: 100

Weightage: 70

Note:       (i) Question No. 1 is compulsory.

(ii) Answer any three Questions from the rest.

Q1. (a) Define 3 NF. Justify whether the following relation satisfies 3 NF or not? In case it does not, decompose it into relations which do satisfy 3 NF. What advantages are gained by this decomposition?             2+5+1=8

Roll No.

N1

D1

1

N2

D2

1

N3

D1

2

N4

D2

2

N5

D1

3

(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.

1. List the names and cities they live in, of the professors who are working for the college C1

2. Find the name, street and city of the professors who are working for the college C2 and are having a salary more than 60000/-.

3. Find the names of professors who live and work in the same city.

4. Find the names of the professors who do not work for college C3.

5. Find the professors whose salaries are less than that of all of the college C4 employees.

6. Display college wise total salary.

(c) Explain the concept of data independence.                                    3

(d) List and explain all the types of constraints which can be violated while modifying database values.

6

(e) What is a weak entity? Explain with the help of an example.                        1+2

(f) Explain the hash file - organisation with the help of a suitable diagram. What are its shortcomings.

5

Q2. (a) For the following statement, draw an E-R 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.

8

(b) What is a transaction? Describe the ACID properties of transaction.                        1+4

(c) What is a deadlock. Explain the schemes of deadlock prevention.                        1+4

(d) Define the term DML pre-compiler.                                          2

Q3. (a) Differentiate between the followings:                                    12

(i). 2 Tier and 3 Tier architecture

(ii). Equi join and Natural join

(iii). Global and local transaction

(iv). Procedural and Non-Procedural DMLs.

(b) What is Cartesian product. Explain using an example. How Cartesian product operation is related to the join operation.

4

(c) Consider the relations                                                       4

student (d name, address)

marks (id, course, marks)

Create an authorization matrix for two users Viz. Student and Administrator. Make and state suitable assumptions.

Q4. Explain the following with the help of an example / diagram wherever needed:            20

(a) Conditions of occurrence of deadlocks

(b) Primary and Secondary indexes

(c) BCNF

(d) Two phase locking

Q5 (a) What is log based recovery ? Explain by taking an example of concurrent transactions. What are its drawbacks.

2+5+1

(b) Why do we need to fragment a relation ? What are the rules to be followed during fragmentation.

6

(c) Explain the following relational algebraic operations with the help of an example.            6

(i). Division operator

(ii). Set Difference operator

MCA (Revised)

Chapter 2: Term-End Examination, December, 2010

MCS-023: Database Management Systems

Time: 3 Hours

Maximum Marks: 100

Weightage: 70

Note:       (i) Question No. 1 is compulsory.

(ii) Answer any three Questions from the rest.

Q1. (a) State the two integrity rules. Also explain through an example when these two rules are violated?

2+2

(b) Define 2NF. Justify whether the following Products relation is in 2NF or not. In case it does not satisfy 2NF, decompose it into a set of relations which do satisfy 2NF. What advantages are gained by this decomposition Products Relation.

2+5+1

Brand Name

L

P1

E

P2

E

P3

E

P4

E

P5

(c) Consider the following database schema:                                     10

Student (Name, Student Number, Class, Major)

Course (Course Name, Course Number Credit Hours, Department)

Section (Section ID, Course Number, Semester, Year, professor)

Grade-Report (Student Number, Section ID, Grade)

Prerequisite (Course Number, Prerequisite Number)

Specify the following question using SQL

(i) Retrieve the names of all students majoring in CS

(ii) Retrieve the names of all courses taught by professor P1 in the years 2000 and 2001

(iii) Retrieve the name and transcript (Course Name, course Number, Credit Hours,