Showing posts with label Question Bank. Show all posts
Showing posts with label Question Bank. Show all posts

Database Management Systems (DBMS) Question - Pune University May 2013

Database Management Systems (DBMS) Question - Pune University May 2013 / Pune University BE (CSE) and BTech (IT) DBMS Question - May 2013


UNIVERSITY OF PUNE
[4363] – 251
T.E. (Computer & IT Semester – I) Examination, 2013
DATABASE MANAGEMENT SYSTEMS
 (2008 Pattern)
Time: 3 Hours                                           Max. Marks: 100
Instructions : 1) Answers to the two Sections should be written in separate books.
2) Black figures to the right indicate full marks.
3) Assume suitable data, if necessary.
4) Solve Section I: Q 1 or Q 2, Q 3 or Q 4, Q 5 or Q 6.
5) Solve Section II: Q 7 or Q 8, Q 9 or Q 10, Q 11 or Q 12.
SECTION – I
Q1) A) How following problems are handled with DBMS. [6]
i. Data Isolation
ii. Data Redundancy and Inconsistency
iii. Data Integrity
B) Explain with examples how ER diagrams are converted into tables. [6]
C) Explain the need of the following. [6]
i. View       ii) Foreign Key.
OR
Q2) A) Explain various database languages. [8]
B) Explain various data models used in DBMS. [10]

Q3) A) Given relation schema: R(A,B,C), S(D,E,F). Let the relation r® and s(S) be given. Convert the following SQL statements in relational algebra form.               [8]
1. select * from r where B = 17;
2. select A, F from r,s where r.C = s.D;
3. update r set B = B*15 where A = ‘aaa’;
4. select * from s where E<20;
B) Explain various operations in relational algebra. [8]
OR
Q4) A) What is Cursor? Explain various types of Cursor. [8]
B) Explain stored procedures and triggers. [8]

Q5) A) Explain why 4NF is more desirable than BCNF. Rewrite the definition of 4NF and BCNF using the notions of domain constraints and general constraints. [8]
B) Specify Armstrong’s axioms. Use Armstrong’s axioms to prove the soundness of pseudo transitivity rule. [8]
OR
Q6) A) Let R=(A,B,C,D,E) and let M be the following set of multi-valued dependencies. [8]
A →→ BC, B →→ CD, E →→ AD.
List the non-trivial dependencies in M+.
B) Describe the concept of Transitive dependency and explain how this concept is used to define 3NF. [8]
SECTION - II
Q7) A) What is ordered indices? Explain the types of ordered indices with suitable example. [9]
B) Explain detail use of B Tree as an indexing technique. Compare B tree and B+ tree. [9]
OR
Q8) A) Explain following: [9]
i. Dense index    ii. Sparse index          iii. Clustered index
B) Give the transformation rules for releational expressions. [9]

Q9) A) Explain the concept of ‘Transaction’. Describe ACID properties for transaction. [8]
B) Show the two phase locking protocol ensures conflict serializability. [8]
OR
Q10) A) Explain timestamp based protocol. [8]
B) State and explain Thomas Write rule. [8]

Q11) A) How does the concept of an object in the object oriented model differ from the concept of an entity in the ER model. [8]
B) Explain the need of backup and replication. [8]
OR
Q12) A) What is fragment of a relation? What are main types of fragments? [8]
B) Write short note on:
i. Data warehouse manager
ii. Pointers swizzling techniques.

————————


 

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)

*********









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)

*********







Wikipedia

Search results