Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

Assignment 2 DBMS

Uploaded by

Sujal Patel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment 2 DBMS

Uploaded by

Sujal Patel
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Database Management System

Assignment II
Relational Database Design and Normalization
1. Demonstrate transitive dependency? Give an example?
2. Explain about Loss less-join dependency?
3. Define Armstrong axioms for FD’s?
4. Determine the closer of the following set of functional dependencies for a relation
scheme R(A,B,C,D,E,F,G,H), F={ AB→C, BD→EF, AD→G, A→H} List the candidate
keys of R.
5. What is normalization? What are the conditions are required for a relation to be in
2NF, 3NF and BCNF explain with examples.
6. Determine the closer of the following set of functional dependencies for a
relational scheme R (A,B,C,D,E) ,F= {A͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢͢→BC, CD→E, B→D, E→A}. List out the
candidate keys of R.
7. What is meant by functional dependencies? Discuss about Third Normal From?
8. Determine the closer of the following set of functional dependencies for a
relational scheme R(A,B,C,D) and FDs {AB → C, C → D, D → A}. List out the
candidate keys of R.
9. Explain BCNF. What are the steps to be followed to convert a relation in 3NF to
BCNF?
10. What is normalization? What are the conditions are required for a relation to be in
1NF, 2NF and 3NF explain with examples.
11. What is meant by closure of F? Where F is the set of functional dependencies.
Explain computing F+ with suitable examples.

Transaction Management
1. Define Transaction. Explain the transaction properties (ACID) and transaction
states (lifecycle).
2. What is deadlock? Explain necessary conditions for deadlock and methods for
handling it.
3. Define Failure? Explain Log based Recovery (deferred database modification and
immediate database modification).
4. What is deadlock? Illustrate the same using the Wait-For-Graph.
5. Explain time stamp based protocols in detail.
6. Explain role of check point in Log base.
7. List and explain various issues while transactions are running concurrently in
DBMS.
8. Explain two phase locking protocol. Also list advantages of this protocol.
9. Explain wait-die and wound-wait for deadlock prevention.
10. Explain three type of actions to be taken for recovery from deadlock.
11. What is serializability? Explain view and conflict serializability with example
12. Explain shadow paging technique.
13. What is concurrency? If not controlled where it can lead to? What are the methods
to control concurrency?

Security
1. Explain in detail Discretionary access control and mandatory access control.
2. What is authorization and authentication? Explain the access controls in a database.
3. What is security of data? Explain data encryption.

SQL Concepts
1. Explain any two aggregate functions of SQL.
2. What is ON DELETE CASCADE in SQL? Explain clearly with example.
3. What is NULL? Explain
4. Explain any two string functions in SQL.
5. Write with example various built in string functions.
6. Explain DDL, DML and DCL syntaxes with example.

PL/SQL Concepts
1. Write note on cursor and its types.
2. What is trigger? Explain its type with their syntax. What are the applications of
trigger?
3. Explain stored procedures and stored functions.
4. Explain the advantages of PL/SQ
5. Write A PL/SQL block to print the sum of Numbers from 1 to 50.
6. Write A PL/SQL block to print the given number is Odd or Even.
7. Consider wholesaler of booh schema.
Book(Book_id, book_title,publisher,book_price)
( i ) Implement procedure which print details of books whose price is more than
average price.(Use cursor).
(ii) Write a trigger such that if record is deleted from book table, insert old record
in book_backup table.

Indexing and Hashing


1. Explain insertion and search operation in B+ trees?
2. What are the indexed data structures? Explain in detail.
3. Compare I/O costs for all File Organizations?
4. Explain about Hash based Indexing and Tree based Indexing?
5. Explain insertion and deletion operation in B+ trees?
6. Explain B+ trees? Discuss about this Dynamic Index Structure?
7. Explain in detail about ISAM?
8. Explain deletion and search operation in B+ trees?

You might also like