DBMS question bank A.

Y: 2023-24
UNIT-I
SHORT ANSWER QUESTIONS:

1. Define Instances and schemas of database?

2. List the Database Applications?
3. List the disadvantages of file processing system?
4. List the advantages of DBMS?
5. Define a) Entity b) Attribute.
6. Define a) Entity Type b) Relationship.
7. Discuss Data Independence?
8. Discuss about Data Manipulation Language?
9. Discuss about Data Definition Language?
10. Discuss about Data Manipulation Language?
LONG ANSWER QUESTIONS:
1. What are the application programs? Explain database access from application
programs?
2. Define a) Entity b) Attribute c) Relationship with examples.
3. State and explain various features of E-R Models.
4. Discuss in detail Views and also Creating, Altering, Destroying of Views.
5. Name the main steps in the Database design. What is the goal of each step? In which
steps is the ER model mainly used?
6. Explain about Integrity Constraints over relations in detail?
7. Explain about Database users and Administrators?
8. Explain about Logical database design?
9. Explain the Architecture of DBMS?
UNIT-2
SHORT ANSWER QUESTIONS:

1. What is domain integrity? Give example.

2. Define SELECT operation in Relational Algebra?
3. Define PROJECT operation in Relational Algebra?
4. Discuss about Trigger?
5. Define UNION operation in Relational algebra?
6. What is the use of group by clause?
7. List the aggregate functions supported by SQL?
8. Discuss the basic form of SQL query?
9. Define CROSS PRODUCT operation in Relational algebra?
10. Define JOIN operation in Relational algebra?
LONG ANSWER QUESTIONS:
1. Explain about Aggregate operators in sql with examples?
2. Explain Integrity constraint over relations with examples.
3. Discuss correlated nested queries?
4. Explain Set operations of Relational Algebra with examples?
5. Explain the fundamental operations in relational algebra with examples.
6. Explain tuple relational calculus with suitable example
7. Discuss about views with example.
8. Consider the following schema to write queries in Domain relational calculus:
Sailor(sid, sname, age, rating)
Boats(bid, bname, bcolor)
Reserves(sid,bid,day)
i) Find the boats reserved by sailor with id 567.
ii) Find the names of the sailors who reserved ‘red’ boats.
iii) Find the boats which have at least two reservations by different sailors.
9. Consider the following schema
instructor (ID, name, dept_name),
teaches (ID, course_id, sec_id, semester, year),
section (course_id, sec_id, semester, year),
student (ID, name, dept_name),
takes (ID, course_id, sec_id, semester, year, grade)
Write the following queries in SQL
a) Find the names of the students not registered in any section
b) Find the names of the instructors not teaching any course
c) Find the total number of courses taught department wise
d) Find the total number of courses registered department wise
10. Let R=(ABC) and S=(DEF) let r(R) and s(S) both relations on schema R and S. Give an
expression in the Tuple relational calculus that is equivalent to each of the following.
i) σ B=19 (r)
ii) ∏ A,F, ( σ C=D (r×s))
iii) r∩s
UNIT-III
SHORT ANSWER QUESTIONS:

1. What are the problems related to decomposition? Explain.

2. Does 3NF allow redundancy? Justify your answer.
3. What is normalization? Differentiate between first normal form and second normal
form
4. Define BCNF?
5. Define Armstrong axioms for FD’s?
6. Explain about Loss less-join dependency?
7. Define functional dependencies.How are primary keys related to FD’s?
8. Define the term functional dependency? multi valued decomposition
9. what is decomposition and how does it address redundancy? what problems may be
caused by the use of decompositions
10. Discuss about active databases?

LONG ANSWER QUESTIONS:

1. Explain the following operators in SQL with examples

i) SOME ii) IN iii) EXCEPT iv)EXISTS
2. Discuss different types of aggregate operators with examples in SQL?
3. Illustrate Group by and Having clauses with examples?
4. Discuss about Complex integrity constraints in SQL?
5. Define trigger and explain its three parts? Differentiate row level and statement level
triggers?
6. Define decomposition and how does it address redundancy? Discuss the problems that
may be caused by the use of decompositions?
7. Compute the closure 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.
8. Define normalization? Explain 1NF, 2NF, 3NF Normal forms?
9. Illustrate Multivalued dependencies and Fourth normal form with example?
10. Discuss about Join dependencies and Fifth normal form?
UNIT – IV

SHORT ANSWER QUESTIONS:

1. What are ACID properties? Explain
2. When are two schedules conflict equivalent? What is conflict serializable schedule?
3. What is Strict Two-Phase Locking (Strict 2PL) Protocol.
4. Define deadlock
5. What is Lock Thrashing
6. Explain ARIES.
7. Explain precedence graphs for the schedules with example
8. Explain view serializability.
9. What is the Thomas Write Rule

LONG ANSWER QUESTIONS:

1. Explain ACID properties and Illustrate them through examples?

2. Discuss How do you implement Atomicity and Durability?
3. Illustrate Concurrent execution of transaction with examples?
4. Discuss Serializability in detail?
5. Discuss two phase locking protocol and strict two phase locking protocols?
6. Describe Timestamp based locking protocols?
7. Describe Validation-based locking protocols?
8. Discuss in detail Multiple Granularity?
9. Discuss Deferred database modification and Immediate database modification?
10. Discuss how do you recover from Concurrent transactions?
UNIT – V

SHORT ANSWER QUESTIONS:

1. Define unclustered index.
2. What are the advantages and disadvantages of B+ trees?
3. Define Dense and Sparse Indices
4. What are multilevel Indices
5. What are basic kinds of indices
6. Discuss about primary indexes.
7. Explain Secondary Indices
8. What are the reasons for occurring of bucket overflow in hashing.
9. What is the main difference between ISAM and B+ tree indexes.

LONG ANSWER QUESTIONS:

1. Write in detail about Hash based Indexing and Tree based Indexing?
2. Write in detail about Static Hashing?
3. Explain in detail about Extendible Hashing?
4. Compare all File Organizations?
5. Explain in detail about ISAM?
6. Explain Deletion and insertion operations in ISAM with examples.
7. Explain B+ trees? Discuss about this Dynamic Index Structure?
8. Illustrate insertion and deletion of an element in B+ trees with example?
9. Demonstrate searching a given element in B+ trees? Explain with example?