Scribd
Upload
62 views

DBMS Assignment Question

The document contains 10 assignments related to database management systems (DBMS). Each assignment contains 10 questions related to concepts such as the differences between databases and DBMS, data abstraction, normalization, relational algebra, functional dependencies, transactions, concurrency control, and distributed databases.

Uploaded by

Amit Vishwakarma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
62 views

DBMS Assignment Question

The document contains 10 assignments related to database management systems (DBMS). Each assignment contains 10 questions related to concepts such as the differences between databases and DBMS, data abstraction, normalization, relational algebra, functional dependencies, transactions, concurrency control, and distributed databases.

Uploaded by

Amit Vishwakarma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment- 1

Q. 1- Write difference between Database and DBMS.

Q. 2- What is data abstraction in DBMS and what are its three levels?

Q. 3- Write difference between cardinality and degree?

Q. 4- Explain de-normalization in DBMS.

Q. 5- Write difference between SQL, MySQL and NoSQL.

Q. 6- What is database cursor and how to use it?

Q. 7- Explain OLTP and OLAP?

Q. 8- Explain Concurrency Control in DBMS?

Q. 9- What is dirty read and unrepeatable read problem in DBMS?

Q. 10- What is Phantom Deadlock?


Assignment- 2

Q. 1- Explain Referential integrity constraint.

Q. 2- What is relational algebra?

Q. 3- What are the additional operations in relational algebra?

Q. 4- Consider the following relations:


Student (ssn, name, address, major)
Course (code, title)
Registered (ssn, code)
Use relational algebra to answer the following:
a. List the codes of courses in which at least one student is registered (registered courses).
b. List the title of registered courses.
c. List the codes of courses for which no student is registered.
d. The titles of courses for which no student is registered.
e. Name of students and the titles of courses they registered to.
f. SSNs of students who are registered for both database systems and analysis of algorithms.
g. SSNs of students who are registered for both database systems and analysis of algorithms.
h. The name of students who are registered for both database systems and analysis of algorithms.

Q. 5- What is relational calculus?

Q. 6- What are the different data types used in SQL?

Q. 7- What are the types of literal used in SQL?

Q. 8- What are the different types of SQL commands?

Q. 9- Draw an ER diagram of Hospital or Bank with showing the specialization, Aggregation,


Generalization. Also convert it in to relational schemas and SQL DDL.

Q. 10- Describe the operators and its types in SQL.


Assignment- 3

Q. 1- What is functional dependency? Explain its role in database design.

Q. 2- Explain trivial and non- trivial functional dependency?

Q. 3- Consider the universal relational schema R (A, B, C, D, E, F, G, H, I, J) and a set of following


functional dependencies.

Q. 4- 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.

Q. 5- Consider the universal relational schema R (A, B, C, D, E, F, G, H, I, J) and a set of following


functional dependencies. F = {AB → C, A → DE, B → F, F → GH, D → IJ} determine the keys for
R? Decompose R into 2nd normal form.

Q. 6 - Write the difference between 3NF and BCNF. Find the normal form of relation R (A, B, C, D, E)
having FD set F= {A → B, BC →E, ED→ A}.

Q. 7- Consider the relation r(X, Y, Z, W, Q) the set F = {X→Z, Y→Z, Z→W, WQ→Z, ZQ→X} and the
decomposition of R into relations R1 (X, W), R2 (X, Y), R3 (Y, Q), R4 (Z, W, Q) and R5 (X, Q).
Check whether the decompositions are lossy or lossless.

Q. 8- Write the algorithm to find minimal cover F for set of functional dependencies E.

Q. 9- What is MVD and JO?

Q. 10- Define partial functional dependency. Consider the following two steps of functional dependencies

F = {A→C, AC→D, E→AD, E→H} and G= {A→CD, E→AH} EAH AH}. Check whether or not
are equivalent.
Assignment- 4

Q. 1- Explain ACID properties of transaction.

Q. 2- What is transaction? Draw a state diagram of a transaction showing its states.

Q. 3- Discuss conflict serializability with example.

Q. 4- What is precedence graph? How can it be used to test the conflict serializability of a schedule?

Q. 5- Test the serializability of the following schedule:

i. r1 (x); r3 (x); w1 (x); r2 (x); w3 (x)

ii. r3 (x); r2 (x); w3 (x); r1 (x); w1 (x)

Q. 6- What is the difference between conflict and view serializability?

Q. 7- 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)

Q. 8- What is deadlock? How it can be detected and avoided?

Q. 9- Discuss about deadlock prevention schemes.

Q. 10- Explain data fragmentation with types.


Assignment- 5

Q. 1- Why concurrency control is needed?

Q. 2- Explain concurrency control mechanism perform with distributed database.

Q. 3- Explain different types of locks?

Q. 4- What do you understand by lock compatibility? Explain with example.

Q. 5- Write lock based protocol?

Q. 6- Explain two phase locking protocol with suitable example.

Q. 7- Define time stamp based protocol to maintain serializability in concurrent execution?

Q. 8- What is Thomas write rule?

Q. 9- Explain phantom phenomenon with suitable example?

Q. 10- What is multiple granularity protocol of concurrency control?

You might also like