Download as pdf or txt
Download as pdf or txt
You are on page 1of 24

DATABASE MANAGEMENT SYSTEMS

Subject Code: (CS402ES)


Regulations : R16 JNTUH
Class :III Year B.Tech ECE I Semester

Department of Electronics and communication Engineering


BHARAT INSTITUTE OF ENGINEERING AND TECHNOLOGY

Ibrahimpatnam -501 510, Hyderabad


DATABASE MANAGEMENT SYSTEMS (CS402ES)
COURSE PLANNER
Course Overview:
This course introduces the core principles and techniques required in the design and
implementation of database systems. This course focus on relational database management
systems, including database design theory: E-R modeling, data definition and manipulation
languages, database security and administration. It also covers essential DBMS concepts such
as: Transaction Processing, Concurrency Control and Recovery and various types of
databases like distributed database, and intelligent database, Client/Server. Students
undertake a semester project to design and build a simple database system and demonstrate
competence with the fundamental tasks involved with modeling, designing, and
implementing a DBMS. It also provides students with theoretical knowledge and practical
skills in the use of databases and database management systems in information technology
applications.

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:

CO1 Demonstrate the basic elements of a relational database Application ( Level 2)


management system.
CO2 Identify the data models for relevant problems.
Remember( Level 1)
Design entity relationship and convert entity relationship
CO3 diagrams into RDBMS and formulate SQL queries on the Analyze, Create ( Level
respect data into RDBMS and formulate SQL queries on 4, Level 6)
the data.

III ECE I SEM


Page 92
CO4 Demonstrate their understanding of key notions of query
evaluation and optimization techniques. Application ( Level 2)
CO5 Extend normalization for the development of application
software‘s.

How Program Outcomes are assessed:

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.

III ECE I SEM


Page 93
Proficiency
Program Outcomes (PO) Level
assessed by
PO12 Life-long learning: Recognize the need for, and have the
preparation and ability to engage in independent and life-long - -
learning in the broadest context of technological change.

How Program Specific Outcomes are Assessed:

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.

Books and References:


Text Books
1. Data base Management Systems, Raghu Ramakrishnan, Johannes Gehrke, McGraw Hill
Education (India) Private Limited, 3rd Edition. (Part of UNIT-I, UNIT-II, UNIT-III, UNIT-
V)
2. Data base System Concepts, A. Silberschatz, Henry. F. Korth, S. Sudarshan, McGraw Hill
Education(India) Private Limited l, 6th edition.( Part of UNIT-I,UNIT-IV)
Reference Books
1) Database systems, 6th edition, Ramez Elmasri, Shamkant B.Navathe, Pearson Education.
2) Database Systems Design, Implementation, and Management, Peter Rob & Carlos
Coronel, 7th Ed.
3) Fundamentals of Database Systems, ElmasriNavrate, Pearson Education
4) Introduction to Database Systems, C.J.Date, Pearson Education
5) Database Development and Management, Lee Chao, Auerbach publications, Taylor &
Francis.G

NPTEL Web Course:


https://onlinecourses.nptel.ac.in/noc18_cs15/preview
http://nptel.ac.in/courses/106106093/
http://nptel.ac.in/courses/106106095/

NPTEL Video Course:


https://www.youtube.com/watch?v=EUzsy3W4I0g
https://www.youtube.com/playlist?list=PL52484DF04A264E59

Relevant syllabus for GATE:


Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design
(integrity constraints, normal forms), Query languages (SQL), File structures (sequential
files, indexing, B and B+ trees), Transactions and concurrency control.

Relevant syllabus for IES: Not Applicable


