Previous year paper

(SEM III) THEORY EXAMINATION 2024-25 BASICS OF DATABASE MANAGEMENT SYSTEMS

Data Structure B.Tech 0 downloads

About this previous year paper

BASICS OF DATABASE MANAGEMENT SYSTEMS (BOE307)

TIME: 3 Hours | MAX MARKS: 70

This examination evaluates a student’s understanding of database concepts, data models, SQL operations, relational algebra, normalization, transactions, concurrency control, and ER modeling techniques. The paper is structured to test conceptual clarity, analytical reasoning, and the ability to apply DBMS principles to real-world scenarios.

The question paper is divided into three sections, each focusing on a different depth of learning—from short conceptual definitions to advanced analytical explanations.

SECTION A – Short Answer Questions (14 Marks)

This section contains seven compulsory questions, each designed to check the student's clarity of core DBMS concepts.

Key areas covered include:

• ER Diagram Notations

Understanding symbols such as entities, attributes, relationships, cardinality, participation, weak entity symbols, etc.

• File System vs Database System

Disadvantages of the file system approach such as data redundancy, lack of integrity, poor security, etc.

• Physical vs Logical Data Independence

Ability to modify schema levels without affecting users or applications.

• DROP vs DELETE Command

Distinction between removing entire structures vs removing table data.

• ACID Properties

Atomicity, Consistency, Isolation, Durability — the foundation of reliable transactions.

• Deadlock & Necessary Conditions

Mutual exclusion, hold & wait, no pre-emption, circular wait.

• Shared vs Exclusive Locks

Locking mechanisms for concurrent transactions.

This section tests fundamental definitions and direct conceptual knowledge.

SECTION B – Descriptive / Application Questions (21 Marks)

(Attempt any three)

This part evaluates deeper understanding, analytical thinking, and the ability to explain DBMS processes clearly.

Topics include:

• Three-Schema Architecture & Mappings

External, Conceptual, and Internal schemas and the role of schema definition languages.

• Data Models in DBMS

Hierarchical, Network, Relational, ER Model, Object-Oriented Model—explained with structure and usage.

• Normalization (1NF, 2NF, 3NF, BCNF)

Eliminating anomalies, decompositions, dependency diagrams, and suitable examples.

• View Serializable vs Cascadeless Schedule

Difference in serializability, transaction ordering, and preventing cascading rollbacks.

• Lock-based Protocols & Timestamp Protocols

Mechanisms for concurrency control, ensuring serializability and avoiding conflicts.

This section tests ability to explain DBMS mechanisms with examples and structured reasoning.

SECTION C – Long Analytical Questions (35 Marks)

(One question from each sub-section)

C1 – ER Concepts

Option A: Comparison of Generalization, Specialization, and Aggregation with examples.
Option B: Purpose and effects of generalization, aggregation, and reduction in ER design.

C2 – Relational Algebra & Joins

Option A: Unary operations (SELECT & PROJECT) with examples.
Option B: Different Join types — Natural, Inner, Outer — with SQL syntax.

C3 – SQL Views / Functional Dependencies

Option A: Definition of SQL Views, creation, advantages, and examples.
Option B: Functional Dependency + Lossless vs Lossy Decomposition (detailed explanation).

C4 – Transactions & MVDs

Option A: Transaction properties (ACID), transaction states (Active → Partially committed → Failed → Aborted → Committed).
Option B: Multi-valued dependencies, 4NF, and how 4NF handles MVDs.

C5 – Schedules & Concurrency Control

Option A: Examples of transaction schedules, analysis of conflict serializability & view serializability.
Option B: Timestamp ordering protocol, differences between Basic and Strict timestamp ordering.

Purpose of This Examination

This DBMS examination ensures that students can:

Understand and draw ER models

Work with relational algebra and SQL

Perform normalization up to BCNF and 4NF

Analyze transaction behaviors and identify concurrency issues

Understand protocols for concurrency control

Interpret various types of serializability and schedules

Apply strong conceptual understanding to practical database design

This paper ensures that a B.Tech (CSE/IT) student masters both the theoretical foundations and the practical application of database management systems.

TypePrevious year paper
SubjectData Structure
Board / courseB.Tech
FilePDF · 187.12 KB
Shared by SuGanta International

Added by the SuGanta team.