5mks

1. List the duties and responsibilities of DBA.

Duties and Responsibilities of a DBA:
1. Database Design & Implementation – Structuring and creating
databases based on requirements.
2. Installation & Configuration – Setting up database software and
environments.
3. Performance Monitoring & Optimization – Tuning queries and
indexes for efficiency.
4. Backup & Recovery – Ensuring regular data backups and disaster
recovery.
5. Security Management – Controlling access, preventing data
breaches, and enforcing security policies.
6. Maintenance & Troubleshooting – Updating databases, fixing
errors, and ensuring smooth operations.

2. Discuss the advantages of DBMS over File processing system.

3. Explain any three relational algebra operations.

Relational algebra is a procedural query language used to manipulate
and retrieve data from relational databases. It consists of the following
operations:
1. Selection (σ)
o Used to filter rows (tuples) based on a condition.
o Syntax: σ_condition(Relation)
o Example: σ_{age > 25}(Students) → Selects students
older than 25.
2. Projection (π)
o Extracts specific columns (attributes) from a relation.
o Syntax: π_{column1, column2}(Relation)
o Example: π_{name, age}(Students) → Retrieves only
name and age of students.
3. Union (∪)
o Combines tuples from two relations (removes duplicates).
o Syntax: Relation1 ∪ Relation2
o Example: Employees ∪ Managers → Combines both relations,
removing duplicates.
4. Intersection (∩)
o Returns common tuples between two relations.
o Syntax: Relation1 ∩ Relation2
o Example: Employees ∩ Managers → Finds employees who are also
managers.
5. Difference (-)
o Finds tuples present in one relation but not in the other.
o Syntax: Relation1 - Relation2
o Example: Employees - Managers → Finds employees who are not
managers.
6. Cartesian Product (×)
o Combines all tuples from two relations (creates all possible pairs).
 o Syntax: Relation1 × Relation2
o Example: Students × Courses → Pairs each student with every
course.
7. Join (⨝)
o Combines related tuples from two relations based on a condition.
o Types:
o Theta Join (⨝ condition) – Uses any condition.
o Equi Join (⨝ column = column) – Uses equality condition.
o Natural Join (⨝) – Automatically matches common attributes.
o Example: Students ⨝ StudentID = CourseID Courses → Matches
students with their courses.
8. Division (÷)
o Finds tuples in one relation that are related to all tuples in another.
o Syntax: Relation1 ÷ Relation2
o Example: A / B → Finds students enrolled in all courses in B
4. Design an ER diagram for a Hospital Management System.
5. Design an ER diagram for a University Management System.
6. Explain the overall system structure of DBMS.

OR
 The Database Management System (DBMS) is structured into different
components that work together to manage data efficiently. The key
components are:
1. Users – Interact with the DBMS (e.g., end-users, database
administrators, application developers).
2. Application Programs – Software that allows users to perform
database operations (e.g., banking apps, e-commerce platforms).
3. Query Processor – Converts high-level queries (SQL) into low-
level instructions for execution.
4. DBMS Engine – The core component that manages database
operations like insertion, deletion, and retrieval.
5. Storage Manager – Handles physical storage, data indexing, and
file organization on disk.
6. Database – The actual collection of structured data stored in
tables.

7. Define Key. Explain different types of keys with examples.

Definition of Key in DBMS:
A key in DBMS is an attribute or a set of attributes that
uniquely identifies a record (row) in a table. Keys help maintain
data integrity and establish relationships between tables.
8. Design an ER diagram for a Bank Database Management System
 2 mks
1. Define super key
A Super Key is a set of one or more attributes that can uniquely identify
a tuple (row) in a relation (table).
It may contain extra attributes that are not necessary for uniqueness.
Example:
• Consider a Students table:

Possible Super Keys:

• {StudentID} (Minimal Unique Identifier)
• {StudentID, Name}
• {StudentID, Email, Phone Number}

2. Explain Specialization.
Specialization is a top-down approach where a higher-level entity is
divided into sub-entities based on specific attributes.
Purpose: Helps in modularization and better classification.
Example:
• Consider an Employee entity:
o We can specialize it into:
▪ Manager (has additional attribute: Bonus)
▪ Developer (has additional attribute:
Programming_Language)
Employee
/ \
Manager Developer
 3. Discuss Total participation' and 'partial participation'.

• Total Participation: Every entity instance must be involved in the

relationship.
• Partial Participation: Some entity instances may or may not be involved
in the relationship.
Example:
• Consider Students and Courses:
o Every student must be enrolled in at least one course (Total
Participation).
o Some Professors may not be assigned a course (Partial
Participation).

4. Demonstrate Multivalued Attribute.

An attribute that can have multiple values for a single entity.
Example:
• A Student can have multiple Phone Numbers, such as:
Student Name: John Phone Numbers: {9876543210, 9123456789}

5. Explain select operation in relational algebra.

• The Select (σ) operation is used to filter rows based on a condition.
 • Syntax: σ condition (Relation)
• Example:

σ Age > 18 (Students) → Returns:

6. Define Physical Data Independence.

Physical Data Independence (3 Marks)

Definition:
Physical Data Independence is the ability to modify the physical storage structure of a
database without affecting the logical schema or application programs.

Example:
If a database stored data in sequential files but later switched to B+ tree indexing, queries
would still work without changes.

Key Benefit:

Allows optimization of storage and performance without modifying database

queries or application logic.

7. Define Primary Key and Foreign Key.

Primary Key vs. Foreign Key
• Primary Key:
o A unique identifier for a record in a table.
o Example: In a Students table, StudentID is a Primary Key.
• Foreign Key:
o A key in one table that refers to the Primary Key in another table.
o Example:
8. Explain Specialization and Generalization.

Specialization & Generalization

• Specialization:
o Dividing an entity into sub-entities (Top-down approach).
o Example: Vehicle → Car, Bike
• Generalization:
o Combining multiple entities into a single parent entity (Bottom-
up approach).
o Example: Car, Bike → Vehicle

9. Define Logical Data Independence.

Logical Data Independence
• The ability to modify the logical schema (tables, columns, constraints)
without affecting applications.
• Example:
o Adding a new column MiddleName to the Students table should
not require changes in all applications.
10.Explain project operation in relational algebra.
• The Project (π) operation is used to retrieve specific columns from a table.
• Syntax: π column1, column2 (Relation)
• Example:

11.Define derived attributes.

An attribute that is computed from other attributes.
Example:
• Age can be derived from Date of Birth

12.List EER features.

EER (Enhanced Entity-Relationship) Features
1. Generalization – Combining lower entities into a higher entity.
2. Specialization – Breaking down an entity into sub-entities.
3. Aggregation – Relationship between a relationship and an entity.
4. Categorization – Grouping different entities under a common
parent entity.
5. Inheritance – Lower entities inherit attributes of higher entities.