III ECE I SEM
Page 95
Course Plan
References
S. UNI Subject Text Books
WEEK Course Learning Outcomes
No. T Topics / Sub-Topics Journals
Websites
Introduction-Database System Understand Database System
1
1 Applications, Purpose of Database Applications, Purpose of T1
Systems Database Systems
View of Data - Data Abstraction, Understand Data Abstraction,
1 T1
2 Instances and Schemas Instances and Schemas
Data Models, Database Languages Understand Data Models,
1 1 T1
3 – DDL Database Languages - DDL
Understand DML, Database
1 DML, Database Architecture T1
4 Architecture
Database Users and Demonstrate Database Users
1 Administrators, History of Data and Administrators, History of T1
5
base Systems Data base Systems
Introduction to Data base design , Understand Data base design ,
1 T1
6 ER diagrams ER diagrams
Beyond ER Design, Entities, Understand Beyond ER Design,
Attributes and Entity sets, Entities, Attributes and Entity
7 1 T1
Relationships and Relationship sets, Relationships and
sets Relationship sets
Additional features of ER Model, Demonstrate Additional features
2
8 1 Conceptual Design with the ER of ER Model, Conceptual Design T1
Model with the ER Model
Additional features of ER Model,
1 Conceptual Design with the ER
9
Model
Conceptual Design for Large Understand Conceptual Design
10 1 T1
enterprises for Large enterprises
Relational Model: Introduction to Understand Relational Model -
11 1 the Relational Model - Integrity Integrity Constraints over T1
Constraints over Relations Relations
Understand Enforcing Integrity
Enforcing Integrity constraints,
1 constraints, Querying relational T1
12 3 Querying relational data
data
13 Demonstrate Logical data base
1 Logical data base Design T1
Design
14 Introduction to Views Destroying/ Apply Destroying/ altering
1 T1
altering Tables and Views. Tables and Views.

III ECE I SEM


Page 96
15
1 Bridge Class #1
Relational Algebra and Calculus: Understand Relational Algebra
16
2 Relational Algebra - Selection and and Calculus: Relational Algebra T1
Projection - Selection and Projection
2 Apply Set operations, Renaming,
Set operations, Renaming, Joins,
17 Joins, Division in Relational T1
Division
Algebra
4 2 Apply Examples of Algebra
18 Examples of Algebra Queries T1
Queries
2 Relational calculus - Tuple
Understand Relational calculus -
19 relational Calculus, Domain T1
Tuple relational Calculus
relational calculus.
2 Expressive Power of Algebra and State Expressive Power of
20 T1
calculus Algebra and calculus
2
21 MOCK TEST#1
2 Form of Basic SQL Query - Apply Form of Basic SQL Query
22 T1
Examples of Basic SQL Queries - Examples of Basic SQL Queries
2
23 5 Introduction to Nested Queries Understand Nested Queries T1
2 Understand Correlated Nested
24 Correlated Nested Queries T1
Queries
2 Set - Comparison Operators, Describe Set - Comparison
25 T1
Aggregate Operators Operators, Aggregate Operators
2 NULL values - Comparison using Define NULL values -
25 T1
Null values Comparison using Null values
2 Logical connectives - AND, OR Describe Logical connectives -
27 T1
and NOT AND, OR and NOT
2 Impact on SQL Constructs, Outer Explain SQL Constructs, Outer
28 T1
6 Joins, Disallowing NULL values Joins
Complex Integrity Constraints in
Define Disallowing NULL
29 2 SQL Triggers and Active Data T1
values
bases
Introduction to Schema Understand Schema
30 3 T1
Refinement Refinement
3 Solve Problems Caused by
31 Problems Caused by redundancy T1
redundancy
7
3 Decompositions - Problem related Solve Decompositions - Problem
32 T1
to decomposition related to decomposition

III ECE I SEM


Page 97
3 Functional Dependencies - Apply Functional Dependencies -
33 Reasoning about FDS, Normal Reasoning about FDS, Normal T1
Forms – FIRST Forms - FIRST
3 SECOND, THIRD Normal forms Apply SECOND, THIRD
34 T1
– BCNF Normal forms - BCNF
3 SECOND, THIRD Normal forms Apply SECOND, THIRD
35 T1
– BCNF Normal forms - BCNF
3 Describe Properties of
Properties of Decompositions -
36 Decompositions - Loss less join T1
Loss less join Decomposition
Decomposition
3 Describe Properties of
Properties of Decompositions -
37 Decompositions - Loss less join T1
Loss less join Decomposition
Decomposition
8 3 Dependency preserving Describe Dependency preserving
38 T1
Decomposition Decomposition
3 Schema Refinement in Data base Define Schema Refinement in
39 T1
Design Data base Design
3 Describe Multi valued
Multi valued Dependencies -
40 Dependencies - FOURTH T1
FOURTH Normal Form
Normal Form
3
41 Join Dependencies Describe Join Dependencies T1
3 FIFTH Normal form, Inclusion Describe FIFTH Normal form,
42 T1
Dependencies Inclusion Dependencies
FIFTH Normal form, Inclusion Describe FIFTH Normal form,
43 3 T1
9 Dependencies Inclusion Dependencies
Understand Transaction
Transaction Management -
44 4 Management - Transaction T2
Transaction Concept
Concept
4 Transaction State - Understand Transaction State -
45 Implementation of Atomicity and Implementation of Atomicity and T2
Durability Durability
4 Concurrent - Executions - Identify Concurrent - Executions
46 T2
Serializability - Recoverability - Serializability - Recoverability
4
47 Implementation of Isolation Implement Isolation T2
10
4
48 Bride Class#3
4
49 Testing for serializability Define Testing for serializability T2

