Database Management System PDF Download – BSCS University

BSCS, BIT, BSIT, and MCS students can download the complete IT Series textbook “A Fundamental Study of Database Management Systems” in PDF format. Written by Imran Saeed, Tasleem Mustafa, Tariq Mahmood, and Ahsan Raza Sattar, this 3rd edition covers the full DBMS course taught at Pakistani universities across 16 chapters and 433 pages, from database fundamentals through complete SQL and MS Access coverage.

This book is designed for exam preparation and practical lab work side by side. It moves from database theory in Chapters 1 to 11, covering the E-R model, semantic object model, relational model, normalization, SQL, concurrency, and distributed databases, into five complete hands-on MS Access projects in Chapters 12 to 16. Each chapter’s summary and important questions on this page are built from the book’s own content, making revision faster before exams.

Book Overview

Program	BSCS, BIT, BSIT, MCS
Subject	Database Management Systems
Series	IT Series
Edition	3rd Edition
Authors	Imran Saeed, Tasleem Mustafa, Tariq Mahmood, Ahsan Raza Sattar
Publisher	IT Series Publications
Total Chapters	16
Total Pages	433
Format	PDF (Free Download)

Chapter List

Chapter 1: Introduction to Databases

Data is defined as raw, unprocessed facts, while information is data processed into meaningful form, and metadata is “data about data.” The chapter contrasts traditional file processing systems against the database approach, detailing file-processing weaknesses like redundancy, data isolation, and integrity problems versus database advantages like redundancy control, atomicity, and security. It also covers DBMS components, the four-tier range of database applications, user types, and a brief history from 1960s hierarchical models through Codd’s relational model to modern databases.

Important Questions:

• What is the key difference between data and information? Data is unprocessed and not meaningful on its own, while information is the processed, organized output of data used for decision-making.
• What is the “atomicity problem” that file processing systems fail to solve? A transaction with multiple steps must all succeed or all fail together, but file processing systems cannot guarantee this, leaving data inconsistent after a mid-transaction failure.
• What are the four categories in the range of database applications? Personal computer databases, workgroup databases, department databases, and enterprise databases.
• How does a “naive user” differ from a “sophisticated user”? A naive user interacts only through simple menus and forms, while a sophisticated user understands the database structure and can write queries directly.

Chapter 2: Database Environment

This chapter explains the ANSI/SPARC three-level database architecture, external, conceptual, and internal, and the mapping between levels that enables data independence. It covers data models including object-based and record-based (hierarchical, network, relational) models, core DBMS functions like transaction support and recovery, the System Development Life Cycle, data-flow diagrams as a design tool, and the distinct roles of the Database Administrator versus the Data Administrator.

Important Questions:

• What are the three schemas in the ANSI/SPARC architecture? The external schema represents individual user views, the conceptual schema is the complete logical description of all data, and the internal schema describes physical storage structures.
• What is the difference between physical and logical data independence? Physical data independence lets you change storage without affecting the conceptual level; logical data independence lets you change the conceptual level without affecting application programs.
• Name the three record-based data models. Hierarchical (tree structure), Network/CODASYL (allows multiple parents via sets), and Relational (data stored in tables based on Codd’s model).
• What is the difference between a Data Administrator and a Database Administrator? The DA sets long-term policy for the organization’s overall data resource and is DBMS-independent, while the DBA implements and maintains the database using a specific DBMS.

Chapter 3: Entity Relationship Model

Introduced by Peter Chen in 1976, the E-R model represents a system as entities connected by relationships, built from entity types, attributes, and relationships. The chapter details E-R diagram notation and attribute types, weak versus strong entities, relationship degree (unary, binary, ternary), and minimum/maximum cardinality constraints. It closes with subtype/supertype entities via generalization and specialization, followed by ten worked E-R design projects covering real scenarios like employees, hospitals, and real estate.

Important Questions:

• What is the E-R model and who introduced it? A logical representation of a database as a collection of entities and relationships, introduced by Peter Chen in 1976.
• What is the difference between a weak entity and a strong entity? A weak entity cannot exist without a related owner entity, while a strong entity exists independently.
• Differentiate between a composite attribute and a multi-valued attribute. A composite attribute can be subdivided into smaller components, while a multi-valued attribute can hold two or more values for one entity instance.
• What do minimum and maximum cardinality specify in a relationship? Minimum cardinality specifies whether participation is optional or mandatory; maximum cardinality specifies the greatest number of related instances allowed.

Chapter 4: Semantic Object Model

First presented in 1988 and based on Codd’s concepts, the Semantic Object Model uses the “semantic object” rather than the entity as its basic building block. It defines three attribute types, simple, group, and semantic-object attributes, along with object identifiers and attribute domains. The chapter classifies objects into simple, composite, compound, hybrid, association, and parent/subtype objects, showing how each represents real-world things more directly than the E-R model.

