FirstRanker.com
Data Base Management System
Firstranker's choice www.FirstRanker.com
--- Content provided by FirstRanker.com ---
(3 Hours) Total Marks: 100
N.B. (1) Question No. 1 is compulsory.
(2) Attempt any four questions from Q.2 to Q.7.
(3) Answers to questions should be grouped and written together.
(4) All questions carry equal marks
--- Content provided by FirstRanker.com ---
Q.1 (a) A university registrar’s office maintains data about the following entities: 10
- courses, including number, title, credits, syllabus, and prerequisites;
- course offerings, including course number, year, semester, section number, instructor(s), timings, and classroom;
- students, including student-id, name, and program; and
- instructors, including identification number, name, department, and title.
--- Content provided by FirstRanker.com ---
Construct an E-R diagram for the registrar’s office. Document all assumptions that you make about the mapping constraints.
(b) Write the schema definition and normalize all the tables till 3NF 10
Q.2 (a) Given the following schema 10
Dept_master(Dept_no, Dept_name)
Emp_master(Emp no, Emp_name, Emp_add, Joining_date, Dept_no, Salary)
--- Content provided by FirstRanker.com ---
- List the Employee name and salary in descending order.
- List the Employee name whose salary is more than 30,000 and designation is manager
- List the employee name and Department name for those employees whose earning salary more than 50000
- List the Employee name which contains at least 2 occurrences of ‘a’ in their name.
- List the name of employee who earning highest salary.
--- Content provided by FirstRanker.com ---
(b) What is serializability? Explain conflict equivalence and view equivalence 10
Q.3 (a) Explain architecture of DBMS. Describe the advantages of DBMS over file systems 10
(b) Define deadlock? Explain deadlock prevention techniques? 10
Q.4 (a) Explain Query optimization process in DBMS 10
(b) What is Bell la pedula model? Explain in detail 10
--- Content provided by FirstRanker.com ---
Q.5 (a) Suppose that we decompose the schema R = (ABCDE) into (ABC),(ADE). 10
Show that this decomposition is a lossless-join decomposition, if the following set F of functional dependency holds:
A->BC, CD->E, B->D, E->A
Also find out the candidate key.
(b) What is locking protocol? How 2 phase locking protocol is different from strict two phase locking protocol. 10
--- Content provided by FirstRanker.com ---
Q.6 (a) Differentiate between 10
- Generalization and Specialization
- Physical Data Independence and Logical Data Independence
(b) Explain timestamp based protocol and how it is used to control concurrency 10
Q.7 Write a short note on the following (any four): 20
--- Content provided by FirstRanker.com ---
- Candidate Key, Super Key and Primary key
- MVD
- Natural Join
- ACID properties of transaction.
- Lossless and dependency preserving decomposition
--- Content provided by FirstRanker.com ---
This download link is referred from the post: MU-Mumbai University MCA Last 10 Years 2010-2020 Question Papers || University of Mumbai
--- Content provided by FirstRanker.com ---