III ECE I SEM


Page 98
4 Concurrency Control - Lock - Explain Concurrency Control -
50 T2
Based Protocols Lock - Based Protocols
4 Explain Timestamp Based
50 Timestamp Based Protocols T2
Protocols
4 Validation - Based Protocols - Define Validation - Based
52 T2
Multiple Granularity Protocols - Multiple Granularity
4 Recovery System-Failure Discuss Recovery System-Failure
53 11 T2
Classification Classification
4 Storage Structure-Recovery and Define Storage Structure-
54 T2
Atomicity ,Log-Based Recovery Recovery and Atomicity
5 4 Recovery with Concurrent Define Recovery with
5 T2
Transactions Concurrent Transactions
56 4 Define Buffer Management -
Buffer Management - Failure with
Failure with loss of nonvolatile T2
loss of nonvolatile storage
storage
57 4 Advance Recovery systems,
Discuss Advance Recovery
Remote Backup systems , Data T2
systems, Remote Backup systems
streaming.
58 12 4
MOCK TEST#2
Overview of Storage and Understand Overview of
59 5 Indexing: Data on External Storage and Indexing: Data on T1
Storage External Storage
5 File Organization and Indexing - Understand File Organization
60 T1
Clustered Indexes and Indexing - Clustered Indexes
5 Identify Primary and Secondary
Primary and Secondary Indexes T1
61 Indexes
5 Describe Index data Structures -
Index data Structures - Hash Based
Hash Based Indexing, Tree based T1
62 Indexing, Tree based Indexing
Indexing
5 Understand Comparison of File
13 Comparison of File Organizations T1
63 Organizations
5
Bridge Class #4
64
5 Understand Tree Structured
Tree Structured Indexing:
Indexing: Intuitions for tree T1
65 Intuitions for tree indexes
indexes
5 Understand Indexed Sequential
Indexed Sequential Access
66 14 Access Methods(ISAM) B+ T1
Methods(ISAM) B+ Trees
Trees

III ECE I SEM


Page 99
5 A Dynamic Index Structure, Define Dynamic Index Structure,
T1
67 Search, Insert, Delete Search, Insert, Delete
5 Distinguish Hash Based
Hash Based Indexing: Static
68 Indexing: Static Hashing, T1
Hashing, Extendable hashing
Extendable hashing
5 Linear Hashing, Extendible vs. Distinguish Linear Hashing,
Linear Hashing Extendible vs. Linear Hashing T1
69

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

1 Define the terms data and information? REMEMBERING 1

2 Define (i) Database (ii)DBMS REMEMBERING 1

3 List the advantages and applications of DBMS? REMEMBERING 1

4 What are the disadvantages of file processing system? REMEMBERING 1

5 Define instances and schemas of database? REMEMBERING 1

6 What is data model? List the types of data models? REMEMBERING 1

7 Discuss about Data Definition language? CREATING 6

8 Discuss about Data Manipulation language? CREATING 6

III ECE I SEM


Page 100
. What is data Abstraction? Give the levels of data
9 REMEMBERING 1
abstraction?

10 Who is DBA? What are the responsibilities of DBA? REMEMBERING 1

11 Discuss Data Independence? CREATING 6

12 What is an entity relationship model? REMEMBERING 1


13 Define (i) Entity (ii) Attribute REMEMBERING 1
14 Define Relationship and Relationship set? REMEMBERING 1

15 What are key constraint and participating constraints? REMEMBERING 1

