03092022

V Semester

AUTOMATA THEORY AND COMPILER DESIGN

Course Code 21CS51 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning Objectives

CLO 1. Introduce the fundamental concepts of Automata Theory, Formal Languages and compiler design
CLO 2. Principles Demonstrate Application of Automata Theory and Formal Languages in the field of
compiler design
CLO 3. Develop understanding of computation through Push Down Automata and Turing Machines
CLO 4. Introduce activities carried out in different phases of Phases compiler
CLO 5. Identify the undecidability problems.

Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) needs not to be only a traditional lecture method, but alternative effective
teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes critical
thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop design
thinking skills such as the ability to design, evaluate, generalize, and analyze information rather
than simply recall it.
6. Introduce Topics in manifold representations.
7. Show the different ways to solve the same problem with different approaches and encourage the
students to come up with their own creative ways to solve them.
8. Discuss how every concept can be applied to the real world - and when that's possible, it helps
improve the students' understanding.
Module-1
Introduction to Automata Theory: Central Concepts of Automata theory, Deterministic Finite
Automata(DFA), Non- Deterministic Finite Automata(NFA) ,Epsilon- NFA, NFA to DFA Conversion,
Minimization of DFA

Introduction to Compiler Design: Language Processors, Phases of Compilers

Textbook 1: Chapter1 – 1.5, Chapter2 – 2.2,2.3,2.5 Chapter4 –4.4

Textbook 2: Chapter1 – 1.1 and 1.2
Teaching-Learning Process Chalk and board, Active Learning, Problem based learning
Module-2
Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular Expressions,
Proving Languages Not to Be Regular

Lexical Analysis Phase of compiler Design: Role of Lexical Analyzer, Input Buffering , Specification of
Token, Recognition of Token.

Textbook 1: Chapter3 – 3.1, 3.2, Chapter4- 4.1

 03092022

Textbook 2: Chapter3- 3.1 to 3.4

Teaching-Learning Process Chalk and board, Active Learning, Demonstration
Module-3
Context Free Grammars: Definition and designing CFGs, Derivations Using a Grammar, Parse Trees,
Ambiguity and Elimination of Ambiguity, Elimination of Left Recursion, Left Factoring.

Syntax Analysis Phase of Compilers: part-1: Role of Parser , Top-Down Parsing

Textbook 1: Chapter 5 – 5.1.1 to 5.1.6, 5.2 (5.2.1, 5.2.2), 5.4

Textbook 2: Chapter 4 – 4.1, 4.2, 4.3 (4.3.2 to 4.3.4) ,4.4
Teaching-Learning Process Chalk and board, Problem based learning, Demonstration
Module-4
Push Down Automata: Definition of the Pushdown Automata, The Languages of a PDA.

Syntax Analysis Phase of Compilers: Part-2: Bottom-up Parsing, Introduction to LR Parsing: SLR, More
Powerful LR parsers

Textbook1: Chapter 6 – 6.1, 6.2

Textbook2: Chapter 4 – 4.5, 4.6, 4.7 (Up to 4.7.4)
Teaching-Learning Process Chalk & board, Problem based learning
Module-5
Introduction to Turing Machine: Problems that Computers Cannot Solve, The Turing machine,
problems, Programming Techniques for Turing Machine, Extensions to the Basic Turing Machine

Undecidability : A language That Is Not Recursively Enumerable, An Undecidable Problem That Is RE.

Other Phases of Compilers: Syntax Directed Translation- Syntax-Directed Definitions, Evaluation

Orders for SDD’s. Intermediate-Code Generation- Variants of Syntax Trees, Three-Address Code.

Code Generation- Issues in the Design of a Code Generator

Textbook1: Chapter 8 – 8.1, 8.2,8.3,8.4 Chapter 9 – 9.1,9.2

Textbook2: Chapter 5 – 5.1, 5.2, Chapter 6- 6.1,6.2 Chapter 8- 8.1
Teaching-Learning Process Chalk and board, MOOC
Course Outcomes
At the end of the course the student will be able to:
CO 1. Acquire fundamental understanding of the core concepts in automata theory and Theory of
Computation
CO 2. Design and develop lexical analyzers, parsers and code generators
CO 3. Design Grammars and Automata (recognizers) for different language classes and become
knowledgeable about restricted models of Computation (Regular, Context Free) and their relative
powers.
CO 4. Acquire fundamental understanding of the structure of a Compiler and Apply concepts automata
theory and Theory of Computation to design Compilers
CO 5. Design computations models for problems in Automata theory and adaptation of such model in
the field of compilers

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 35% (18 Marks out of 50) in the semester-end examination
 03092022

