DMC 1971 Advanced Databases February 2014 Question Paper

Anna University MCA Distance Education Advanced Databases Question Paper / Anna University MCA Distance Education Previous Year Question Paper / DMC 1971 Advanced Databases Question Papers with Answers / DMC 1971 Advanced Databases February March Question Papers with Answers / February March DMC1971

Question Paper Code : 96324

M.C.A. DEGREE EXAMINATION, FEBRUARY/MARCH 2014

Elective

DMC 1971 – ADVANCED DATABASES

(Regulation 2009)

Time : Three Hours                                               Maximum : 100 Marks

Answer ALL Questions

PART A – (10 X 2 = 20 Marks)

1. What is referential key constraint?

2. State the purpose of query optimization.

3. Differentiate transient and persistent objects.

4. Justify the need for concurrency control.

5. What is client/server model?

6. Define: mobile database.

7. What is active rule?

8. Give advantages of distributed database systems.

9. When did you say that the consistency of a database is lost?

10. What is authentication? How does it differ from authorization?

PART B – (5 X 16 = 80 Marks)

11. (a) (i) Describe in detail about hashing techniques. (8)

(ii) Briefly explain about relational model concepts. (8)

Or

(b) Why normalization is required? Explain 1NF, 2NF, 3NF, and BCNF in detail with suitable examples. (16)

12. (a) How will you model and design an object oriented database? Explain in detail. (16)

Or

(b) Write short notes on the following;

(i) Database administration (8)

(ii) Recovery (8)

13. (a) What is enhanced data model? Explain each of them. (16)

Or

(b) Write a detailed note on web databases. (16)

14. (a) Write short notes on:

(i) Active databases. (8)

(ii) Deductive databases. (8)

Or

(b) (i) Explain any one of the concurrency control protocol in detail with example. (8)

(ii) Discuss in detail the parallel database. (8)

15. (a) Describe the database tuning techniques in detail. (16)

Or

(b) (i) Explain the integrity issues in database design. (8)

(ii) Discuss the research issues related to security in database design. (8).

________________

MC 7103 – DATABASE MANAGEMENT SYSTEMS January 2014 Question Paper

MC 7103 – Database Management Systems - January 2014 Question Paper / Anna University MCA Exam January 2014 Question Paper / MC7103 DBMS January 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 : 80813

M.C.A DEGREE EXAMINATION, JANUARY 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. Differentiate file systems from a database system.

2. What is weak entity sets? Give examples.

3. Define the “integrity rules”

4. What is a view? How it is related to data independence?

5. What do you understand from Time stamping? Give examples.

6. What is shadow paging? When it is used?

7. What is the use of unstructured file? Give an example.

8. When do we need to do indexing and hashing?

9. What is persistent data? Give an example.

10. What are mobile databases? Give an example.

PART B – (5 X 16 = 80 marks)

11. (a) Explain the various levels of database schema based on the data abstraction. How does the schema support different type of data independence? (16)

Or

(b) Scenario: A publishing company produces scientific books on various subjects. The books are written by authors who specialize in one particular subject. The company employs editors who, not necessarily being specialists in a particular area, each take sole responsibility for editing one or more publications. A publication covers essentially one of the specialist subjects and is normally written by a single author. When writing a particular book, each author works with one editor, but may submit another work for publication to be supervised by other editors. To improve their competitiveness, the company tries to employ a variety of authors, more than one author being a specialist in a particular subject.

Draw an ER diagram that represents the above scenario and also identify the thing like entities, attributes of entities, all keys, relationship among the entities, cardinality/connectivity between entities and any assumption you make. (16)

12. (a) Consider the following relational schema. An employee can work in more than one department; the pct_time field of the Works relation shows the percentage of time that a given employee works in a given department.

Emp(eid: integer, ename: string, age: integer, salary: real)

Works(eid: integer, did: integer, pct_time: integer)

Dept(did: integer, dname: string, budget: real, managerid: integer)

Write the following queries in SQL;

(i) Print the names and ages of each employee who works in both the Hardware department and the Software department.

(ii) Find the managerids of managers who manage only departments with budget greater than Rs. 1 lakhs.

(iii) Find the enames of managers who manage the departments with the largest budgets.

(iv)  If a manager manages more than one department, he or she controls the sum of all the budgets for those departments. Find the managerids of managers who control more than Rs. 5 lakhs.

(v) Find the managerids of managers who control the largest amounts.

(vi) Find the enames of managers who manages only departments with budgets larger than Rs. 1 lakhs, but at least one department with budget less than Rs. 5 lakhs. (16)

Or

(b) (i) Why do we need normalization? Is normalization preferred in today’s scenario? (4)

(ii) Explain the different normal forms with an example. (12)

13. (a) (i) Explain about transaction properties. (8)

(ii) Explain the SQL commands that support transaction with an example. (8)

Or

(b) (i) Describe about different types of recovery techniques. (10)

(ii) Describe about security of statistical databases. (6)

14. (a) Explain about different types of hashing and collision resolution techniques. (16)