16 Define weak entity and strong entity sets? REMEMBERING 1


17 Define relation, relation instance and relation schema. REMEMBERING 1
18 Define i) super key ii)candidate key iii) primary key REMEMBERING 1

19 Explain the use of foreign key constraint? UNDRESTANDING 2

20 Define the terms arity and cardinality of relation? REMEMBERING 1

21 What are domain constraints REMEMBERING 1

22 Explain about querying relational data? UNDRESTANDING 2

23 Define views? REMEMBERING 1


24 Discuss how can you change the data in the table? CREATING 6
25 List various types of attributes? REMEMBERING 1
26 Discuss how can you alter and destroy tables? CREATING 6
27 Explain the use of null values? UNDRESTANDING 2
Unit-1
Long Answer Questions-

Course
S.No Question Blooms Taxony level
outcome
1 Compare and Contrast file Systems with database system? UNDRESTANDING 2

2 Define Data Abstraction and discuss levels of Abstraction? REMEMBERING 1

III ECE I SEM


Page 101
3 Discuss about different types of Data models? CREATING 6

4 Describe the architecture of DBMS? CREATING 6

5 Discuss additional features of the ER-Models? CREATING 6

6 Discuss about the Conceptual Design with the ER-Model? CREATING 6

7 Write about views and updates on views? REMEMBERING 1


Explain different types of database users and write the functions
8 UNDRESTANDING 2
of DBA?

9 Explain about different types of integrity constraints? UNDRESTANDING 2

10 Discuss about the logical database Design? CREATING 6

Distinguish strong entity set with weak entity set? Draw an ER


11 UNDRESTANDING 2
diagram to illustrate Weak entity set?
12 Explain how the integrity constraints are specified and enforces? UNDRESTANDING 2

13 Explain in detail about views? UNDRESTANDING 2

Unit-2
Short Answer Questions-

Course
S.No Question Blooms Taxony level
outcome
1 Define relational database query? REMEMBERING 1

2 Explain different types of query languages? UNDRESTANDING 2

3 Explain about relational algebra? UNDRESTANDING 2

4 State about SELECT operation in Relational algebra? ANALYZE 4

5 State about PROJECT operation in Relational algebra? ANALYZE 4

6 Explain about set operations? UNDRESTANDING 2

7 Discuss the use of rename operation? CREATING 6

8 Define join ? Explain different join operations? REMEMBERING 1

III ECE I SEM


Page 102
9 Illustrate division operation? UNDRESTANDING 2

10 . Explain about tuple relational calculus? UNDRESTANDING 2

11 . Explain about Domain relational calculus? UNDRESTANDING 2


. Discuss about the expressive power of relational algebra
12 CREATING 6
and calculus?
13 . Discuss the basic form of SQL query? CREATING 6
Explain the working of union, intersection and except
14 UNDRESTANDING 2
operations?
15 Define nested queries? REMEMBERING 1

16 Define correlated nested queries? REMEMBERING 1


17 Explain Aggregate Functions? UNDRESTANDING 2
18 What is the use of groupby and having clauses? REMEMBERING 1

19 Define Null Values? REMEMBERING 1

20 Define tuple variable with its syntax? REMEMBERING 1

21 Define outer join? Explain its types? REMEMBERING 1

22 Explain how to create new domain? UNDRESTANDING 2

23 Define Assertions? REMEMBERING 1


24 . Discuss about trigger? CREATING 6
25 Demonstrate how to add a NOT NULL column to a table? UNDRESTANDING 2
Write a TRC query to find the names of sailors who have
26 REMEMBERING 1
reserved boat103?
Write a DRC query to find the names of sailors who have
27 REMEMBERING 1
reserved red boat?

Unit-2
Long Answer Questions-

S.No Question Blooms Taxony level Course outcome