(SEE), and a minimum of 40% (40 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together

Continuous Internal Evaluation:

Three Unit Tests each of 20 Marks (duration 01 hour)
1. First test at the end of 5th week of the semester
2. Second test at the end of the 10th week of the semester
3. Third test at the end of the 15th week of the semester
Two assignments each of 10 Marks
1. First assignment at the end of 4th week of the semester
2. Second assignment at the end of 9th week of the semester
Group discussion/Seminar/quiz any one of three suitably planned to attain the COs and POs for 20
Marks (duration 01 hours)
1. At the end of the 13th week of the semester

The sum of three tests, two assignments, and quiz/seminar/group discussion will be out of 100 marks
and will be scaled down to 50 marks
(to have a less stressed CIE, the portion of the syllabus should not be common /repeated for any of the
methods of the CIE. Each method of CIE should have a different syllabus portion of the course).
CIE methods /question paper has to be designed to attain the different levels of Bloom’s taxonomy
as per the outcome defined for the course.
Semester End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the subject (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks. Marks scored shall
be proportionally reduced to 50 marks
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
Suggested Learning Resources:

Textbooks
1. John E Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,“ Introduction to Automata Theory,
Languages and Computation”, Third Edition, Pearson.
2. Alfred V.Aho, Monica S.Lam,Ravi Sethi, Jeffrey D. Ullman, “ Compilers Principles, Techniques and
Tools”, Second Edition,Perason.
Reference:
1. Elain Rich, “Automata,Computability and complexity”, 1st Edition, Pearson Education,2018.
2. K.L.P Mishra, N Chandrashekaran , 3rd Edition , ‘Theory of Computer Science”,PHI,2012.
3. Peter Linz, “An introduction to Formal Languages and Automata “, 3rd Edition, Narosa
Publishers,1998.
4. K Muneeswaran, ”Compiler Design”, Oxford University Press 2013.
Weblinks and Video Lectures (e-Resources):

1. https://nptel.ac.in/courses/106/106/106106049/#
2. https://nptel.ac.in/courses/106/104/106104123/
3. https://www.jflap.org/

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

Group Activities, quizzes, Puzzles and presentations

 03092022

V Semester

COMPUTER NETWORKS
Course Code: 21CS52 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40T + 20P Total Marks 100
Credits 04 Exam Hours 03
Course Objectives:

CLO 1. Fundamentals of data communication networks.

CLO 2. Software and hardware interfaces
CLO 3. Application of various physical components and protocols
CLO 4. Communication challenges and remedies in the networks.
Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) need not to be only traditional lecture method, but alternative effective
teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes critical
thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop design
thinking skills such as the ability to design, evaluate, generalize, and analyze information rather
than simply recall it.
6. Introduce Topics in manifold representations.
7. Show the different ways to solve the same problem and encourage the students to come up with
their own creative ways to solve them.
8. Discuss how every concept can be applied to the real world - and when that's possible, it helps
improve the students' understanding.
Module-1
Introduction to networks: Network hardware, Network software, Reference models,

Physical Layer: Guided transmission media, Wireless transmission

Textbook 1: Ch.1.2 to 1.4, Ch.2.2 to 2.3

Laboratory Component:
1. Implement Three nodes point – to – point network with duplex links between them for different
topologies. 1Set the queue size, vary the bandwidth, and find the number of packets dropped for
various iterations.

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration

Module-2
The Data link layer: Design issues of DLL, Error detection and correction, Elementary data link
protocols, Sliding window protocols.

The medium access control sublayer: The channel allocation problem, Multiple access protocols.

Textbook 1: Ch.3.1 to 3.4, Ch.4.1 and 4.2

Laboratory Component:
1. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation and
determine the throughput with respect to transmission of packets
2. Write a program for error detecting code using CRC-CCITT (16- bits).
 03092022

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration

Module-3
The Network Layer:
Network Layer Design Issues, Routing Algorithms, Congestion Control Algorithms, QoS.

Textbook 1: Ch 5.1 to 5.4

Laboratory Component:
1. Implement transmission of ping messages/trace route over a network topology consisting of 6
nodes and find the number of packets dropped due to congestion in the network.
2. Write a program to find the shortest path between vertices using bellman-ford algorithm.

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration

Module-4
The Transport Layer: The Transport Service, Elements of transport protocols, Congestion control, The
internet transport protocols.

Textbook 1: Ch 6.1 to 6.4 and 6.5.1 to 6.5.7

Laboratory Component:
1. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion
window for different source / destination.
2. Write a program for congestion control using leaky bucket algorithm.
Teaching-Learning Process Chalk and board, Problem based learning, Demonstration
Module-5
Application Layer: Principles of Network Applications, The Web and HTTP, Electronic Mail in the
Internet, DNS—The Internet’s Directory Service.

Textbook 2: Ch 2.1 to 2.4

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration
Course Outcomes (Course Skill Set)
At the end of the course the student will be able to:
CO 1. Learn the basic needs of communication system.
CO 2. Interpret the communication challenges and its solution.
CO 3. Identify and organize the communication system network components
CO 4. Design communication networks for user requirements.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 35% (18 Marks out of 50) in the semester-end examination
(SEE), and a minimum of 40% (40 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together
Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks (duration 01 hour)
1. First test at the end of 5th week of the semester
2. Second test at the end of the 10th week of the semester
3. Third test at the end of the 15th week of the semester
Two assignments each of 10 Marks
4. First assignment at the end of 4th week of the semester
5. Second assignment at the end of 9th week of the semester

Practical Sessions need to be assessed by appropriate rubrics and viva-voce method. This will contribute
to 20 marks.
 03092022

 Rubrics for each Experiment taken average for all Lab components – 15 Marks.
 Viva-Voce– 5 Marks (more emphasized on demonstration topics)

The sum of three tests, two assignments, and practical sessions will be out of 100 marks and will be
scaled down to 50 marks
(to have a less stressed CIE, the portion of the syllabus should not be common /repeated for any of the
methods of the CIE. Each method of CIE should have a different syllabus portion of the course).
CIE methods /question paper has to be designed to attain the different levels of Bloom’s taxonomy
as per the outcome defined for the course.

Semester End Examination:

Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the subject (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks. Marks scored shall
be proportionally reduced to 50 marks
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.

The students have to answer 5 full questions, selecting one full question from each module.
Suggested Learning Resources:
Textbooks:
1. Computer-Networks- Andrew S. Tanenbaum and David J. Wetherall, Pearson Education, 5th-
Edition. (www.pearsonhighered.com/tanenbaum)
2. Computer Networking A Top-Down Approach -James F. Kurose and Keith W. RossPearson
Education 7th Edition.
Reference Books:
1. Behrouz A Forouzan, Data and Communications and Networking, Fifth Edition, McGraw
Hill,Indian Edition
2. Larry L Peterson and Brusce S Davie, Computer Networks, fifth edition, ELSEVIER
Weblinks and Video Lectures (e-Resources):
1. https://www.digimat.in/nptel/courses/video/106105183/L01.html
2. http://www.digimat.in/nptel/courses/video/106105081/L25.html
3. https://nptel.ac.in/courses/106105081
4. VTU e-Shikshana Program
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
Simulation of Personal area network, Home area network, achieve QoS etc.
Note: For the Simulation experiments modify the topology and parameters set for the experiment and
take multiple rounds of reading and analyze the results available in log files. Plot necessary graphs and
conclude using NS2. Installation procedure of the required software must be demonstrated, carried out
in groups, and documented in the report. Non simulation programs can be implemented using Java

V Semester

DATABASE MANAGEMENT SYSTEMS

Course Code 21CS53 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning Objectives
CLO 1. Provide a strong foundation in database concepts, technology, and practice.
CLO 2. Practice SQL programming through a variety of database problems.
CLO 3. Demonstrate the use of concurrency and transactions in database
 03092022

CLO 4. Design and build database applications for real world problems.
Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) need not to be only a traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes
critical thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills such as the ability to design, evaluate, generalize, and analyze
information rather than simply recall it.
6. Introduce Topics in manifold representations.
7. Show the different ways to solve the same problem with different circuits/logic and
encourage the students to come up with their own creative ways to solve them.
8. Discuss how every concept can be applied to the real world - and when that's possible, it
helps improve the students' understanding.
Module-1
Introduction to Databases: Introduction, Characteristics of database approach, Advantages of using the
DBMS approach, History of database applications.

Overview of Database Languages and Architectures: Data Models, Schemas, and Instances. Three
schema
architecture and data independence, database languages, and interfaces, The Database System
environment.

Conceptual Data Modelling using Entities and Relationships: Entity types, Entity sets, attributes,
roles, and structural constraints, Weak entity types, ER diagrams, Examples

Textbook 1: Ch 1.1 to 1.8, 2.1 to 2.6, 3.1 to 3.7

Teaching-Learning Process Chalk and board, Active Learning, Problem based learning
Module-2
Relational Model: Relational Model Concepts, Relational Model Constraints and relational database
schemas, Update operations, transactions, and dealing with constraint violations.

Relational Algebra: Unary and Binary relational operations, additional relational operations (aggregate,
grouping, etc.) Examples of Queries in relational algebra.

Mapping Conceptual Design into a Logical Design: Relational Database Design using ER-to-Relational
mapping.

Textbook 1:, Ch 5.1 to 5.3, 8.1 to 8.5, 9.1;

Teaching-Learning Process Chalk and board, Active Learning, Demonstration
Module-3
SQL: SQL data definition and data types, specifying constraints in SQL, retrieval queries in SQL, INSERT,
DELETE, and UPDATE statements in SQL, Additional features of SQL.

Advances Queries: More complex SQL retrieval queries, Specifying constraints as assertions and action
triggers, Views in SQL, Schema change statements in SQL.
Database
 03092022

Application Development: Accessing databases from applications, An introduction to JDBC, JDBC classes
and interfaces, SQLJ, Stored procedures, Case study: The internet Bookshop.

Textbook 1: Ch 6.1 to 6.5, 7.1 to 7.4; Textbook 2: 6.1 to 6.6;

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration
Module-4
Normalization: Database Design Theory – Introduction to Normalization using Functional and
Multivalued Dependencies: Informal design guidelines for relation schema, Functional Dependencies,
Normal Forms based on Primary Keys, Second and Third Normal Forms, Boyce-Codd Normal Form,
Multivalued Dependency and Fourth Normal Form, Join Dependencies and Fifth Normal Form. Examples
on normal forms.

Normalization Algorithms: Inference Rules, Equivalence, and Minimal Cover, Properties of Relational
Decompositions, Algorithms for Relational Database Schema Design, Nulls, Dangling tuples, and alternate
Relational Designs, Further discussion of Multivalued dependencies and 4NF, Other dependencies and
Normal Forms

Textbook 1: Ch 14.1 to -14.7, 15.1 to 15.6

Teaching-Learning Process Chalk& board, Problem based learning
Module-5
Transaction Processing: Introduction to Transaction Processing, Transaction and System concepts,
Desirable properties of Transactions, Characterizing schedules based on recoverability, Characterizing
schedules based on Serializability, Transaction support in SQL.

Concurrency Control in Databases: Two-phase locking techniques for Concurrency control,

Concurrency control based on Timestamp ordering, Multiversion Concurrency control techniques,
Validation Concurrency control techniques, Granularity of Data items and Multiple Granularity Locking.

Textbook 1: Ch 20.1 to 20.6, 21.1 to 21.7;

Teaching-Learning Process Chalk and board, MOOC
Course Outcomes
At the end of the course the student will be able to:
CO 1. Identify, analyze and define database objects, enforce integrity constraints on a database using
RDBMS
CO 2. Use Structured Query Language (SQL) for database manipulation and also demonstrate the
basic of query evaluation.
CO 3. Design and build simple database systems and relate the concept of transaction, concurrency
control and recovery in database
CO 4. Develop application to interact with databases, relational algebra expression.
CO 5. Develop applications using tuple and domain relation expression from queries.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 35% (18 Marks out of 50) in the semester-end examination
(SEE), and a minimum of 40% (40 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together
Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks (duration 01 hour)
1. First test at the end of 5th week of the semester
2. Second test at the end of the 10th week of the semester
 03092022

3. Third test at the end of the 15th week of the semester

Two assignments each of 10 Marks
4. First assignment at the end of 4th week of the semester
5. Second assignment at the end of 9th week of the semester
Group discussion/Seminar/quiz any one of three suitably planned to attain the COs and POs for 20
Marks (duration 01 hours)
6. At the end of the 13th week of the semester
The sum of three tests, two assignments, and quiz/seminar/group discussion will be out of 100 marks
and will be scaled down to 50 marks
(to have less stressed CIE, the portion of the syllabus should not be common /repeated for any of the
methods of the CIE. Each method of CIE should have a different syllabus portion of the course).
CIE methods /question paper has to be designed to attain the different levels of Bloom’s taxonomy
as per the outcome defined for the course.
Semester End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the subject (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks. Marks scored shall be
proportionally reduced to 50 marks
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
The students have to answer 5 full questions, selecting one full question from each module.
Suggested Learning Resources:
Textbooks
1. Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th Edition, 2017,
Pearson.
2. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014, McGraw Hill

Reference Books:
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan’s Database System Concepts 6th
EditionTata Mcgraw Hill Education Private Limited

Weblinks and Video Lectures (e-Resources):

1. https://www.youtube.com/watch?v=3EJlovevfcA
2. https://www.youtube.com/watch?v=9TwMRs3qTcU
3. https://www.youtube.com/watch?v=ZWl0Xow304I
4. https://www.youtube.com/watch?v=4YilEjkNPrQ
5. https://www.youtube.com/watch?v=CZTkgMoqVss
6. https://www.youtube.com/watch?v=Hl4NZB1XR9c
7. https://www.youtube.com/watch?v=EGEwkad_llA
8. https://www.youtube.com/watch?v=t5hsV9lC1rU

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

 Demonstration of real time Database projects - E-commerce Platform, Inventory Management,
Railway System, College Data Management, Library Data Management, Solution for Saving
Student Records, Hospital Data Management, Blood Donation Management.
 03092022

V Semester

ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

Course Code 21CS54 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning Objectives
CLO 1. Gain a historical perspective of AI and its foundations
CLO 2. Become familiar with basic principles of AI toward problem solving
CLO 3. Familiarize with the basics of Machine Learning & Machine Learning process, basics of Decision
Tree, and probability learning
CLO 4. Understand the working of Artificial Neural Networks and basic concepts of clustering
algorithms
Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) need not to be only a traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes
critical thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills such as the ability to design, evaluate, generalize, and analyze
information rather than simply recall it.
6. Introduce Topics in manifold representations.
7. Show the different ways to solve the same problem with different logic and encourage the
students to come up with their own creative ways to solve them.
8. Discuss how every concept can be applied to the real world - and when that's possible, it
helps improve the students' understanding.
Module-1
Introduction: What is AI? Foundations and History of AI

Problem‐solving: Problem‐solving agents, Example problems, Searching for Solutions, Uninformed

Search Strategies: Breadth First search, Depth First Search,

Textbook 1: Chapter 1- 1.1, 1.2, 1.3

Textbook 1: Chapter 3- 3.1, 3.2, 3.3, 3.4.1, 3.4.3

Teaching-Learning Process Chalk and board, Active Learning. Problem based learning
Module-2
Informed Search Strategies: Greedy best-first search, A*search, Heuristic functions.
Introduction to Machine Learning , Understanding Data

Textbook 1: Chapter 3 - 3.5, 3.5.1, 3.5.2, 3.6

Textbook 2: Chapter 1 and 2

Teaching-Learning Process Chalk and board, Active Learning, Demonstration

Module-3
Basics of Learning theory
Similarity Based Learning
Regression Analysis
 03092022

Textbook 2: Chapter 3 - 3.1 to 3.4, Chapter 4, chapter 5.1 to 5.4

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration

Module-4
Decision Tree learning
Bayesian Learning

Textbook 2: Chapter 6 and 8

Teaching-Learning Process Chalk and board, Problem based learning, Demonstration

Module-5
Artificial neural Network
Clustering Algorithms

Textbook 2: Chapter 10 and 13

Teaching-Learning Process Chalk and board, Active Learning.

Course Outcomes Course Skill Set)
At the end of the course the student will be able to:
CO 1. Apply the knowledge of searching and reasoning techniques for different applications.
CO 2. Have a good understanding of machine leaning in relation to other fields and fundamental issues
and challenges of machine learning.
CO 3. Apply the knowledge of classification algorithms on various dataset and compare results
CO 4. Model the neuron and Neural Network, and to analyze ANN learning and its applications.
CO 5. Identifying the suitable clustering algorithm for different pattern

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 35% (18 Marks out of 50) in the semester-end examination
(SEE), and a minimum of 40% (40 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together

Continuous Internal Evaluation:

Three Unit Tests each of 20 Marks (duration 01 hour)

1. First test at the end of 5th week of the semester

2. Second test at the end of the 10th week of the semester
3. Third test at the end of the 15th week of the semester
Two assignments each of 10 Marks

4. First assignment at the end of 4th week of the semester

5. Second assignment at the end of 9th week of the semester
Group discussion/Seminar/quiz any one of three suitably planned to attain the COs and POs for 20 Marks
(duration 01 hours) OR Suitable Programming experiments based on the syllabus contents can be
given to the students to submit the same as laboratory work( for example; Implementation of concept
learning, implementation of decision tree learning algorithm for suitable data set, etc…)

6. At the end of the 13th week of the semester

The sum of three tests, two assignments, and quiz/seminar/group discussion will be out of 100 marks
and will be scaled down to 50 marks

(to have less stressed CIE, the portion of the syllabus should not be common /repeated for any of the
 03092022

methods of the CIE. Each method of CIE should have a different syllabus portion of the course).

CIE methods /question paper has to be designed to attain the different levels of Bloom’s taxonomy
as per the outcome defined for the course.

Semester End Examination:

Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the subject (duration 03 hours)

1. The question paper will have ten questions. Each question is set for 20 marks. Marks scored shall
be proportionally reduced to 50 marks
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.

The students have to answer 5 full questions, selecting one full question from each module.
Suggested Learning Resources:
Textbooks
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence, 3rd Edition, Pearson,2015
2. S. Sridhar, M Vijayalakshmi “Machine Learning”. Oxford ,2021
Reference:
1. Elaine Rich, Kevin Knight, Artificial Intelligence, 3 rdedition, Tata McGraw Hill,2013
2. George F Lugar, Artificial Intelligence Structure and strategies for complex, Pearson Education,
5th Edition, 2011
3. Tom Michel, Machine Learning, McGrawHill Publication.
Weblinks and Video Lectures (e-Resources):
1. https://www.kdnuggets.com/2019/11/10-free-must-read-books-ai.html
2. https://www.udacity.com/course/knowledge-based-ai-cognitive-systems--ud409
3. https://nptel.ac.in/courses/106/105/106105077/
4. https://www.javatpoint.com/history-of-artificial-intelligence
5. https://www.tutorialandexample.com/problem-solving-in-artificial-intelligence
6. https://techvidvan.com/tutorials/ai-heuristic-search/
7. https://www.analyticsvidhya.com/machine-learning/
8. https://www.javatpoint.com/decision-tree-induction
9. https://www.hackerearth.com/practice/machine-learning/machine-learning-algorithms/ml-
decision-tree/tutorial/
10. https://www.javatpoint.com/unsupervised-artificial-neural-networks
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

Role play for strategies– DFS & BFS, Outlier detection in Banking and insurance transaction for identifying
fraudulent behaviour etc. Uncertainty and reasoning Problem- reliability of sensor used to detect
pedestrians using Bayes Rule
 Email dated 09082022 HB

V Semester
RESEARCH METHODOLOGY & INTELLECTUAL PROPERTY RIGHTS
Course Code: 21RMI56 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 1:2:0:0 SEE Marks 50
Total Hours of Pedagogy 25 Total Marks 100
Credits 02 Exam Hours 03
Course Objectives:
CO1. To Understand the knowledge on basics of research and its types.
CO2. To Learn the concept of Literature Review, Technical Reading, Attributions and Citations.
CO3. To learn Ethics in Engineering Research.
CO4. To Discuss the concepts of Intellectual Property Rights in engineering.
Teaching-Learning Process (General Instructions)
These are sample Strategies; which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer methods (L) need not be only the traditional lecture methods, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video to explain various concepts on IPR.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher Order Thinking) questions in the class, which promotes critical
thinking.
5. Introduce Topics in manifold representations.
6. Show the different ways to analyze the research problem and encourage the students to come
up withtheir own creative ways to solve them.
7. Discuss how every concept can be applied to the real world - and when that's possible, it helps
Improve the students' understanding.
Module-1 (5 Hours)
Introduction: Meaning of Research, Objectives of Engineering Research, and Motivation in Engineering
Research, Types of Engineering Research, Finding and Solving a Worthwhile Problem.

Ethics in Engineering Research, Ethics in Engineering Research Practice, Types of Research Misconduct,
Ethical Issues Related to Authorship.

Teaching- Learning Process Chalk and talk method / PowerPoint Presentation.

Module-2(5 Hours)
Literature Review and Technical Reading, New and Existing Knowledge, Analysis and Synthesis of
Prior Art Bibliographic Databases, Web of Science, Google and Google Scholar, Effective Search: The Way
Forward Introduction to Technical Reading Conceptualizing Research, Critical and Creative Reading,
Taking Notes While Reading, Reading Mathematics and Algorithms, Reading a Datasheet.
Attributions and Citations: Giving Credit Wherever Due, Citations: Functions and Attributes, Impact of
Title and Keywords on Citations, Knowledge Flow through Citation, Citing Datasets, Styles for Citations,
Acknowledgments and Attributions, What Should Be Acknowledged, Acknowledgments in, Books
Dissertations, Dedication or Acknowledgments.
Teaching-Learning Process Chalk and talk method / PowerPoint Presentation
Module-3(5 Hours)
Introduction To Intellectual Property: Role of IP in the Economic and Cultural Development of the Society,
IP Governance, IP as a Global Indicator of Innovation, Origin of IP History of IP in India. Major Amendments in
IP Laws and Acts in India.

Patents: Conditions for Obtaining a Patent Protection, To Patent or Not to Patent an Invention. Rights
Associated with Patents. Enforcement of Patent Rights. Inventions Eligible for Patenting. Non-Patentable
Matters. Patent Infringements. Avoid Public Disclosure of an Invention before Patenting. Process of Patenting.
Prior Art Search. Choice of Application to be Filed. Patent Application Forms. Jurisdiction of Filing Patent
Application. Publication. Pre-grant Opposition. Examination. Grant of a Patent. Validity of Patent Protection.
Post-grant Opposition. Commercialization of a Patent. Need for a Patent Attorney/Agent. Can a Worldwide
Patent be Obtained. Do I Need First to File a Patent in India. Patent Related Forms. Fee Structure. Types of
Patent Applications. Commonly Used Terms in Patenting. National Bodies Dealing with Patent Affairs. Utility
Models.

Process of Patenting. Prior Art Search. Choice of Application to be Filed. Patent Application Forms.
Jurisdiction of Filing Patent Application. Publication. Pre-grant Opposition. Examination. Grant of a Patent.
Validity of Patent Protection. Post-grant Opposition. Commercialization of a Patent. Need for a Patent
Attorney/Agent. Can a Worldwide Patent be Obtained. Do I Need First to File a Patent in India. Patent Related
Forms. Fee Structure. Types of Patent Applications. Commonly Used Terms in Patenting. National Bodies
Dealing with Patent Affairs. Utility Models.

Teaching- Learning Process Chalk and talk method / PowerPoint Presentation.

25.08.2023
 Email dated 09082022 HB

Module-4(5 Hours)
Copyrights and Related Rights: Classes of Copyrights. Criteria for Copyright. Ownership of Copyright.
Copyrights of the Author. Copyright Infringements. Copyright Infringement is a Criminal Offence. Copyright
Infringement is a Cognizable Offence. Fair Use Doctrine. Copyrights and Internet. Non-Copyright Work.
Copyright Registration. Judicial Powers of the Registrar of Copyrights. Fee Structure. Copyright Symbol.
Validity of Copyright. Copyright Profile of India. Copyright and the word ‘Publish’. Transfer of Copyrights to a
Publisher. Copyrights and the Word ‘Adaptation’. Copyrights and the Word ‘Indian Work’. Joint Authorship.
Copyright Society. Copyright Board. Copyright Enforcement Advisory Council (CEAC). International
Copyright Agreements, Conventions and Treaties. Interesting Copyrights Cases.

Trademarks: Eligibility Criteria. Who Can Apply for a Trademark. Acts and Laws. Designation of Trademark
Symbols. Classification of Trademarks. Registration of a Trademark is Not Compulsory. Validity of
Trademark. Types of Trademark Registered in India. Trademark Registry. Process for Trademarks
Registration. Prior Art Search. Famous Case Law: Coca-Cola Company vs. Bisleri International Pvt. Ltd.
Module-5(5 Hours)
Industrial Designs: Eligibility Criteria. Acts and Laws to Govern Industrial Designs. Design Rights.
Enforcement of Design Rights. Non-Protectable Industrial Designs India. Protection Term. Procedure for
Registration of Industrial Designs. Prior Art Search. Application for Registration. Duration of the Registration
of a Design. Importance of Design Registration. Cancellation of the Registered Design. Application Forms.
Classification of Industrial Designs. Designs Registration Trend in India. International Treaties. Famous Case
Law: Apple Inc. vs. Samsung Electronics Co.

Geographical Indications: Acts, Laws and Rules Pertaining to GI. Ownership of GI. Rights Granted to the
Holders. Registered GI in India. Identification of Registered GI. Classes of GI. Non-Registerable GI. Protection
of GI. Collective or Certification Marks. Enforcement of GI Rights. Procedure for GI Registration Documents
Required for GI Registration. GI Ecosystem in India.

Case Studies on Patents. Case study of Curcuma (Turmeric) Patent, Case study of Neem Patent, Case
study of Basmati patent. IP Organizations In India. Schemes and Programmes

Teaching- Learning Process Chalk and talk method / PowerPoint Presentation

Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50). A
student shall be deemed to have satisfied the academic requirements and earned the credits allotted to
each subject/ course if the student secures not less than 35% (18 Marks out of 50) in the semester-end
examination(SEE), and a minimum of 40% (40 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.

Continuous Internal Evaluation:

Three Unit Tests each of 20 Marks (duration 01 hour)
1. First test at the end of 5 th week of the semester
2. Second test at the end of the 10 th week of the semester
3. Third test at the end of the 15 th week of the semester
Two assignments each of 10 Marks
4. First assignment at the end of 4 th week of the semester
5. Second assignment at the end of 9 th week of the semester
Group discussion/Seminar/quiz any one of three suitably planned to attain the COs and POs for 20
Marks (duration 01 hours)
6. At the end of the 13th week of the semester
The sum of three tests, two assignments, and quiz/seminar/group discussion will be out of 100 marks
and will be scaled down to 50 marks (to have less stressed CIE, the portion of the syllabus should not
be common /repeated for any of the methods of the CIE. Each method of CIE should have a different
syllabus portion of the course).
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
Outcome defined for the course.

Semester End Examination:

Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the subject (duration 03 hours)
1. The question paper will be set for 100 marks. Marks scored shall be proportionally reduced to 50
marks
2. The question paper will have ten questions. Each question is set for 20 marks.
3. There will be 2 questions from each module. Each of the two questions is under a module (with a
maximum of 2 sub-questions).
4. The students have to answer 5 full questions, selecting one full question from each module.
Marks scored by the students will be proportionally scaled down to 50 marks

25.08.2023
 Email dated 09082022 HB

Course Outcomes (Course Skill Set)

At the end of the course the student will be able to:
CO 1. To know the meaning of engineering research.
CO 2. T o k n o w t h e p r o c e d u r e o f Literature Review and Technical Reading.
CO 3. T o k n o w t h e f u n d a m e n t a l s o f p a t e n t l a w s a n d d r a f t i n g p r o c e d u r e .
CO 4. Understanding the copyright laws and subject matters of copyrights and designs
CO 5. U n d e r s t a n d i n g t h e b a s i c p r i n c i p l e s o f d e s i g n r i g h t s .

Suggested Learning Resources:

Textbook
1. Dipankar Deb • Rajeeb Dey, Valentina E. Balas “Engineering Research Methodology”, ISSN 1868-
4394 ISSN 1868-4408 (electronic), Intelligent Systems Reference Library, ISBN 978-981-13-
2946-3 ISBN 978-981-13-2947-0 (eBook), https://doi.org/10.1007/978-981-13-2947-0
2. Intellectual Property A Primer for Academia by Prof. Rupinder Tewari Ms. Mamta Bhardwa
Reference Book:
1. David V. Thiel “Research Methods for Engineers” Cambridge University Press, 978-1-107-03488-4
–
2. Intellectual Property Rights by N.K.Acharya Asia Law House 6th Edition. ISBN: 978-93-81849-30-9
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
 Quizzes
 Assignments
 Seminars

25.08.2023