0% found this document useful (0 votes)
1K views71 pages

Updated 5th and 6th Sem 2021 Scheme and Syllabus

Uploaded by

dmprashanth6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1K views71 pages

Updated 5th and 6th Sem 2021 Scheme and Syllabus

Uploaded by

dmprashanth6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 71

Vidyavardhaka Sangha ®, Mysuru

VIDYAVARDHAKA COLLEGE OF ENGINEERING


Autonomous Institute, Affiliated to Visvesvaraya Technological University, Belagavi
(Approved by AICTE, New Delhi & Government of Karnataka)
Accredited by NBA, NAAC with ‘A’ Grade
P.B. No.206, Gokulam 3rd Stage, Mysuru -570 002, Karnataka, India
Phone+91 821-4276200, 225 Email: [email protected], website:www.vvce.ac.in

Bachelor of Engineering
V to VI Semester Scheme and Syllabi

(2021 Scheme)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

i
Scheme of Teaching and Examination for BE (Autonomous Scheme: 2021)
V SEMESTER - Computer Science & Engineering
Contact Hours /
Examination
Course
Sl. Course Teaching week
Area
Course Name Credits
No. Code Department Duration CIE SEE
L T P Total
(Hrs.) Marks Marks
1 IPCC 21CS51* Computer Networks CS 3 0 2 3 50 50 100 4
2 IPCC 21CS52 Operating System CS 3 0 2 3 50 50 100 4
Software Engineering and
3 PC 21CS53 CS 3 0 0 3 50 50 100 3
Testing
4 PC 21CS54* Automata Theory CS 3 0 0 3 50 50 100 3
5 PE 21CS55X Professional Elective – I CS 3 0 0 3 50 50 100 3
6 OE 21CS56X Open Elective – I CS 3 0 0 3 50 50 100 3
Technical Proficiency
7 HS 21TP57A* TAP 0 2 0 2 50 50 100 1
Enhancement Course – III
8 HS 21HS58A Environmental Studies CV 1 0 0 2 50 50 100 1
2 0 0
9 AEC 21AL59X Career Elective-I CS 2 50 50 100 2
0 0 4
TOTAL 19/21 2 4/8 - 450 450 900 24

Professional Elective – I Open Elective – I Career Elective-I


21CS551* Full Stack Development-I 21CS561 Introduction to Data Structures 21AL59X Mini Project
21CS552 Cryptography 21IS562 Introduction to Database Management System 21AL59X Research
21CS553# Data Mining and Data Warehousing 21CI563 Basics of Artificial Intelligence 21AL59X Add-on Course
21AL59X Foreign Language
21IS564 Introduction to OOP with Java
21CS554 Computer Graphics & Visualization
21AL59X Online Courses
21CS565 Introduction to Python Programming
*common to (AI&ML/CSE/ISE), #common to (CSE/ISE), $common to (AI&ML/CSE), @common to (AI&ML/ISE)

ii
Scheme of Teaching and Examination for BE (Autonomous Scheme: 2021)
VI SEMESTER - Computer Science & Engineering
Contact Hours / week Examination Credits
Sl. Course Teaching
Cour

Area

Course Name Duration CIE SEE


se

No. Code Department L T P Total


(Hrs.) Marks Marks
1 IPCC 21CS61# Machine Learning CS 3 0 2 3 50 50 100 4
2 IPCC 21CS62* DevOps CS 3 0 2 3 50 50 100 4
System Software and Compiler
3 PC 21CS63 CS 3 0 0 3 50 50 100 3
Design
4 PE 21CS64X Professional Elective – II CS 3 0 0 3 50 50 100 3

5 OE 21CS65X Open Elective – II CS 3 0 0 3 50 50 100 3


Innovation/Entrepreneurship
6 PRI 21INT66 CS/TAP - - - - 100 - 100 3
/Societal Internship
Technical Proficiency Enhancement
7 HS 21TP67A TAP 0 2 0 2 50 50 100 1
Course-IV
Research Methodology and
8 HS 21HS68B ME 1 0 0 2 50 50 100 1
Intellectual Property Rights
2 0 0
9 AEC 21AL69X Career Elective-II 3 50 50 100 2
0 0 4
TOTAL 16/18 2 4/8 - 500 400 900 24

Professional Elective - II Open Elective – II Career Elective-II


21CS641* Full Stack Development-II 21IS651 Introduction to Operating System 21AL69X Mini Project
21CS642 Network Security 21IS652 Introduction to Internet of Things 21AL69X Research
21CS643* Cloud Computing 21CI653 Introduction to Web Technologies 21AL69X Add-on Course
21CS644* Computer Vision 21CS654 Introduction to Machine Learning 21AL69X Foreign Language
21CS655 Fundamentals of Cloud Computing 21AL69X Online Courses
*common to (AI&ML/CSE/ISE), #common to (CSE/ISE), $common to (AI&ML/CSE), @common to (AI&ML/ISE)

iii
Internship of 04 weeks during the intervening period of IV and V semesters; 21INT66 Innovation/ Entrepreneurship/ Societal based
Internship.
(1) All the students shall have to undergo a mandatory internship of 04 weeks during the intervening period of IV and V semesters. The
internship shall be slated for CIE only and will not have SEE. The letter grade earned through CIE shall be included in the VI semester grade
card. The internship shall be considered as a head of passing and shall be considered for vertical progression and for the award of degree. Those,
who do not take up / complete the internship shall be considered under F (fail) grade and shall have to complete during subsequently after
satisfying the internship requirements.
(2) Innovation/ Entrepreneurship Internship shall be carried out at industry, State and Central Government /Non-government organizations
(NGOs), micro, small and medium enterprises (MSME), Innovation centers, or Incubation centers. Innovation need not be a single breakthrough;
it can also be a series of small or incremental changes. Innovation of any kind can also happen outside of the business world. Entrepreneurship
internships offer a chance to gain hands-on experience in the world of entrepreneurship and helps to learn what it takes to run a small
entrepreneurial business by performing intern duties with an established company. This experience can then be applied to future business
endeavors. Start-ups and small companies are a preferred place to learn the business tack ticks or future entrepreneurs as earning how a small
business operates will serve the intern well when he/she manages his/her own company. Entrepreneurship acts as a catalyst to open the minds
to creativity and innovation. Entrepreneurship internships can be from several sectors, including technology, small and medium-sized, and the
service sector.
(3) Societal or social internship. Urbanization is increasing on a global scale; and yet, half the world’s population still resides in rural areas and is
devoid of many things that urban population enjoys. The rural internship is a work-based activity in which students will have a chance to
solve/reduce the problems of the rural place for better living.

iv
SEMESTER – V
Course Name : Computer Networks Course Code: 21CS51
Number of Lecture Hours /
: 03 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40+24=64 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:2 Credits: 04
Course Prerequisites
Basic knowledge of problem-solving skills, Computer hardware are required to learn the course.
Course Overview
This course will enable students to,
This course provides fundamental understanding of all the layers for TCP/IP model and different
protocols used in the layers. Provides basic knowledge of different types of networks and their
applications.
Course Learning Objectives (CLOs)
● Study the TCP/IP protocol suite, switching criteria and Medium Access Control protocols for
reliable and noisy channels.
● Study network layer services and IP versions
● Discuss transport layer services and understand UDP and TCP protocols.
● Demonstrate the working of different concepts of networking layers and protocols.
Teaching
Modules
Hours
Module 1
Introduction: Data Communications, Networks, Network Types, Networks Models:
Protocol Layering, TCP/IP Protocol suite, The OSI model, Introduction to Physical Layer:
08
Transmission media, Guided Media, Unguided Media: Wireless.
SLT: Switching: Packet Switching and its types.
Textbook: Ch. 1.1 - 1.3, 2.1 - 2.3, 7.1 – 7.3, 8.3.
Module 2
Data Link Layer: Error Detection and Correction: Introduction, Block Coding, Cyclic
Codes. Data link control: DLC Services: Framing, Flow Control, Error Control,
Connectionless and Connection Oriented, Data link layer protocols, High Level Data Link
08
Control.
Media Access Control: Random Access, Controlled Access.
SLT : Check Sum and Point to Point Protocol
Textbook : Ch. 10.1-10.4, 11.1 -11.3, 12.1 - 12.2
Module 3
Network Layer: Network layer Services, Packet Switching, IPv4 Address, IPv4
Datagram, IPv6 Datagram, Introduction to Routing Algorithms, Unicast Routing
08
Protocols: DVR, LSR, PVR, Unicast Routing protocols: RIP, OSPF, BGP
SLT: Multicasting Routing-MOSPF
Textbook 1: Ch. 18.1, 18.2, 18.4, 22.2,20.1-20.3, 21.3.2
Module 4 08
Introduction to Transport Layer: Introduction, Transport-Layer Protocols:
Introduction, User Datagram Protocol, Transmission Control Protocol: services, features,
segments, TCP connections, flow control, Error control, Congestion control.
SLT: Transport Layer Protocols
Textbook 1: Ch. 23.1- 23.2 , 24.1-24.3.4, 24.3.6-24.3.9
Module 5
Introduction to Application Layer: Introduction, Client-Server Programming,
Standard Client-Server Protocols: World Wide Web and HTTP, FTP, Electronic Mail,
08
Domain Name System (DNS)
SLT: TELNET, Secure Shell (SSH)
Textbook 1: Ch. 25.1-25.2, 26.1-26.6
Part – A
Practical Module
1. Implement three nodes point – to – point network with duplex links between them. Set the
queue size, vary the bandwidth, and find the number of packets dropped.
Demonstration
2. 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.
Demonstration
3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion
window for different source / destination.
Demonstration
4. Develop a program for error detecting code using CRC-CCITT (16- bits).
Demonstration
5. Develop a program to implement a sliding window protocol in the data link layer.
Exercise
6. Develop a program to find the shortest path between vertices using the Bellman-Ford and
path vector routing algorithm.
Exercise
7. Using TCP/IP sockets, write a client – server program to make the client send the file name
and to make the server send back the contents of the requested file if present.
Exercise
8. Develop a program on a datagram socket for client/server to display the messages on client
side, typed at the server side.
Exercise
9. Develop a program for a simple RSA algorithm to encrypt and decrypt the data.
Structured Enquiry
10. Develop a program for congestion control using a leaky bucket algorithm.
Structured Enquiry
Part - B
Open Ended Experiments
1. Given a graph with adjacency list representation of the edges between the nodes, the task is
to implement Dijkstra’s Algorithm for single-source shortest path using Priority Queue in
Java.
2. Implementation of stop and wait protocol using socket programming.
3. Implementation of group chat application using multicast socket Programming.
4. Implementation of address resolution protocol.
5. Implementation of Open Shortest Path First (OSPF).
Type of Experiment Program Number Weightage
Demonstration 1,2,3,4 36%
Exercise 5,6,7,8 36%
Structured Enquiry 9,10 18%
Open ended 10%
Textbooks
1. Behrouz A. Forouzan, Data Communications and Networking, 5th Edition, Tata McGraw-Hill,2013
Reference Books
1. 1. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th Edition,
Elsevier, 2019.
2. 2. Nader F. Mir: Computer and Communication Networks, 2nd Edition, Pearson Education, 2015.
3. 3. William Stallings, Data and Computer Communication 10th Edition, Pearson Education, Inc.,
2014.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Explain the fundamentals of computer networks.
Apply the concepts of computer networks to demonstrate the working of various layers and
CO2
protocols in communication network.
CO3 Analyze the principles of protocol layering in modern communication systems.
Simulate/Design & Demonstrate various Routing protocols and their services using tools such
CO4
as Cisco packet tracer, Wireshark and so on

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 2 2

CO3 2 2

CO4 2 2 2 2

AVG 2 2 2 2 2 2
SEMESTER – V
Course Name : Operating System Course Code: 21CS52
Number of Lecture Hours
: 03 CIE Marks: 50
/ Week
Number of Tutorial /
: 02 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40+24=64 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:2 Credits: 04
Course Prerequisites
Good knowledge of C, Computer Organization and Architecture
Course Overview
This course introduces the basic concepts of an operating system. Students can apply and analyze
different memory allocation schemes, CPU scheduling and process synchronization algorithms.
Course Learning Objectives (CLOs)
• To introduce students to basics of Operating System and their services
• To learn different process scheduling algorithms and synchronization techniques
• To understand memory management concepts
• To explore features of various operating systems
Teaching
Modules
Hours
Module 1
Introduction to operating systems: What Operating Systems do, Operating System
structure, Operating System operations, Operating System services, System Calls, System
Programs, Design and Implementation, Operating System structure– Simple, Layered, 08
Microkernels and Modules.
SLT: Types of system calls
TextBook1: Ch. 1.1, 1.4, 1.5, 2.1 – 2.6, 2.7.1 - 2.7.4
Module 2
Processes and CPU Scheduling: Process concept, Process scheduling, Operations on
processes, Inter process communication, Overview of Threads, Multithreaded models, Basic
08
concepts of scheduling, Scheduling criteria and algorithms.
SLT: Threading issues
TextBook1: Ch. 3.1 - 3.4, 4.1, 4.3, 4.6, 6.1 - 6.3
Module 3
Process Synchronization: Synchronization Background, Critical section problem,
Peterson’s solution, Semaphores, Classic problems of synchronization. 08
SLT: Monitors
TextBook1: 5.1 - 5.3, 5.6 - 5.8
Module 4
Memory Management: Background, Swapping, Contiguous Memory allocation,
Segmentation, Paging, Structure of page table, Virtual memory: Background, Demand paging,
08
Copy on write, Basic Page replacement, Page replacement algorithms: FIFO, Optimal and LRU.
SLT: Thrashing
TextBook1: Ch. 8.1 - 8.6, 9.1 - 9.3, 9.4.1 - 9.4.4, 9.6
Module 5
Deadlocks: System Model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance: Banker’s algorithm, Deadlock detection. 08
SLT: Recovery from deadlock
TextBook1: Ch. 7.1 - 7.7
PRACTICAL MODULE

1. Design, Develop a program in C to implement process and Input/Output system calls.