Illustrate different operations in Relational
UNDRESTANDING
1 algebra with an example? 2
2 Define Join? Explain different types of REMEMBERING 1
III ECE I SEM
Page 103
joins?
Discuss about Relational calculus in
CREATING
3 detail? 6
Define trigger and explain its three parts?
Differentiate row level and statement level REMEMBERING
4 triggers? 1
Illustrate Group by and having clauses
UNDRESTANDING
5 with examples? 2
Discuss about Complex integrity
CREATING
6 constraints in SQL? 6
Define null value? Describe the effect of
REMEMBERING
7 null values in database? 1
Discuss different types of aggregate
CREATING
8 operators with examples in SQL? 6
9 Define a nested query? REMEMBERING 1
Write a nested query to find the names of
sailors who have reserved both a red and REMEMBERING
10 green boat? 1
Write a nested query to find the names of
REMEMBERING
11 sailors who have reserved all boats? 1

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

6 Illustrate functional dependency with example? UNDRESTANDING 2


Illustrate fully functional dependency with example? UNDRESTANDING
7 2

8 Demonstrate transitive dependency? Give an example? UNDRESTANDING 2

III ECE I SEM


Page 104
Define First Normal Form? REMEMBERING
9 1

Define Second Normal Form? REMEMBERING


10 1
Define Third Normal Form? REMEMBERING
11 1
Explain about Loss Less Join Decomposition? UNDRESTANDING
12 2
13 Describe Dependency Preserving Decomposition? CREATING 6
What is multi valued Dependency? REMEMBERING
14 1
Define Fourth Normal Form? REMEMBERING
15 1
Define Join Dependency? REMEMBERING
16 1
17 Define BCNF? REMEMBERING 1
18 Explain Fifth Normal Form? UNDRESTANDING 2
Explain about Inclusion Dependency? UNDRESTANDING
19 2

Unit-3
Long Answer Questions-

S.No Question Blooms Taxony level Course outcome


Illustrate redundancy and the problems that
UNDRESTANDING
1 it can cause 2
Define decomposition and how does it
address redundancy? Discuss the problems
REMEMBERING
that may be caused by the use of
2 decompositions? 1
Define functional dependencies. How are
REMEMBERING
3 primary keys related to FD‘s? 1
Define normalization? Explain
REMEMBERING
4 1NF,2NF,3NF normal forms 1
5 Compare and contrast BCNF with 3NF? UNDRESTANDING 2
6 Describe properties of decompositions CREATING 6

Unit-4
Short Answer Questions-

III ECE I SEM


Page 105
Course
Question Blooms Taxony level
S.No outcome
Define a Transaction? List the properties of transaction REMEMBERING
1 1
Discuss different phases(states) of transaction? CREATING
2 6
3 What is shadow copy technique? REMEMBERING 1
List the advantages of concurrent execution? REMEMBERING
4 1
Define Schedule? What is a serial schedule? REMEMBERING
5 1

6 Discuss the Procedure to test Serializability? CREATING 6


Demonstrate Conflict Serializability? UNDRESTANDING
7 2

8 Discuss View Serializability? CREATING 6

Discuss recoverable schedules? CREATING


9 6

Discuss cascade less schedules? CREATING


10 6
Explain the procedure to test for serializability? UNDRESTANDING
11 2
Explain about different types of locks? UNDRESTANDING
12 2
13 Define Deadlock? REMEMBERING 1
Explain about locking protocols? UNDRESTANDING
14 2
Define Two Phase locking protocol? REMEMBERING
15 1
Demonstrate the implementation of Isolation? UNDRESTANDING
16 2
17 Explain how the locks are implemented? UNDRESTANDING 2
18 Explain the rules of tree protocol? UNDRESTANDING 2
What is timestamp? Explain different timestamps used by a
REMEMBERING
19 transaction? [L1:REMEMBERING] 1
Explain Thomas write rule? [L2: UNDRESTANDING] UNDRESTANDING
20 2

21 What are the phases of validation based protocol? REMEMBERING 1

III ECE I SEM


Page 106
Explain different timestamps used by validation protocol? UNDRESTANDING
22 2
23 Define granularity? REMEMBERING 1
24 Explain about ARIES? UNDRESTANDING 2

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

Explain in detail storage structure


9 UNDRESTANDING 2

Discuss how do you recover from failure?


10 CREATING 6
Explain Buffer Management?
11 UNDRESTANDING 2
Explain different types of advanced recovery techniques
12 UNDRESTANDING 2
13 Write in detail about Remote Backup systems? REMEMBERING 1

Unit-5
Short Answer Questions-

Course
Question Blooms Taxony level
S.No outcome

III ECE I SEM


