0% found this document useful (0 votes)
4 views2 pages

DBMS Assignment Questions Overview

The document outlines an assignment for a Database Management System (DBMS) module, consisting of 25 questions across various topics including database architecture, data modeling, relational algebra, normalization, and higher normal forms. Each section contains specific tasks such as differentiating concepts, explaining models, and performing numerical exercises. The assignment aims to assess understanding of fundamental DBMS principles and their applications.

Uploaded by

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

DBMS Assignment Questions Overview

The document outlines an assignment for a Database Management System (DBMS) module, consisting of 25 questions across various topics including database architecture, data modeling, relational algebra, normalization, and higher normal forms. Each section contains specific tasks such as differentiating concepts, explaining models, and performing numerical exercises. The assignment aims to assess understanding of fundamental DBMS principles and their applications.

Uploaded by

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

DBMS Module 1 - Assignment

Questions (25)
A. Introduction & Basics
1. Differentiate between File System and Database Management System with examples.
2. Explain the Database System Architecture with a neat diagram.
3. What is Data Independence? Differentiate between Logical and Physical Data
Independence with example.
4. Write short notes on DDL, DML, DCL with example SQL commands.
5. Explain the Database Development Life Cycle (DDLC) with suitable case study.

B. Data Modeling & ER Model


6. Explain the components of ER Model with an example diagram.
7. Draw an ER diagram for a “Library Management System” and convert it into relational
tables.
8. Explain Mapping of ER model to relational schema with example.
9. What is Specialization and Generalization? Give real-life examples with diagrams.
10. Differentiate between Weak Entity Set and Strong Entity Set with examples.

C. Relational Model & Relational Algebra (Numericals)


11. What is Relational Algebra? Explain any five operators with example relations.
12. Consider the following relations: STUDENT (RollNo, Name, Dept, Year), COURSE (CId,
CName, Dept). Write relational algebra queries for: (a) Find names of all students in CSE
dept. (b) List students enrolled in “DBMS” course.
13. Write SQL & Relational Algebra for: (a) Display names of students who are in 3rd year.
(b) List all distinct departments from COURSE.
14. Differentiate between Relational Model Constraints: Domain, Entity Integrity,
Referential Integrity with examples.
15. What is a Primary Key, Foreign Key, Candidate Key, Super Key? Give example relations
to illustrate.

D. Normalization – I (with Numerical)


16. Define Functional Dependency (FD). Give real-life examples.
17. Check whether the following FDs hold or not: R(A, B, C), F = {A → B, B → C}. Does A → C
hold?
18. Consider relation R(ABCD) with FDs: {A → B, B → C, C → D}. Find the Candidate Key(s).
19. For the relation R(A, B, C, D) with FDs {AB → C, C → D, D → A}: (a) Find Closure of AB. (b)
List all Candidate Keys.
20. Explain First Normal Form (1NF) with example. Convert a given unnormalized table
into 1NF.

E. Higher Normal Forms (with Numerical)


21. Convert the following relation into 2NF: R(StudentID, CourseID, StudentName,
CourseName, Instructor). FDs: {StudentID → StudentName, CourseID → CourseName,
CourseID → Instructor, (StudentID, CourseID) → Instructor}
22. Convert the same relation into 3NF.
23. What is BCNF? Convert the following relation into BCNF: R(A, B, C), FDs: {A → B, B → C}
24. Find the Canonical Cover for FDs: F = {A → B, B → C, A → C, AB → D}
25. Write short notes on: (a) Lossless Join Decomposition (b) Dependency Preservation

You might also like