0% found this document useful (0 votes)
50 views

Question Bank of DBMS by Engineering Express

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
50 views

Question Bank of DBMS by Engineering Express

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

B.

TECH (CSE) SEMESTER / YEAR: 5TH /3RD


SUBJECT NAME (SUBJECT CODE): DBMS/BCS-501
Engineering
Very Short Answer Type Questions
Express
UNIT-I
a) Distinguish between DBMS and RDBMS?
b) What is data model? List the types of data model used?
c) Write the difference between super key and candidate key
d) Discuss three level of abstractions or schemas architecture of DBMS.
e) Explain the difference between a weak and a strong entity set with example.
f) Write the difference between DDL and DML.
g) Why Network Data model and Hierarchical Data model are little used now?
h) Name any five database systems?
i) What is the significance of Physical Data Independence?
j) List any four disadvantages of file system approach over database approach.

UNIT-II
a) What are different Integrity Constraints?
b) Differentiate between SQL and PL/SQL?
c) Differentiate between relational algebra and relational calculus?
d) Explain different Features of SQL.
e) Course Outcome:for example, only
f) Define aggregation with example.
g) What are different relational algebra operations?
h) When a relation set is called a recursive relationship set?
i) What do you understand by Union Comparability?
j) What do you mean by Cursor?
k) What do you mean by index?

Paid Notes are Available 7300798298 (Only WhatsApp)


UNIT-III
a) Discuss the various anomalies associated with normalization?
b) MVD is a special case of JD. Discuss?
Engineering
c) Why do we normalize database?
d) Write different Inference Rule for Functional Dependency?
Express
e) What is Boyce-Codd Normal Form in the DBMS?
f) Explain MVD with the help of suitable example.
g) Define the closure of an attribute set.
h) List all prime and non-prime attributes In Relation R(A,B,C,D,E) with FD set
i) F = {AB→C, B→E, C→D}.
j) What is Functional Dependency Form in the DBMS?
k) What are different between Lossless and Lossy Join Decomposition?

UNIT-IV
a) Define the term ACID properties?
b) What are various reasons for transaction failure?
c) What are serial, non-serial schedules?
d) When is a transaction Rolled Back?
e) Draw a state diagram and discuss the typical states that a transaction goes through during execution.
f) Discuss Consistency and Isolation property of a transaction.
g) Describe how view serializability is related to conflict serializability.
h) What is deadlock?
i) What are distributed databases?
j) What is log file? Write the steps for log based recovery of a system.

UNIT-V
a) Distinguish between Shared and Exclusive Locks?
b) What are Concurrent Transactions?
c) Discuss Conservative 2PL and Strict 2PL
d) What are various reasons for transaction failure?
e) What is Lock in Transaction Management?
f) List the various levels of locking?
g) What is the Dirty Read Problems?
h) What is Lock Compatibility Table?
i) Explain two phase locking protocol?
j) What is the Lost Update Problems?
Long Answer Type Questions
UNIT-I
a) Compare and contrast the differences between File Processing System and DBMS? Also discuss the
terms Generalization, Specialization and Aggregation with suitable example?
b) Distinguish the terms: super key, candidate key, primary key, Unique Key and foreign key with
example?
c) Draw overall structure of DBMS and explain its components in brief.
d) Differentiate the file system and database Management system by 10 key Factors.
e) What do you mean by offset in database structure? Define the role of it in database development
process.
f) What are the various types of users involved in DBMS operations? Explain each.
g) State the procedural DML and non procedural DML with their differences.
h) Describe the three-schema architecture. Why do we need mappings between schema levels? How do
different schema definition languages support this architecture?
i) What are the different types of Data Models in DBMS? Explain them.
j) Compare Generalization, Specialization and aggregation with suitable examples.

UNIT-II
a) Consider the following Scheme:
SUPPLIER (SUPPLIER ID, SUPPLIER_NAME, SUPPLIER_ADDRESS)
PARTS (PART ID, PART_NAME, COLOR)
CATALOG (SUPPLIER ID, PART ID, COST)
Write the following queries in Relational Algebra and in SQL:
Engineering
(i) Find the name of the suppliers who supply Black Parts.
(ii) Find the name of suppliers who supply both Blue and Black Parts.
Express
(iii) Find the name of suppliers who supply all Parts.
b) Student (RollNo, Name, Father_ Name, Branch)
Book (ISBN, Title, Author, Publisher)
Issue (RollNo, ISBN, Date-of –Issue)
Write the following queries in SQL and relational algebra:
I. List roll number and name of all students of the branch ‘CSE’.
II. Find the name of student who has issued a book published by ‘ABC’publisher
III. List title of all books and their authors issued to a student ‘RAM’.
IV. List title of all books issued on or before December 1, 2020.
V. List all books published by publisher ‘ABC’.
c) What are the symbols used in E-R diagram? Construct an E-R diagram for a car Insurance company
whose customers own one or more cars each. Each car has Associated with it zero to any number of
recorded accidents? Also convert the E-R Diagram into tables?
d) Explain the concepts of natural join? Also discuss the types of Outer join with suitable example?
e) Write difference between Cross Join, Natural Join, left outer join and right outer join with suitable
example.
f) Explain different types of Triggers in SQL/PL SQL.
g) A database is being constructed to keep track of the teams and games of a sportleague. A team has
a number of players, not all of whom participate in each game. It is desired to keep track of players
participating in each game for each team, the positions they play in that game and the result of the
game.
(i) Design an E-R schema diagram for this application.
(ii) Map the E-R diagram into relational model
h) Discuss the concept of Trigger with a suitable example? Also differentiate between Views and
Indexes?
i) What is Relational Algebra? Explain Different Operations of Relational Algebra with Example.
j) What are the different types of domains used in relational model? Discuss the referential integrity
constraint with suitable example.
k) What do you mean by view? Explain it with an example. How are they Implemented in DBMS?
l) What is Aggregate Function in SQL? Write SQL query for different Aggregate Function.
m) Explain the following with example
(i) indexes Engineering
(ii) Views Express
UNIT-III
a) Define partial functional dependency. Consider the following two sets of functional dependencies F=
{A ->C, AC ->D, E ->AD, E ->H} and G = {A ->CD, E ->AH}. Check whether or not they are
equivalent.
b) Define Minimal Cover. Suppose a relation R (A,B,C) has FD set F = {A→B, B→C, A→C, AB→B,
AB→C, AC→B} convert this FD set into minimal cover.
c) A set of FDs for the relation R{A, B, C, D, E, F} is {AB →C, C → DE, E →F,F → a} Find What is
highest normal form
d) What is Functional Dependency? Explain the procedure of calculating the Canonical Cover of a given
Functional Dependency Set with suitable example.
e) Consider the relation R(a,b,c,d) with Set F={a→c,b→d}. Decompose this relation in 2 NF.
f) Explain the Loss Less Decomposition with example.