Or

(b) Write short notes on;

          (i) Sequential file operation. (8)

          (ii) B+ tree. (8)

15. (a) Write short notes on the following databases;

          (i) Temporal databases. (8)

          (ii) Spatial databases. (8)

Or

(b) (i) Write a comparison between ODBMS and RDBMS. (8)

(ii) Write a short note on XML. (8)

_____________________

MC 9213/MC 913 – DATABASE MANAGEMENT SYSTEMS - May/June 2013

MC 9213/MC 913 – Database Management Systems - May June 2013 Question Paper / Anna University MCA Exam May June 2013 Question Paper / MC9213 DBMS May June 2013 Question Paper / MC9213 Database Management Systems Previous Year Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC9213 Database Management Systems Previous Year Question Paper according to Regulation 2009

Question Paper Code : 70705

M.C.A DEGREE EXAMINATION, MAY/JUNE 2013

First Semester

MC 9213/MC 913 – DATABASE MANAGEMENT SYSTEMS

(Regulation 2009)

Time : Three Hours                                                         Maximum : 100 marks

Answer ALL Questions

PART A – (10 X 2 = 20 marks)

1. What is logical data independence?

2. List out the functionalities of DBA.

3. What is a candidate key? Give example.

4. Define view in SQL.

5. What do you mean by hashing?

6. What is data dictionary?

7. What is database tuning?

8. Define normalization.

9. List the desirable properties of transaction.

10. What is concurrency control?

PART B – (5 X 16 = 80 marks)

11. (a) Explain the architecture of a DBMS with diagrammatic illustration. (16)

Or

(b) Model a ER diagram for a library management system. State the functional requirements you are taking into consideration. (16)

12. (a) Explain Cartesian product. Natural join, left outer join, right outer join and full outer join in relational algebra with examples. (16)

Or

(b) Explain with examples in SQL the following:

(i) Aggregate functions. (8)

(ii) GROUP BY (2)

(iii) ORDER BY (2)

(iv) Trigger (4)

13. (a) Describe in detail about sequential file organization and random file organization. (16)

Or

(b) Explain B+ tree index files and B tree index files with examples. (16)

14. (a) Explain 1NF, 2NF, and 3NF with examples. (16)

Or

(b) Explain with an example the steps involved in processing a query. (16)

15. (a) (i) What is meant by concurrent execution of database transactions in a multi-user system? Discuss why concurrency control is needed? Give suitable example. (8)

(ii) Explain two phase locking protocol with an example. (8)

Or

(b) (i) Draw a state diagram and discuss the typical states that a transactions goes through during execution. (8)

(ii) Explain with examples read only transaction and read write transaction. (4)

(iii) What is crash recovery? Discuss. (4)

_____________________

MC 9213/MC 913/600103 – DATABASE MANAGEMENT SYSTEMS - January 2013

MC 9213/MC 913/600103 – Database Management Systems - January 2013 Question Paper / Anna University MCA Exam January 2013 Question Paper / MC9213 DBMS January 2013 Question Paper / MC9213 Database Management Systems Previous Year Question Paper / Anna University Affiliated Colleges MCA Question Papers

Question Paper Code : 60803

M.C.A DEGREE EXAMINATION, JANUARY 2013

MC 9213/MC 913/600103 – DATABASE MANAGEMENT SYSTEMS

(Regulation 2009/2010)

Time : Three Hours                                                         Maximum : 100 marks

Answer ALL Questions

PART A – (10 X 2 = 20 marks)

1. What is the role of Database Administrator?

2. Define: Super key with an example.

3. What is the function of Natural join operation? Give an example.

4. Define: Tuple Relational Calculus

5. What are the features of variable length record?

6. Define: Sparse indices.

7. Write short notes on BCNF.

8. What is meant by Equivalence rules?

9. Define: Two Phase Locking Protocol.

10. Write a short note on Cascading Rollback.

PART B – (5 X 16 = 80 marks)

11. (a) Explain in detail about Database Management System structure. (16)

Or

(b) Discuss about E-R model with an example. (16)

12. (a) Explain the following operations in Relational Algebra.

          (i) Select operation                                       (4)

          (ii) Project operation                                     (4)

          (iii) Union operation                                      (4)

          (iv) Cartesian – Product operation                   (4)

Or

(b) What is Trigger? Explain in detail with an example. (16)

13. (a) Explain the following terms

          (i) Byte string representation                        (4)

          (ii) Fixed length representation                     (4)

          (iii) Sequential file organization                    (4)

          (iv) Clustering file organization                     (4)

Or

(b) Describe about B+ tree index files. (16)

14. (a) Explain in detail about Third and Fourth Normal Form with suitable example. (16)

Or

(b) Discuss the evaluation plan in detail. (16)

15. (a) Explain the following terms

          (i) Serializability                                           (10)

          (ii) Recoverability                                         (6)

Or

(b) Explain the following terms

          (i) Graph based Protocols                             (8)

          (ii) Time Stamp Protocols                             (8)

_____________________