M.C.A. DEGREE EXAMINATION,
NOVEMBER 2017
First Semester
Computer Applications
RELATIONAL DATABASE MANAGEMENT SYSTEMS
(Common for M.C.A. M.C.A.
(CBCS 2017 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is DDL?
2. Comment on ER Diagram.
3. What is meant by Integrity constraint?
4. Write a note on selection operation in Relational Algebra.
5. What are Nested Queries?
6. Define Normal Form.
7. What is Transaction? List down the ACID properties.
8. Distinguish between physical and logical undo.
9. What are primary indices?
10. What is a Hash function?
Sub. Code
541103/
545103
RW-964
2
Wk 3
Part B 5 25)
Answer all questions, choosing either or
11. Explain the differences in between Database system
and File system.
Or
Write down the additional features of ER Model.
12. Write a note on Enforcing Integrity constraints.
Or
Explain Tuple Relational Calculus with examples.
13. What are comparison operators in SQL? Explain
with examples.
Or
Explain Fourth Normal form with an example.
14. Write about Implementation of Atomicity and
Durability.
Or
Write short notes on Buffer Management.
15. Write a note on File organizations.
Or
Write about the structure of B+-tree with an
example.
RW-964
3
Wk 3
Part C 10 30)
Answer any three questions.
16. Write about
views of data
instances and schemas.
17. Explain the following Relational Algebra operations with
examples.
set operations
joins.
18. Describe in detail, about Lossless Join Decomposition.
19. Explain Time stamp-based protocols in detail.
20. Discuss, Indexed Sequential Access methods in detail.
————————