(Demonstration)
2. Design, Develop and implement a program in C to create threads and implement wait ()
system call.
(Demonstration)

3. Develop a program in C to implement inter-process communication (IPC) using shared


memory
(Exercise)

4. Develop a program in C to implement create and join operations on pthreads.


(Exercise)
5. Design, develop and run a program to implement the Banker’s algorithm. Demonstrate its
working with different data values. 10
(Exercise)

Pro Maxi Tota


cess Allocati mum l
on A B C ABC
ABCD D D
P1 2010 3211 644
P2 1100 1202 2
P3 1100 1120
P4 1010 3210
P52 1 0 1 0 1 0 1

6. Develop a program to create 10 threads and must print the thread ID based on their
priorities starting from 0 to 10
. (Structured Enquiry)
7. Design, develop and implement program in C to simulate the working of a scheduling
algorithm.
(Structured Enquiry)
8. Design, develop a program in C to implement a page replacement algorithm. Assume
suitable input required to demonstrate the results.
Input : Number of Frames = 3 , String = HELLO
(Structured Enquiry)
Open Ended Experiments

● Design and Develop a multi-threaded program along with synchronization constructs to


implement the following (Not limited to)
a) The Sleeping Teaching Assistant
b) The Dining Philosophers Problem
c) Producer – Consumer Problem
d) Reader- Writer Problem
e) Critical Section Problem

Weightages:
Type of Experiment Program Weightage
Numbers
Demonstration 1&2 22%
Exercise 3,4&5 34%
Structured Enquiry 6,7 & 8 44%
Open Ended 10%
Experiments

Textbooks
1. Abraham Silberchatz, Peter Galvin, Greg Gagne, Operating System concepts, 9th
edition,Wiley,2018.

Reference Books
1. Modern Operating Systems, Andrew S Tanenbaum and Herbert Bos, Fourth Edition, Pearson
Education,2014
2. Thomas Anderson and Michael Dahlin, Operating Systems: Principles and Practice, Recursive
Books, Second Edition, 2014
3. William Stallings, Operating Systems internals and design Principles, 7th Edition, 2017
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Explain the basics and functions of operating system
CO2 Apply the concepts of memory management policies, virtual memory, and scheduling techniques
for processes handling
CO3 Analyze processes and memory management in operating system
CO4 Present and demonstrate various concepts of operating system in a team

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2
CO2 3 3
CO3 2 2
CO4 2 2 2
AVG 2.5 2 2 2 2 2.5
SEMESTER – V
Course Name : Software Engineering and Testing Course Code: 21CS53
Number of Lecture Hours
: 03 CIE Marks: 50
/ Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic understanding of computer fundamentals theory
Course Overview
Software engineering is a detailed study of software design, development, testing, and maintenance.
Students will gain knowledge on various software development, testing and maintenance processes
practiced in the Software industry.
Course Learning Objectives (CLOs)
● To understand the different phases of software development with professional and ethical
responsibility.
● To come up with an idea of using various process models in the software industry according to
given circumstances.
● To gain the knowledge on how Analysis, Design, Implementation, Testing and Maintenance
processes are conducted in a software project
Teaching
Modules
Hours
Module 1
Introduction: Professional Software Development, Software Engineering Ethics, Case
Studies.
Software Processes Models: Software process models, Process activities, Coping with
Change. 08
Agile Software Development: Agile methods, Agile development techniques, Agile project
management. Scaling agile methods.
SLE: Case Study-Insulin Pump
Textbook 1: Ch. 1, Ch. 2.1, 2.2, 2.3 Ch. 3
Module 2
Requirements Engineering: Functional and non-functional requirements. Requirements
Engineering Processes. Requirements Elicitation. Requirements Specification.
Requirements validation. Requirements change. 08
System Modelling: Context models. Interaction models. Structural models. Behavioral
models.
SLE: Model-driven architecture
Textbook 1: Ch. 4, Ch. 5
Module 3
Design and Implementation: Object-oriented design using the UML
Project Planning: Software pricing. Plan-driven development. Project scheduling. Agile
08
Planning. Estimation techniques. COCOMO cost modelling.
SLE: Design Patterns
Textbook 1: Ch. 7.1,7.2 Ch. 23
Module 4
A Perspective on Testing: Basic Definitions, Test Cases, Insights from a Venn Diagram,
Identifying Test Cases, Levels of Testing.
Examples: Generalized Pseudocode, The Triangle Problem, The Next Date Function, The
Commission Problem. 08
Software Testing Types: Development testing, Test-driven development, Release testing,
User testing.
SLE: Error and Fault Taxonomies
Textbook 1: Ch. 8
Textbook 2: Ch. 1, Ch. 2
Module 5
Boundary Value Testing: Boundary value analysis, Robustness Testing, Worst Case
Testing, Special Value Testing, Examples, Random Testing, Guidelines for Boundary Value
Testing.
Equivalence Class Testing: Equivalence Classes, Equivalence Class Test Cases for The
Triangle Problem, NextDate Problem and The Commission Problem, Guidelines and 08
Observations.
Decision Table Based Testing: Decision Tables, Test Cases for the Triangle Problem,
NextDate Problem and The Commission Problem, Guidelines and Observations.
SLE: Random Testing
Textbook 2: Ch. 5, Ch. 6, Ch.7
Textbooks
1. Ian Sommerville: Software Engineering, 10th Edition, Pearson Education, 2017.
2. Paul C. Jorgensen: Software Testing - A Craftsman’s Approach, Fourth Edition, Auerbach
Publications.
Reference Books
1. Roger S. Pressman: Software Engineering-A Practitioner's approach, 8/e Paperback – 19 March
2019. Tata McGraw Hill.
2. Aditya P Mathur: Foundations of Software Testing, Pearson Education 2015 edition.
Course Outcomes (COs)
At the end of the course students will be able to
Explain the concepts of software development with professional, ethical responsibility as a
CO1
software engineer
CO2 Illustrate various phases of the software development lifecycle
CO3 Examine the test cases and Classify the problem into suitable testing techniques
CO4 Demonstrate various test cases for the given real time scenario in a team.
CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 2 2

CO3 2 2

CO4 2 2

AVG 2 2 2 2 2
SEMESTER – V
Course Name : Automata Theory Course Code: 21CS54
Number of Lecture Hours
: 03 CIE Marks: 50
/ Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic knowledge of problem-solving skills, logical thinking and discrete mathematics are required to learn
the course.
Course Overview
This course helps the student to design an abstract machine to accept any formal languages, which will help
the student to understand the design process need to be followed for any problem.
Course Learning Objectives (CLOs)
• Learn about different abstract models of computing, decidability and Undecidability.
• Design regular expressions and grammar for different formal languages.
• Prove or disprove theorems in automata theory using their properties.
• Design various abstract models such as Finite State Machine, Pushdown automata & Turing
machine.
Teaching
Modules
Hours
Module 1
Why study the Theory of Computation, Languages and Strings: Strings, Languages. A
Language Hierarchy, Computation, Finite State Machines (FSM): Deterministic FSM,
Regular languages, Designing FSM, Nondeterministic FSMs, From FSMs to Operational
08
Systems, Simulators for FSMs, Minimizing FSMs, Finite State Transducers, Bidirectional
Transducers.
SLT: Canonical form of Regular languages
Textbook 1: Ch 1,2, 3,4, 5.1 to 5.10
Module 2
Regular Expressions (RE): what is a RE? Kleene‟s theorem, Manipulating and Simplifying
REs. Regular Grammars: Definition, Regular Grammars and Regular languages. Regular
Languages (RL) and Non-regular Languages: How many RLs, to show that a language is 08
regular, Closure properties of RLs, to show some languages are not RLs.
SLT: Applications of Regular Expressions
Textbook 1: Ch 6, 7, 8: 6.1 to 6.4, 7.1, 7.2, 8.1 to 8.4
Module 3
Context-Free Grammars (CFG): Introduction to Rewrite Systems and Grammars, CFGs
and languages, designing CFGs, simplifying CFGs, proving that a Grammar is correct,
Derivation and Parse trees, Ambiguity, Normal Forms. Pushdown Automata (PDA):
Definition of non-deterministic PDA, Deterministic and Non-deterministic PDAs, Non-
08
determinism and Halting, alternative equivalent definitions of a PDA, alternatives that are
notequivalent to PDA.
SLT: Closure properties of CFLs
Textbook 1: Ch 11, 12: 11.1 to 11.8, 12.1, 12.2, 12,4, 12.5, 12.6
Module 4
Algorithms and Decision Procedures for CFLs: Decidable questions, Un-decidable
questions. Turing Machine: Turing machine model, Representation, Language acceptability
by TM, design of TM, Techniques for TM construction. Variants of Turing Machines (TM),
08
The model of Linear Bounded automata.
SLT: Other undecidable problems
Textbook 1: Ch 14: 14.1, 14.2, Textbook 2: Ch 9.1 to 9.8
RBT: L1, L2, L3
Module 5
Decidability: Definition of an algorithm, decidability, decidable languages, Undecidable
languages, halting problem of TM, Post correspondence problem. Complexity: Quantum
Computation: quantum computers, Church- Turing thesis. Applications: G.1 Defining syntax
of programming language, Appendix J: Security. 08
SLT: Growth rate of functions, the classes of P and NP
Textbook 2: 10.1 to 10.7, 12.1, 12.2, 12.8, 12.8.1, 12.8.2
Textbook 1: Appendix: G.1(only), J.1 & J.2RBT: L1, L2, L3
Textbooks
1. Elaine Rich, Automata, Computability and Complexity, 1st Edition, Pearson education, 2012 / 2013.
2. K L P Mishra, N Chandrasekaran, 3rd Edition, Theory of Computer Science, PhI, 2012.
Reference Books
1. John E Hopcroft, Rajeev Motwani, Jeffery D Ullman, Introduction to Automata Theory, Languages,
and Computation, 3rd Edition, Pearson Education, 2013.
2. Michael Sipser: Introduction to the Theory of Computation, 3rd edition, Cengage learning, 2013.
3. John C Martin, Introduction to Languages and the Theory of Computation, 3rd Edition, Tata
McGraw –Hill Publishing Company Limited, 2013.
4. Peter Linz, “An Introduction to Formal Languages and Automata”, 3rd Edition, Narosa Publishers,
1998.
5. Basavaraj S. Anami, Karibasappa K G, Formal Languages and Automata theory, Wiley India, 2012.
6. C K Nagpal, Formal Languages and Automata Theory, Oxford University press, 2012.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Acquire fundamental concepts of automata theory and computability
Apply the concept of regular expressions, context free grammars and automata theory in
CO2
construction of programming languages
CO3 Analyze various models of computation and languages
CO4 Simplify and Design CFG, PDA and Turing machine for a given language or grammar
CO5 Demonstrate the working of an automaton using a modern tool

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 2
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
AVG 2 2 2 2 2
SEMESTER – V
Course Name : Full Stack Development-I Course Code: 21CS551
Number of Lecture Hours
: 03 CIE Marks: 50
/ Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic understanding of Programming skills and JavaScript.
Course Overview
The course provides a fundamental understanding of full-stack web development tools and techniques,
with a particular focus on Node and Angular components of the MEAN stack which a powerful
combination of technologies that enables developers to build dynamic and scalable web applications
Course Learning Objectives (CLOs)
● Understanding of Nodejs runtime environment for JavaScript
● Familiarize with Typescript scripting
● Acquaintance with Angular framework for front-end web application development
Teaching
Modules
Hours
Module 1
Node and NPM Of JavaScript Runtimes and Building (Mostly) Servers First Baby Steps with
Node: Installation More Useful: Executing JavaScript Source Files Node’s Partner in Crime:
NPM A Few More NPM Commands Initializing a New NPM/Node Project Adding
Dependencies A Quick Aside: Semantic Versioning Fisher Price’s “My First Node Web
Server” Bonus Example: Advanced Node and NPM : More on package.json NPM: Other 08
Commands Auditing Package Security Deduplication and Pruning Finding/Searching for
Packages sans Browser Updating Packages Publishing/Unpublishing Packages Node:
Standard Modules File System (fs) HTTP and HTTPS (http and https) OS (os) Path (path)
Process Query Strings (querystring) URL (url) Utilities (util)
SLT: The Rest of the Cast
Module 2
Typescript: Angular is built in Typescript, types, classes, utilities, Advanced TypeScript Interfaces
Argument/Object Interfaces Methods in Interfaces Interfaces and Classes Extending Interfaces
08
Namespaces and Modules Namespaces Modules Decorators Decorator Factories Third-Party
Libraries Debugging TypeScript,
SLT: AppsSource Maps
Module 3
How Angular Works: Application, product model, components, component decorator, The
Products List Component, etc., NgModule and Booting the App. Built-in directives: NgIf, 08
NgSwitch, NgStyle, NgClass, NgFor, NgNonBindable.
SLT: Inventory management app components
Module 4
Forms in Angular: FormControls and FormGroups, Our First Form, Reactive Forms with
FormBuilder, Adding Validations, Watching For Changes, ngModel, Dependency Injection: 08
Injections Example: PriceService, Dependency Injection Parts, Playing with an Injector,
Providing Dependencies with NgModule, Providers are the Key,
SLT: Dependency Injection in Apps
Module 5
Http: Using @angular/common/http, basic request, Routing: Why Do We Need Routing?
How client-side routing works, Components of Angular routing, Putting it all together, 08
Routing Strategies
SLT: Route parameters
Textbooks
1. Frank Zammetti-Modern Full-Stack Development Apress 2020
2. Nate Murray, Felipe Coury, Ari Lerner, and Carlos Taborda, ng-book, The Complete Guide to Angular,
Fullstack.io, 2018
Reference Books
1. Basarat Ali Syed - Beginning Node.js-Apress, 2014.
2. Anthony Accomazzo, Ari Lerner, Clay Allsopp, David Guttman, Tyler Mcginnis, Nate Murray,
FullStack React The Complete Guide to ReactJS & Friends, Fullstack.io, 2017
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Explain the basic setup and tools for full stack web application development
CO2 Apply various commands and constructs of Angular to execute specific operations
CO3 Examine application structure and their dependencies and interactions in an Angular application
CO4 Design front-end component of a web application using Angular framework

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 3 3

