0% found this document useful (0 votes)
786 views9 pages

Database Management System: Important Questions Unit-1

The document provides important questions for the Database Management System course. It covers topics like data modeling using the entity relationship model, the relational data model and SQL, database design and normalization. Some of the questions ask students to draw ER diagrams, define normalization concepts, decompose relations into different normal forms based on functional dependencies, and write SQL queries.

Uploaded by

Aniket Kaushik
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)
786 views9 pages

Database Management System: Important Questions Unit-1

The document provides important questions for the Database Management System course. It covers topics like data modeling using the entity relationship model, the relational data model and SQL, database design and normalization. Some of the questions ask students to draw ER diagrams, define normalization concepts, decompose relations into different normal forms based on functional dependencies, and write SQL queries.

Uploaded by

Aniket Kaushik
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/ 9

Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310

Email: [email protected], Website: www.universityacademy.in,


YouTube: www.youtube.com/c/UniversityAcademy

Database Management System


Important Questions
Unit-1
Introduction: Overview, Database System vs File System, Database System Concept and
Architecture, Data Model Schema and Instances, Data Independence and Database
I
Language and Interfaces, Data Definitions Language, DML, Overall Database Structure.
Data Modeling Using the Entity Relationship Model: ER Model Concepts, Notation for ER
Diagram, Mapping Constraints, Keys, Concepts of Super Key, Candidate Key, Primary
Key, Generalization, Aggregation, Reduction of an ER Diagrams to Tables, Extended ER
Model, Relationship of Higher Degree.

1. Describe the three-schema architecture. Why do we need mappings between schema levels?
2. Consider following relational schema:
Student (s_no, s_name, s_address, class), Teacher (t_name, t_address, dept, specialization)
Lecture_schedule (day, time, room_no, class, subject), attendance (data, subject, s_no)
Draw E-R diagram. Identify the relationships and also indicate mapping cardinalities.
3. Discuss the main characteristics of database approach and how it differs from traditional file
system.
4. When is the concept of a weak entity type used in data modeling? Define the terms owner
entity type, weak entity type, identifying relationship type and partial key.
5. What is the difference between specialization and generalization? Why we do not display the
difference in schema diagram?
6. What is the Data Model? Explain Data independence with suitable diagram.
7. Explain Super key, Candidate key, Primary key and Partial key with example.
8. Describe Generalization, Specialization with example and reduce it into tables (Record need
not require).
9. Draw the E-R Diagram of registration process of the student in a particular course, convert
the ER diagram into tables also (Records need not require).
10. Explain all database languages in detail with examples.
11. Explain the differences between physical level, conceptual level and view level of data
abstraction.

1 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

12. Draw an E-R diagram for a small marketing companydatabase, assuming your own data
requirements.
13. What do vou mean by a key to the relation ? Explain the differences between super key,
candidate key and primary key.

2 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

Database Management System


Important Questions
Unit-II
Relational data Model and Language: Relational Data Model Concepts, Integrity
Constraints, Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints,
II Relational Algebra, Relational Calculus, Tuple and Domain Calculus. Introduction on SQL:
Characteristics of SQL, Advantage of SQL. SQl Data Type and Literals. Types of SQL
Commands. SQL Operators and Their Procedure. Tables, Views and Indexes. Queries and
Sub Queries. Aggregate Functions. Insert, Update and Delete Operations, Joins, Unions,
Intersection, Minus, Cursors, Triggers, Procedures in SQL/PL SQL

1. Define Relational calculus and their types. Explain it with suitable examples.
2. Discuss Join and types with suitable example.
3. What do you mean by referential integrity? Explain the concept of foreign key with a suitable
example?
4. What are the differences in Cartesian product and natural join operations? Explain with a
suitable example.
5. Discuss the entity integrity and referential integrity constraints. Why each is considered
important?
6. What is union compatibility? Why do union, intersection and difference operations require
that the relations on which they applied be union compatible?
7. Explain tuple relational calculus and domain relational calculus by taking suitable example.
8. With an example show how a referential integrity can be implemented
9. Explain embedded SQL and dynamic SQL in detail.
10. What are the relational algebra operations supported in SQL? Write the SQL statement for
each operation.
11. Consider the following relation. The Primary key is Rollno, Isbn, Student(RollNo, Name,
Branch), Book(Isbn, Title, Author, Publisher) Issue(Rollno, Isbn, date_of_issue). Write the
query in Relational algebra and SQL of the following)
a. List the Roll Number and Name of All CSE Branch Student.
b. Find the name of students who have issued a book of publication ‘BPB’.
3 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

c. List the title and author of all books which are issued by a student name started with
a.
d. List the title of all books issued on or before 20/09/2012.
e. List the name of student who will read the book of author named ‘Sanjeev’.
12. Give the following queries in the relational algebra using the relational schema:
student(id, name),
enrolled(id, code) *.
subject(code, lecturer)
a. What are the names of students enrolled in cs3020?
b. Which subjects is Hector taking?
c. Who teaches cs1500?
d. Who teaches cs1500 or cs3020?
e. Who teaches at least two different subjects?
f. What are the names of students in cs1500 or cs307? _
g. What are the names of students in both cs1500 and cs1200?

4 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

Database Management System


Important Questions
Unit-III
Data Base Design & Normalization: Functional dependencies, normal forms, first, second,
third normal forms, BCNF, inclusion dependence, loss less join decompositions,
III
normalization using FD, MVD, and JDs, alternative approaches to database design

1. What is a Functional Dependency? Describe Inference rules for Functional Dependencies


