Database Management Systems - Cochin University July 2010 Supplementary Questions

Database Management Systems - Cochin University July 2010 Questions / CUSAT - DBMS July 2010 Supplementary Question / CS 505 DBMS CUSAT Question

BTS (C) – V – (S) - 10 – 037 – E

B.Tech Degree V Semester (Supplementary) Examination,

July 2010

CS/IT 505 Database Management Systems

(2002 Scheme)

Time: 3 Hours                                                    Maximum marks: 100

I. (a) Explain various data models. (15)

(b) List the function of database administrator. (5)

OR

II. (a) Explain the three schema architecture. (10)

(b) Show the specialization and generalization features of database with the help of an ER diagram. (10)

III. Discuss various hashing techniques. (20)

OR

IV. (a) Distinguish between spanned and unspanned records. (10)

(b) What do you meant by multilevel indexing? (10)

V. (a) Explain the fundamental operations in relational algebra. (10)

(b) What do you meant by multivalued dependency and join dependency? (10)

OR

VI. (a) Distinguish between trivial and nontrivial dependency. (5)

(b) What do you meant by normalization? Describe I, II, and III normal forms with example. (15)

VII. (a) Define transaction. Explain the ACID properties of transaction. (15)

(b). Explain shadow paging. (5)

OR

VIII. (a) Discuss view serializability and conflict serializability. (10)

(b) Explain the various database recovery techniques. (10)

IX. (a) Explain three phase commit protocol. (15)

(b) What do you meant by distributed database? (5)

OR

X. Write short notes on

(i) Active database

(ii) Data mining

(iii) Object oriented database

(iv) Distributed query processing (4 X 5 = 20)

*********

Go to ALL CUSAT Questions - Home

Database Management Systems - Cochin University July 2009 Supplementary Questions

Database Management Systems - Cochin University July 2009 Questions / CUSAT - DBMS July 2009 Supplementary Question / CS 505 DBMS CUSAT Question

BTS (C) – V – (S) - 09 – 032 – G

B.Tech Degree V Semester (Supplementary) Examination,

July 2009

CS/IT 505 Database Management Systems

(2006 Scheme)

Time: 3 Hours                                                    Maximum marks: 100

PART – A

(Answer ALL Questions)

(All questions carry EQUAL marks)

 (8 X 5 = 40)

I. (a) List five functions of database management systems.

(b) Draw the three schema architecture of database and explain the functions of each schema.

(c) Differentiate between fixed length and variable length records.

(d) List the advantages and disadvantages of ordered records over heap files.

(e) Differentiate between Cartesian product and join operation in relational algebra.

(f) Explain the terms super key, candidate key, primary key and foreign key.

(g) Explain any five characteristics of a data warehouse.

(h) Explain ACID properties of transaction.

PART – B

 (4 X 15 = 60)

II. (a) Explain the concept of generalization and specialization with example. (7)

(b) Explain in detail different categories of data models. (8)

OR

III. (a) Describe any five advantages of database approach over file system approach. (5)

(b) Identify relevant attributes and construct an ER diagram for a university which has many departments and each department has multiple instructors; one among them is the head of the department. An instructor belongs to only one department, each department offers multiple courses, each of which is taught by a single instructor. A student may enroll for many courses offered by different departments. (10)

IV. (a) Differentiate between closed and open hashing. Discuss the relative merits of each technique in database application. (5)

(b) Describe multilevel indexing with necessary diagram. How does multilevel indexing improve the efficiency of searching an index file? (10)

OR

V. Differentiate between static and dynamic external hashing techniques. Explain the various hashing techniques used in both categories with necessary diagrams. (15)

VI. (a) Write down Armstrong’s inference rules. What do you mean by saying that “These rules are complete and sound”? Show other inference rules that can be derived from these rules. (7)

(b) Explain four types of join operations with examples. (8)

OR

VII. Define normalization, 1NF, 2NF, 3NF and BCNF with examples. (15)

VIII. (a) Compare between deferred update and immediate update for database recovery with suitable example. (10)

(b). Describe binary locking technique for concurrency control. (5)

OR

IX. (a) Describe shadow paging recovery techniques with necessary diagram. (7)

(b) Explain the following feature of object oriented database:

(i) Encapsulation  (ii) Inheritance  (iii) Polymorphism (8)

*********

Go to ALL CUSAT Questions

CP7202 - Advanced Databases November/December 2014 Question Paper

CP 7202 Advanced Databases question paper – November/December 2014 

CP 7202 Advanced Databases question paper – November/December 2014 / Anna University Previous Year Exam Questions / Anna University Previous Year M.E. M.Tech. Computer Science and Information Technology Question Papers

Question Paper Code : 13294 M.E./M.Tech. DEGREE EXAMINATION, November/December 2014 Second Semester Computer Science and Engineering CP 7202 — ADVANCED DATABASES (Common to Computer Science and Engineering (with Specialization in Networks) and M.Tech. Information Technology) (Regulation 2013) Time: Three hours                                                       Maximum: 100 Marks Answer ALL Questions PART A — (10 × 2 = 20 Marks) 1. Execution of a single query can be parallelized in two ways. What are they? 2. Define ACID in transaction processing. 3. Write the types of fragmentation. 4. What is operator polymorphism. 5. Define the term ‘persistence’ in object based databases. 6. List the types of spatial queries. 7. Define Handoff in mobile database. 8. Mention the components of deductive database. 9. List the goals of data mining. 10. List the merits of Web database. PART B — (5 × 16 = 80 Marks) 11. (a) (i) What factors could result in skew when a relation is partitioned on one of its attributes by:                                                                                               (8) (1) Hash partitioning (2) Range partitioning. In each case, what can be done to reduce the skew? (ii) Write short notes parallel database and distributed databases.                           (8) Or (b) Explain the various ways in which concurrency control can be implemented in a database. Draw the schematic diagram for two-phase locking system.            (16) 12. (a) Explain about the mandatory features of OODBMS and illustrate the syntax of OQL.                                                                                                            (16) Or (b) (i) Write the differences and similarities between class and interface inheritance. (8) (ii) Represent the following schema diagram in ODL. How do you iterate through all the persistent classes?                                                                               (8) STATE_NAME(CCITY#, STATE) CUST(CID#, CNAME, CCITY) SALE_DETAIL(CID#, PID#, SALE, SALEDT#) PROD(PID#, PNAME, PCOST, PPROFIT) 13. (a) (i) Explain the various spatial access methods and data structure of spatial database.                                                                                                     (8) (ii) Write a short note on spatial data types and relationships.                       (8) Or (b) Explain about temporal database and TSQL2.                                            (16) 14. (a) Explain about mobile database, location and handoff management in detail. (16) Or (b) (i) Compare Online Transaction Processing (OLTP) with Online Analytical Processing (OLAP).                                                                                              (8) (ii) What is the difference between classification and association in the context of data mining?                                                                                                        (8) 15. (a) Consider the following DTD <!DOCTYPE bibliography [ <!ELEMENT book(title, author+, year, publisher, place?)> <! ELEMENT article (title, author+, journal, year, number, volume, pages?)> <!ELEMENT title (#PCDATA)> … similar PCDATA declarations for Year, publisher, place, journal, year, member, volume, pages, lastname, firstname)]> (i) Show how to map this DTD to a relational schema. (ii) Create a XML document for this DTD.                                             (16) Or (b) Write short notes on the following. (i) Cloud database                                                                                        (8) (ii) Big data analysis                                                                                     (8) _____________________________