M.C.A. DEGREE EXAMINATION, APRIL 2016
Comp. Applications
RELATIONAL DATABASE SYSTEMS
(Common for M.C.A.(R)/WE)
(2012 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 2 20)
Answer all the questions.
1. Define: DDL.
2. What is meant by Storage Manager?
3. Define: Integrity Constraint.
4. Write a note on Division operation in Relational Algebra.
5. What are Nested SQL queries?
6. Define Second Normal Form.
7. List the Transaction states.
8. Define: Serializable schedules.
9. What is meant by Cluster index?
10. State any two differences between Primary index and
Secondary index.
Sub. Code
541103/
545103
RW-10961
2
hp-ap1
Part B 5 25)
Answer all the questions, choosing either or
11. Describe the View's of data in Database.
Or
Write short notes on: Transaction Management.
12. Describe about logical database design.
Or
Write short notes on: Projection and Join operations
in Relational Algebra.
13. List any FIVE aggregative operations in SQL and
explain them with examples.
Or
Discuss about Lossless Join Decomposition.
14. Describe about Testing for Serializability.
Or
Write short notes on: Buffer Management.
15. Write short notes on: Tree based indexing.
Or
Write a short note on: trees.
RW-10961
3
hp-ap1
Part C 10 30)
Answer any three questions.
16. Explain the Database System Structure.
17. Explain Tuple and Domain Relational Calculus with
examples.
18. Discuss Multi valued dependencies with examples.
19. Explain about Timestamp based protocols.
20. Discuss in detail, Comparison of file organizations.