University BDT College of Engineering, Davanagere.

(A Constituent College of VTU, Belagavi)

DEPARTMENT OF MASTER OF COMPUTER APPLICATIONS

LESSON PLAN for ODD Sem (2024-2025)

Name of the Staff : Prasanna Kumar Naik R

Name of the subject : DBMS
Subject code : MMC103 CIE Marks : 50

Teaching Hours/Week(L:P:SDA) : 2:0:1 SEE Marks : 50

Total Hours of Pedagogy : 40 Total Marks : 100
Credits : 03 Exam Hours : 03

Course Learning objectives:

 Explain the need and services of the operating system
 Explore how the operating system handles processes and manages memory

SL.
DATES SYLLABUS PLAN TO COVER REMARKS
NO.
23-12-24 Introduction: Purpose of Database System, Views of data,
TO data models, database management system, three-schema
1
25-12-24 architecture of DBMS, components of DBMS. E/R Model
30-12-24 Conceptual data modelling - motivation, entities, entity
TO types, attributes relationships, relationship types, E/R
2
01-01-24 diagram notation, examples. Data Models: Introduction to
the Relational Model
06-01-24 Structure – Database Schema, Keys – Schema Diagrams.
3
TO Database design– Other Models, ER diagrams – ER Model -
08-01-24 Entities, Attributes and Entity sets
13-01-25 Relationships and Relationship sets – ER Design Issues –
4 TO Concept Design – Conceptual Design with relevant
15-01-25 Examples. Relational Query Languages, Relational
Operations
20-01-25 Relational Algebra – Selection and projection set
5 TO operations – renaming – Joins – Division – Examples of
22-01-25 Algebra overviews – Relational calculus – Tuple Relational
Calculus (TRC)
27-01-25 Domain relational calculus (DRC).Overview of the SQL
6 TO Query Language – Basic Structure of SQL Queries, Data
29-01-25 types, Creating a database, create a table, drop the database,
drop table, select table,
03-02-25 Insert a record, update record, delete a record, order by,
TO group by, triggers, Set Operations, Aggregate Functions ,
7
05-02-25 Nested Sub queries, Views, Procedures
 10-02-25 Normalization – Introduction, Non loss decomposition and
TO functional dependencies, First, Second, and third normal
8 12-02-25 forms – dependency preservation, Boyce/Codd normal
form

17-02-25 Higher Normal Forms - Introduction, Multi-valued

TO dependencies and Fourth normal form, Join dependencies
9
19-02-25 and Fifth normal form

24-02-25 Transaction Concept- Transaction State- Implementation of

TO Atomicity and Durability – Concurrent Executions –
10
26-02-25 Serializability- Recoverability

03-03-25 Implementation of Isolation – Testing for serializability-

11 TO Lock –Based Protocols
05-03-25
10-03-25 Timestamp Based Protocols- Validation- Based Protocols –
12 TO Multiple Granularity.
12-03-25
17-03-25 Recovery and Atomicity – Log – Based Recovery –
13 TO Recovery with Concurrent Transactions
18-03-25
Check Points - Buffer Management – Failure with loss of
24-03-25 nonvolatile storage.
14 TO
26-03-25

Text Books:

1. Database System Concepts, Silberschatz, Korth, Mc Graw hill, 7th edition.

2. Database Management Systems, Raghu Ramakrishnan, Johannes Gehrke, TATA
McGrawHill 3rd Edition

Reference Books:

 An Introduction to Database systems, C.J. Date, A.Kannan, S.Swami Nadhan, Pearson, Eight
Edition.
 Rob,Coronel, “Database Systems”, Seventh Edition, Cengage Learning. 3. Fundamentals of
Database Management Systems, M. L. Gillenson, Wiley Student Edition.
 Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
 Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah, PHI.

[Prasanna Kumar Naik R.] PROGRAM STAFF INCHARGE

 University BDT College of Engineering, Davanagere.
(A Constituent College of VTU, Belagavi)
DEPARTMENT OF MASTER OF COMPUTER APPLICATIONS

LESSON PLAN for ODD Sem (2024-2025)

Name of the Staff : Prasanna Kumar Naik R.

Name of the subject : Discrete Mathematics and Graph Theory

Subject code : MMC102 CIE Marks : 50

Teaching Hours/Week(L:P:SDA) : 2:0:0:2 SEE Marks : 50

Total Hours of Pedagogy : 40 Total Marks : 100
Credits : 03 Exam Hours : 03

Course Learning objectives:

 Analyze basic concepts of mathematical logic for analyzing propositions and proving
theorems
 Apply sets and their operations algebraically to solve real-world problems.
 Examine the basics of graph theory and their various properties.
 Model problems using graphs and to solve these problems algorithmically.
 Apply graph theory concepts to solve real world problems in Computer Networking,
Telecommunication Infrastructure, Transportation etc.

SL.
DATES SYLLABUS PLAN TO COVER REMARKS
NO.
23-12-24
TO Basic Structures: Sets,
1
26-12-24
30-12-24 Principle of Inclusion, Exclusion and Pigeonhole principle
2 TO Functions
03-01-25
06-01-25
3 Matrices- Eigenvalues and Eigenvectors.
TO
08-01-25
13-1-25
4 Mathematical Logic, Propositional Logic,
TO
16-01-25
20-01-25 Applications of Propositional Logic, Propositional
5 TO Equivalences, Predicates and Quantifiers
22-01-25
27-01-25
6 Nested Quantifiers, Rules of Inference Introduction to Proofs
TO
30-01-25
03-02-25 Introduction to Graphs: Application of graphs – finite, infinite
7 TO and bipartite graphs – Incidence and Degree – Isolated vertex
06-02-25
10-02-25 pendant vertex and Null graph. Paths and circuits –
8 TO Isomorphism, sub-graphs, walks, paths and circuits
13-02-25
 17-02-25
TO connected graphs, disconnected graphs and components.
9
20-02-25
24-02-25 Eulerian and Hamiltonian graphs: Euler graphs, Operations
10 TO on graphs
27-02-25
03-03-25
TO Hamiltonian paths and circuits, Travelling salesman problem.
11
06-03-25
10-03-25 Directed graphs – types of digraphs, Digraphs and binary
12 TO relation.
13-03-25
17-03-25 Graph Colouring: Colouring- Chromatic number, Chromatic
13 TO polynomial, Matchings, Coverings,
20-03-25

24-03-25 Four colour problem and Five colour problem. Greedy

14 colouring algorithm
TO
27-03-25

Text Books:
1. Kenneth H Rosen, “Discrete Mathematics and its Applications”, McGraw Hill publications, 7th
edition. .
2. Narsingh Deo, Graph theory with the applications to engineering & Computer Science, Dovers
Publications, 2016
3. J.A. Bondy and U.S.R. Murty. Graph theory with Applications, Springer, 1 st edition, 2008

Reference Books:

 .K Sharma “Discrete Mathematics”, Mac Millian Publishers India, 3rd edition,2011.

 Garry Chartand and Ping Zhang, Introduction to Graph Theory, Tata McGraw-Hill, 2006.
 Frank Harary, Graph Theory, Narosa Publishing House, Latest edition.

[Prasanna Kumar Naik R.] PROGRAM COORDINATOR