DBMS Question Bank with Detailed Answers
1. Explain the architecture of DBMS using a well-labeled diagram.
The architecture of DBMS can be broadly classified into three levels:
1. **Internal Level (Physical Level):** Describes how the data is physically stored on storage devices.
2. **Conceptual Level (Logical Level):** Describes what data is stored in the database and the relationships
among those data.
3. **External Level (View Level):** Describes various user views of the database.
This architecture supports data abstraction and data independence. [Diagram required]
2. Explain Application of DBMS.
Applications include:
- Banking systems
- Airlines and Railways
- Education and University systems
- Manufacturing and inventory systems
- Telecommunications
- Online shopping sites
- Social media apps
3. Discuss the advantages and limitations of DBMS in comparison to traditional file-based systems.
**Advantages:**
- Data redundancy is reduced
- Ensures consistency
- Easy access and sharing
- Improved security and backup
**Limitations:**
- High cost
- Need for technical staff
- Complex system
- Performance can be affected with a huge load
4. Explain View of data in Database.
DBMS provides three views of data:
- **Physical View:** Internal storage
- **Logical View:** Data structure and schema
- **View Level:** User-specific views
5. Describe the node structure of B+ tree. Construct a B+ tree for: (2,3,5,7,11,17,19,23,29,31)
A B+ tree has internal nodes containing keys and pointers, and leaf nodes storing actual data with linked
pointers.
Given: Order = 4 (Max 3 keys, 4 pointers). [Tree diagram should be drawn manually]
6. Summarize Index and types of Index.
**Indexing** speeds up data retrieval. Types:
- Primary Index
- Secondary Index
- Clustered Index
- Non-clustered Index
- Multilevel Index
- B-Tree and Bitmap Index
7. What is Dynamic Hashing? Advantages over static hashing? Mechanism.
Dynamic hashing grows/shrinks based on data. It uses a directory of pointers and bucket overflow
mechanism.
**Advantages:**
- No overflow problem
- Efficient memory use
**Mechanism:**
- Uses global depth and local depth, adjusts table dynamically based on collisions.
8. Explain all DDL commands with syntax.
- **CREATE**: `CREATE TABLE table_name (...);`
- **ALTER**: `ALTER TABLE table_name ADD column_name datatype;`
- **DROP**: `DROP TABLE table_name;`
- **TRUNCATE**: `TRUNCATE TABLE table_name;`
9. Give various SQL Aggregate functions.
- **COUNT()**
- **SUM()**
- **AVG()**
- **MIN()**
- **MAX()**
10. Outline the term Authorization. Explain the process.
Authorization is the process of granting permissions to users for accessing data.
**Process:**
- Define roles
- Assign privileges (e.g., GRANT SELECT)
- Use of GRANT and REVOKE commands
11. Identify all DML commands with syntax.
- **SELECT**: `SELECT * FROM table_name;`
- **INSERT**: `INSERT INTO table_name VALUES (...);`
- **UPDATE**: `UPDATE table_name SET column=value WHERE condition;`
- **DELETE**: `DELETE FROM table_name WHERE condition;`
12. Illustrate BCNF with example.
BCNF is a stricter version of 3NF.
**Example:**
A table with FD: A->B, B->A, A is a candidate key, but B is not. We decompose into two relations to satisfy
BCNF.
13. Elaborate E. F. Codd's relational database rules.
Codd proposed 12 rules for a perfect RDBMS:
- Information Rule
- Guaranteed Access
- Systematic Nulls
- Data Independence (Logical & Physical)
- Integrity rules
- View Updatability
- High-level language support
- etc.
14. What is Normalization? Explain 1NF, 2NF, and 3NF.
Normalization organizes data to reduce redundancy.
**1NF:** Atomic values only
**2NF:** 1NF + No partial dependency
**3NF:** 2NF + No transitive dependency
15. Explain Integrity constraints in detail.
- **Domain Constraint**: Value must be from predefined domain
- **Entity Integrity**: Primary key can't be NULL
- **Referential Integrity**: Foreign key must refer to a valid primary key
16. What is serializability? Types?
Serializability ensures concurrent transactions result in consistent database state.
**Types:**
- Conflict Serializability
- View Serializability
17. Analyze concurrency problems and solutions.
**Problems:**
- Lost update
- Dirty read
- Unrepeatable read
- Phantom read
**Solutions:**
- Locking
- Timestamp ordering
- Serializable schedules
18. Define Transaction. Explain ACID properties.
A transaction is a unit of work. **ACID:**
- **Atomicity:** All or none
- **Consistency:** Consistent state
- **Isolation:** Transactions don't interfere
- **Durability:** Changes are permanent
19. What is deadlock in DBMS?
Deadlock occurs when two or more transactions wait for each other to release resources. E.g., T1 waits for
lock held by T2 and vice versa.
20. What are deadlock prevention strategies.
- **Wait-die**: Older waits, younger dies
- **Wound-wait**: Older preempts, younger waits
- **Timeouts**
- **Resource ordering**: Enforce resource acquisition order
