Punjab Technical University 2006-3rd Sem M.C.A -RELATIONAL DATABASE MANAGEMENT SYSTEM-I - Question Paper

RELATIONAL DATABASE MANAGEMENT SYSTEM-I
MCA-304, third Semester (2096)

Time: 3 Hours Max Marks:75

Note: 1. Part A is compulsory. ans the ques. in 40-60 words.
2. Attempt any nine ques. from Part- B

Part A
Q1
i. What are relations?
ii. Define deadlock recovery.
iii. What is aggregation?
iv. What is multivalued dependency?
v. Difference ranging from ODD and ORD?
vi. What are strong & weak entities?
vii. What is super keys?
viii. Differentiate ranging from schema & Sub schema.
ix. What are log files?
x. Differentiate ranging from schema & sub schema.
xi. What are log files?
xii. Differentiate ranging from DDL & DML.
xiii. Write an SQL query to display the names of the employee from emp table whose salary is equal to the minimum salary.
xiv. What is dual table?
xv. What do you mean by selection and projection?
xvi. What are equi-joins and self joins?
xvii. Discuss the purpose of GROUP BY & HAVING clause with their syntax.
Marks : 15x2=30

Part – B
1. Explain the various views of DBMS.
2. What are various levels of normalization of database? explain.
3. Compare & contrast network, hierarchical & relation model.
4. Discuss the structure of distributed databases.
5. Differentiate ranging from physical and logical data Independence.
6. Differentiate ranging from relational algebra and relational calculus.
7. Explain object-oriented database with an example.
8. What do you mean by specialization & generalization. What is the difference ranging from them?
9. Draw E-R diagram of employee salary database.
10. Why locks are necessary in the concurrent operations in the database.
11. Explain the client/server architecture.
12. Discuss the main features of Oracle.
Marks: 9x5=45

Earning:   Approval pending.