CO3 2 2

CO4 2 2 2

AVG 2.5 2 2 2 2.25


SEMESTER – V
Course Name : Cryptography Course Code: 21CS552
No. of Lecture Hours /
: 03 CIE Marks: 50
Week
No. of Tutorial / Practical
: 00 SEE Marks: 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial / Practical Hours
L: T: P : 3:0:0 CREDITS: 03
Course Prerequisites
Basic knowledge of calculus and linear algebra
Course Overview
This course emphasizes on principles and practice of modern applied cryptography: classical systems,
symmetric block ciphers like DES, AES and public-key cryptography algorithms. The course discusses
the inner workings of cryptographic systems and how to correctly use them in real-world
applications.
Course Learning Objectives (CLO)
This course will enable students to:
• To understand basic cryptographic concepts and methods
• To deeply understand how modern cryptographic schemes work and necessary mathematical
concepts involved
• Illustrate the structure and working principle of DES & AES Algorithms
• Demonstrate the working of public key cryptosystem
Teaching
Modules
Hours
Module 1
Introduction to Cryptography and Data Security: Overview of Cryptology, Symmetric
Cryptography, Cryptanalysis, Modular Arithmetic and More Historical Ciphers 08
SLT: How Many Key Bits Are Enough?
Textbook 1:Ch.1.1-1.4
Module 2
The Data Encryption Standard (DES): Introduction to DES, Overview of the DES
Algorithm, Internal Structure of DES, Decryption, Security of DES 08
SLT: Analytical Attacks
Textbook 1: Ch.3.1-3.5
Module 3
The Advanced Encryption Standard (AES): Introduction, Overview of the AES
Algorithm, A Brief Introduction to Galois Fields, Internal Structure of AES, Decryption 08
SLT: Multiplication, Inversion in GF
Textbook 1: Ch.4.1-4.5
Module 4
Introduction to Public-Key Cryptography, The RSA Cryptosystem: Symmetric vs.
Asymmetric Cryptography , Practical Aspects of Public-Key Cryptography, Essential
Number Theory for Public-Key Algorithms
08
The RSA Cryptosystem: Introduction , Encryption and Decryption ,Key Generation and
Proof of Correctness, Encryption and Decryption
SLT: Euclidean , Extended Euclidean Algorithm
Textbook 1: Ch. 6.1-6.3, 7.1-7.4
Module 5 08
Public-Key Cryptosystems Based on the Discrete Logarithm Problem: Diffie–
Hellman Key Exchange , The Discrete Logarithm Problem, Security of the Diffie–Hellman
Key Exchange ,The Elgamal Encryption Scheme
SLT: Security of the Diffie–Hellman Key Exchange
Textbook 1:Ch.8.1, 8.3, 8.4, 8.5
Textbooks
1. Christof Paar, Jan Pelzl, Understanding Cryptography, A Textbook for Students and
Practitioners, 1st edition Springer-Verlag Berlin Heidelberg 2014
Reference Books
1. James F Kurose and Keith W Ross, Computer Networking, A Top-Down Approach, Sixth edition,
Pearson,2017
2. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th Edition,
Elsevier, 2019
3. Nader F. Mir: Computer and Communication Networks, 2nd Edition, Pearson Education, 2015
4. William Stallings, Data and Computer Communication 10th Edition, Pearson Education, Inc.,
2014
Course Outcomes (COs)
At the end of the course, students will be able to
CO1 Explain cryptography and its principles.
CO2 Illustrate various cryptographic algorithms used for secure data transmission
CO3 Perform cryptanalysis of cryptographic algorithms.
CO4 Explore cryptographic primitives for a given scenario using modern tools in a team.

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 3 3

CO3 2 2

CO4 2 2 2

AVG 2.5 2 2 2 2.25


SEMESTER – V
: Data Mining and Data
Course Name Course Code: 21CS553
Warehousing
No. of Lecture Hours /
: 03 CIE Marks: 50
Week
No. of Tutorial / Practical
: 00 SEE Marks: 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial / Practical Hours
L: T: P : 3:0:0 Credits: 03
Course Prerequisites
Basic knowledge of algorithms, statistics for data analytics or equivalent working knowledge is
required.
Course Overview
The course provides an insight into the basic concepts of data warehousing, online analytical
processing, and data cube technology. It also provides an opportunity to explore the concepts and
techniques of knowledge discovery and data mining.
Course Learning Objectives (CLO)
This course will enable students to:
• Define multi-dimensional data models
• Interpret rules related to association, classification and clustering analysis
• Apply appropriate classification/clustering algorithm for a given task
Teaching
MODULES
Hours
Module 1
Data Warehousing: Basic Concepts, What is a Data Warehouse? Difference between
Operational database Systems and Data Warehouses, Why have a Separate data
Warehouse? Data Warehousing: A Multitiered Architecture, Extraction, Transformation
and loading, metadata Repository.
Data Warehouse Modeling: Data Cube and OLAP, Data Cube: A multidimensional
08
data model, Stars, Snowflakes and Fact constellations: Schemas for multidimensional
Data models, Dimensions: The role of concept Hierarchies, Measures: Their
Categorization and computation, Typical OLAP Operations.
SLT: Data Warehouse Models: Enterprise Warehouse, Data Mart and Virtual
Warehouse
Textbook 2: Ch. 4.1, 4.2
Module 2
Data warehouse implementation, Efficient Data Cube computation: An overview,
Indexing OLAP Data: Bitmap index and join index, Efficient processing of OLAP Queries.
Data Mining, Introduction: What is Data Mining? Motivating Challenges, The Origins
08
of Data Mining, Data Mining Tasks. Data, Types of Data, Data Quality, Data
Preprocessing
SLT: OLAP server Architecture ROLAP versus MOLAP Versus HOLAP
Textbook 2: Ch. 4.4, Ch. 1.1-1.4, Ch. 2.1,2.3
Module 3
Classification, General Approach to solving a Classification Problem, Decision Tree
Induction, Model Overfitting, Nearest-Neighbour Classifiers, Bayesian Classifiers, 08
Artificial Neural Network(ANN).
SLT: Evaluating the performance of a Classifier
Textbook 1: Ch. 4.2-4.5, Ch. 5.2-5.4
Module 4
Cluster Analysis, Overview, K-Means, Agglomerative Hierarchical Clustering. DBSCAN,
Characteristics of data, clusters, and clustering algorithms, Which Clustering
08
Algorithm?
SLT: Scalability: General Issues and Approaches
Textbook 2: Ch. 8.1-8.4, Ch. 9.1,9.5.1,9.6
Module 5
Association Analysis, Problem Definition, Frequent Itemset Generation, Rule
Generation, Compact Representation of Frequent itemset, FP-Growth Algorithm. 08
SLT: Alternative Methods for Generating Frequent Itemsets
Textbook 1: Ch. 6.1-6.6
Textbooks
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Pearson, First
impression, 2016.
2. Jiawei Han, Micheline Kamber, Jian Pei: Data Mining -Concepts and Techniques, 3rd Edition,
Morgan Kaufmann Publisher, 2012.
Reference Books
1. Sam Anahory, Dennis Murray: Data Warehousing in the Real World, Pearson, Tenth Impression,
2012.
2. Michael.J.Berry, Gordon.S.Linoff: Mastering Data Mining, Wiley Edition, second edition, 2012.
CO1 Interpret the need for data warehousing and online analytical processing
CO2 Apply appropriate classification/clustering technique to solve a given data mining problem
CO3 Analyze the given pattern to describe associated features in the data
Illustrate data mining solutions for exploring a given dataset either individually or in a team,
CO4
using any of the data mining tools.

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 2

CO2 3 3

CO3 2 2

CO4 2 2 2

AVG 2.5 2 2 2 2.25


SEMESTER – V
: Computer Graphics and
Course Name Course Code: 21CS554
Visualization
No. of Lecture Hours /
: 03 CIE Marks: 50
Week
No. of Tutorial / Practical
: 00 SEE Marks: 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration: 03 Hrs
Tutorial / Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic knowledge of programming, linear algebra, data structures and algorithms.
Course Overview
This course will introduce students to all aspects of computer graphics including hardware, software and
applications. Students will gain experience using a graphics application programming interface by
completing several programming projects.
Course Learning Objectives (CLO)
This course will enable students to,
● Understand the basics of graphics primitives
● Familiarize with various scan conversion methods on graphics primitives
● Understand various transformations, viewing and clipping techniques on both two dimensional
and three-dimensional objects
Teaching
Modules
Hours
Module 1
Introduction to Computer Graphics and OpenGL
Computer Graphics: Basics of computer graphics, Application of Computer Graphics,
Video Display Devices: Random Scan and Raster Scan displays, graphics software. 08
Coordinate representations, Graphics functions, Software standards
OpenGL: Basic OpenGL syntax, Header files, Display window management using GLUT
SLT: Other graphics packages
Module 2
Graphics Primitives
Coordinate reference frame, specifying two-dimensional world coordinate reference
frames in OpenGL, OpenGL point functions, OpenGL line functions, Fill area primitives,
OpenGL Polygon Fill-Area Functions, point attributes, line attributes, curve attributes, 08
OpenGL point attribute functions, OpenGL line attribute functions, Fill area attributes,
OpenGL fill area attribute functions, Line drawing algorithms (DDA, Bresenham’s), Circle
generating algorithms (Midpoint), General scan line polygon fill algorithm
SLT: Front and back polygon faces
Module 3
Two dimensional Geometric Transformations and Two dimensional viewing
Two dimensional Geometric Transformations: Basic 2D Geometric Transformations,
08
matrix representations and homogeneous coordinates. Inverse transformations,
2DComposite transformations, other 2D transformations, OpenGL raster
transformations, OpenGL geometric transformations functions
Two dimensional viewing: 2D viewing pipeline, Clipping: clipping window,
normalization and viewport transformations, clipping algorithms, 2D line clipping
algorithms: Cohen Sutherland line clipping only, polygon fill area clipping: Sutherland-
Hodgeman polygon clipping algorithm only OpenGL 2D viewing functions
SLT: 2D point clipping
Module 4
Three dimensional Geometric Transformations and three dimensional viewing
Three dimensional Geometric Transformations: 3D translation, rotation, scaling,
composite 3D transformations, other 3D transformations, affine transformations,
OpenGL geometric transformations functions
08
Three dimensional Viewing: 3D viewing concepts, 3D viewing pipeline, 3D viewing
coordinate parameters , Transformation from world to viewing coordinates, Projection
transformation, orthogonal projections, perspective projections, The viewport
transformation and 3D screen coordinates. OpenGL 3D viewing functions
SLT: Affine transformations
Module 5
Curved surfaces, Bezier spline curves, Color and Illumination Models
Curved surfaces, quadric surfaces, Super quadrics, OpenGL Quadric-Surface and Cubic-
Surface Functions
Bezier Spline Curves: Bezier curve equations, properties 08
Color Models: Properties of light, color models, RGB and CMY color models
Illumination Models: Light sources, basic illumination models- Ambient light, diffuse
reflection, specular and Phong model
SLT: OpenGL functions for curved surfaces, illumination models
Textbooks
1. Donald Hearn & Pauline Baker: Computer Graphics with OpenGL Version, 4th Edition, Pearson
Education,2011
Reference Books
1. James D Foley, Andries Van Dam, Steven K Feiner, John F Huges Computer graphics with OpenGL,
Pearson education,2014
2. Xiang, Plastock, Computer Graphics, sham’s outline series, 2nd edition, Tata McGraw hill,2015
3. Rajesh K. Maurya, Computer Graphics with Virtual Reality System, Wiley 3rd edition, 2018
Course Outcomes (COs)
At the end of the course students will be able to
Understand the fundamental concepts of computer graphics, Curved surfaces and Bezier spline
CO1
curves.
Illustrate various scan conversion, geometric transformations, and viewing methods on 2D and
CO2
3D objects.
CO3 Analyze three dimensional geometric transformations and viewing for 3D objects.
CO4 Explore and implement computer graphics applications using OpenGL individually or in a team.
CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 2
CO2 3 3
CO3 2 2
CO4 2 2 2
AVG 2.5 2 2 2 2.25
SEMESTER – V
Course Name : Introduction to Data Structures Course Code: 21CS561
Number of Lecture Hours /
: 03 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic knowledge of programming is required to learn the course.
Course Overview
This course enables students to learn basic algorithms, data structures and implementation of the data
structures like linked lists, stacks, queues, trees, heaps, hash tables and graphs. Course also examines
algorithms for manipulating queues, traversing, and searching in trees and finding shortest paths in
graphs.
Course Learning Objectives (CLOs)
● Understand the foundations of data structure and how different data structures are used for
effective data access and data manipulation.
● Understand the context of problem definition and implement a suitable data structure to solve
it.
● Investigate various data structures such as stacks, queues, linked lists, trees and graphs.
Teaching
Modules
Hours
Module 1
C-Recap I: Introduction to C, constants, variables, data types, input output operations,
operators, and expressions.
08
C-Recap II: control Statements, arrays, strings, built-in functions, user defined functions,
structures, and pointers.
SLT: unions
Module 2
Algorithms: Asymptotic notations, Introduction to data structures, Types of data
structures, data structure operations.
Arrays: Types of arrays, representation of one-dimensional arrays, Array traversal, 08
insertion and deletion, representation of multi-dimensional array, realizing matrices using
two dimensional arrays, matrix operations.
SLT: Sorting and searching
Module 3
Linked lists: Introduction, basic concept, linked list implementation, types of linked list,
circular linked list, doubly linked list. 08
Stacks: stacks, stack operations, stack implementation using arrays.
SLT: stack implementation using linked list
Module 4
Queues: Introduction, basic concept, operations, queue implementations, circular queue.
Trees: Introduction, basic concept, binary tree, binary tree representation, binary tree 08
traversal.
SLT: Binary search tree
Module 5
Graphs: Introduction, basic concept, graph terminology, graph implementation-
adjacency matrix, path matrix, adjacency list, shortest path algorithm, Graph traversal-
08
breadth first search and depth first search.
Searching: hashing
SLT : Sorting: Insertion sort
Textbooks
1. Data structures using C, E Balagurusamy, McGraw Hill education (India) Pvt. Ltd, 2013.
Reference Books
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Ed, Universities
Press, 2014.
2. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Explain the fundamentals of basic data structures.
CO2 Implement various data structures and its applications.
CO3 Analyze the various operations on data structures.
Design and Demonstrate appropriate solution in a team by implementing suitable data
CO4
structure for a given problem.

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2

