Advanced Database Management System - Tutorials and Notes: MC 7103 – DATABASE MANAGEMENT SYSTEMS May June 2014 Question Paper

Thursday, 24 September 2015

MC 7103 – DATABASE MANAGEMENT SYSTEMS May June 2014 Question Paper

MC 7103 – Database Management Systems - May/June 2014 Question Paper / Anna University MCA Exam May/June 2014 Question Paper / MC7103 DBMS May/June 2014 Question Paper / MC7103 Database Management Systems Previous Year Question Paper with Answers / Anna University Affiliated Colleges MCA Question Papers / Regulation 2013 MC7103 Question Paper

Question Paper Code : 60804
M.C.A DEGREE EXAMINATION, MAY/JUNE 2014
MC 7103 – DATABASE MANAGEMENT SYSTEMS
(Regulation 2013)
Time : Three Hours                                                         Maximum : 100 marks
Answer ALL Questions
PART A – (10 X 2 = 20 marks)

1. What do you mean by weak entity set?
2. List any four applications where database is used.
3. With an example define the basic structure of a relational database.
4. For the given schema structure – loan(loan_number, branch_name, amount), using Tuple Relational Calculus, find the loan number with amount greater than Rs.50,000.
5. Define the term ACID property.
6. What is shadow paging?
7. Mention the advantages and disadvantages of indices.
8. Why variable length records arises in databases? Give an example.
9. What are the advantages of OODBMS?
10. Write a note on nested relation.

PART B – (5 X 16 = 80 marks)

11. (a) Explain the database system architecture with neat diagram. (16)
Or
(b) (i) Draw the ER diagram for University database and explain each attribute in detail. (8)
(ii) Discuss the various disadvantages of file system and explain how it can be overcome by DBMS. (8)

12. (a) Explain Boyce Codd Normal Form and 3NF with your own example. Also give how it differs from that of 3NF. (16)
Or
(b) Explain various relational algebra operators with suitable example. (16)

13. (a) Explain the different techniques of serializability with example. (16)
Or
(b) How concurrency control is performed? Explain the protocol that is used to maintain the concurrency concept. (16)

14. (a) Explain how B+ tree is used for indexing with an example. (16)
Or
(b) Construct the extendible hash structure to accommodate the records of a relation given below by using the search key values given. (Assume the bucket size as 2) (16)
A217
A101
Brighton
Downtown
750
500
A110
Downtown
600
A215
Mianus
700
A102
Perryridge
400
A201
A218
Perryridge
Perryridge
900
700
A222
Redwood
700
A305
Round Hill
350
Table
Branch_name
h(branch_name)
Brighton
Downtown
Mianus
Perryridge
Redwood
Round Hill
0010 1101 1111
1010 0011 1010
1100 0111 1110
1111 0001 0010
0011 0101 1010
1101 1000 0011
Search key values

15. (a) Explain the following with example.
          (i) Spatial databases. (8)
          (ii) For given RDBMS schema (s_id integer, s_name string, s_status string), give the equivalent XML schema structure. (8)
Or
(b) Design a database for the student management system with the requirements like managing attendance details and the semester marks of the students. Give the complete design that includes ER diagram, relational databases using normalization. (16)

_____________________

 




No comments:

Post a comment

Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents