Here are the answers to your DBMS ques ons in a concise and clear manner:

1. Explain the characteris cs of the database:

 Self-describing nature: A DBMS contains not only the data but also a complete descrip on of
its structure (metadata).
 Data abstrac on: It provides different levels of abstrac on to hide complexity.
 Data independence: Changes in structure do not affect applica on programs.
 Efficient data access: Query op miza on ensures quick data retrieval.
 Concurrent access and crash recovery: Supports mul -user access and ensures data is safe
even a er failures.
 Security and integrity: Controls user access and maintains data accuracy.

2. Define data abstrac on:

Data abstrac on is the process of hiding the complexi es of the database and showing only
necessary details to the user. It has three levels: physical, logical, and view level.

3. What is the difference between file system and database system?

Feature File System Database System
Data Redundancy High Low
Data Integrity Hard to maintain Enforced through constraints
Access Sequen al or manual Query-based, faster and flexible
Security Limited Advanced access controls
Backup & Recovery Manual Automated and reliable

4. Explain the different types of a ributes:

 Simple A ribute: Cannot be divided further (e.g., Age).
 Composite A ribute: Can be divided into subparts (e.g., Name → First, Last).
 Derived A ribute: Can be derived from other a ributes (e.g., Age from DOB).
 Mul -valued A ribute: Can have mul ple values (e.g., Phone Numbers).
 Key A ribute: Uniquely iden fies a record (e.g., Roll Number).

5. What is degree of rela on?

The degree of a rela on refers to the number of a ributes (columns) in a rela on (table).

6. What is rela onal algebra?

Rela onal algebra is a procedural query language that uses operators to manipulate rela ons and
produce required results. Example operators: SELECT, PROJECT, UNION, SET DIFFERENCE,
CARTESIAN PRODUCT, JOIN.

7. What are the three levels of data abstrac on?

 Physical level: Describes how data is stored.
 Logical level: Describes what data is stored and the rela onships.
 View level: Describes only part of the en re database for user interac on.

8. Define normaliza on:

Normaliza on is the process of organizing data to reduce redundancy and improve data integrity by
dividing tables and establishing rela onships.
9. Discuss func onal dependency:
A func onal dependency exists when one a ribute uniquely determines another a ribute.
Example: If A → B, then knowing A means you can determine B. It's essen al in normaliza on.

10. Explain types of joins:

 Inner Join: Returns records with matching values in both tables.
 Le Join (Le Outer Join): Returns all records from the le table and matched records from
the right.
 Right Join (Right Outer Join): Returns all records from the right table and matched records
from the le .
 Full Join (Full Outer Join): Returns all records when there is a match in one of the tables.
 Cross Join: Returns the Cartesian product of two tables.
 Self Join: Joining a table with itself.

Let me know if you’d like a PDF version or short answers for quick revision!

Sure! Here are answers to the most important viva ques ons from your DBMS experiment list—
these are the ones you're most likely to be asked:

1. What is the purpose of your selected case study?

The purpose is to design a database system that solves a specific real-world problem—like managing
student records, hospital pa ents, or library systems—by efficiently storing, accessing, and
manipula ng data.

2. What is an ER model? How is it different from an EER model?

 ER Model: Represents en es, a ributes, and rela onships in a system.
 EER Model: Extends ER with features like generaliza on, specializa on, and categoriza on to
represent more complex real-world scenarios.

3. How do you convert an ER diagram into a rela onal schema?

 En es → Tables
 A ributes → Columns
 Primary Keys → Unique Iden fiers
 Rela onships → Foreign Keys
 Mul valued A ributes → Separate Tables
 Weak En es → Tables with foreign keys referencing their owner en es

4. What are primary keys, foreign keys, and NOT NULL constraints?
 Primary Key: Uniquely iden fies each row in a table.
 Foreign Key: Refers to a primary key in another table to maintain referen al integrity.
 NOT NULL: Ensures a column cannot have NULL values.

5. What are DML commands? Give examples.

DML (Data Manipula on Language) is used to manage data:
 INSERT – Adds data
 UPDATE – Modifies data
 DELETE – Removes data
  SELECT – Retrieves data

6. What is the difference between INNER JOIN and OUTER JOIN?

 INNER JOIN: Returns only matching records from both tables.
 OUTER JOIN: Returns matching records + unmatched rows from one or both tables.

7. What is a nested query? Give an example.

A nested query (or subquery) is a query inside another query.
Example:
SELECT name FROM Employee WHERE salary > (SELECT AVG(salary) FROM Employee);

8. What are transac ons in DBMS?

A transac on is a sequence of opera ons performed as a single unit of work. It must sa sfy ACID
proper es:
 Atomicity
 Consistency
 Isola on
 Durability

9. What is a view?
A view is a virtual table created by a query. It simplifies access to complex queries and provides data
security.

10. What is a trigger?

A trigger is a set of ac ons automa cally performed in response to specific events on a table, like
INSERT, UPDATE, or DELETE.

11. What are shared and exclusive locks?

 Shared Lock (S Lock): Allows mul ple users to read the same data.
 Exclusive Lock (X Lock): Allows only one user to write to data, blocking others.

Let me know if you want a printable version, or if you want the answers to be even shorter for quick
revision!

Great! Let’s now complete the answer set by covering the few remaining ques ons that were not
answered explicitly in the previous messages:

Already Answered:
Most of the answers were already given in the previous responses, but here are the ques ons that
were implicitly skipped or par ally addressed, now answered directly:

1. What is the difference between generaliza on, specializa on, and aggrega on in EER?
 Generaliza on: Combines mul ple lower-level en es into a single higher-level en ty (e.g.,
Car and Bike become Vehicle).
 Specializa on: Breaks a higher-level en ty into more specific sub-en es (e.g., Employee
specialized into Manager and Engineer).
 Aggrega on: Treats a rela onship as an en ty (used when you want to relate rela onships to
other en es).
2. Can a view be updated?
 Answer: Yes, but only if the view is based on a single table without:
o Aggregate func ons
o Group By or Dis nct
o Joins or subqueries
Otherwise, the view becomes read-only.

3. What is a correlated subquery?

 A correlated subquery is a subquery that uses values from the outer query. It executes once
for each row of the outer query. Example:
SELECT name FROM Employee e WHERE salary > (SELECT AVG(salary) FROM Employee WHERE
dept_id = e.dept_id);

4. What are ACID proper es in DBMS transac ons?

 Atomicity: All opera ons succeed or none.
 Consistency: DB remains in a valid state before and a er.
 Isola on: Concurrent transac ons don’t interfere.
 Durability: Changes are permanent a er commit.

5. What is the difference between COMMIT and ROLLBACK?

 COMMIT: Saves all changes made in the current transac on.
 ROLLBACK: Undoes all changes made since the last COMMIT or SAVEPOINT.

6. What is a SAVEPOINT in SQL?

 SAVEPOINT: Creates a point in a transac on to which you can rollback par ally.
SAVEPOINT point1;
ROLLBACK TO point1;

7. What is the purpose of database connec vity in applica ons?

 Answer: It allows applica ons (e.g., web or desktop apps) to interact with the database—like
fetching user data, submi ng forms, or processing transac ons.

That now completes all the remaining unanswered or par ally covered parts from your experiment
list! If you’d like a compiled PDF of all Q&A for quick revision, just say the word!