Showing posts with label Cochin University. Show all posts
Showing posts with label Cochin University. Show all posts

Sunday, 6 September 2015

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)

*********









Thursday, 3 September 2015

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)

*********







Tuesday, 7 April 2015

Database Management Systems - Cochin University November 2009 Questions

Database Management Systems - Cochin University November 2009 Questions / CUSAT - DBMS Nov 2009 Question / CS 505 DBMS CUSAT Question




BTS (C) – V – 09 – 055 – G
B.Tech Degree V Semester Examination, November 2009

CS/IT 505 Database Management Systems

(2006 Scheme)
Time: 3 Hours                                                    Maximum marks: 100
PART – A
(Answer ALL Questions)
 (8 X 5 = 40)
I. (a) What is meant by data abstraction? How it helps to provide data independence?
(b) With suitable example, explain ‘partial key’ and ‘primary key’ concepts.
(c) Are tuples in a relation ordered? Why? What do you mean by domain of attributes?
(d) Describe the concept of functional dependencies with an example. When it will be trivial?
(e) Describe ACID properties of transactions. State its significance also.
(f) Explain the goals of data mining.
(g) Explain the technique ‘hashing’. Distinguish between internal and external hashing.
(h) Why do we use spanned records? Mention advantages and disadvantages.

PART – B
 (4 X 15 = 60)
II. (a) Explain the 3-schema architecture of database system. How it helps to achieve data independence? (7)
(b) Why do we use constraints in ER model? Describe various constraints. (6)
(c) When is super class/sub class relationship needed in data modeling?
OR
III. An University with various departments keep track of student details. Each ‘department’ runs courses (with unique course#) and each ‘course’ is divided into ‘sections’. Each section has a (coordinator, semester, year, course). Grade reports are supplied to students. Design an ER schema for this, supplying necessary attributes. Draw ER diagram and specify key attributes of each entity type and structural constraints on each relationship. (15)

IV. (a) When does collision occur in hashing? What are the resolution methods? (5)
(b) Why do we use ‘indexes’ in file access? (2)
(c) Explain any two single level ordered indexes. (8)
OR
V. (a) What is ‘mixed file’? Write difference between fixed length and variable length records. (5)
(b) Explain any two dynamic hashing techniques. (10)

VI. (a) A company database is given below;
          EMPLOYEE (NAME, ENO, DOB, SALARY, SEX, SUPERENO, DNO)
          DEPARTMENT (DNAME, DNUMBER, MGRENO, STRTDATE)
          DEPTLOCATIONS (DNUMBER, DLOCATIONS)
          PROJECT (PNUMBER, PLOCATION, DNUM)
          WORKS-ON (EENO, PNO, HOURS)
Write the following queries in SQL;
          (i) Retrieve all employees in department 1 whose salary is between 25,000 and 40,000.
          (ii) Get a list of employees and projects they are working on, ordered by department.
          (iii) For each employee, get the name and address of the manager.
          (iv) Get DOB and address of employees with name ‘James’. (8)
(b) Explain the use of various ‘JOIN’ operators in relational algebra. (3)
(c) Describe first 3 normal forms with examples. (4)
OR
VII. (a) Discuss various relational model constraints. (10)
(b) What is the need for high level data model? (2)
(c) Write the difference between ‘left outer join’ and ‘right outer join’ operations. (3)

VIII. (a) What are the problems associated with uncontrolled concurrent transactions? (6)
(b). Explain any two concurrency control techniques. (9)
OR
IX. (a) Discuss the relation of data mining to knowledge discovery. (7)
(b) Write short notes on object oriented databases and active databases. (8)

*********







Lossless join decomposition one more example

Lossless Join Decomposition Question: Let R = {ssn, ename, pnumber, pname, plocation, hours} and R is decomposed into three re...