CO2 2 3

CO3 2

CO4 2 2

AVG 2 2 3 2 2
SEMESTER – V
: Introduction to Database
Course Name Course Code: 21IS562
Management System
Number of Lecture Hours /
: 03 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
A Good understanding of basic computer concepts and set theory.
Course Overview
The course provides fundamental understanding of database management systems, query retrieval,
normalization and transaction management..
Course Learning Objectives (CLOs)
● Identify and define the information that is needed to design a database management system
for a given problem.
● Build a database management system that satisfies relational theory and provides users with
business queries, forms and reports.
● Understand the core terms, concepts, and tools of relational database management systems.
● Learning the language for creating and manipulating the database viz SQL.
● Understanding the concept of Transaction Management and concurrency control
Teaching
Modules
Hours
Module 1
Introduction to Database Databases and Database users: Introduction,
Characteristics of database approach, Advantages of using the DBMS approach,
Database system concepts: Data Models, Schemas, and Instances. Three schema
08
architecture and data independence, database languages, and interfaces, The Database
System environment.
SLE: Centralized and Client/Server architecture of DBMS
Textbook 1: Ch. 1.1 to 1.3,1.6, 2.1 to 2.5
Module 2
Data Modelling using Entities and Relationships Model: using high-level conceptual
data models for Entity types, Entity sets, attributes, roles, and structural constraints,
Weak entity types, ER diagrams examples. Relational Data Model: Relational Data
08
Model and Relational Database Constraints: Relational Model Concepts, Relational
Model Constraints and relational database schemas, Update operations, transactions.
SLE: Dealing with constraint violations.
Textbook 1: Ch. 3.1 to 3.5,5.1 to 5.3
Module 3
Structured Query Language: Basic SQL: SQL data definition and data types, specifying
constraints in SQL, retrieval queries in SQL, INSERT, DELETE, and UPDATE statements
08
in SQL, More SQL: More complex SQL retrieval queries, Specifying constraints as
assertions and action triggers, Views in SQL, Schema change statements in SQL.
SLE: Additional features of SQL
Textbook 1: Ch. 6.1-6.5,7.1 to 7.4
Module 4
Database design: Informal Design Guidelines for Relation Schemas; Functional
Dependencies; General Definitions of Second and Third Normal Forms; Boyce Codd
08
Normal Form, Join Dependencies and Fifth Normal Form
SLE: Normal Forms Based on Primary Keys.
Textbook 1: Ch. 14.1 to 14.7
Module 5
Transaction Processing, Concurrency Control: Transaction Processing: Introduction
to Transaction Processing, Transaction and System concepts, Desirable properties of
Transactions, characterizing schedules based on Serializability, Concurrency Control in 08
Databases:
SLE: Two-Phase Locking Techniques for Concurrency Control
Textbook 1: Ch. 20.1, 20.2.1, 20.3, 20.5.1,20.5.2,21.1.1
Textbooks
1. Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th Edition,
2017, Pearson.
Reference Books
1. Silberschatz Korth and Sudharshan, Database System Concepts, 6th Edition, Mc-GrawHill,
2013.
2. Coronel, Morris, and Rob, Database Principles Fundamentals of Design, Implementation
Management, Cengage Learning 2012
3. Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014, McGraw
Course Outcomes (COs)
At the end of the course students will be able to
Explain the concepts of database, relational database schema design, query processing and
CO1
transaction management.
Apply the relational model database query retrieval techniques using structured query
CO2
language.
CO3 Design an ER diagram, schema and relational database for a given requirement specification.
CO4 Develop a database application software for catering to the societal needs.

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2
CO2 2
CO3 2
CO4 2
AVG 2 2 2
SEMESTER – IV
Course Name : Basics of Artificial Intelligence Course Code: 21CI563
Number of Lecture Hours /
: 03 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic Knowledge of machine learning, problem-solving skills, mathematics
Course Overview
This course is designed to give a graduate-level student a thorough grounding in the methodologies,
technologies, mathematics, and algorithms currently needed for machine learning.
Course Learning Objectives (CLOs)
This course will enable students to,
• Understand the basic theory of Artificial Intelligence and Machine learning.
• Illustrate supervised and unsupervised Learning.
• Understand Bayesian techniques to solve machine learning problems.
• Statistical analysis of machine learning techniques.
Teaching
Modules
Hours
MODULE 1
Introduction: What is AI? Foundations of AI.
Intelligent Agents: Agents and environment, Concept of Rationality, The nature of 08
environment, The structure of agents.
SLT: History of AI
Textbook 1: Chapter 1- 1.1, 1.2, 1.3 Chapter 2- 2.1, 2.2, 2.3, 2.4
MODULE 2
Problem‐solving: Problem‐solving agents, Example problems, Searching for Solutions
08
SLT: Real-world problems
Textbook 1: Chapter 3- 3.1, 3.2, 3.3
MODULE 3
Uninformed Search Strategies: Breadth First search, Uniform cost search, Depth First
Search, Depth limited search, Iterative deepening depth first search, Bidirectional Search,
08
Comparing uninformed search strategies.
SLT: Logic
Textbook 1: Chapter 3-3.4
MODULE 4
Informed Search Strategies: Heuristic functions, Greedy best first search, A*search.
Functions Logical Agents: Knowledge–based agents, The Wumpus world, Propositional
08
logic, Reasoning patterns in Propositional Logic
SLT: Logic
Textbook 1: Chapter 3-3.5, 3.6. Chapter 7- 7.1, 7.2, 7.3, 7.4.
MODULE 5
First Order Logic: Representation Revisited, Syntax and Semantics of First Order logic,
Using First Order logic. 08
Inference in First Order Logic: Propositional Versus First Order Inference, Unification,
Forward Chaining, Resolution SLT: First order logic-representation revisited.
SLT: Backward Chaining
Textbook 1: Chapter 8- 8.1, 8.2, 8.3 Chapter 9- 9.1, 9.2, 9.3, 9.4, 9.5
Textbooks
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence, 3rd Edition, Pearson,2015
Reference Books
1. Saroj Kaushik, Artificial Intelligence, 3rd Edition, Cengage learning, 2014,
ISBN-13:978-8131510995.
2. Elaine Rich, Kevin Knight: “Artificial Intelligence”, 3rd Edition, Tata McGraw
Hill, 2018, ISBN-13: 9780070087705.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Understand the fundamental knowledge of artificial intelligence
CO2 Apply the basic principles of AI in problem solving and knowledge representation

CO3 Analyze the key components of intelligent agents and evaluate their performance

CO4 Explore the real-world application in AI and present as a team

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2
CO2 3
CO3 2
CO4 2 2 2
AVG 2.5 2 2 2 2
SEMESTER – V
Course Name : Introduction to OOP with Java Course Code: 21IS564
Number of Lecture Hours /
: 03 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 40 SEE Duration: 03 Hrs.
Tutorial/Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Overview
This course is paced to provide a Basic fundamental of Java, also provides intensive hands-on experience
to the students. Besides learning the basic structure and syntax of the language, students will also learn
object-oriented principles and how they are applied in Java applications.
Course Learning Objectives (CLOs)
• Familiarize with Java environment and other integrated environment
• To understand the fundamental features of object-oriented language with JAVA
• To know multi-threaded programs and exception handling mechanisms
• To learn Database connectivity using JDBC
Teaching
Modules
Hours
Module 1
The Java Language: Java’s magic: the Byte code; Object-oriented programming; Simple
Javaprogram, Data types. Variables and Arrays. 08
SLT: Java Buzzwords
Textbook: Ch: 1, 2, 3
Module 2
Operators, Control Statements, Introducing Classes: Class Fundamentals, Declaring
Objects, Assigning Object Reference Variables, Introducing Methods, Constructors, This
08
Keyword, The finalize() method.
SLT: Garbage Collection
Textbook: Ch: 4, 5, 6
Module 3
A Closer Look at Methods and Classes: Overloading methods, Inheritance: inheritance
basics, using super, creating multi-level hierarchy, Method Overriding, dynamic method
08
dispatch, using abstract classes, using final with inheritance.
SLT: Using Objects as Parameters
Textbook: Ch: 7, 8
Module 4
Packages and Interfaces: Packages, Access Protection, Importing Packages, Interfaces,
Exception handling: Exception handling fundamentals, Exception types, uncaught
exceptions, Using Try and catch, Multiple catch clauses, Nested try statements, throw, 08
throws, finally.
SLT: variables in interfaces.
Textbook: Ch: 9, 10
Module 5
Multi-Threaded Programming: Java Thread Model, The main thread, Creating a thread,
Creatingmultiple threads, Using isAlive() and join(), Thread priorities. 08
SLT: Thread priorities
Textbook: Ch: 11
Textbooks
1. Herbert Schildt, “JAVA the Complete Reference”, 10th Edition, Oracle Press, 2017.
Reference Books
1. E Balaguruswamy, “Programming with Java”, 5th Edition, McGraw Hill Education, 2017.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Explain the fundamentals of JAVA programing.
Apply the concepts of object-oriented programming and multithreading to solve real-world
CO2
problem.
CO3 Design solutions to given problem with suitable exception handling methods.
CO4 Develop modularized solution for the given problem statements using any IT tools. (PO5)

CO – PO – PSO Matrix
PO PSO
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 2
CO3 2
CO4 2