Important Questions:

• What is a semantic object? A thing identifiable in the user’s working environment; objects can contain other objects directly as attributes rather than linking via separate relationship symbols.
• What are the three types of attributes a semantic object can have? Simple attributes (a single value), group attributes (a composite of other attributes), and semantic object attributes (a link to another semantic object).
• What is the difference between a composite object and a compound object? A composite object contains multi-valued, non-object attributes but no object attributes, while a compound object contains at least one object attribute referencing another semantic object.
• What is a hybrid object? An object combining composite and compound object properties in one object, such as a ROOM object with both a plain Rent attribute and a STUDENT object attribute.

Chapter 5: Relational Model & Normalization

Grounded in E. F. Codd’s 1970 paper, this chapter covers relational terminology, the full key hierarchy (super, candidate, primary, foreign keys), Codd’s 12 rules for a true RDBMS, and the three integrity categories. It details relational algebra and all join types, tuple- and domain-oriented relational calculus, database anomalies, and the full normalization sequence from 1NF through 5NF and BCNF, plus common design problems, illustrated with two worked normalization projects.

Important Questions:

• What is the difference between a candidate key and a primary key? A candidate key is any minimal super key that uniquely identifies a tuple; the primary key is the one candidate key selected to actually identify rows, and it cannot be null.
• According to Codd’s Rules, what does the Guaranteed Access Rule require? Every data value must be logically accessible by specifying only the table name, primary key value, and column name.
• What is the difference between an equi join and a natural join? An equi join keeps the duplicated common attribute in the result, while a natural join removes the duplicate so it appears only once.
• What is a transitive dependency, and which normal form eliminates it? A non-key attribute determining another non-key attribute; Third Normal Form (3NF) removes it by moving the transitively dependent attribute into its own relation.

Chapter 6: Database Design using E-R Model

This chapter explains the mechanical process of converting a completed E-R diagram into a relational database schema. It walks through converting regular entities, composite attributes, and multi-valued attributes into relations, converting weak entities using foreign keys from the owner entity, and converting relationships by degree and cardinality, including one-to-many, many-to-many, one-to-one, unary, ternary, and supertype/subtype relationships.

Important Questions:

• How is a one-to-many (1:M) relationship converted into relations? Create a relation for each entity type, then place the primary key of the entity on the “one” side into the relation on the “many” side as a foreign key.
• How is a many-to-many (M:N) relationship converted into relations? Create a relation for each entity type, then create a third associative relation whose primary key combines both entities’ primary keys as foreign keys.
• How is a weak entity converted into a relation? A relation is created for the weak entity, and the owner’s primary key is included as a foreign key combined with the weak entity’s partial identifier.
• How is a multi-valued attribute handled when converting an entity to a relation? It is moved into a new relation whose key is the composite of the original entity’s primary key plus the multi-valued attribute.

Chapter 7: Database Design with Semantic Object Model

This chapter teaches how to convert semantic objects into relational schemas. A simple object maps to one relation, while a composite object splits into a base relation plus a relation for its repeating group. Compound objects require two or three linked relations depending on cardinality, hybrid objects combine these techniques, association objects need at least three relations, and super/subtype objects get one relation for the parent plus one per subtype, all tied together with referential integrity constraints.

Important Questions:

• What is a simple object, and how is it mapped to a relation? An object with only single-valued, non-object attributes; it maps directly to one relation, with its identifier becoming the primary key.
• How is a composite object converted into relations? It is split into a relation for the base object and a relation for the repeating-group attribute, linked by a foreign key.
• How many relations does an association object require, and why? At least three, one for each of the two related objects plus one for the association itself, carrying both objects’ keys as foreign keys.
• How are super/subtype objects represented in relations? One relation for the supertype and one for each subtype, with each subtype relation’s key matching the supertype’s key.

Chapter 8: Structured Query Language (SQL)

This is the book’s largest chapter, covering SQL end to end using sample EMP/DEPT tables. It starts with basic SELECT statements, arithmetic and logical operators, and aggregate functions with GROUP BY and HAVING. It details join types including equi, self, and outer joins, single-row and correlated subqueries, then moves into DDL commands, the four constraint types, DML statements, and simple versus complex views.

Important Questions:

• What are the two mandatory clauses of a SQL SELECT statement? SELECT, which specifies the columns to retrieve, and FROM, which identifies the table to retrieve them from.
• What is the difference between the WHERE and HAVING clauses? WHERE filters individual rows before grouping and cannot use aggregate functions, while HAVING filters groups of rows after grouping.
• What is a correlated subquery? A subquery that re-executes once for every candidate row of the outer query, using a value from that row, such as finding employees earning more than their department’s average salary.
• What are the four types of integrity constraints described in the chapter? NOT NULL, UNIQUE, CHECK, and PRIMARY KEY.

Chapter 9: Concurrency & Security

The chapter defines a transaction as a logical unit of work governed by the ACID properties and explains concurrency problems in multi-user systems including lost update, uncommitted dependency, and inconsistent analysis. It covers resource locking, deadlock, and serializable schedules, database failure and recovery through rollback and rollforward using transaction logs, backup types, and security measures like authorization, authentication, and encryption.

Important Questions:

• What are the four ACID properties of a transaction? Atomicity, Consistency, Isolation, and Durability.
• What is the lost update problem? When two transactions update the same data concurrently, unaware of each other, so the later update overwrites the earlier one.
• What is the difference between an exclusive lock and a shared lock? An exclusive lock blocks all access by other transactions, while a shared lock allows other transactions to still read the locked item.
• What is the difference between recovering a database by rollback versus rollforward? Rollback undoes uncommitted transactions using the transaction log; rollforward restores a backup and reapplies all committed transactions since that backup.

Chapter 10: Client-Server Databases & ODBC

The chapter explains client-server architecture, where client computers manage the user interface and application logic while the server stores and processes the database. It lists advantages like concurrent access and richer GUIs against reduced control over simultaneous updates, covers pessimistic versus optimistic locking, and explains Open Database Connectivity (ODBC) as a DBMS-independent standard interface, including single-tier versus multi-tier drivers and conformance levels.

Important Questions:

• What tasks does the client computer perform versus the server? The client manages the interface and application logic and sends SQL requests; the server processes those requests, enforces rules, and returns results.
• What is the difference between pessimistic and optimistic locking? Pessimistic locking locks the database automatically for each transaction; optimistic locking lets transactions proceed freely and only checks for conflicts before committing.
• What is ODBC, and what problem was it built to solve? A DBMS-independent standard interface that lets one application access databases built on different DBMS products without changing its code.
• What is the difference between a single-tier and a multi-tier ODBC driver? A single-tier driver processes both ODBC calls and SQL statements itself; a multi-tier driver only processes ODBC calls and passes SQL statements to the server.

Chapter 11: Distributed & Object Oriented Databases

This chapter distinguishes centralized, distributed, and decentralized database systems, then introduces the Distributed DBMS, weighing advantages like local control and modular growth against disadvantages like software complexity and harder data integrity. It covers distributed database design through horizontal and vertical data fragmentation, data replication, and allocation strategies, along with an introduction to object-oriented databases and their data model.

Important Questions:

• What is the difference between a distributed database and a decentralized database? A distributed database’s sites are connected by a network, while a decentralized database’s sites are independent and not networked.
• What is the difference between horizontal and vertical fragmentation? Vertical fragmentation breaks a table into sets of columns, while horizontal fragmentation divides a table’s rows into separate pieces.
• What is “complete replication” as a data allocation strategy? A full copy of the database is kept at every site, giving fast local queries and high reliability, at the cost of storage and update complexity.
• Name two advantages of a distributed database over a centralized one. Reliability and availability during a site failure, and modular growth through adding new sites more easily than expanding one large computer.

Chapter 12: Introduction to MS Access

Chapter 12 introduces the MS Access environment, the application window, and the seven-object database window: Tables, Queries, Forms, Reports, Pages, Macros, and Modules. It covers three ways to build a table, Design view, the Table Wizard, and entering data directly, plus Access’s seven data types and field properties like validation rules and input masks. It also covers sorting, find/replace, and filtering, demonstrated through a hands-on Employees table.

Important Questions:

• What are the seven types of objects in the MS Access Database window? Tables, Queries, Forms, Reports, Pages, Macros, and Modules.
• What are the three methods for creating a table in MS Access? Design view, the Table Wizard, and entering data directly into a blank datasheet.
• What is the difference between “Filter by Selection” and “Filter by Form”? Filter by Selection filters records matching a highlighted value, while Filter by Form lets you specify criteria including alternate “Or” conditions before applying the filter.
• What is the purpose of a Validation Rule and Validation Text? The Validation Rule specifies criteria data must satisfy, and Validation Text is the custom message shown when data violates that rule.

Chapter 13: Relationships in MS Access

Chapter 13 covers table relationships, referential integrity tools like Cascade Update/Delete, and lookup fields, then walks through building queries with the Simple Query Wizard, Design-view queries, wildcards, calculated fields with the Expression Builder, parameter queries, and summary queries. It closes with the four action queries, Make-Table, Append, Delete, and Update, demonstrated through an Employee/Department database and a real-estate rental scenario.