Page 107
Discuss about data on External storage? CREATING
1 6
What is indexing and what are the different kinds of
REMEMBERING
2 indexing? 1
3 Explain Clustered Indexes? UNDRESTANDING 2
Discuss the Primary and Secondary indexes? REMEMBERING
4 1
Define Tree Indexing? REMEMBERING
5 1

6 Explain Hash based Indexing? UNDRESTANDING 2


Compare different file organizations? UNDRESTANDING
7 2

8 Discuss the intuition for Tree Indexes? CREATING 6

Define Indexed Sequential Access Method? REMEMBERING


9 1
Discuss about Overflow pages and Locking considerations of
CREATING
10 ISAM? 6
Discuss the Cost model of Heap files, Sorted files and
CREATING
11 Clustered files? 6
Explain the structure of B+ tree? UNDRESTANDING
12 2
Describe how the insert and delete operations are performed in
CREATING
13 B+ tree? 6
Explain how search is performed in B+ tree? UNDRESTANDING
14 2
Define static Hashing? REMEMBERING
15 1
Explain extendible hashing? UNDRESTANDING
16 2
17 Define linear hashing? REMEMBERING 1
18 Differentiate between linear and extensible hashing? UNDRESTANDING 2

Unit-5
Long Answer Questions-

S.No Question Blooms Taxony level Course outcome


Write in detail about hash based indexing
REMEMBERING 1
1 and Tree based indexing

III ECE I SEM


Page 108
[L1:REMEMBERING]

Compare I/O costs for all file


UNDRESTANDING 2
2 organizations
3 Explain in detail about ISAM UNDRESTANDING 2

Explain about B+ tree index file? UNDRESTANDING 2


4
Demonstrate searching a given element in
UNDRESTANDING 2
5 B+ trees? Explain with example?
Illustrate insertion of an element in B+
UNDRESTANDING 2
6 Tree with example
Illustrate deletion of an element in B+ Tree
UNDRESTANDING 2
7 with example

Write in detail about Static Hashing UNDRESTANDING 2


8
9 Explain in detail about Extendible hashing UNDRESTANDING 2

Explain in detail about Linear hashing UNDRESTANDING 2


10
Compare and contrast Extendible hashing
UNDRESTANDING 2
11 With Linear hashing

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.

III ECE I SEM


Page 109
(B) Addition of new structures in the database system.
(C) Manipulation & processing of database.
(D) Definition of physical structure of database system.
Ans: C DML is provided for manipulation & processing of database.Data stored
in the database is processed or manipulated using data manipulation language
commands as its name)
6) ‗AS‘ clause is used in SQL for
(A) Selection operation. (B) Rename operation.
(C) Join operation. (D) Projection operation.
Ans: B „AS‟ clause is used in SQL for rename
operation. (e.g., SELECT ENO AS EMPLOYEE_NO
FROM EMP)
7) ODBC stands for
(A) Object Database Connectivity.(B) Oral Database Connectivity.
(C) Oracle Database Connectivity.(D) Open Database Connectivity.
Ans: D
8) Architecture of the database can be viewed as
(A) two levels. (B) four levels.(C) three levels. (D) one level.
Ans: C
In a relational model, relations are termed as
a) Tuples. (B) Attributes(C) Tables. (D) Rows.
10) The database schema is written in
(A) HLL (B) DML(C) DDL (D) DCL
Ans: C
11) In the architecture of a database system external level is the
(A) physical level. (B) logical level.(C) conceptual level (D) view level.
Ans: D
12) An entity set that does not have sufficient attributes to form a primary key is a
(A) strong entity set. (B) weak entity set.
(C) simple entity set. (D) primary entity set.
Ans: B
13) In a Hierarchical model records are organized as
(A) Graph. (B) List.(C) Links. (D) Tree.
Ans: D
14) In an E-R diagram attributes are represented by
(A) rectangle. (B) square.(C) ellipse. (D) triangle.
Ans: C
15) In case of entity integrity, the primary key may be
(A) not Null (B) Null(C) both Null & not Null. (D) any value.

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)

III ECE I SEM


