Showing posts with label MCA Question Paper. Show all posts
Showing posts with label MCA Question Paper. Show all posts

Anna University MCA MC 1654 – DATABASE MANAGEMENT SYSTEMS Question May June 2006

MC 1654 – Database Management Systems - May June 2006 Question Paper / Anna University MCA Exam May June 2006 Question Paper / MC1654 DBMS May June 2006 Question Paper / MC1654 Database Management Systems Previous Year MCA Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC1654 DBMS Regulation 2005 MCA Question Paper / MCA Second Semester Question Paper

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

1. Define the terms super key and candidate key.
2. List the components and responsibilities of the storage component manager?
3. How can you express queries in Query By Examples (QBE)?
4. Define the terms Authentication and Authorization.
5. What do you mean by RAID? Mention its significance.
6. Distinguish between Static hashing and Dynamic hashing.
7. List the operations involved in query processing?
8. Discuss about pipelining.
9. What are the different states of a transaction? Explain.
10. What is the purpose of check point mechanism?

PART B – (5 X 16 = 80 marks)

11. (a) Explain the design of Entity Relationship diagram with a suitable example.
Or
(b) Discuss the responsibility of DBA.
12. (a) (i)Discuss the various set operations that operate on a relation with suitable example.
(ii) Discuss the different types of joins in queries.
Or
(b) Explain about integrity constraints in database with examples.
13. (a) Discuss on how Hashing technique overcomes drawbacks in Sequential File  Organization.
Or
(b) Discuss about how file organization is implemented using B+ tree?
14. (a) Explain the various issues to be considered in the Evaluation of expressions with proper illustration.
Or
(b) Write down the procedure to perform Heuristics Optimization and explain.
15. (a) (i) Explain conflict serialization with example.
(ii) Explain shadow paging conflict.
Or
(b) (i) Write short notes on Data Dictionary.
(ii) Write short notes on Buffer Management.

*************
                                            

Anna University MCA MC 1654 – DATABASE MANAGEMENT SYSTEMS Question November December 2006

MC 1654 – Database Management Systems - November December 2006 Question Paper / Anna University MCA Exam November December 2006 Question Paper / MC1654 DBMS November December 2006 Question Paper / MC1654 Database Management Systems Previous Year MCA Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC1654 DBMS Regulation 2005 MCA Question Paper / MCA Second Semester Question Paper




Question Paper Code :
M.C.A DEGREE EXAMINATION, NOV/DEC 2006
MC 1654 – DATABASE MANAGEMENT SYSTEMS
(Regulation 2005)
Time : Three Hours                                                         Maximum : 100 marks
Answer ALL Questions
PART A – (10 X 2 = 20 marks)

1. How is the database management system indispensable in data handling?
2. What is semantic data model?
3. What are integrity constraints in relational model?
4. What is the use of Embedded SQL?
5. Define hash based indexing in data storage operations.
6. What are composite search keys? Explain with a example.
7. What do you meant by query optimization?
8. What does a query evaluation plan consists of?
9. State the purpose of locking protocols in DBMS.
10. What are the two important functions of Recovery Management?

PART B – (5 X 16 = 80 marks)

11. (a) (i) Narrate the advantage of DBMS systems.
(ii) Discuss the steps involved in the design of database systems.
Or
(b) (i) Illustrate the concept of relationships and relationship sets in Entity Relationship (ER) model with a suitable example.
(ii) Elaborate on the key constraint construct in ER models with an example.
12. (a) (i) What is the use of cursors in embedded SQL? Specify the basic cursor definition format, giving illustrative examples.
(ii) Give an example of foreign key constraints in relational models and develop an SQL statement for the same.
Or
(b) How is the Relational Model designed based on the ER models? Discuss with respect to the issues of tables, relationship without constraints and key constraints?
13. (a) Explain the mechanism of hash based indexing with an example.
Or
(b) Describe the various levels of RAID systems in detail.
14. (a) Explain the working of Query Optimizer with a block diagram.
Or
(b) Discuss the issues in implementing optimization strategies for the JOIN queries.
15. (a) What is the role of COMMIT, ROLLBACK and SAVEPOINT SQL statements in transaction management?
Or
15. (b) Write short notes on Buffer Management.

*************
                                            

Anna University MCA MC 1654 – DATABASE MANAGEMENT SYSTEMS Question May June 2008

MC 1654 – Database Management Systems - May June 2008 Question Paper / Anna University MCA Exam May June 2008 Question Paper / MC1654 DBMS May June 2008 Question Paper / MC1654 Database Management Systems Previous Year MCA Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC1654 DBMS Regulation 2005 MCA Question Paper / MCA Second Semester Question Paper





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

1. Write any four major disadvantages of keeping organization information in a file processing system.
2. Define a weak and strong entity set.
3. What is a condition Box in the context of Query By example (QBE)?
4. Write the advantages and Disadvantages of 3 NF.
5. Difference between mirroring and striping.
6. What are Bitmap indices?
7. How can you measure the cost of a query?
8. List some of the useful statistical information about database relations as maintained by DBMS catalog.
9. Write any four properties of a transaction.
10. What is fuzzy check point?

PART B – (5 X 16 = 80 marks)

11. (a) (i) Explain two methods for dealing with the deadlock problem ?
(ii) Write short note on shadow paging and buffer management.
Or
(b) (i) Explain the distinction between the terms Serial Schedules and Serializable Schedules.
(ii) During its execution, a transaction passes through several stages, until it finally commits or aborts. List all possible sequences of stages through which a transaction may pass.
12. (a) Explain various data models with suitable examples for each.
Or
(b) (i) Construct an E-R diagram with all major components for a banking enterprises with entity set customer, branch, loan, payment, account, employee with other own assumption.
(ii) Write short note on history of database system
13. (a) (i) Explain the fourth Normal Form (4NF).
(ii) Write short note on Embedded SQL.
Or
(b) (i) Explain about Functional Dependencies (FD’s).
ii) Write short note on Embedded SQL.
14. (a) (i) Explain the physical characteristics of Disk.
(ii) What is RAID? Explain all the RAID levels.
Or
(b) Explain B+ Tree index files.
15. (a) What do you mean by external sorting? Explain the merge sort technique and discuss its performance.
Or
(b) How can you perform heuristic optimization? Explain the various heuristics in query optimization with examples

*************



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)

_____________________

 




Wikipedia

Search results