(FDs). If we have a initial set of attributes (A,G) and given FD are A→ B, A→C, CG→
H,CG→ I,B→ H, Find the relation.
2. Explain Lossless join Decomposition with example. Why is it desirable to have a
decomposition to be dependency preserving?
3. Define Normalization. List the types of Normal form. Describe multivalued dependency with
a suitable example.
4. Consider the universal relation R= {A,B,C,D,E,F,G,H,I,J} and a set of functional
dependencies F= { {AB→ C}, { A → DE}, { B→ F}, {F→ GH}, {D→ IJ}}.
What is the key for R?
Decompose R into 2NF, then 3NF relations.
5. Consider the relation R: (A, B, C, D, E, F, G, H) with following FDs: F :{ AC → G, D →
EG, BC →D, CG →BD, ACD →B, CE →AG}, Find the canonical cover of F.
6. Explain dependency preserving decomposition. Given two sets F1 and F2 of FDs for a
relation R (A, B, C, D, E). F1:A→ B, AB →C, D →AC, D →E, F2: A →BC, D →AE. Are
F1 and F2 equivalent? Explain.
7. Suppose we have the database for an investment firm consisting of the following attributes:
B (broker), O(office of the broker), I( investor), S( Stock), Q(quantity of the stock owned by
an investor) and D( dividend paid by a stock), with the functional dependencies:
a. S→ D, I→ B, IS→ Q, B→>O

Find the key of the relational schema R=BOSQID.


How many keys does the R have? Justify.
Find the lossless join decomposition of R into Boyce Codd Normal Form.

5 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

8. Consider the relation R(A,B,C,D,E,F,G,H,I,J) and the set of FD’s


a. F= {AB→C, A→DE, B→F, F→GH, D→IJ},
What is the key in the given relation? Decompose R into 2NF and 3NF.
9. Is every 3rd NF is in BCNF, if not why? If so, give any example of 3rd NF but not in BCNF.
10. What is Canonical Cover? Determine canonical cover of an FD set
a. {A→BCD, B→CDA, C→ABD}
11. Explain INF, 2NF, 3NF and BCNF with suitable example.
12. 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> I}. Determine the keys for R?
Decompose R into 2nd Normal Form.
13. Define functional dependency. What do you mean by loss-less decomposition ? Explain with
suitable example
14. Define Normal forms. List the definitions of First. Second and Third normal! forms. Explain
BCNF with a suitable example.

6 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

Database Management System


Important Questions
Unit-IV
Transaction Processing Concept: Transaction System, Testing of Serializability,
Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability,
IV Recovery from Transaction Failures, Log Based Recovery, Checkpoints, Deadlock
Handling. Distributed Database: Distributed Data Storage, Concurrency Control, Directory
System

1. What do you mean by deadlock? Explain different deadlock


techniques.
2. What are the problem faced when concurrent transactions are executed in an Uncontrolled
manner? Give an example and explain.
3. What is a schedule (history)? Define the concepts of recoverable, cascade less, and Strict
schedules, and compare them in terms of their recoverability.
4. What do you mean by Transaction? Explain ACID properties of transaction with suitable
example.
5. Discuss the Recovery Technique from transaction failure and their types with example.
6. What is a Schedule? What are the problems associated with concurrent schedule? Explain
with suitable examples.
7. What is Serializability? Explain view and conflict serializability.
8. List all possible schedules for transactions T1 and T2 and determine which is conflict
serializable and which are not.
a. T1 T2
b. read_item(X); read_item(X);
c. X: =X-N; X: =X+M;
d. Write_item(X); write_item(X);
e. Read_item(Y);
f. Y: =Y+N;
g. Write_item(Y);

7 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

9. What is log based recovery? Explain the difference between deferred and immediate database
modification. How checkpoint reduce the overheads in database modification?
10. Explain the role of check pointing in detail
11. Discuss about the deadlock prevention schemes.
12. What are schedules ? What are differences between conflict serialzabilty and view
serialzability ? Explain with suitable example what are cascadeless and recoverable schedules
?
13. What are distributed databases ? List advantages and disadvantages of data replication and
data Fragmentation. Explain with a suitable example. what are differences in replication and
fragmentation transparency.
14. What do you mean by multiple granularities ? How it is implemented in transaction system ?

8 University Academy
Amrapali Castle Chi-V, Greater Noida, Uttar Pradesh -201310
Email: [email protected], Website: www.universityacademy.in,
YouTube: www.youtube.com/c/UniversityAcademy

Database Management System


Important Questions
Unit-V
Concurrency Control Techniques: Concurrency Control, Locking Techniques for
Concurrency Control, Time Stamping Protocols for Concurrency Control, Validation Based

V Protocol, Multiple Granularity, Multi Version Schemes, Recovery with Concurrent


Transaction, Case Study of Oracle.
1. Describe major problems associated with concurrent processing with examples.
2. What is the role of locks in avoiding these problems?
3. What is phantom phenomenon
4. What do you mean by multiple granularities? Explain in detail.
5. Define deadlock. Explain deadlock recovery and prevention techniques
6. Explain multiversion concurrency control in detail.
7. Explain the working of various time stamping protocols for concurrency control
8. Explain the difference between two phase commit protocol and three phase commit protocol.
9. What is meant by the concurrent execution of database transactions in a multiuser system?
Discuss why concurrency control is needed, and give informal examples.
10. What are the problems encountered in distributed DBMS while considering concurrency
control and recovery?
11. Distinguish between data replication and data fragmentation.
12. Explain in detail Validation Based Protocol.
13. What are multi version schemes of concurrency control? Describe with the help of an
example. Discuss the various Time stamping protocols for concurrency control also.

9 University Academy

You might also like