Page 110
17) The language used in application programs to request data from the DBMS is
referred to as the
(A) DML (B) DDL(C) VDL (D) SDL
Ans: A
18) A logical schema
(A) is the entire database.
(B) is a standard way of organizing information into accessible parts.
(C) describes how data is actually stored on disk.
(D) both (A) and (C)
Ans: A
19) In a relation
(A) Ordering of rows is immaterial
(B) No two rows are identical
(C) (A) and (B) both are true
(D) None of these.
Ans: C
20) Which of the following is correct:
(A) a SQL query automatically eliminates duplicates.
(B) SQL permits attribute names to be repeated in the same relation.
(C) a SQL query will not work if there are no indexes on the relations
(D) None of these
Ans: D
21) It is better to use files than a DBMS when there are
(A) Stringent real-time requirements.
(B) Multiple users wish to access the data.
(C) Complex relationships among data.
(D) All of the above.
Ans: B
22) The conceptual model is
(A) dependent on hardware.
(B) dependent on software.
(C) dependent on both hardware and software .
(D) independent of both hardware and software.
Ans: D
23) What is a relationship called when it is maintained between two entities?
(A) Unary (B) Binary(C) Ternary (D) Quaternary
Ans: B
24) Which of the following operation is used if we are interested in only certain columns of
atable?
(A) PROJECTION (B) SELECTION(C) UNION (D) JOIN
Ans: A
25) Which of the following is a legal expression in SQL?
(A) SELECT NULL FROM EMPLOYEE;
(B) SELECT NAME FROM EMPLOYEE;
(C) SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL;

III ECE I SEM


Page 111
(D) None of the above
Ans: B
26) The users who use easy-to-use menu are called
(A) Sophisticated end users. (B) Naïve users.
(C) Stand-alone users. (D) Casual end users.
Ans: B
27) Which database level is closest to the users?
(A) External (B) Internal(C) Physical (D) Conceptual
Ans: A
28) Which are the two ways in which entities can participate in a relationship?
(A) Passive and active (B) Total and partial
(C) Simple and Complex (D) All of the above
Ans: B
29) The result of the UNION operation between R1 and R2 is a relation that includes
(A) all the tuples of R1
(B) all the tuples of R2
(C) all the tuples of R1 and R2
(D) all the tuples of R1 and R2 which have common columns
Ans: D
30) Which of the following is a comparison operator in SQL?
(A) = (B) LIKE(C) BETWEEN (D) All of the above
Ans: D
31) A set of possible data values is called
(A) attribute. (B) degree.(C) tuple. (D) domain.
Ans: D
32) Which of the operations constitute a basic set of operations for manipulating
relationaldata?
(A) Predicate calculus (B) Relational calculus
(C) Relational algebra (D) None of the above
Ans:C
33) Which of the following is another name for weak entity?
(A) Child (B) Owner(C) Dominant (D) All of the above
Ans: A
34) Which of the following database object does not physically exist?
(A) base table (B) index(C) view (D) none of the above
Ans: C
GATE
35) Consider a relational table with a single record for each registered student with the
following attributes:
Registration_number: Unique registration number for each registered
student UID: Unique identity number at the national level for each
citizen Bank Account_number: Unique account number at the bank. A
student can have multiple accounts or join accounts. This attribute stores
the primary account number. Name: Name of the student Hostel_room:
room number of the hostel Which of the following option is incorrect ?

III ECE I SEM


Page 112
A.Bank account number is candidate key
B.Registration Number can be a Primary Key
C.UID is Primary Key if students are from the same country.
D. If S is a superkey such that S UID is Null then S UID is also a super key

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

Journals (National & International):


1) International Journal of Intelligent Information and Database Systems
(http://www.inderscience.com/jhome.php?jcode=ijiids)
2) The Journal of Biological Databases and Curation
(http://database.oxfordjournals.org/content/current)

List of topics for student‟s seminar s:


1) Database Management System pu rpose and applications
2) Database Users and Administrators
3) History of Database Systems

III ECE I SEM


Page 113
4) Data Models
5) File System vs DBMS
6) Form of basic SQL query with examples
7) Schema Refinement
8) Problems caused by Redundancy
9) Normalization and Normal Forms
10) Transaction Management
11) Transaction States and properties
12) Concurrency control and execution

Case Studies / Small Projects:


1. Hospital Management System
2. Railway Reservation.

III ECE I SEM


Page 114

You might also like