First Unit available for FREE Demo.


g) What are RAT axioms? Also discuss the algorithm for finding the closure of functional dependency
with a suitable example?
h) What do you mean by Loss-Less Join Decomposition? Explain with suitable example that how
functional dependency can be used to show that decompositions are loss-less?
i) De Given the following set of FDs on schema R (V,W,X,Y,Z) {Z→V, W→Y, XY→Z, V→WX}State
whether the following decomposition are loss-less-join decompositions or not.
(i) R1=(V,W,X) , R2=(V,Y,Z)
(ii) R1=(V,W,X), R2=(X,Y,Z)
j) What is the purpose of Normalization? Explain 1NF, 2NF, 3NF and BCNF with suitable example?

UNIT-IV
a) What is deadlock? Discuss about the deadlock detection? Also mention the msteps for recovery from
deadlock?What are distributed databases?
b) Discuss the various concurrency protocol used in distributed database in detail?
c) Which of the following schedules are conflicts serializable? For each serializable schedule find the
equivalent schedule.
S1: r1(x); r3(x); w3(x); w1(x); r2(x)
S2: r3(x); r2(x); w3(x); r1(x); w1(x)
S3: r1(x); r2(x); r3(y); w1(x); r2(z); r2(y); w2(y)
d) Explain the method of testing the serializability. Consider the schedule
S1 and S2 given below
S1: R1(A),R2(B),W1(A),W2(B)
Engineering
S2: R2(B),R1(A),W2(B), W1(A)
Express
Check whether the given schedules are conflict equivalent or not?
e) What is Conflict Serializable Schedule? Check the given Schedule S1 is Conflict Serializable or not?
S1: R1(X), R2(X),R2(Y),W2(Y),R1(Y),W1(X)
f) Explain Deadlock Handling with Suitable Example
g) Define the precedence graph. What is the role of it in transaction processing? Discuss in detail.
h) What do you understand by interleaving of transaction? How is it differ from the serial execution?
i) Describe serializable schedule. Discuss conflict serializability with suitable example.
j) Consider schedules S1, S2, and S3 below. Determine whether each schedule is strict, cascade less,
recoverable, or non recoverable. (Determine the strictest recoverability condition that each schedule
satisfies.)
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z); w2(Y); c2;
S2: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);c1;c2; c3;
S3: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2(Y);c3; c2;
k) Consider the three transactions T1, T2, and T3, and the schedules S1 and S2given below. State
whether each schedule is serializable or not. If a schedule is serializable, write down the equivalent
serial schedule(s).
T1: r1 (X); r1 (Z); w1 (X);
T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);
T3: r3 (X); r3 (Y); w3 (Y);
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);

l) What is a schedule? Define the concepts of recoverable, cascade less and strict schedules, and
compare them in terms of their recoverability

UNIT-V
a) Discuss the concept of two phase locking protocol? Also differentiate between strict two phase &
rigorous two phase locking protocol?
b) Explain the concept of Multiple Granularity? Also discuss Multi-version Schemes?.
c) Compare and contrast the differences between time stamp protocol and validation based protocol for
concurrency control?
d) Explain two phase locking protocol with suitable example.
e) Discuss 2 phase commit (2PC) protocol and time stamp based protocol withsuitable example. How
the validation based protocols differ from 2PC?
f) Explain the Validation Based protocol for concurrency control.
Engineering
g) Explain Time Stamp Based Concurrency Control technique. Express
h) Explain Recovery from Concurrent Transaction.
i) Discuss the timestamp ordering protocol for concurrency control. How does strict timestamp ordering
differ from basic timestamp ordering?
j) Explain the concept of Multiple Granularity? Also discuss Multi-version Schemes?
k) What do you mean by time stamping protocol for concurrency controlling? Discuss multi version
scheme of concurrency control.

Access notes via Gmail and Drive

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy