DBMS
DBMS
DBMS
Prerequisites:
Concepts of computer programming (like programming in C --Files concepts). The course
introduced under the subject ‗C Programming‘ or ‗Computer Programming‘ or ‗Computer
Programming and Data Structures‘ of B.Tech 1st Year is sufficient to cope up this subject.
Course Objectives:
At the end of the course, the students will be able to:
Understand the basic concepts and the applications of database systems.
Master the basics of SQL and construct queries using SQL.
Understand the relational database design principles.
Familiar with the basic issues of transaction processing and concurrency control.
Familiar with database storage structures and access techniques.
Course Outcomes:
Knowledge Level
S. No. Course Outcomes (CO)
(Blooms Le vel)
After completing this course the student must demonstrate the knowledge and ability to:
Proficiency
Program Outcomes (PO) Level
assessed by
PO1 Engineering knowledge: Apply the knowledge of mathematics, Assignments,
science, engineering fundamentals, and an engineering 3 Tutorials,
specialization to the solution of complex engineering problems. Mock Tests
PO2 Problem analysis: Identify, formulate, review research literature,
and analyze complex engineering problems reaching substantiated Assignments,
2
conclusions using first principles of mathematics, natural sciences, Tutorials
and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex
engineering problems and design system components or processes Assignments,
that meet the specified needs with appropriate consideration for the 3 Tutorials,
public health and safety, and the cultural, societal, and Mock Tests
environmental considerations.
PO4 Conduct investigations of complex problems : Use research-based
Assignments,
knowledge and research methods including design of experiments,
3 Tutorials,
analysis and interpretation of data, and synthesis of the information
Mock Tests
to provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate
Assignments,
techniques, resources, and modern engineering and IT tools
3 Tutorials,
including prediction and modeling to complex engineering
Mock Tests
activities with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the
contextual knowledge to assess societal, health, safety, legal and
- -
cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the
professional engineering solutions in societal and environmental
- -
contexts, and demonstrate the knowledge of, and need for
sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics
- -
and responsibilities and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual,
and as a member or leader in diverse teams, and in - -
multidisciplinary settings.
PO10 Communication: Communicate effectively on complex
engineering activities with the engineering community and with
society at large, such as, being able to comprehend and write - -
effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and
- -
apply these to one‘s own work, as a member and leader in a team,
to manage projects and in multidisciplinary environments.
Proficiency
Program Specific Outcomes (PSO) Level
assessed by
PSO1 Software Development and Research Ability: Ability to understand
the structure and development methodologies of software systems.
Possess professional skills and knowledge of software design process. Assignments,
Familiarity and practical competence with a broad range of 3 Tutorials,
programming language and open source platforms. Use knowledge in Mock Tests
various domains to identify research gaps and hence to provide solution
to new ideas and innovations.
PSO2 Foundati on of mathematical concepts: Ability to apply the acquired
knowledge of basic skills, principles of computing, mathematical Assignments,
2
foundations, algorithmic principles, modeling and design of computer- Tutorials
based systems in solving real world engineering Problems.
PSO3 Successful Career: Ability to update knowledge continuously in the
tools like Rational Rose, MATLAB, Argo UML, R Language and Assignments,
technologies like Storage, Computing, Communication to meet the 3 Tutorials,
industry requirements in creating innovative career paths for immediate Mock Tests
employment and for higher studies.
1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High) - : None
Course Content:
UNIT - I Introduction: Database System Applications, Purpose of Database Systems, View
of Data, Database Languages – DDL, DML, Relational Databases, Database Design, Data
Storage and Querying, Transaction Management, Database Architecture, Data Mining and
Information Retrieval, Specialty Databases, Database Users and Administrators, History of
Database Systems. Introduction to Data base design: Database Design and ER diagrams,
Entities, Attributes and Entity sets, Relationships and Relationship sets, Additional features
of ER Model, Conceptual Design with the ER Model, Conceptual Design for Large
enterprises. Relational Model: Introduction to the Relational Model, Integrity Constraints
over Relations, Enforcing Integrity constraints, Querying relational data, Logical data base
Design: ER to Relational, Introduction to Views, Destroying /Altering Tables and Views.
UNIT - II Relational Algebra and Calculus: Preliminaries, Relational Algebra, Relational
calculus – Tuple relational Calculus, Domain relational calculus, Expressive Power of
Algebra and calculus. SQL: Queries, Constraints, Triggers: Form of Basic SQL Query,
UNION,INTERSECT, and EXCEPT, Nested Queries, Aggregate Operators, NULL values
Complex Integrity All JNTU World Constraints in SQL, Triggers and Active Data bases,
Designing Active Databases.
UNIT - III Schema Refinement and Normal Forms: Introduction to Schema Refinement,
Functional Dependencies - Reasoning about FDs, Normal Forms, Properties of
Decompositions, Normalization, Schema Refinement in Database Design, Other Kinds of
Dependencies.
III ECE I SEM
Page 94
UNIT - IV Transaction Management: Transactions, Transaction Concept, A Simple
Transaction Model, Storage Structure, Transaction Atomicity and Durability, Transaction
Isolation, Serializability, Transaction Isolation and Atomicity Transaction Isolation Levels,
Implementation of Isolation Levels. Concurrency Control: Lock–Based Protocols, Multiple
Granularity, Timestamp-Based Protocols, Validation-Based Protocols, Multiversion
Schemes. Recovery System-Failure Classification, Storage, Recovery and Atomicity,
Recovery Algorithm, Buffer Management, Failure with loss of nonvolatile storage, Early
Lock Release and Logical Undo Operations, Remote Backup systems.
UNIT - V Storage and Indexing: Overview of Storage and Indexing: Data on External
Storage, File Organization and Indexing, Index Data Structures, Comparison of File
Organizations. Tree-Structured Indexing: Intuition for tree Indexes, Indexed Sequential
Access Method (ISAM), B+ Trees: A Dynamic Index Structure, Search, Insert, Delete. Hash-
Based Indexing: Static Hashing, Extendible hashing, Linear Hashing, Extendible vs. Linear
Hashing.
Program Specific
Program Outcomes (PO)
Outcomes
Outcomes (PSO)
Course
PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO3
2
CO1 3 2 2 2 3 - 2 - 2 3 - 1 2 3 2
CO2 2 3 3 2 3 - 2 - 2 3 - 2 2 3 2
CO3 2 2 3 2 3 - 2 - 2 3 - 2 2 2 3
CO4 3 2 3 2 2 - 2 - 2 2 - 2 2 3 2
CO5 2 2 3 2 3 - 2 - 2 2 - 2 2 2 3
1: Slight 3: Substantial
2: Moderate (Medium) - : None
(Low) (High)
Question Bank
Descriptive Questions
Unit-1
Short Answer Questions-
Course
S.No Question Blooms Taxony level
outcome
Course
S.No Question Blooms Taxony level
outcome
1 Compare and Contrast file Systems with database system? UNDRESTANDING 2
Unit-2
Short Answer Questions-
Course
S.No Question Blooms Taxony level
outcome
1 Define relational database query? REMEMBERING 1
Unit-2
Long Answer Questions-
Unit-3
Short Answer Questions-
Course
Question Blooms Taxony level
S.No outcome
Define redundancy? REMEMBERING
1 1
Define functional dependency? REMEMBERING
2 1
3 Explain the problems with Redundancy? UNDRESTANDING 2
What is decomposition? Explain the properties of
REMEMBERING
4 Decomposition? 1
Discuss normalization? CREATING
5 6
Unit-3
Long Answer Questions-
Unit-4
Short Answer Questions-
Unit-4
Long Answer Questions-
Course
Question
S.No Blooms Taxony level outcome
Explain ACID properties and illustrate them through
1 examples? UNDRESTANDING 2
Discuss How do you implement Atomicity and Durability
2 CREATING 6
Illustrate Concurrent execution of transaction with
3 examples UNDRESTANDING 2
Discuss Serializability in detail?
4 CREATING 6
Discuss two phase locking protocol and strict two phase CREATING
5 locking protocols? [L6: CREATING] 6
Describe Times tamp based locking protocols? CREATING
6 6
Describe Validation-based locking protocols? CREATING
7 6
Discuss in detail Multiple Granularity? CREATING
8 6
Unit-5
Short Answer Questions-
Course
Question Blooms Taxony level
S.No outcome
Unit-5
Long Answer Questions-
Objective-Type Questions
JNTUH
1) In the relational modes, cardinality is termed as:
(A) Number of tuples. (B) Number of attributes.
(C) Number of tables. (D) Number of constraints.
Ans: A
2) Relational calculus is a
(A) Procedural language. (B) Non- Procedural language.
(C) Data definition language. (D) High level language.
Ans: B
3) The view of total database content is
(A) Conceptual view. (B) Internal view.
(C) External view. (D) Physical View.
Ans: A
4) Cartesian product in relational algebra is
(A) a Unary operator. (B) a Binary operator.
(C) a Ternary operator. (D) not Defined.
Ans: B Cartesian product in relational algebra is a binary operator.(It requires
two operands. e.g., P X Q)
5) DML is provided for
(A) Description of logical structure of database.
Ans: A
16) In tuple relational calculus P1 ®P2 is equivalent to
(A) ¬P1 Ú P2 (B) P1 Ú P2(C) P1 Ù P2 (D) P1 Ù¬P2
Ans: A In tuple relational calculus P1 _ P2 is equivalent to ¬P1 Ú P2.
(The logical implication expression A _ B, meaning if A then B,is equivalent to ¬A Ú B)
36) Consider the following schedules involving two transactions. Which one of the following
statements is true ? [GATE 2007]
S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
A)s1 is not conflict serializable and s2 is conflict serializable
B)both s1 and s2 are conflict serializable
C)s1 is conflict serializable and s2 is not conflict serialazable
D) both s1 and s2 are not conflict serializable
37) Let E1 and E2 be two entities in an E/R diagram with simple single valued attributes. R1
and R2 are two relationships between E1 and E2, where R1 is one to many and R2 is
many to many. R1 and R2 do not have any attributes of their own. What is the minimum
number of
tables required to represent this situation in the relational model? [GATE2005] A)2 B)
4 C) 5 D)3
38) The order of an internal node in a B+ tree index is the maximum number of children it
can have . Suppose that a child pointer takes 6 bytes, the search filed value takes 14 bytes,
and the block size is 512 bytes. What is the order of the internal node ? [GATE 2004]
A)27 B) 24 C) 25 D)26
Websites Addresses:
1) http://nptel.iitm.ac.in/video.php?subjectId=106106093
2) http://www.sqlcourse.com/index.html
3) http://www.tutorialspoint.com/sql/
Expert details:
1) Dr. S. Srinath working in IIIT Bangalore
2) Prof. D. Janaki Ram working in IIT Madras