AVG 2 2 2 2
SEMESTER – V
Course Name : Introduction to Python Programming Course Code: 21CS565
Number of Lecture
: 03 CIE Marks: 50
Hours / Week
Number of
Tutorial / Practical : 00 SEE Marks: 50
Hours / Week
Total Number of
Lecture +
: 40+00=40 SEE Duration: 03 Hrs
Tutorial/Practical
Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisites
Basic knowledge of working with commands, logical thinking and problem-solving skills are required to learn
the course.
Course Overview
In this course the students will gain knowledge on the basic concepts of python syntax and semantics, core
programming concepts like data structures, conditionals, loops, variables, writing custom functions, reading
and writing to files. This course includes an overview of the various tools available for writing and
running Python.
Course Learning Objectives (CLOs)
• Understand the Syntax and Semantics and create Functions in Python
• Handle Strings and Files in Python
• Implement Object Oriented Programming concepts in Python
• Illustrate the process of structuring the data using the Lists, Dictionaries and Regular expressions in
Python
Teaching
Modules
Hours
Module 1
The way of the program, variables, expressions and statements, functions
08
SLT: case study: interface design
Textbook 1: Ch. 1,2,3
Module 2
Conditionals and recursion, Iterations, Strings
08
SLT: Case study: word play
Textbook 1: Ch. 5,7,8
Module 3
Lists, Dictionaries, Tuples
08
SLT: Case study: data structure selection
Textbook 1: Ch. 10,11,12
Module 4
Classes and objects, Classes and functions, Classes and methods
08
SLT: Type-based dispatch
Textbook 1: Ch. 15,16,17
Module 5 08
Inheritance, The goodies, files
SLT: Debugging
Textbook 1: Ch. 18,19,14
Textbooks
1. Allen B. Downey, "Think Python: How to Think Like a Computer Scientist”, 2ndEdition, Green Tea Press, 2015.
(http://greenteapress.com/thinkpython2/thinkpython2.pdf) (Download pdf files from the above links)
Reference Books
1. Charles Dierbach, "Introduction to Computer Science Using Python", 1st Edition, Wiley India Pvt
Ltd, 2015. ISBN-13: 978-8126556014
2. Gowrishankar S, Veena A, “Introduction to Python Programming”, 1st Edition, CRC Press/Taylor &
Francis, 2018. ISBN-13: 978-0815394372
3. Mark Lutz, “Programming Python”, 4th Edition, O’Reilly Media, 2011.ISBN-13: 978- 9350232873
4. Reema Thareja, “Python Programming Using Problem Solving Approach”, Oxford university press,
2017. ISBN-13: 978-0199480173

Course Outcomes (COs)


At the end of the course students will be able to
CO1 Describe the syntax, semantics of Python and be fluent with its flow control and functions.
Apply various constructs and data structure like lists, dictionaries, tuples to design and develop python
CO2
program.
CO3 Analyze the concepts of Object-Oriented Programming used in Python.
Develop python program to solve real world problems using various IDE’s and packages. (Additional
CO4
CO- PO5)

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 3 1
CO3 2
CO4 2 2
AVG 2.5 2 1 2 2
SEMESTER – V
: Technical Proficiency Enhancement
Course Name Course Code : 21TP57A
Course- III
Number of Lecture Hours
: 00 CCE Marks : 50
/ Week
Number of Tutorial /
: 02 SEE Marks : 50
Practical Hours / Week
Total Number of Lecture +
: 24 SEE Duration : 2h
Tutorial/Practical Hours

L:T:P : 0:0:2 CREDITS : 01

COURSE PREREQUISITES: Working knowledge of C Programming and Data Structures


COURSE OVERVIEW: This course is designed to enhance an individual’s problem-solving, analytical,
and critical thinking skills using data structures and dynamic programming. It also helps the students to
acquire skills for career development, competitive exams, and job recruitment processes.
COURSE LEARNING OBJECTIVES (CLO)
• To enhance problem-solving skills
• To develop technical Skill in advanced Data Structures and Dynamic Programming
• 3. To Prepare students for job recruitment process and competitive exams
TEACHING
MODULES
HOURS
MODULE 1: Advanced Data Structures 1
Priority Queues: Introduction to Priority Queues, Ways to implement priority queues,
Introduction to heaps, Introduction to Complete Binary Trees and its implementation,
06
Insert and Delete operations in heaps, Implementing priority queues, Heap sort, Inbuilt
Priority Queue.

MODULE 2: Advanced Data Structures 2


Hashmaps: Introduction to Hashmaps, Inbuilt Hashmap, Hash functions, Collision
06
handling, Insert and Delete operation implementation in hashmap, Load factor, Rehashing.

MODULE 3: Advanced Data Structures 3


Tries: Introduction to Tries, Making a Trie Node class, Insert, Search and Remove
operation implementation in Tries, Types of Tries, Huffman coding.
06
Graphs: Introduction to Graphs, Graph Terminology, Graph implementation, Graph
Traversals (DFS and BFS), Weighted and Directed Graphs, Minimum Spanning Trees, Cycle
Detection in Graphs, Kruskal's algorithm, Prim's Algorithm, Dijkstra's algorithm.

MODULE 4: Dynamic Programming 1


Introduction to Dynamic Programming: Introduction to Memoization, Introduction to
Dynamic Programming, Fibonacci numbers using recursion, memoization and dynamic 06
programming.

MODULE 5: Dynamic Programming 2 06


Applications of Dynamic Programming: Longest Common Subsequence (LCS) using
recursion, memoization and dynamic programming, Edit distance using recursion,
memoization and dynamic programming, Knapsack problem using recursion,
memoization and dynamic programming.
Reference Books:
1. Data Structures and Algorithms Made Easy by Narasimha Karumanchi
2. Data Structures through C in Depth by by S K Srivastava and Deepali Srivastava
COURSE OUTCOMES (COs):
Upon completion of the course, students will be able to
Apply and solve complex problems efficiently using Advanced Data Structures and Dynamic
CO1
Programming.
CO2 Develop critical thinking skills, enabling them for job interviews and assessment tests.

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3
CO2 3
AVG 3 3
SEMESTER – V
Course Name : Environmental Studies Course Code: 21HS58A
Number of Lecture Hours /
: 01 CIE Marks: 50
Week
Number of Tutorial /
: 00 SEE Marks: 50
Practical Hours / Week
Total Number of Lecture +
: 15 SEE Duration: 02 Hrs.
Tutorial/Practical Hours
L:T:P : 1:0:0 Credits: 01
Course Overview
The need for sustainable development is a key to the future of mankind. Continuing problems of
pollution, solid waste disposal, degradation of environment, Global warming, depletion of ozone
layer and loss of biodiversity have made everyone aware of environmental issues. This course
focuses on Environment, ecosystem, natural resources and other issues related to it. It also deals
with the Environmental legislation and waste management
Course Learning Objectives (CLOs)
• Identify the major challenges in environmental issues
• Develop skills, critical thinking and demonstrate socio-economic skills for Environment
protection
• Analyze the impact of specific issues and plan strategies for environmental management
Teaching
Modules
Hours
Module 1 : Ecosystem and Sustainability
Ecosystem: Types & Structure of Ecosystem: Forest, Desert, Wetlands, Riverine,
Oceanic. 03
Sustainability: 17SDG targets and possible actions
SLT: Components of environment
Module 2: Natural resources and Energy
Natural Resources: Water resources – Availability & Quality aspects, Water borne
diseases & water induced diseases, Fluoride problem in drinking water, Material
Cycles – Carbon Cycle, Nitrogen Cycle & Sulphur Cycle. 03
Energy :Different types of energy, Conventional sources & Non -Conventional sources
of energy : Solar energy, Wind Energy, Hydrogen as an alternative energy
SLT: Alternative Energy sources
Module 3: Environmental Pollution
Environmental Pollution: Water Pollution, Noise pollution, Air pollution (Sources,
Impacts, Preventive measures and Public Health Aspects). 03
SLT: Case studies of water act
Module 4: Waste management
Waste management : Solid Waste Management, E - Waste Management & Biomedical
Waste Management - Sources, Characteristics 03
Environmental Legislation : Solid Waste Management Rules,2016
SLT: Case studies of water quality issues
Module 5
Global Concerns: Global warming, Climate change, Acid rain, Ozone depletion,
Field work: Visit to Environmental Engg. Lab, Zero Waste Management Plant and 03
Solid waste management plant
SLT: Case studies of global warming
Textbooks
1. S M Prakash , “Environmental Studies” 3rd Edition, Elite Publishing House, Mangalore, 2018.
2. Benny Joseph (2005), “Environmental Studies”, Tata McGraw – Hill Publishing Company
Limited.
3. R Rajagopalan, “Environmental Studies – From Crisis to Cure ” 2nd Edition, Oxford
university press, New Delhi , 2013.
Reference Books
1. Raman Sivakumar, “Principles of Environmental Science and Engineering”, 2nd edition,
Cengage learning Singapur, 2005.
2. G.Tyler Miller Jr., “Environmental Science – working with the Earth”, Eleventh Edition,
Thomson Brooks /Cole, 2006
3. Dr. Pratiba Sing, Dr.Anoop Singh and Dr. Piyush Malaviya, “Text Book of Environmental and
Ecology”, Acme Learning Pvt. Ltd. New Delhi.
4. P. Meenakshi, “Elements of Environmental Science and Engineering”, Prentice Hall of India
Private Limited, New Delhi, 2006.
Course Outcomes (COs)
At the end of the course students will be able to
Comprehend the principles of ecology and environmental issues pertaining to air, land, and
CO1
water on a global scale
CO2 Acquire observation skills for solving problems related to the environment
CO3 Conduct survey to describe the realities of waste management system

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3

CO2 2 2 3

CO3 2 3 2

AVG 2 2 2 3 3 2
SEMESTER – VI
Course Name : Machine Learning Course Code : 21CS61
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 02 SEE Marks : 50
Hours / Week
Total No. of Lecture + Tutorial
: 40+24=64 SEE Duration : 03 Hrs.
/ Practical Hours
L:T:P : 3:0:2 Credits : 04
Course Prerequisites
Basic Knowledge on variables, linear equations, graphs of functions, histograms, probability and
statistics
Course Overview
This course is concerned with computer programs that automatically improve their performance
through experience which illustrates methodologies, technologies, mathematics and algorithms of
machine learning techniques.
Course Learning Objectives (CLO)
• This course will enable students to,
• Define machine learning and understand the basic theory underlying machine learning.
• Differentiate supervised, unsupervised and reinforcement learning
• Understand the basic concepts of learning and decision trees.
• Understand neural networks and Bayesian techniques for problems appear in machine learning
• Understand the instant based learning and statistical analysis of machine learning techniques.
Teaching
Modules
Hours
Module 1
Introduction to Machine Learning
Introduction, What is Human Learning, Types of Human Learning, What is Machine
Learning, Types of Machine Learning, Problems not to be solved using Machine Learning,
08
Application of Machine Learning, Issues in Machine Learning, Prepare to Model –
Introduction, Machine Learning activities, Basic types of Data in Machine Learning
SLT: Issues in Machine Learning
Textbook1: Ch: 1.1 – 1.7, 1.9, 2.1 – 2.3
Module 2
Decision Tree Learning
Introduction, Decision tree representation, Appropriate problems, Decision Tree
08
Learning algorithm, Issues in decision tree learning
SLT: Issues in decision tree learning- Rule Post-Pruning
Textbook2: Ch:3.1-3.4,3.7
Module 3
Artificial Neural Networks
Introduction, Neural Network representation, Perceptron, Backpropagation algorithm 08
SLT: Appropriate problems
Text Book2: Ch: 4.1 – 4.5
Module 4
08
Bayesian Learning
Introduction, Bayes theorem, Bayes theorem and concept learning, ML and LS error
hypothesis, MLH for predicting probabilities, MDL principle, Naive Bayes classifier
SLT: EM algorithm
Textbook2: Ch: 6.1 – 6.6, 6.9, 6.11 - 6.11
Module 5
Instance Based Learning
Introduction, k-nearest neighbor learning, locally weighted regression, Case-based
reasoning. 08
Reinforcement Learning: Introduction, The learning task, Q-Learning
SLT: Radial Basis Functions
Textbook2: Ch: 8.1-8.4,8.5,13.1 – 13.3
PRACTICAL MODULE

1. Implement and demonstrate the FIND-S Algorithm for finding the most specific hypothesis
based on a given set of training data samples. Read the training data from a .CSV file
2. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an
appropriate data set for building the decision tree and apply this knowledge to classify a new
sample.
3. Build an Artificial Neural Network by implementing the Back propagation algorithm and test
the same using appropriate data sets.
4. Write a program to implement the naïve Bayesian classifier for a sample training data set stored
as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
5. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for
clustering using the k-Means algorithm. Compare the results of these two algorithms and
comment on the quality of clustering. You can add Java/Python ML library classes/API in the
program.
6. Write a program to implement k-Nearest Neighbor algorithm to classify the iris data set. Print
both correct and wrong predictions. Java/Python ML library classes can be used for this
problem.
7. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select the appropriate data set for your experiment and draw graphs.

Open Ended Enquiry Problems

1. For a given set of training data examples stored in a .CSV file, implement and demonstrate the
Candidate-Elimination algorithm to output a description of the set of all hypotheses consistent
with the training examples.
2. Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier model
to perform this task. Built-in Java classes/API can be used to write the program. Calculate the
accuracy, precision, and recall for your data set.
3. Write a program to construct a Bayesian network considering medical data. Use this model to
demonstrate the diagnosis of heart patients using standard Heart Disease Data Set. You can use
Java/Python ML library.

Textbooks
1. Saikat Dutt, Subramanian Chandramouli, Amit Kumar Dos, “Machine Learning”, 1st edition,
Pearson, 2019
2. Tom M. Mitchell, Machine Learning, India Edition 2013, McGraw Hill Education
Reference Books
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning, 2nd
edition, springer series in statistics.
2. Ethem Alpaydın, Introduction to machine learning, second edition, MIT press
3. Foundations of Machine Learning , Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar,
second edition, MIT Press, 2018.
Course Outcomes (COs)
At the end of the course students will be able to
CO1 Understand fundamentals of machine learning
CO2 Demonstrate the working of machine learning algorithms
Analyze input and optimization principles of machine learning for efficient and effective
CO3
implementation
CO4 Design and implement machine learning techniques for solving complex problems in a team

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 3 2

CO3 2 2

CO4 2 2 2 2

AVG 2.5 2 2 2 2 2
SEMESTER – VI
Course Name : DevOps Course Code : 21CS62
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 02 SEE Marks : 50
Hours / Week
Total No. of Lecture + Tutorial
: 40+24=64 SEE Duration : 03 Hrs.
/ Practical Hours
L:T:P : 3:0:2 Credits : 04
Course Prerequisites
• Basics of Computer Networks and Software Development Life cycle.
• Agile methodologies.
• Linux basic commands.
Course Overview
Course provides the insights of Continuous Integration /Continuous Deployment tools in software
development life cycle.
Course Learning Objectives (CLO)
• To acquaint students with various DevOps tools used in the industry.
• To gain a hands-on experience for building a Continuous Integration /Continuous Deployment
pipeline.
Teaching
Modules
Hours
Module 1
DevOps and Infrastructure
DevOps Culture and Practices, Getting started with DevOps, Implementing CI/CD and
continuous deployment, Continuous integration(CI),Implementing CI, Continuous delivery
(CD),Continuous deployment, Understanding IaC practices, The benefits of IaC ,IaC
languages and tools ,Scripting types, Declarative types, The IaC topology, Optimizing
08
Infrastructure Deployment with Packer: Technical requirements, An overview of Packer,
Installing Packer, Installing manually, Installing by script, Installing Packer by script on
Linux, Installing Packer by script on Windows, Integrating Packer with Azure Cloud Shell,
Checking the Packer installation, Creating Packer templates for Azure VMs with scripts, The
structure of the Packer template, The builders section, The provisioners section, The
variables section, Building an Azure image with the Packer template.
Module 2
DevOps CI/CD Pipeline I
Managing Your Source Code with Git, Technical requirements, Over viewing Git and its
command lines, Git installation, Configuration Git, Git vocabulary, Git command lines,
Retrieving a remote repository, Initializing a local repository, Configuring a local repository,
Adding a file for the next commit, Creating a commit, Updating the remote repository, 08
Synchronizing the local repository from the remote, Managing branches, Understanding the
Git process and GitFlow pattern, Starting with the Git process, Creating and configuring a
Git repository, Committing the code, Archiving on the remote repository, Cloning the
repository, The code update, Retrieving updates, Isolating your code with branches,
Branching strategy with GitFlow, The GitFlow pattern, GitFlow tools.
Module 3
DevOps CI/CD Pipeline II
08
Continuous Integration and Continuous Delivery, Technical requirements, The CI/CD
principles, Continuous integration(CI) ,Continuous delivery(CD),Using a package manager,
Private NuGet and npm repository, Nexus Repository OSS, Azure Artifacts, Using Jenkins,
Installing and configuring Jenkins, Configuring a GitHub webhook, Configuring a Jenkins CI
job, Executing the Jenkins job, Using Azure Pipelines, Versioning of the code with Git in
Azure Repos, Creating the CI pipeline, Creating the CD pipeline :the release, Using GitLab CI,
Authentication at GitLab, Creating a new project and managing your code source, Creating
the CI pipeline, Accessing the CI pipeline execution details
Module 4
Containerized Applications with Docker
Containerizing Your Application with Docker, Technical requirements, Installing Docker,
Registering on Docker Hub, Docker installation, An overview of Docker's elements, Creating
08
a Docker file, Writing a Docker file, Docker file instructions overview, Building and running
a container on a local machine, Building a Docker image, Instantiating a new container of an
image, Testing a container locally, Pushing an image to Docker Hub, Deploying a container
to ACI with a CI/CD pipeline.
Module 5
Containerized Applications with Kubernetes
Managing Containers Effectively with Kubernetes, Technical requirements, Installing
Kubernetes, Kubernetes architecture overview, Installing Kubernetes on a local machine, 08
Installing the Kubernetes dashboard, First example of Kubernetes application deployment,
Using HELM as a package manager, Using Azure Kubernetes service, Creating an Azure
Kubernetes service, Configuring kubectl for Azure Kubernetes service.
PRACTICAL MODULE
A-Demonstration

A1. Demonstrate and Create project in local and remote repository using git and GitBash.
A2. Demonstrate and apply fork, merge, conflict and rebase concepts on repo using
GitHub.
A3. Demonstrate the process of interfacing the repo using Jenkins to automate the project
execution.

B-Exercise

B1. Create a repository and apply different types of scheduling using continuous
integration tool.
B2. Create a script to automate the operation using selenium WebdriverIO and integrate
with reporting tools.

C-Structured Inquiry

C1. Apply basic commands for Dockers and integrate with other tools.
C2. Create and apply backlogs, sprints, tasks for project and retrieve data using J-query.

D-Open Ended Problem

D1. Create a Framework and integrate different DevOps tools for an application.

Textbooks
1. Mikel Krief: Learning DevOps, Published by Packt Publishing Ltd, October 2019.
Reference Books
1. Michael Duffy: DevOps Automation Cookbook, Published by Packt Publishing Ltd, Nov 2015.
2. Jennifer Davis: Effective DevOps, Published by O’Reilly Media, in. June 2016
3. David Gonzalez: implementing Modern DevOps, Published by Packt Publishing Ltd, Oct 2017
Course Outcomes (COs)
At the end of the course students will be able to
Discuss the fundamental Definitions of DevOps & Github relevant to Software development and
CO1
deployment.
Discuss the various Properties and Applications by understanding the course topics pertaining
CO2
to Dockers, Jenkins, Containers & Ansible.
Apply various Concepts and Principles used in the topics to understand the theory related to
CO3
DevOps.
Experiment with the DevOps topics of the course by applying the theory relevant to Dockers,
CO4
Jenkins, Containers & Ansible.

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 2 2

CO3 3 2 2

CO4 3 2 2

AVG 2 3 2.5 2 2
SEMESTER – VI
: System Software and Compiler
Course Name Course Code: 21CS63
Design
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs.
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic Knowledge of Finite Automata and Computer Organization.
Course Overview
The course provides insights to the phases of a compiler. This course also aims to convey the language
specifications, use of regular expressions, context free grammars and parsing techniques involved in
the design of a compiler. The course introduces the basics of assemblers, loaders and linkers.
Course Learning Objectives (CLO)
This course will enable students to,
• Understand the phases of compilers and lexical analyzer
• Generate parse table, intermediate code, and target code.
• Learn the concepts of System Software like assemblers and loaders.
Teaching
Modules
Hours
Module 1
Introduction: Language Processors, the structure of a compilers, Evolution of
programming languages, the science of building a compiler
Lexical Analysis: The role of lexical analyzer, Input Buffering, Specifications of Token, 08
Recognition of Tokens.
SLT: Applications of compilers technology
Textbook 1: Ch. 1.1-1.5, 3.1 – 3.4
Module 2
Syntax Analysis - I: Introduction, Writing a grammar, Top-Down Parsers, Bottom-Up
Parsers. 08
SLT: Context Free Grammars
Textbook 1: Ch. 4.1 - 4.5
Module 3
Syntax Analysis - II: Introduction to LR parsing: Simple LR
Syntax Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's
08
Intermediate Code Generation: Three-Address Code
SLT: Variants of Syntax Trees
Textbook 1: Ch. 4.6, 5.1-5.2,6.1 - 6.2
Module 4
Code Generation: The Target Language, basic blocks and flow graph, Optimization of
basic blocks, The Code-Generation Algorithm
Introduction to Assembler
08
Machine Architecture of SIC and SIC/XE., Basic assembler functions
SLT: Issues in the Design of a Code Generator
Textbook 1: Ch. 8.1-8.2,8.4-8.5,8.6.2
Textbook 2: Ch. 1.3.1-1.3.2,2.1
Module 5
Assembler: Machine dependent assembler features.
Introduction to Loaders: Basic Loader Functions, Machine-Dependent loader features,
08
Machine-Independent loader features
SLT: Loader Design options
Textbook 2: Ch. 2.2, 3.1-3.4
Textbooks
1. Compilers-Principles, Techniques and Tools by Alfred V Aho, Monica S. Lam, Ravi Sethi,
Jeffrey D. Ullman. Pearson, 2nd edition, 2013
2. System Software by Leland. L. Beck, D Manjula, 3rd edition, 2016.
Reference Books
1. Systems programming – Srimanta Pal , Oxford university press, 2016
2. System programming and Compiler Design, K C Louden, Cengage Learning
3. System software and operating system by D. M. Dhamdhere TMG
4. Compiler Design, K Muneeswaran, Oxford University Press 2013.
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Explain the basic concepts of system software and compiler design
Apply the concepts of compiler design for parsing a given string and assembler features
CO2
generating object program.
CO3 Analyze and trace the working of lexical analyser and syntax analyser for a given grammar
CO4* Design and develop solutions to system software programs like LEX and YACC in a team

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3
CO2 3 3
CO3 2 2
CO4 2 2 2 2
AVG 3 2 2 2 2 2.5 2
SEMESTER – VI
Course Name : Full Stack Development-II Course Code: 21CS641

No. of Lecture Hours / Week : 03 CIE Marks : 50


No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic understanding of Programming skills and JavaScript.
Course Overview
The course provides a fundamental understanding of full-stack web development tools and techniques,
with a particular focus on Express and MongoDB components of the MEAN stack which is a powerful
combination of technologies that enables developers to build dynamic and scalable web applications.
Course Learning Objectives (CLO)
This course will enable students to,
• Understanding the setup and integration of backend components of MEAN stack web
application
• Familiarize with Express web framework for server-side programming
• Acquaintance with design and development of backend of MEAN stack web application
Teaching
Modules
Hours
Module 1
Introducing MEAN Development: Introducing Node.js: The web server/platform,
Introducing Express: The framework, Introducing MongoDB: The database, Introducing
Angular: The frontend framework. Designing a MEAN Stack Architecture: A common 08
MEAN stack architecture, Looking beyond SPAs, Designing a flexible MEAN architecture,
Planning a real application, Breaking the development into stages.
SLT: Hardware architecture
Module 2
Creating and setting up a MEAN project: A brief look at Express, Node, and npm,
Creating an Express project, Modifying Express for MVC, Importing Bootstrap for quick,
responsive layouts. 08
Building a static site with Node and Express: Defining the routes in Express, Building
basic controllers, Creating some views, Adding the rest of the views.
SLT: Taking the data out of the views and making them smarter.
Module 3
Building a data model with MongoDB and Mongoose: Connecting the Express
application to MongoDB by using Mongoose, Why model the data, Defining simple
08
mongoose schemas, Using the MongoDB shell to create a MongoDB database and add
data, Getting your database live.
SLT: Making the application use the right database.
Module 4
Writing a REST API: Exposing the MongoDB database to the application: The rules
of a REST API, GET methods: Reading data from MongoDB, POST methods: Adding data 08
to MongoDB, PUT methods: Updating data in MongoDB, DELETE method: Deleting data
from MongoDB
SLT: Setting up the API in Express
Module 5
Authenticating users, managing sessions, and securing APIs: How to approach
authentication in the MEAN stack, Creating a user schema for MongoDB, Creating an 08
authentication API with Passport, Securing relevant API endpoints
SLT: Using the JWT information inside a controller
Textbooks
1. Simon Holmes, Clive Harber, “Getting MEAN with Mongo, Express, Angular, and Node”
second edition, 2019.
Reference Books
1. Jake Spurlock, “Bootstrap” First Edition 2013.
2. Steve Fenton “Pro TypeScript - Application-Scale JavaScript Development”, Second Edition,
Apress publications, 2018.
3. Shyam Seshadri, “Angular Up & Running - Learning Angular, Step by Step”, First Edition,
O’Reilly Media, 2018.
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Understand the features and design principles of MEAN stack architecture
Use node, express, mongoDB and rest API frameworks to build and integrate backend
CO2
components
CO3 Examine structure of backend components and their dependencies and interactions
CO4* Design and develop MEAN stack web application for given requirements in a team

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 3 2 2
CO3 2 2
CO4 2 2 2 2
AVG 2.5 2 2 2 2 2
SEMESTER – VI
Course Name : Network Security Course Code: 21CS642

No. of Lecture Hours / Week : 03 CIE Marks : 50


No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic knowledge on computer networks and basic understanding of cryptography
Course Overview
This course aims to provide the concept of network security issues, services and goals, also to build
protection mechanisms in order to secure computer networks. At the end of the course students will
have the thorough knowledge on variety of network security applications and system-level security
issues.
Course Learning Objectives (CLO)
This course will enable students to,
• Explore knowledge on security concepts in terms of attacks, services, and mechanism
• Analyze the security models of communication systems, networks and protocols used for secure
transactions.
• Understand various system security to protect against the threats in the networks.
Teaching
Modules
Hours
Module 1
Introduction to Security: Security Concepts, OSI Security Architecture, Security Attacks,
08
Security services, Security Mechanism, A Model for Network Security
SLT: Case studies on DoS Attack
Module 2
Authentication Applications: Kerberos – Motivation, Version 4, Version 5, X.509
08
Authentication Service, Public – Key Infrastructure
SLT: Kerberos Encryption Techniques
Module 3
Email privacy: Pretty Good Privacy (PGP), S/MIME, IP Security: Overview, IP Security
Architecture, Authentication Header, Encapsulating Security Payload, Combining Security 08
Associations and Key Management.
SLT: Case study on Replay Attack
Module 4
Web Security
Web Security Consideration, Secure Socket Layer (SSL) and Transport Layer Security 08
(TLS), Secure Electronic Transaction (SET).
SLT: Threats on Web Security
Module 5
System Security
Intrusion Detection, Password Management, Distributed Denial of Service, Firewall- 08
Design Principles
SLT: Honeypot & Types of Viruses
Textbooks
1. William Stallings, Cryptography and Network Security: Principles and Practice, PHI 4th
Edition, 2006
Reference Books
1. Behrouz A. Foruzan, Cryptography and Network Security, Tata McGraw Hill 2007.
2. Cryptography and Network Security”, by Atul Kahate 3rd edition Mc Graw Hill, 2008.
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Understand the principles of Network security, System security and its issues
CO2 Apply the authentication application and services for security framework
CO3 Analyze Various security principles used for secure transactions
CO4* Demonstrate different web and system security applications using modern tools

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 2 2

CO3 2 2

CO4 2 2 2 2

AVG 2 2 2 2 2 2
SEMESTER – VI
Course Name : Cloud Computing Course Code: 21CS643

No. of Lecture Hours / Week : 03 CIE Marks : 50


No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic Understanding of programming skills, familiarity with databases, basics of security and privacy,
familiarity with operating systems and networking.
Course Overview
This course will emphasize on the on-demand delivery of compute power, database, storage,
applications, and other IT resources through a cloud services platform via the internet. The course
discusses the cloud infrastructure, application paradigms, resource management, security, google
platforms, services and how to correctly use them in real-world applications.
Course Learning Objectives (CLO)
This course will enable students to,
• Identify the architecture, infrastructure and delivery models of cloud computing
• Compare and contrast different cloud services.
• Apply suitable virtualization concepts.
• Apply Cloud automation and management tools to build your own cloud application in Google
Cloud Platform.
Teaching
Modules
Hours
Module 1
Introduction to Cloud Infrastructure: Cloud computing, Cloud computing delivery
models and services, Ethical issues, Cloud vulnerabilities, Major Challenges Faced by
Cloud Computing, Cloudcomputing at Amazon, Cloud computing the Google perspective,
Microsoft Windows Azure and online services, Open-source software platforms for 08
private clouds, Cloud storage diversity and vendor lock-in, Energy use and ecological
impact.
SLT: Service level agreements, User experience and software licensing.
Textbook 1: Ch. 1.3,-1.7, 3.1-3.8
Module 2
Cloud Computing: Application Paradigms and Concepts: Challenges of cloud
computing, Architectural styles of cloud computing, Workflows: Coordination of multiple
activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce 08
programming model.
SLT: The GrepTheWeb application.
Textbook 1: Ch. 4.1-4.7
Module 3
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual
machinemonitors, Virtual Machines, Performance and Security Isolation, Full 08
virtualization and Paravirtualization.
Cloud Security- Cloud security risks, Privacy and privacy impact assessment, Trust,
Operating system security.
SLT: Virtual machine security.
Textbook 1: Ch. 5.1- 5.6, 9.1-9.6
Module 4
Resource Management and Scheduling: Policies and mechanisms for resource
management, Application of control theory to task scheduling on a cloud, Stability of a
two-level resource allocation architecture, Feedback control based on dynamic
thresholds, Coordination of specialized autonomic performance managers, A utility- 08
based model for cloud-based Web services, Resourcing bundling: Combinatorial auctions
for cloud resources, Scheduling algorithmsfor computing clouds.
SLT: Fair queuing and Start-time fair queuing.
Textbook 1: Ch. 6.1-6.10
Module 5
Google Cloud Platform and Services: Types of Cloud Services, Cloud Computing vs. Data
Center Computing. Computing Components of Google Cloud Platform, Storage
Components of Google Cloud Platform, Networking Components of Google Cloud
08
Platform, Additional Components of Google Cloud Platform. How GCP Organizes Projects
and Accounts, Roles and Identities.
SLT: Billing and Enabling APIs.
Textbook 2: Ch. 2, 3
Textbooks
1. Dan C Marinescu: Cloud Computing Theory and Practice, 2nd edition. Elsevier (MK) 2013.
2. Dan Sullivan: Official Google Cloud Certified Associate Cloud Engineer Study Guide, 1st
edition, SYBEX, 2019
Reference Books
1. John W Rittinghouse, James F Ransome: Cloud Computing Implementation, Management
and Security, CRC Press 2013.
Course Outcomes (CO)
Upon the completion of the course, students will be able to
Explain the basic cloud computing concepts and distinguish between the various cloud
CO1
infrastructures.
Illustrate different types of virtualizations, security and resource management techniques that
CO2
can beused in designing cloud applications.
Perform analysis of the different virtualization and Resource Management techniques used in
CO3
Google Cloud Platform.
Investigate the various methods, algorithms for allocating and managing the resources in
CO4*
cloud.

CO – PO – PSO Matrix

CO PO PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 2

CO2 2 2

CO3 2

CO4 2 2

AVG 2 2 2 2 2
SEMESTER - VI
Course Name : Computer Vision Course Code: 21CI644*
No. of Lecture Hours / Week : 03 CIE Marks: 50
No. of Tutorial / Practical
: 00 SEE Marks: 50
Hours / Week
Total No. of Lecture + Tutorial
: 40 SEE Duration: 03 Hr.
/ Practical Hours
L:T:P : 3:0:0 Credits: 03
Course Prerequisite
Basic knowledge of programming, linear algebra, algorithms and image processing are desirable.
Course Overview
This course introduces computer vision including fundamentals of image formation, camera imaging
geometry, feature detection and matching, Multi-view geometry including stereo, motion estimation,
tracking and classification.
Course Learning Objectives (CLO)
The students will be able to:
• Review image processing techniques for computer vision.
• Explain shape and region analysis.
• Illustrate Hough Transform and its applications to detect lines, circles, ellipses.
• Contrast three-dimensional image analysis techniques, motion analysis and applications of
computer vision algorithms.
TEACHING
MODULES
HOURS
MODULE 1:
Radiometry - Measuring Light: Light in Space, Light Surfaces, Important Special Cases.
Sources, Shadows, And Shading: Qualitative Radiometry, Sources and Their Effects,
Local Shading Models, Application: Photometric Stereo, Interreflections: Global 08
Shading. Color: The Physics of Color, Human Color Perception, Representing Color, A
Model for Image Color, Surface Color from finite dimensional linear models.
SLT: Radiometry terminology for light surfaces
MODULE 2:
Linear Filters: Linear Filters and Convolution, Shift Invariant Linear Systems, Spatial
Frequency and Fourier Transforms, Sampling and Aliasing, Filters as Templates. Edge 08
Detection: Noise, Estimating Derivatives, Texture: Representing Texture, Analysis (and
Synthesis) Using Oriented
Pyramids, Application: Synthesis by Sampling Local Models.
SLT: Shape from Texture.
MODULE 3:
The Geometry of Multiple Views: Two Views. Stereopsis: Reconstruction, Human
Stereopsis- Binocular Fusion, Using More Cameras, Using more cameras.
Segmentation by Clustering: Human Vision: Grouping and Gestalt, Applications: Shot 08
Boundary Detection and Background Subtraction, Image segmentation by Clustering
Pixels.
SLT: Segmentation by Graph-Theoretic Clustering
MODULE 4:
Segmentation by Fitting a Model: The Hough Transform, Fitting Lines, Fitting Curves
Segmentation and Fitting Using Probabilistic Methods: Missing Data Problems,
Fitting, and Segmentation, The EM Algorithm in Practice. Tracking With Linear 08
Dynamic Models: Tracking as an Abstract Inference Problem, Linear Dynamic Models
and Kalman Filtering.
SLT: Data Association
MODULE 5:
Geometric Image features: Elements of differential geometry. Geometric Camera
Models: Elements of Analytical Euclidean Geometry, Geometric Camera Parameters,
Calibration Methods: A Linear Approach to Camera Calibration technique- Linear
Least-Square methods, Taking Radial Distortion into Account, Analytical 08
Photogrammetry technique- Nonlinear least squares methods.
SLT: The shape of secularities
Textbooks:
1. David A. Forsyth and Jean Ponce: Computer Vision – A Modern Approach, PHI Learning (Indian
Edition), 2012.
Reference Books:
1. E. R. Davies: Computer and Machine Vision – Theory, Algorithms and Practicalities, Elsevier
(Academic Press), 4th edition, 2013.
2. Richard Szeliski, “Computer Vision: Algorithms and Applications”, 2nd Edition, Springer, 2022.

COURSE OUTCOME (CO)


At the end of the course, the student will be able to
CO1 Explain fundamental image processing techniques required for computer vision.
Apply Linear Filters, Fourier transforms and segmentation in computer vision.
CO2
CO3 Analyze Hough transformations, segmentation methods, Shot Boundary Detection and
Background Subtraction in computer vision.
CO4 Implement computer vision applications using appropriate tools for a given scenario.
(Additional CO)

CO – PO – PSO MAPPING
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3
CO2 2 2
CO3 2 2
CO4 2 2

AVG 2.5 2 2 2 2
SEMESTER – VI
Course Name : Introduction to Operating System Course Code: 21IS651
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic knowledge of computer components and C programming.
Course Overview
An operating system is the most important software that runs on a computer. It manages the
computer's memory and processes, as well as all its software and hardware. This course introduces the
basic concepts of an operating system. Students can apply and analyse different memory allocation
schemes, CPU scheduling and process synchronization algorithms.
Course Learning Objectives (CLO)
This course will enable students to,
• To make aware of basics of Operating System and their services
• To learn different process scheduling algorithms and synchronization techniques
• To understand memory management concepts
• To explore features of various operating systems
Teaching
Modules
Hours
Module 1
Introduction: What Operating Systems Do, Computer-system Architecture, Computer-
system Structure, Operating-System Operations. Process, memory and storage
management, Protection, and security. System Structures: Operating-System Services,
08
User and Operating System, Types of System Calls, Operating System Design and
Implementation, Operating System structure.
SLT: System calls
Textbook: Ch. 1.1, 1.3-1.9, 2.1 – 2.4, 2.6, 2.7.1-2.7.4
Module 2
Processes and CPU Scheduling: Process Concept, Process Scheduling, Operations on
Processes, Interprocess Communication, Overview of Threads, Multithreading Models,
08
Basic concepts of scheduling, Scheduling Criteria and Scheduling algorithms.
SLT: Threading issues
Textbook: Ch. 3.1 - 3.4, 4.1, 4.3, 4.6, 5.1 - 5.3
Module 3
Process Synchronization: Synchronization Background, Critical-Section problem,
Peterson’s solution, Semaphores, Classic problems of synchronization. 08
SLT: Monitors
Textbook: 6.1 - 6.3, 6.6 - 6.8.2
Module 4
Deadlocks: System Model, Deadlock characterization, Methods for handling deadlocks,
08
Deadlock prevention, Deadlock avoidance: Banker’s algorithm, Deadlock detection.
SLT: Recovery from deadlock
Textbook: Ch. 7.1 - 7.7
Module 5
Memory Management: Background, Swapping, Contiguous Memory allocation,
Segmentation, Paging, Structure of page table, Virtual memory: Background, Demand
paging, copy on write, Basic Page replacement, Page replacement algorithms: FIFO, 08
Optimal and LRU.
SLT: Thrashing
Textbook: Ch. 8.1 - 8.6.3, 9.1 - 9.3, 9.4.1 - 9.4.4, 9.6
Textbooks
1. Abraham Silberschatz, Peter B Galvin, Greg Gagne, Operating System Concepts, 9th edition,
Wiley, 2016 INDIA Edition
Reference Books
1. Modern Operating Systems, Andrew S Tanenbaum and Herbert Bos, Fourth Edition, Pearson
Education,2014
2. Thomas Anderson and Michael Dahlin, Operating Systems: Principles and Practice,
Recursive Books, Second Edition, 2014
3. Stallings, Operating Systems internals and design Principles, 7th Edition, 2017
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Explain the basics and functions of operating system.
Apply the concepts of memory management policies, virtual memory, and scheduling
CO2
techniques for processes handling.
CO3 Analyse processes and memory management in operating system.
CO4* Design and develop solutions for process management in a team.

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2

CO2 3

CO3 2

CO4 2

AVG 2.5 2 2
SEMESTER – VI
Course Name : Introduction to Internet of Things Course Code: 21IS652

No. of Lecture Hours / Week : 03 CIE Marks : 50


No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs.
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
The students should possess fair knowledge of programming, communication technology, knowledge
of Database and Artificial Intelligence.
Course Overview
The course deals with concepts of Internet of Things which is a system of interrelated computing
devices, mechanical and digital machines, objects, animals or people that are provided with unique
identifiers and the ability to transfer data over a network without requiring human-to-human or
human-to-computer interaction. It is an emerging topic of technical, social and economic significance.
Consumer products, durable goods, cars and trucks, industrial and utility components, sensors and
other everyday objects are combined with internet connectivity and powerful data analytic capabilities
that promise to transform the way we work, live and play
Course Learning Objectives (CLO)
This course will enable students to,
• To assess the genesis and impact of IoT applications and architectures
• To illustrate the concepts of smart objects, sensors and actuators
• To compare different application protocols for IoT
• To infer the importance of Security and Data analytics with Internet of Things
Teaching
Modules
Hours
Module 1
Introduction: What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact
IoT Network Architecture and Design: Drivers Behind New Network Architectures-
08
oneM2M IoT Standardized Architecture and The IoT World Forum (IoTWF) Standardized
Architecture, Comparing IoT Architectures, A Simplified IoT Architecture.
SLT: IoT Challenges.
Module 2
Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects, Sensor
Networks 08
Connecting Smart Objects: IoT Access Technologies – IEEE 802.15.4 and LoRaWAN.
SLT: Wireless sensor networks
Module 3
IP as the IoT Network Layer: The Business Case for IP, The need for Optimization
Application Protocols for IoT: The Transport Layer, IoT Application Transport Methods -
08
Application Layer Protocol Not Present, Generic Web-Based Protocols, IoT Application
Layer Protocols.
SLT: Profiles and Compliances
Module 4
Data and Analytics for IoT: An Introduction to Data Analytics for IoT - Structured Versus
Unstructured Data, Data in Motion Versus Data at Rest, IoT Data Analytics Overview,
Machine Learning - Machine Learning Overview – Supervised Learning, Unsupervised
08
Learning and Neural Networks
IoT in Industry: Smart and Connected Cities- An IoT Strategy for Smarter Cities, Smart
City IoT Architecture, Smart City Use-Case Examples.
SLT: IoT Data Analytics Challenges
Module 5
IoT Physical Devices and Endpoints - Arduino UNO: Introduction to Arduino, Arduino
UNO, Installing the Software, Fundamentals of Arduino Programming. RaspberryPi:
08
Introduction to RaspberryPi, RaspberryPi Board- Hardware Layout, Operating Systems on
RaspberryPi, Configuring RaspberryPi.
SLT: RaspberryPi Commands
Textbooks
1. IoT Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things, David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome Henry,
1st Edition, Pearson Education (Cisco Press Indian Reprint). (ISBN: 978 -9386873743).
2. Internet of Things, Srinivasa K G, CENGAGE Leaning India, 2017.
Reference Books
1. Internet of Things: Architecture and Design Principles, Raj Kamal, 1st Edition, McGraw Hill
Education, 2017. (ISBN: 978-9352605224).
2. Internet of Things (A Hands-on-Approach), Vijay Madisetti and Arshdeep Bahga, 1st Edition,
VPT, 2014
Course Outcomes (CO)
Upon the completion of the course, students will be able to
Explain the architectures, impact of IoT and deployment of smart objects and the technologies
CO1
to connect them to network
CO2 Illustrate the need for Internet protocol, Data Analytics and Applications of IoT in Industry
CO3 Analyze the devices and boards used in IoT along with its layout and implications.
CO4* Implement interfacing of various sensors with Arduino/Raspberry Pi

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 2
CO3 2
CO4 2
AVG 2 2 2 2
SEMESTER – VI
: Introduction to Web
Course Name Course Code: 21CI653
Technologies
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic Knowledge of Problem solving and Design skills.
Course Overview
The focus in this course is on the World Wide Web as a platform for interactive applications, content
publishing and social services. This course is about the HTTP communication protocol, the markup
languages HTML, XML, the CSS for formatting and transforming web content, interactive graphics and
multimedia content on the web, client-side programming using JavaScript. Fundamentals of PHP - from
the perspective of object-oriented program and how it can be used in web development.
Course Learning Objectives (CLO)
This course will enable students to,
• To Understand the foundations of web page design using HTML & CSS
• To Design Client-Side programs using JavaScript and Server-Side programs using PHP
• To Learn about Object Oriented Programming capabilities of PHP
• To Understand the Web page sessions and JSON formats
Teaching
Modules
Hours
Module 1
HTML5: Understanding elements, physical style elements, Immediate solutions (first
eight immediate solutions), DIV and SPAN elements, exploring hyperlink and URLs,
08
Table elements, Images in web page, input element, button, multi choice, submitting
forms.
SLT: Exploring Colours.
Module 2
CSS: Syntax of CSS, CSS selectors, CSS in HTML doc, Colour property, image property,
size property, background property, font family, font size property, font style property,
font variant property, font weight property, font property, CSS to text, box model, 08
template layout model, display of an element using CSS, positioning an element, floating
element.
SLT: Pseudo-classes
Module 3
JavaScript: Features of JavaScript, JavaScript in HTML doc, Programming
Fundamentals, Exploring functions, Events: HTML Forms, keyboard, objects in
08
JavaScript, describing document object, cookies, DOM nodes, levels, introduction to form
validation, errors in JavaScript, handling exceptions
SLT: Debugging, security in JavaScript
Module 4 08
XML: Working with basics of XML, XML namespaces, XML schema: simple type, data
types, DOM parser, XPath language,XLink Language , XPointer Language.
SLT: XML entity references, XML encoding
Module 5
AJAX: Overview of AJAX, Asynchronous data transfer with XML HTTP Request,
Implementing AJAX Frameworks, fundamentals of PHP, interaction between PHP and
08
AJAX, web service protocols, consuming web services using AJAX, new technologies to
create web services.
SLT: Using PHP enabled server
Textbooks
1. HTML 5 Black Book, Covers CSS 3, JavaScript, XML, XHTML, AJAX, PHP and jQuery, Second
Edition, 2016
Reference Books
1. Robin Nixon, “Learning PHP, MySQL &JavaScript with jQuery, CSS and HTML5”, 4th Edition,
O’Reilly Publications, 2015. (ISBN:978-9352130153)
2. Luke Welling, Laura Thomson, “PHP and MySQL Web Development”, 5th Edition, Pearson
Education, 2016. (ISBN:978-9332582736)
3. Nicholas C Zakas, “Professional JavaScript for Web Developers”, 3rd Edition, Wrox/Wiley India,
2012. (ISBN:978-8126535088)
4. David Sawyer Mcfarland, “JavaScript & jQuery: The Missing Manual”, 1st Edition, O’Reilly/Shroff
5. Publishers & Distributors Pvt Ltd, 2014 (ISBN:978- 9351108078)
6. Zak Ruvalcaba Anne Boehm, “Murach's HTML5 and CSS3”, 3rdEdition, Murachs/Shroff
Publishers & Distributors Pvt Ltd, 2016. (ISBN:978-9352133246
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Explain basic concepts of web development.
CO2 Apply concepts of web technology to create dynamic web pages.
CO3 Design and develop static and dynamic web pages.
CO4* Design and develop web-based solutions for societal problems.

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 3
CO3 2 2
CO4 3
AVG 2.5 2 2 3
SEMESTER – VI
: Introduction to Machine
Course Name Course Code: 21CS654
Learning
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic Knowledge on variables, linear equations, graphs of functions, histograms, Probability and
statistics
Course Overview
This course is concerned with computer programs that automatically improve their performance
through experience which illustrates methodologies, technologies, mathematics and algorithms of
machine learning techniques.
Course Learning Objectives (CLO)
This course will enable students to,
• Define machine learning and understand the basic theory underlying machine learning
• Differentiate supervised, unsupervised and reinforcement learning
• Understand the basic concepts of learning and decision trees
• Understand neural networks and Bayesian techniques for problems appear in machine learning
• Understand the instant based learning and statistical analysis of machine learning techniques
Teaching
Modules
Hours
Module 1
Introduction: Well posed learning problems, Designing a Learning system, Perspective
and Issues in Machine Learning. Concept Learning: Concept learning task, Concept 08
learning as search, Find-S algorithm, Version space, Candidate Elimination algorithm.
SLT: Inductive Bias
Module 2
Decision Tree Learning: Decision tree representation, Appropriate problems for
decision tree learning, Basic decision tree learning algorithm, hypothesis space search in 08
decision tree learning, Inductive bias in decision tree learning.
SLT: Issues in decision tree learning
Module 3
Artificial Neural Networks: Introduction, Neural Network representation, Perceptron,
08
Backpropagation algorithm.
SLT: Appropriate problems
Module 4
Bayesian Learning: Introduction, Bayes theorem, Bayes theorem and concept learning,
ML and LS error hypothesis, ML for predicting probabilities, MDL principle, Naive Bayes 08
classifier, Bayesian belief networks.
SLT: EM algorithm
Module 5 08
Instance Based Learning: Introduction, k-nearest neighbor learning, locally weighted
regression, radial basis function. Reinforcement Learning: Introduction, The Learning
Task, Q Learning.
SLT: Cased Based Reasoning
Textbooks
1. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, Foundations of Machine Learning, 2nd
edition, MIT Press, 2018
2. Tom M. Mitchell, Machine Learning, McGraw Hill Education, 2013
Reference Books
1. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning, 2nd
edition, Springer Series in Statistics, 2009
2. Ethem Alpaydın, Introduction to machine learning, 2nd edition, MIT press,2010
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Explain the concepts of machine learning techniques
CO2 Illustrate the working of various machine learning algorithms
Analyze theory of probability and the concepts of neural network, classifier for problems
CO3
appearing in machine learning
CO4* Design and develop machine learning models for predictive analytics

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2
CO2 2
CO3 2
CO4 2 2 2 1
AVG 2 2 2 2 2 1
SEMESTER – VI
: Fundamentals to Cloud
Course Name Course Code: 21CS655
Computing
No. of Lecture Hours / Week : 03 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 40 SEE Duration : 03 Hrs
Tutorial
L:T:P : 3:0:0 Credits : 03
Course Prerequisites
Basic Understanding of programming skills, familiarity with security and privacy and basic knowledge
of networking.
Course Overview
This course will emphasize on the delivery models of cloud, database, storage, applications, and other
IT resources through a cloud services platform via the internet. The course discusses the cloud
infrastructure, application paradigms, resource management, security, google platforms, services and
how to correctly use them in real-world applications.
Course Learning Objectives (CLO)
This course will enable students to,
• Identify the architecture, infrastructure, and delivery models of cloud computing.
• Compare and contrast different cloud services.
• Apply suitable virtualization concepts.
• Analyse various security measures that are required to safeguard the cloud platforms.
Teaching
Modules
Hours
Module 1
Introduction to Cloud Infrastructure: Cloud computing, Cloud computing delivery
models and services, Ethical issues, Cloud vulnerabilities, Major Challenges Faced by
Cloud Computing, Cloud computing at Amazon, Cloud computing the Google perspective,
08
Microsoft Windows Azure and online services, Cloud storage diversity and vendor lock-
in, Energy use and ecological impact.
SLT: Open-source software platforms for private clouds
Textbook 1 : Ch. 1.3-1.7,Ch. 3.1-3.7
Module 2
Cloud Computing Application Paradigms and Concepts: Challenges of cloud
computing, Architectural styles of cloud computing, Workflows: Coordination of multiple
activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce
programming model, A case study: The GrepTheWeb application.
Cloud Resource Management and Scheduling: Policies and mechanisms for resource 08
management, Stability of a two-level resource allocation architecture, Feedback control
based on dynamic thresholds, Resourcing bundling: Combinatorial auctions for cloud
resources.
SLT: Application of control theory to task scheduling on a cloud
Textbook 1 : Ch. 4.1-4.7, Ch. 6.1-6.4, 6.7
Module 3 08
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual
machine monitors, Virtual Machines, Performance and Security Isolation, Full
virtualization and Para virtualization, Hardware support for virtualization.
SLT: Case study: Xen, a VMM based on paravirtualization
Textbook 1: Ch. 5.1- 5.8
Module 4
Storage systems: The evaluation of Storage Technology, Storage Models, File systems, and
Databases, Distributed File Systems: The Processors, General Parallel File System, Google
File System, Apache Hadoop, Locks and Chubby, Transaction Processing and NoSQL 08
Databases, Megastore
SLT: BigTable
Textbook 1: Ch.8
Module 5
Cloud security: Cloud Security Risk, The Top Concern for Cloud Users, Privacy and Privacy
Impact Assessment, Trust, Operating System Security, Virtual Machine Security, Security
Virtualization, Security risk posed by shared images, Security risks posed by a 08
management OS, Xoar: Breaking the monolithic Design of TCB
SLT: A trusted Virtual Machine Monitor
Textbook 1: Ch. 9
Textbooks
1. Dan C Marinescu: Cloud Computing Theory and Practice, 2nd edition. Elsevier (MK) 2013.
Reference Books
1. John W Rittinghouse, James F Ransome: Cloud Computing Implementation, Management and
Security, CRC Press 2013.
2. Kai Hwang, Geoffrery C. Fox, Jack J. Dongarra: Distributed and Cloud Computing, Elsvier,2012
Course Outcomes (CO)
Upon the completion of the course, students will be able to
CO1 Explain the applications of cloud computing and its security systems.
Apply different types of virtualization and storage systems that can be used in designing cloud
CO2
applications.
CO3 Analyze the different Resource Management techniques used in Cloud Platform.
CO4* Explore various cloud platform used to build cloud applications in a team.

CO – PO – PSO Matrix
PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3
CO2 2
CO3 2
CO4 2
AVG 2.5 2 2
SEMESTER – VI
: Technical Proficiency
Course Name Course Code : 21TP67A
Enhancement Course - IV
Number of Lecture Hours /
: 00 CCE Marks : 50
Week
Number of Tutorial /
: 02 SEE Marks : 50
Practical Hours / Week
Total Number of Lecture +
: 24 SEE Duration : 2 Hrs.
Tutorial/Practical Hours

L:T:P : 0:0:2 Credits : 01

COURSE PREREQUISITES: Working knowledge of C Programming and Data Structure.

COURSE OVERVIEW: This course is designed to enhance an individual’s problem-solving, analytical,


and critical thinking skills using competitive programming, graphs, strings and tries.
COURSE LEARNING OBJECTIVES (CLO) :
1. To enhance problem-solving skills.
2. To develop technical Skill in Recursion, Dynamic Programming, Graphs, Strings and Tries.
3. To Prepare students for job recruitment process and competitive exams.
TEACHING
MODULES
HOURS
MODULE 1: Basics of Competitive Programming
Introduction to Competitive Programming, Recursion, Time and Space Complexity
Analysis, Language Tools, Searching and Sorting Applications, Two Pointers, and Sliding 06
Window

MODULE 2: Recursion and Bit Manipulation


Applications of Recursion: Advanced Recursion, Backtracking, Bit Manipulation and
06
Modulo Arithmetic

MODULE 3: Dynamic Programming


Dynamic Programming, Greedy Problems, Dp and Bitmasking 06

MODULE 4: Range Queries and Graphs


Range Queries: Segment Tree, Fenwick Tree
06
Graphs: Graph Implementation, Graph Algorithms, Advanced Graphs.

MODULE 5: Strings and Tries


String Algorithms and Tries 06
Reference Books:
1. Guide to Competitive Programming: Learning and Improving Algorithms Through Contests by Antti
Laaksonen
2. Data Structures and Algorithms Made Easy by Narasimha Karumanchi
3. Data Structures through C in Depth by by S K Srivastava and Deepali Srivastava
COURSE OUTCOMES (COs):
Upon completion of the course, students will be able to
Apply and solve complex problems efficiently using Recursion, Dynamic Programming,
CO1
Graphs, Strings and Tries
CO2 Develop critical thinking skills, enabling them for job interviews and assessment tests.

CO – PO – PSO Matrix

PO PSO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3
CO2 3
AVG 3 3
SEMESTER – V/VI
: Research Methodology and
Course Name Course Code: 21HS68B
Intellectual Property Rights
No. of Lecture Hours / Week : 01 CIE Marks : 50
No. of Tutorial / Practical
: 00 SEE Marks : 50
Hours / Week
Total No. of Lecture +
: 20 SEE Duration : 02 Hrs.
Tutorial
L:T:P : 1:0:0 CREDITS : 1
COURSE OVERVIEW:
The course develops the skill of interpreting results and preparation of research reports and highlights
intellectual property rights. Also, the course emphasizes various techniques of research. It involves
developing theoretical and conceptual frameworks and writing a review. It sheds light on sampling
designs and methods of data collection.

COURSE LEARNING OBJECTIVES (CLO):


1. To give an overview of the research methodology and explain the technique of defining a
research problem.
2. To explain various research designs, sampling designs and different methods of data
collections.
3. To explain the art of interpretation and the art of writing research reports and research
proposals.
4. To explain various forms of the intellectual property, its relevance and business impact in the
changing global business environment.
TEACHI
MODULES NG
HOURS
MODULE 1: Introduction to Research Methodology
Introduction, meaning of research, Objectives of research, Types of research, Research
approaches, Research methods versus Methodology, Research process.
Defining the Research Problem: Research problem, Selecting the problem, Necessity of 04
defining the problem, Technique involved in defining a problem.
Textbook 1: Ch.1, Ch.2.
Self-Study Component: Criteria of good research.
MODULE 2: Research Design
Introduction, meaning of research design, Features of a good design, Important concepts
relating to research design, Different research designs, Basic principles of experimental
designs- the Principle of Replication, the Principle of Randomization & Principle of Local
Control.
04
Textbook 1: Ch.3. Textbook 2: Ch.3, Ch.7, Ch.8.
Self-Study Component: Need for research design.
MODULE 3: Sampling Design & Measurement Techniques
Sampling Design: Introduction, Steps in sampling design, Characteristics of a good
sample design, Different types of sample designs.
Measurement and Scaling Techniques: Introduction, Measurement scales, Sources of
04
error in measurement, Tests of sound measurement, Technique of developing
measurement tools.
Textbook 1: Ch.4, Ch.5.
Self-Study Component: Criteria of Selecting a Sampling Procedure.
MODULE 4: Data Collection & Interpretation and Report Writing
Data Collection: Collection of primary data-Observation Method, Interview Method,
Collection of Data through Questionnaires, Collection of Data through Schedules,
Collection of Secondary Data.
Interpretation and Report Writing: Introduction, Technique of interpretation, Different 04
steps in writing report, Layout of the research report, types of research report, Mechanics
of writing a research report.
Textbook 1: Ch.6, Ch.14.
Self-Study Component: Selection of appropriate method for data collection.
MODULE 5: Intellectual Property Rights
Introduction, The concept, Intellectual property system in India, Patents act-1970,
Trademark act-1999, Protection of intellectual property under TRIPS, Copyright and
04
related rights, Geographical indications, Industrial designs, Patents.
Textbook 3: Ch.1.
Self-Study Component: Trademarks
OTHER ASSESSMENT TOOLS (OAT):
Case studies on research methodology & intellectual property rights and presenting the
information in a report.
Textbooks:
1. Research Methodology: Methods and Techniques, C.R. Kothari, Gaurav Garg, New Age
International(P)Limited, Second Edition, 2019.
2. Research Methodology a step-by step guide for beginners, Ranjit Kumar, SAGE Publications
Ltd., Fourth Edition, 2014.
3. Study material on Intellectual Property Rights-Law and Practice, The Institute of Company
Secretaries of India, 2015.
Reference Books:
4. Research Methods: the concise knowledge base, Trochim Atomic Dog Publishing, 2004.
5. Conducting Research Literature Reviews: From the Internet to Paper, Fink A, Sage Publications,
2010.
COURSE OUTCOMES (CO): Upon the completion of the course, students will be able to
CO1 Describe the knowledge of research techniques for conducting research studies
CO2 Apply the knowledge of research process to provide solutions for engineering problems.
CO3 Analyze the techniques of research for solving the problems
Investigate the problems using research-based methods, appropriate techniques, resources,
CO4
and engineering tools to provide valid conclusions

CO – PO Matrix

PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2
CO2 2
CO3 2 2
CO4 2 2 - 2
AVG 2 2 2 2 2 2

You might also like