DBMS Assignment Answers
DBMS Assignment Answers
Database :
A database is a collection of data that is organized and stored electronically. It
can store any type of data, including numbers, words, images, videos, and
files.
Database management system:
A database management system (DBMS) is a collection of interrelated and a
set of application programs used to access, update and manage that data.
The goal of DBMS is to provide an environment that is both convenient and efficient to
use in retrieving information from the database, Storing information into the database.
DATABASE SYSTEM APPLICATIONS :
Database Users:
1. Naïve Users:
a. Interact with the system via predefined applications without
understanding the database structure.
b. They typically use forms or reports to interact with the system. For
instance, a student using a web interface to register for a class.
2. Application Programmers:
a. Computer professionals who develop applications to interface with
the database. They use tools like Rapid Application Development
(RAD) tools to create user interfaces with minimal coding effort.
3. Sophisticated Users:
a. These users formulate complex database queries using query
languages or data analysis tools. Analysts exploring database
information fall into this category.
4. Specialized Users:
a. Users who develop complex, non-traditional database
applications such as systems involving CAD (computer-aided
design), graphics, or audio data.
DBAs hold central control over data and access programs. Their primary
responsibilities include:
2. Projection (π)
3. Union (∪)
• Definition: The set difference operation returns tuples that are in the
first relation but not in the second.
• Syntax: relation1 − relation2
• Example: To find students in Students_CS but not in Students_EE:
o Students_CS − Students_EE
5. Cartesian Product (×)
6. Rename (ρ)
7. Join (⨝)
8. Intersection (∩)
These features and issues help enhance the database model’s clarity and
efficiency.
9) Explain various processes of reducing an E-R diagram into
relational schemas.
To reduce an E-R diagram into relational schemas, we follow several steps,
which are explained in the document you provided:
b. The primary key of the entity set is used as the primary key of the
table.
a. A weak entity set does not have a primary key on its own and
depends on a strong entity set for identification.
b. The relational schema for a weak entity set includes both its own
attributes and the primary key of the strong entity set on which it
depends.
• Example: If a section is a weak entity set dependent on course, the
corresponding relation could be section (course_id, sec_id,
semester, year).
10) What is the use of Normalization and discuss the first three
normal forms with suitable examples.
• Rule: Each table must have atomic (indivisible) values, and each
column must contain only one value per row.
• Example: A table storing student data must not have a column that
stores multiple phone numbers in one cell. Instead, each phone number
should be placed in a separate row or column.
• Rule: The table must meet all the criteria of 1NF, and all non-key
attributes must be fully functionally dependent on the entire primary key.
• Example: Consider a table storing course enrollments:
• Rule: The table must be in 2NF, and all attributes must be directly dependent on the
primary key, with no transitive dependencies (i.e., non-key attributes must not
depend on other non-key attributes).
• Example: If a table stores student information, it should not include attributes like
Department_Name, which is dependent on Department_ID: