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

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

CS6302 Database Management Systems May June 2015 - Question with answers

CS6302 Database Management Systems question paper - May/June 2015 / Anna University Previous Year 2015 Exam Questions / Anna University Previous Year 2015 Computer Science and Information Technology Question Papers / CS6302  / CS 2255 / CS 46 / CS 1254/080250009/10144 CS 406 — Database Management Systems Question with Answers

Question Paper Code : 77094

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2015.

Third Semester

Computer Science and Engineering

CS 6302 — DATABASE MANAGEMENT SYSTEMS

(Common to Information Technology)

(Regulation 2013)

Time : Three hours                                                             Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Write the characteristics that distinguish the database approach with the file-based approach.
2. Define: Functional dependency

3. State the need for query optimization.

4. What is the difference between static and dynamic SQL?

5. Write the ACID properties of Transaction.

6. Define: DDL, DML, DCL, and TCL

7. How dynamic hashing differ from static hashing?

8. Write about four types (Star, snowflake, galaxy and fact constellation) of data warehouse schemas.

9. Define threats and risks.

10. What is association rule mining?

PART B — (5 × 16 = 80 marks)

11. (a) Draw an ER diagram for the “Restaurant Menu Ordering System”, which will facilitate the food items ordering and services within a restaurant. The entire restaurant scenario is detailed as follows. The customer is able to view the food items menu, call the waiter, place orders and obtain the final bill through the computer kept in their table. The waiters through their wireless tablet PC are able to initialize a table for customers, control the table functions to assist customers, orders, send orders to food preparation staff (chef) and finalize the customer’s bill. The food preparation staffs (chefs), with their touch-display interfaces to the system, are able to view orders sent to the kitchen by waiters. During preparation, they are able to let the waiter know the status of each item, and can send notifications when items are completed. The system should have full accountability and logging facilities, and should support supervisor actions to account for exceptional circumstances, such as a meal being refunded or walked out on. (16)

Or

(b) State the need for normalization of a database and explain the various normal forms (1st,2nd, 3rd, BCNF, 4^th, 5^th, and domain-key) with suitable examples (16)

12. (a) Consider a student registration database comprising of the below given table schema. (16)

Student_File(student_number, student_name, address, telephone)

Course_File(course_number, description, hours, professor_number)

Professor_File(Professor_number, name, office)

Registration_File(student_number, course_number, date)

Consider a suitable sample of tuples/records for the above mentioned tables and write DML statements (SQL) to answer for each queries listed below.

(i) Which courses does a specific professor teach?

(ii) What courses are taught by two specific professors?

(iii) Who teaches a specific course and where is his/her office?

(iv) For a specific student number, in which courses is the student registered and what is his/her name?

(v) Who are the professors for a specific student?

(vi) Who are the students registered in a specific course?

Or

(b) Discuss about the join order optimization and heuristic optimization algorithms. (16)

13. (a) Explain the Two-phase and Three-phase commit protocols. (16)

Or

(b) Consider the following schedules. The actions are listed in the order they are scheduled, and prefixed with the transaction name.

S1: T1:R(X), T2:R(X), T1:W(Y), T2:W(Y), T1:R(Y), T2:R(Y)

S2: T3:W(X), T1:R(X), T1:W(Y), T2:R(Z), T2:W(Z), T3:R(Z)

For each of the schedules, answer the following questions;

(i) What is the precedence graph for the schedule? (2)

(ii) Is the schedule conflict-serializable? If so, what are all the conflict equivalent serial schedules? (7)

(iii) Is the schedule view-serializable? If so, what are all the view equivalent serial schedules? (7)

14. (a) With suitable diagrams, discuss about the RAID levels (level 0, level 1, level 0+1, level 3, level 4 and level 5). (16)

Or

(b) Explain the architectural components of a data warehouse and write about data marts. (16)

15. (a) Neatly write the K-means algorithm and show the intermediate results in clustering the below given points into two clusters using K-means algorithm. (16)

P1: (0,0), P2: (1,10), P3: (2,20), P4: (1,15), P5: (1000,2000), P6: (1500,1500), P7: (1000,1250).

Or

(b) Discuss about the access control mechanisms and Cryptography methods to secure the databases. (16)

***********