Important Questions:

• How is a many-to-many relationship implemented in Access? By creating a junction table holding the primary keys of both related tables, linked to each with a one-to-many relationship.
• What is the difference between Cascade Update and Cascade Delete Related Records? Cascade Update auto-updates matching foreign-key values when a parent’s primary key changes; Cascade Delete auto-deletes related child records when the parent is deleted.
• What are the four types of action queries? Make-Table, Append, Update, and Delete.
• How is a parameter query created? By typing a prompt in square brackets in the Criteria row of the relevant field in Design view.

Chapter 14: Forms & Reports

Chapter 14 explains forms as GUI tools for adding, editing, deleting, and viewing table data, covering four form types and three creation methods: AutoForm, the Form Wizard, and Design view. It covers subforms for one-to-many relationships, then reports including Columnar and Tabular types, AutoReport, the Report Wizard, and the Label Wizard for mailing labels, contrasting editable forms against read-only, print-oriented reports.

Important Questions:

• How do Columnar and Tabular forms differ? Columnar shows one record at a time with labels beside textboxes; Tabular shows many records at once as rows with labels at the top.
• What is a subform and when is it used? A form embedded in a parent form, used to show related records from a one-to-many relationship.
• What is the main difference between a form and a report? A form is used to input, edit, and delete data on screen; a report only displays or prints formatted data.
• What does the Label Wizard do? It creates a report formatted to print data directly onto mailing labels, letting the user pick a label size and field layout.

Chapter 15: Data Access Pages

Chapter 15 introduces Data Access Pages, HTML pages bound directly to Access data and viewable through a web browser over an intranet or internet, noting that unlike other Access objects, a page is stored as a separate HTML file. Practicals walk through creating a page with the Page Wizard, applying a theme, and editing data in Page View, along with connecting a page to its data source via connection properties.

Important Questions:

• How is a Data Access Page stored differently from other Access objects? It is stored as a separate HTML file, not inside the database file, which only holds a shortcut to it.
• What are the two main uses of Data Access Pages? Publishing HTML forms that write directly into the database, and creating interactive data reports viewable via a web browser.
• What is the purpose of a ConnectionFile property? It stores the page’s data source location as a reusable connection so multiple pages can share the same connection.
• Why does the book caution against using data access pages over the internet unsecured? Because a page creates a live connection to the database, so an unsecured connection risks unauthorized access.

Chapter 16: MS Access Projects

The book’s flagship practical chapter builds five complete databases end to end: Library Management System (staff, authors, book catalogs, members, and issues), Sales Management System (customers, products, sales persons, and orders), Student Management System (class, subject, student, result, and fee tables), Magazine Database (magazines, categories, and publishers), and Construction Company Database (employees, customers, orders, and attendance). Each project demonstrates real relationships, parameter queries, subforms, and report generation.

Important Questions:

• What tables does the Library Management System project use? Staff Personals, Authors Data, Book Catalogs, Library Members, Books Collection, and Book Issues.
• What is the purpose of the “NotFullFee” and “ResultAGrade” queries in the Student Management System? NotFullFee shows students who haven’t paid full fee, and ResultAGrade shows students who scored 70 or more marks.
• What tables make up the Construction Company Database? Employees, Customers, Orders, and Attendance tables.
• How is the order Amount calculated in the Sales Management System? Through a calculated field multiplying the quantity ordered by the product’s unit price.

---

Download Database Management Systems PDF

Your free PDF is ready. Click the button below to download the complete IT Series DBMS textbook.

⬇ Download PDF

---

Who Should Read This

This book is specifically written for BSCS students studying Database Management Systems at Pakistani universities. BIT, BSIT, and MCS students with DBMS in their curriculum will also find it very useful. With 275+ short questions, 300+ MCQs, complete SQL and MS Access coverage, and 5 real-world projects, it is ideal for both theory and practical exam preparation.

---

Applicable Universities

This IT Series textbook is widely used at Pakistani universities offering BSCS, BIT, BSIT, and MCS programs including Punjab University, Virtual University, COMSATS, FAST, UET, and other HEC-recognized institutions.

FAQs

Related Books

• Object Oriented Programming Using C++ PDF Download – IT Series BSCS
• Key Book to OOP C++ Programming Exercises PDF Download – IT Series BSCS
• The Concepts of Information Technology PDF Download – IT Series (2nd Edition)
• Operating Systems and Networks PDF Download – IT Series BSCS (5th Edition)
• Data Structures in C++ PDF Download – Aikman Series BSCS
• Number System & Boolean Algebra SN-2 Notes