Instructions to the Students:
- Each question carries 12 marks.
- Question No. 1 is compulsory and includes objective-type questions.
- Attempt any four questions from Q.2 to Q.6.
- Use of non-programmable scientific calculators is allowed.
- Assume suitable data wherever necessary and mention it clearly.
Q.1 Objective type questions. (Compulsory) – 12 Marks
- Which of the following is an advantage of a DBMS over file systems?
- Data redundancy increases
- Improved data sharing and security
- Manual data inconsistency handling
- Files are smaller in size
- Which of the following provides physical data independence?
- External Level
- Conceptual Level
- Internal Level
- None of these
- Which is not a component of DBMS?
- Query Processor
- Data Manager
- Operating System
- Database
- In an E–R model, attributes are represented by:
- Rectangles
- Ovals
- Diamonds
- Lines
- A primary key must be:
- Unique and Not Null
- Only Unique
- Only Not Null
- Can be Null
- Referential integrity constraint ensures:
- Foreign key matches primary key in referenced table
- Every tuple has a unique value
- Values are in specified domain
- All attributes are atomic
- Relational Algebra is:
- Procedural query language
- Non-procedural query language
- Natural language
- Low-level machine language
- Which SQL command is a DDL command?
- INSERT
- DELETE
- UPDATE
- CREATE
- A View in SQL is:
- A physical copy of data
- A virtual table derived from query
- A synonym for table
- A type of transaction
- Which aggregate function is not valid in SQL?
- MAX()
- SUM()
- COUNT()
- INCREMENT()
- Which normal form removes transitive dependency?
- 1NF
- 2NF
- 3NF
- BCNF
- Which data structure is used by a DBMS for indexing?
- Stack
- Queue
- B+ Tree
- Graph
Q.2 Solve the following. 12 Marks
- A) Explain the advantages of DBMS over file systems. (6)
- B) Describe the three levels of data abstraction with a neat diagram. (6)
Q.3 Solve the following. 12 Marks
- A) Draw and explain the DBMS architecture. (6)
- B) Explain different data models in DBMS with examples. (6)
Q.4 Solve Any Two of the following. 12 Marks
- A) Explain E–R modeling concepts with example E–R diagram. (6)
- B) Define constraints and different types of keys with examples. (6)
- C) Explain relational algebra operations with examples. (6)
Q.5 Solve Any Two of the following. 12 Marks
- A) Explain SQL DDL commands with examples (CREATE, ALTER, DROP). (6)
- B) Write SQL queries using aggregate functions and nested queries. (6)
- C) Explain the concept of stored procedures and dynamic SQL. (6)
Q.6 Solve Any Two of the following. 12 Marks
- A) Explain functional dependency and its role in normalization. (6)
- B) Discuss RAID levels, file organization, B-Trees, and B+ Trees. (6)
- C) Explain transaction management: concurrency control & recovery. (6)