III and IV Sem Autonomous Scheme and Syllabus

Vidyavardhaka College of Engineering
Gokulam III stage, Mysuru – 570 002

Autonomous Institute under Visvesvaraya Technological University (VTU)
Accredited by NBA (2017- 2020) & NAAC with ‘A’ Grade (2018 - 2023)
Department of Computer Science & Engineering

Scheme of Teaching and Examination for B.E. with effect from 2020 – 2021
III Semester
Contact Hours /
Examination
Course
Course
Code
Sl. Teaching week

Area
Course Name Credits

No Department Duration CIE SEE
L T P Total
(Hr.) Marks Marks
1 BS 20MA31 Advanced Mathematics-III Mathematics 3 2 0 3 50 50 100 4
2 PC 20CS32 Data Structures CS 3 0 0 3 50 50 100 3
3 PC 20CS33 Object Oriented Programming CS 3 0 0 3 50 50 100 3
4 PC 20CS34 Computer Organization and ARM Architecture CS 3 0 0 3 50 50 100 3
5 PC 20CS35 Discrete Mathematics and Graph Theory CS 3 0 0 3 50 50 100 3
6 HS 20HS31 Universal Human Value CS 2 0 0 3 50 50 100 2
7 PC 20CS37 Data Structures Laboratory CS 1 0 2 3 50 50 100 2
8 PC 20CS38 Python Programming Laboratory CS 1 0 2 3 50 50 100 2
9 HS 20HS32 Skill Development-I TAP 0 2 0 - 50 50 100 1
20HS34 /
10 HS Balake Kannada/ Samskruthika Kannada HS 1 0 0 2 50 50 100 1
20HS35
TOTAL 20 4 4 - 500 500 1000 24
11 BS 20MADIP 31 Additional Mathematics-I *# Mathematics 3 2 0 3 50 50 100 -
* Mandatory Non – Credit Course to be cleared before the end of that Academic Year
#
Applicable to lateral entry students
NOTE: PC:Professional Core CREDIT Definition

BS: Basic Science PE :Professional Electives 1 hour Lecture per week per semester = 1 credit
ES: Engineering Science OE :Open Electives 2 hours Tutorials per week per semester = 1 credit
HS:Humanities & Social Science PRI:Project & Internship 2 hours Practical / lab / drawing per week per semester = 1 credit
Department of Computer Science & Engineering

Scheme of Teaching and Examination for BE with effect from 2020 – 2021
IV SEMESTER
Contact
Examination
Course
Course
Code
Sl. Teaching Hours/ week

Area
Course Name Credits

No. Department Duration SEE
L T P CIE Marks Total
(Hr.) Marks
1 BS 20MA41 Advanced Mathematics-IV Mathematics 3 2 0 3 50 50 100 4
2 PC 20CS42 Design and Analysis of Algorithms CS 3 0 0 3 50 50 100 3
3 PC 20CS43 Web Technology and its Applications CS 3 0 0 3 50 50 100 3
4 PC 20CS44 Data Communication CS 3 0 0 3 50 50 100 3
5 PC 20CS45 Software Engineering and Testing CS 3 0 0 3 50 50 100 3
6 PC 20CS46 Operating System CS 3 0 0 3 50 50 100 3
7 PC 20CS47 Design and Analysis of Algorithms Laboratory CS 1 0 2 3 50 50 100 2
8 PC 20CS48 Web Programming Laboratory CS 1 0 2 3 50 50 100 2
9 HS 20HS42 Skills Development-II TAP 0 2 0 3 50 50 100 1
10 HS 20HS43 * HS 1 0 0 - 50 - 50 -
Constitution of India & Professional Ethics
TOTAL 21 4 4 - 500 450 950 24
11 BS 20MADIP41 Additional Mathematics-II *# Mathematics 3 2 0 3 50 50 100 -
* Mandatory Non – Credit Course to be cleared before the end of that Academic Year
#
Applicable to lateral entry students
NOTE: PC:Professional Core CREDIT Definition

BS: Basic Science PE :Professional Electives 1 hour Lecture per week per semester = 1 credit
ES: Engineering Science OE :Open Electives 2 hours Tutorials per week per semester = 1 credit
HS:Humanities & Social Science PRI:Project & Internship 2 hours Practical / lab / drawing per week per semester = 1 credit
Semester – III
Course Name : Advanced Mathematics-III Course Code: 20MA31
No. of Lecture Hours / Week : 03 CIE Marks: 50

No. of Tutorial / Practical
: 02 SEE Marks: 50
Hours / Week
Total No. of Lecture + Tutorial
: 36 + 24 = 50 SEE Duration: 03 hr.
/ Practical Hours
L:T:P : 3:2:0 Credits: 04
Course Overview
The course provides Mathematical techniques in the advanced areas of Mathematics like Fourier, Z-
Transformation, Numerical Methods, Partial Differential Equations and Calculus of Variation/Advanced Linear
Algebra that are of at most relevance to the Engineering disciplines. The purpose of this course is to provide
the skills and knowledge required to perform Mathematical procedures and processes for solution of
Engineering problems.
Course Learning Objectives (CLOs)
• Explain the concept of Fourier, Z-Transformation, Numerical Methods, Partial Differential Equations and
Calculus of Variation/Advanced Linear Algebra applying it appropriately in solving Engineering problems.
• Explain how to analyze the Engineering problems by making use of the concepts of Fourier, Z-
Transformation, Numerical Methods, Partial Differential Equations and Calculus of Variation/Advanced
Linear Algebra.
• Explain the usage of modern tools to understand the concepts of Fourier, Z-Transformation, Numerical
Methods, Calculus of Variation and Partial Differential Equations.
Teaching
MODULE Hours
MODULE 1
Fourier and Harmonic Series
Fourier Series: Periodic functions, Dirichlet’s condition. Fourier series of periodic functions,
08
Half range Fourier series, deducing some important series. Practical Harmonic Analysis:
Harmonic Analysis
SLE: Half range harmonic series

MODULE 2
Fourier Transforms and Z –Transforms (I-C)
Fourier Transforms: Fourier transforms, Fourier sine and cosine transforms, Inverse Fourier
08
transforms (direct method)
Z-Transforms: Basic definition, problems on Z-Transforms of standard functions (without
proof), Damping and shifting rules (Problems only). Inverse Z-Transform and applications to
1
solve difference equations
SLE: Derivation of standard Z-Transforms
Module 3: Partial Differential Equations (PDE's)
Formation of PDE's by elimination of arbitrary functions. Solution of non-homogeneous PDE
by direct integration, Solution of Lagrange’s Linear PDE. Solution of PDE by variable
08
separable method, Solutions of one-dimensional heat and wave equations using variable
separable method
SLE: Solution of Laplace equation by variable separable method
MODULE 4: Numerical Solutions of Ordinary Differential Equations (I-C)
Numerical Solutions of First Order and First-Degree ODE’s - Taylor’s series method, Runge-
Kutta method of fourth order, Milne’s predictor-corrector method (No derivations) -
Problems
08
Numerical Solutions of Second Order ODE’s: Runge-Kutta method of fourth order
(No derivations)-Problems
Numerical Methods to Solve PDE’s: Parabolic and Laplace equations
SLE: Numerical methods to solve hyperbolic equation
MODULE 5
Advanced Linear Algebra: Orthogonalization (GS algorithm), QR-factorization, Singular
08
value decomposition (SVD) (without proof).
SLE: Singular value decomposition of square matrix (2 x 2)
Textbooks
1. B. S. Grewal, Higher Engineering Mathematics, Latest edition, Khanna Publishers
2. B. V. Ramana, Higher Engineering Mathematics, Latest edition, Tata Mc. Graw Hill Publications
3. E. Balaguruswamy, Numerical Methods, Tata-McGraw-Hill Publication Limited
4. David C. Lay, Linear Algebra and its Applications, Third edition, Pearson Publication
Reference Books
1. Erwin Kreyszic, Advanced Engineering Mathematics, Latest edition, Wiley Publications.
2. Peter V. O’Neil, Advanced Engineering Mathematics, 7th edition, CENGAGE Learning India Pvt. Ltd.
Publishers
3. V. N. Ghougule, M. T. Puranic, Numerical Methods and Optimization, Niralli Publication.
4. M. K. Jain, S. R. K. Iyengar, Numerical Methods, sixth ed., New Age, International, Publication
5. Gilbert Strang, Linear Algebra and its Application, Fourth edition, Cengage learning
Course Outcomes (COs)
At the end of the course, students will be able to
Understand the basic concepts of Fourier, Z-Transforms, Partial Differential Equations, Numerical
CO1
Solutions to ODE &PDE, Calculus of Variation/Advanced Linear Algebra
CO2 Apply the concept of Fourier, Z-Transforms, Partial Differential Equations, Numerical Solutions to
2
ODE &PDE, Calculus of Variation/Advanced Linear Algebra to solve the problems arising in
Engineering field
Analyze mathematical problems arising in Engineering, using the concepts of Fourier, Z-
CO3 Transforms, Partial Differential Equations, Numerical Solutions to ODE &PDE, Calculus of
Variation/Advanced Linear Algebra
Use modern tool to solve/visualize mathematical problems arising in Engineering (Additional CO -
CO4
PO5)
CO – PO – PSO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1
CO2 2
CO3 2
CO4 2
Avg. 1.5 2 2
3
Semester – III
Course Name : Data Structures Course Code: 20CS32

: 00 SEE Marks: 50
Hours / Week
: 40 SEE Duration: 03 hr.
/ Practical Hours
Course Overview
In this course, we will study several basic algorithms and data structures and learn how to implement them in
C. Some of the data structures we will encounter include linked lists, stacks, queues, trees, heaps, hash tables
and graphs. We will study and analyse algorithms for searching, traversing trees, hashing, manipulating
priority queues and finding shortest paths in graphs.
• Understand the foundations of data structure and how different data structures are used for effective
data access and data manipulation
• Investigate various data structures such as stacks, queues, link lists, trees, and graphs
• Understand the context of problem definition and implement a suitable data structure to solve it
Teaching
MODULE Hours
MODULE 1
Introduction: Data structures, pointers and dynamic memory allocation, data abstraction.
Arrays: Dynamically allocated arrays, Sparse matrix and polynomial representation.
String Processing & Pattern matching Algorithms: Naive Pattern Searching, KMP Algorithm. 08
Sorting Techniques : Insertion Sort , Radix Sort
SLE : String Operations
Text Book 1 : Ch.1-1.2,1.4,Ch.2-2.2,2.4,2.5,2.7.3 Text Book 2 : Ch.1-1.4,Ch.3-3.7,Ch. 9-9.3,9.7
MODULE 2
Stacks: Introduction, Array representation, Applications of stacks: Infix to Postfix, Evaluation
of Postfix, Recursion, Tower of Hanoi 08
Queues: Introduction, Circular queues, Deques, Priority queue
SLE: Multiple stacks and queues
Textbook 1: Ch. 3- 3.4,3.6 Textbook 2: Ch. 6-6.1 to 6.3,6.5, 6.7, 6.8, 6.10, 6.12,6.13
MODULE 3
Linked Lists: Introduction, Representation of linked list in memory, traversing and searching
linked list, insertion, deletion from the linked list, header linked list, two-way linked list,
Linked list representation of stacks and queues, Circular linked list 08
SLE: Addition and concatenation of two lists
Textbook 1: Ch.4 - 4.4.4
Textbook 2: Ch. 5 - 5.1 to 5.4, 5.7 to 5.10 Ch.6 – 6.4, 6.11
4
MODULE 4
Trees: Introduction, Binary Trees, Binary tree Traversal, Additional binary tree operations,
Threaded Binary trees, Binary search Trees 08
SLE: Expression trees, Heaps
Textbook 1: Ch. 5- 5.1 to 5.5, 5.7
MODULE 5
Trees: Selection Trees, Forest, Representation of Disjoint Sets, Counting binary tree
Efficient Binary Search trees: AVL trees, Red-Black Trees, Splay tree
Graphs: ADT, Elementary graph operations: BFS, DFS 08
Hashing: Introduction, Static Hashing, Dynamic Hashing.
SLE: Optimal Binary Search trees
Textbook 1: Ch. 5 - 5.8 to 5.11, Ch.6 – 6.1 to 6.2 ,Ch.8- 8.1 to 8.3, Ch.10 - 10.2 to 10.4
Textbooks
5. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, 2nd Edition, Universities Press,
reprint 2018
6. Seymour Lipschutz, Data Structures Schaum's Outlines, Revised 1st Ed, McGraw Hill, 2014
Reference Books
6. Programming and Data Structure by Jackulin C Salini etal., Ane books publishers, 2019
7. Learning JavaScript data structures and algorithms hone your skills by learning classic data structures by
Loiane Groner, Pack T publishing, 2019
8. Data structures and program design in C by Robert Kruse, Tondo C L, Bruce Leung, Pearson education
publishers, 2017
9. Introduction to Algorithms by Thomas H Cormen, 2nd Edition, MIT Press,2009
CO1 Explain the fundamentals of basic data structures
CO2 Implement the various data structures and its applications
CO3 Analyze the various operations on data structures
Design appropriate solution by implementing suitable data structure for a given problem in a
CO4
team. (Additional CO - PO9)
CO1 2 1
CO2 3 2
CO3 3 1
CO4 2 1
Avg. 2.5 3 2 1.5 1
5
Semester – III
Course Name : Object Oriented Programming Course Code: 20CS33

No. of Practical Hours /
: 00 SEE Marks: 50
Week
Total No. of Lecture +
Tutorial / Practical Hours
Course Overview
This course provides basic coverage of object-oriented programming principles and techniques using JAVA.
Topics include classes, overloading, data abstraction, encapsulation, inheritance, polymorphism, and
exception. The course briefly covers the UI design using JAVA, implementation and object-oriented
considerations for software design and reuse.
● To understand the fundamental features of object-oriented language with JAVA
● To know multi-threaded programs and exception handling mechanisms
● To learn servlets, JSP and JDBC
Teaching
MODULE Hours
MODULE 1
Introducing Classes: Class fundamentals, declaring objects, assigning object reference
variables, introducing methods, constructors, the this keyword, garbage collection A Closer
Look at Methods and Classes: overloading methods, using object as parameters, understanding 08
static, introducing final, introducing nested and inner classes
SLE: using command line arguments
Textbook 1: Ch. 6 ,7
MODULE 2
Inheritance: Inheritance basics, using super, create multi-level hierarchy, method overriding,
dynamic method dispatch, using abstract classes, interfaces Exception Handling in Java:
Exception handling fundamentals, exception types, using try and catch, nested try statements, 08
throw, throws and finally Multi-Threaded Programming: The Java Thread Model, The main
thread, creating a thread, creating multiple threads, using isAlive() and join()
SLE: using final with inheritance
Textbook 1: Ch. 8 - 11
MODULE 3
Multithreading and Collections: Thread priorities, synchronization, interthread communication,
Deadlock, suspending. Exploring the Collections Framework: Collections Overview, The
08
Collection Interfaces, The Collection Classes, accessing a collection Via an Iterator, Storing User
Defined Classes in Collections
SLE: Resuming and Stopping threads
6
Textbook 1: Ch. 11, 19
MODULE 4
Servlets: Java Servlets and Common Gateway Interface Programming, A simple Java Servlet,
Anatomy of a Java Servlet, Reading Data from client, Reading HTTP Request Headers, sending
data to a client and writing the HTTP Response Header, working with Cookies; Tracking Session. 08
Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies
SLE: Session Objects
Textbook 2: Ch. 10, 11
MODULE 5
Java Database Connectivity: The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief
Overview of the JDBC process; Database Connection; Associating the JDBC/ODBC Bridge with
08
the Database; Statement Objects; Result Set; Transaction Processing; Metadata, Data types
SLE: Exceptions
Textbook 2: Ch. 6
Textbooks
1. Herbert Schildt, “JAVA the Complete Reference”, 10th Edition, Oracle Press, 2017
2. Jim Keogh, “J2EE-TheCompleteReference”, McGraw Hill, 2017
Reference Books
1. E Balaguruswamy, “Programming with Java”, 5th Edition, McGraw Hill Education, 2017
2. R Nageswara Rao, “Core and Advanced Java, Black Book, Dreamtech Press, 2018
Note: The faculty shall organize a bridge course on the basic concepts of Java for a period of 2 days.
CO1 Explain the object-oriented concepts in JAVA
CO2 Apply the concepts of object-oriented programming to solve a real-world problem
CO3 Analyze how the concepts of OOP fit into Java based applications
CO4 Design data centric applications
CO5 Develop a simple web application using IDEs (Additional CO-PO5)
CO1 1
CO2 2
CO3 2
CO4 2 2
CO5 2 2
Avg. 1.5 2 2 2 2 2
7
Semester – III
: Computer Organization and ARM
Course Name Course Code: 20CS34
Architecture
: 00 SEE Marks: 50
Hours / Week
Course Overview
This course deals with the selection of the basic functional units such as the processor and memory, and how
they should be interconnected into a computer system. Computer organization is concerned with how the
various hardware components operate and how they are interconnected to implement the architectural
specifications
• To understand the basic subsystems of a computer, their organization, structure and operations
• Illustrate the concept of programs as sequences of machine instructions
• Demonstrate different ways of communicating with I/O devices and standard I/O interfaces
• Exposure to ARM architecture and its programming
Teaching
MODULE Hours
MODULE 1
Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance-
Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement.
Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, 08
Instructions and Instruction Sequencing, Addressing Modes
SLE: Additional Instructions
Textbook 1: Ch.1: 1-1.3,1.4,1.6(1.6.1-1.6.4,1.6.7), Ch.2: 2.2 to 2.5
MODULE 2
Input / Output Organization: Accessing I/O Devices, Interrupts-Interrupt Hardware, Direct
Memory Access, Buses, Interface Circuits, Standard I/O Interfaces-PCI Bus, SCSI Bus, USB 08
SLE: Universal Serial Bus(USB)
Textbook 1: Ch.4: 4.1,4.2,4.4,4.5,4.6,4.7
MODULE 3
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed,
Size and Cost, Cache Memories-Mapping Functions, Replacement Algorithm, Performance
Considerations. 08
Arithmetic: Addition & subtraction of signed numbers, Design of fast adders; Multiplication of
positive numbers, Signed-operand multiplication, Fast multiplication, Integer division
SLE: Virtual Memory
Textbook 1: Ch.5: 5.1 to 5.4,5.5(5.5.1,5.5.2),5.6, Ch. 6: 6.1 to 6.6
8
MODULE 4
ARM Processor Fundamentals: Registers, Current Program Status Register, Pipeline, Exceptions,
Interrupts and the Vector Table, Core Extensions.
Introduction to the ARM Instruction Set: Data Processing Instructions, Branching Instructions, 08
Load-Store Instructions, Software Interrupt Instruction, Program Status Register Instructions,
Loading Constants
SLE: Loading Constants
Textbook 2: Ch.2: 2.1-2.5,3.1-3.6
MODULE 5
Writing and Optimizing ARM Assembly Code: Writing Assembly Code, Profiling and Cycle
counting, Instruction scheduling, Conditional execution, Looping constructs (Decremented
08
counted loops, Unrolled Counted loops), Sample ARM assembly programs
SLE: Register Allocation
Textbook 2: Ch.6: 6.1-6.6
Textbooks
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, ‘Computer Organization’, Fifth Edition, McGraw Hill
Education (India), 2016
2. Andrew N. Sloss, Dominic Symes, Chris Wright, ‘ARM System Developers Guide’, Designing and Optimizing
System Software, Elsevier publications, 2017
Reference Books
1. William Stallings: Computer Organization & Architecture, 9th Edition, Pearson, 2015
2. Steve Fuber, ‘ARM system-on-chip architecture’, Second Edition, United Kingdom, 2015
CO1 Explain the basic structure and machine instructions of ARM Processor and a computer system
Demonstrate the applications of arithmetic operations, memory and ARM assembly code to
CO2
design a computer system
CO3 Examine the functioning of different subsystems, such as processor, Input/output and memory
Ability to independently assemble, disassemble and upgrade the system configuration by
CO4
applying the knowledge of Computer Organization (Additional CO- PO12)
CO1 2 2
CO2 3 2
CO3 2 2
CO4 1 2
Avg. 2.5 2 1 2
9
Semester – III
Course Name : Discrete Mathematics and Graph Theory Course Code: 20CS35

: 00 SEE Marks: 50
Hours / Week
Course Overview
Discrete Mathematics is a subject of mathematics involving discrete elements that use algebra and
arithmetic. It is increasingly being applied in the practical fields of mathematics and computer science. The
mathematics of modern computer science is built almost entirely on discrete math, in particular
combinatorics and graph theory. This course provides a solid background in these topics to learn the
fundamental algorithms used by computer programmers.
• To learn and use propositional logic, truth table and mathematical induction to verify the correctness of
an argument
• To understand and apply mathematical induction, combinatorics, discrete probability, and elementary
number theory
• To understand the graph and tree structures and properties
• To explore the applications of Discrete Mathematics to computer science domain
Teaching
MODULE
Hours
MODULE 1
Logic and Proofs: Propositional Logic- propositions, Basic Connectives and Truth Tables,
Propositional equivalences, Rules of Inference 08
SLE: Predicates and Quantifiers
Textbook 1: Ch. 2.1 to 2.4
MODULE 2
Induction and Counting: Well ordering principle- Mathematical Induction, Basics of counting,
Permutations and Combinations, Combinations with Repetition. 08
SLE: The Pigeon-hole Principle
Textbook 1: Ch. 4.1, 1.1 to 1.4, 5.5
MODULE 3
Number Theory and Discrete Probability: Linear Congruences – Chinese remainder theorem.
Introduction to discrete probability, Probability Theory – Introduction, Assigning Probabilities,
Probabilities of complements and union of events, Conditional Probability, Independence, 08
Bernoulli Trials and the Binomial Distribution, Random Variables
SLE: Divisibility and Modular Arithmetic
Textbook 2: Ch. 4.1, 4.4, 7.1, 7.2.1 to 7.2.7
10
MODULE 4
Introduction to Graph Theory: Definitions and Examples, Sub graphs, Complements, and
Graph Isomorphism, Trees: Routed Trees, Weighted Trees and prefix codes 08
SLE: Definitions and Properties of Trees
Textbook 1: Ch. 11.1,11.2, 12.1, 12.2, 12.4
MODULE 5
Applications of Discrete Mathematics: Encryption and Decryption using RSA Algorithm, Bayes
Theorem, Dijkstra’s Shortest Path Algorithm, Minimal Spanning Trees – The algorithm of Prim. 08
SLE: Simplifying Logic Circuits, Minimal Spanning Trees – The algorithm of Kruskal
Textbook 1: Ch. 13.1 to 13.2, Textbook 2: Ch. 1.2.6, 4.6.5, 4.6.6, 7.3.2
Textbooks
1. Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics – An applied Introduction”, 5th Edition,
Pearson Publication, 2018
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 8th Edition, McGraw Hill Publication,
2019
Reference Books
1. N. Deo, “Graph Theory with applications to engineering and Computer Science”, PHI, 2004
2. J.P. Tremblay, R. Manohar, “Discrete Mathematical Structures with Applications to Computer Science”,
McGrawHill Publications, 2006
3. D.S. Chandrasekharaiah, “Discrete Mathematical Structures”, 6th Edition, Prism Publication, 2019
4. Erciyes K,” Discrete Mathematics and Graph Theory - A Concise Study Companion and Guide”, Springer,
2021
CO1 Explain the basic concepts of discrete mathematical structures
Apply graphs, propositional logic, counting techniques, number theory and discrete probability to
CO2
solve real world problems
Examine the correctness of an argument, possible outcomes of a situation, occurrence of an
CO3
event, graph and its properties
Communicate the applications of Discrete Mathematical Structures to support a technical concept
CO4
(Additional CO- PO10)
CO1 1 1
CO2 3 1
CO3 2 2
CO4 1 1
Avg. 2 2 1 2 1
11
Semester – III
Course Name : Universal Human Values Course Code: 20HS31

: 00 SEE Marks: 50
Hours / Week
Course Overview
The course is designed to orient the students for universally adaptable, involving a systematic and rational
study of the human being vis-à-vis the rest of existence. It is free from any dogma or value prescriptions. This
process of self-exploration takes the form of a dialogue between the teacher and the students to begin with
and within the student himself/herself finally.
• Development of a holistic perspective based on self-exploration about themselves (human being), family,
society and nature/existence
• Understanding (or developing clarity) of the harmony in the human being, family, society and
nature/existence
• Strengthening of self-reflection
• Development of commitment and courage to act
Teaching
MODULE
Hours
MODULE 1
Course Introduction - Need, Basic Guidelines, Content and Process for Value Education
Purpose and motivation for the course, recapitulation from Universal Human Values-I, Self-
Exploration–what is it? - Its content and process; ‘Natural Acceptance’ and Experiential
Validation- as the process for self-exploration, Continuous Happiness and Prosperity- A look at 05
basic Human Aspirations, Right understanding, Relationship and Physical Facility- the basic
requirements for fulfillment of aspirations of every human being with their correct priority.
Understanding Happiness and Prosperity correctly- A critical appraisal of the current scenario,
Method to fulfill the above human aspirations: understanding and living in harmony at various
levels.
MODULE 2
Understanding Harmony in the Human Being - Harmony in Myself
Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’,
Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical facility,
05
Understanding the Body as an instrument of ‘I’ (I being the doer, seer and enjoyer),
Understanding the characteristics and activities of ‘I’ and harmony in ‘I’, Understanding the
harmony of I with the Body: Sanyam and Health; correct appraisal of Physical needs, meaning
of Prosperity in detail, Programs to ensure Sanyam and Health.
12
MODULE 3
Understanding Harmony in the Family and Society- Harmony in Human-Human Relationship
Understanding values in human-human relationship; meaning of Justice (nine universal values
in relationships) and program for its fulfillment to ensure mutual happiness; Trust and Respect
as the foundational values of relationship. Understanding the meaning of Trust; Difference 05
between intention and competence. Understanding the meaning of Respect, Difference
between respect and differentiation; the other salient values in relationship. Understanding
the harmony in the society (society being an extension of family): Resolution, Prosperity,
fearlessness (trust) and co-existence as comprehensive Human Goals. Visualizing a universal
harmonious order in society- Undivided Society, Universal Order- from family to world family.
MODULE 4
Understanding Harmony in the Nature and Existence - Whole existence as Coexistence
Understanding the harmony in the Nature, Interconnectedness, and mutual fulfillment among
the four orders of nature recyclability and self-regulation in nature. Understanding Existence
05
as Co-existence of mutually interacting units in all pervasive space. Holistic perception of
harmony at all levels of existence. Include practice sessions to discuss human being as cause of
imbalance in nature (film “Home” can be used), pollution, depletion of resources and role of
technology etc.
MODULE 5
Implications of the above Holistic Understanding of Harmony on Professional Ethics
Natural acceptance of human values, Definitiveness of Ethical Human Conduct. Basis for
Humanistic Education, Humanistic Constitution and Humanistic Universal Order. Competence
in professional ethics: a. Ability to utilize the professional competence for augmenting
universal human order b. Ability to identify the scope and characteristics of people friendly
05
and eco-friendly production systems, c. Ability to identify and develop appropriate
technologies and management patterns for above production systems.
Case studies of typical holistic technologies, management models and production systems.
Strategy for transition from the present state to Universal Human Order: a. At the level of
individual: as socially and ecologically responsible engineers, technologists and managers.
b. At the level of society: as mutually enriching institutions and organizations.
Textbooks
1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel Books, New Delhi, 2010
Reference Books
1. Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book)
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj - PanditSunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
13
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)
Understand the need of human values to become more aware of themselves, and their
CO1
surroundings (family, society, nature)
Understand the responsibilities in life, and in handling problems with sustainable solutions, while
CO2
keeping human relationships and human nature in mind
Have better critical ability and also become sensitive to their commitment towards human
CO3
relationship and human society
CO4 Apply what they have learnt to their own self in different day-to-day settings in real life
CO1 2
CO2 2 2
CO3 2 2
CO4 2
Avg. 2 2 2
14
Semester – III
Course Name : Data Structures Lab Course Code: 20CS37

: 02 SEE Marks: 50
Hours / Week
: 42 SEE Duration: 03hr.
Course Overview
The laboratory course aims at introducing the concepts of data structure to the students using C. The
students will be able to enhance their analytical and problem-solving skills by implementing suitable data
structure. This course is designed to encourage the students in solving open ended problems
This laboratory course enables the students to gain practical experience in design, development,
implementation, analysis and evaluation/testing of
● Linear data structures and their applications such as stacks, queues and lists
● Non-linear data structures and their applications such as trees and graphs
● Pattern Matching algorithms
Part A
(Demonstration)
1. Design, Develop and Implement a Program in C for the following operations on Strings
1. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
2. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR with REP if PAT
exists in STR. Report suitable messages in case PAT does not exist in STR.
3. Pattern Matching Algorithm: Brute Force
4. Support the program with functions for each of the above operations. Don't use Built-in functions
5. Check the following test cases.
Test Case 1: STR = “VVCE MYSURU”, PAT=” MYSURU”, REP=” KARNATAKA”, OUTPUT=” VVCE
KARNATAKA”
Test Case 2: STR = “COMPUTER SCIENCE”, PAT=” COMPUTER”, REP=” BASIC”, OUTPUT=” BASIC
SCIENCE”
(Demonstration)
2. Design, Develop and Implement a Program in C for the following operations on expression.
a. Read infix expression String (INFIX)
b. Convert the infix expression (INFIX) to a postfix expression using stacks.
c. Evaluate the postfix expression using stacks.
d. Check the following test cases.
Test Case 1: Infix = “(1+ (2-3) *4)”, Postfix=”123-4*+”, Result = -3
Test Case 2: Infix = “4/2-2+3*3-4*2”, Postfix=”42/233*42*-+-”, Result = -1
Note: Program should support for both parenthesized and free parenthesized expressions with the
operators: +, -, *, /, % (Remainder), ^ (Power) and alphanumeric operands.
15
(Exercise)
3. Design, Develop and implement menu driven program to simulate processing of batch jobs by a computer
system. The scheduling of these jobs should be handled using a priority queue.
Note:
● The Program should allow users to add or remove items from the queue.
● It should also display current status i.e. the total number of items in the queue. (Exercise)
4. Design, Develop and implement c program using singly linked list for the following scenario
a. There are two linked list A and B containing the following data:
A: 3,7,10,15,16,09,22,17,32 and B: 16,02,09,13,37,08,10,01,28
b. Create a linked list C that contains only those elements that are common in linked list A and B
c. Create a linked list D which contains all elements of A as well as B ensures that there is no repetition of
elements.
(Structured Enquiry)
5. Design, Develop and implement C program for the following operations on doubly linked list.
a. Create doubly linked list of N nodes with integer data by adding each node at the front.
b. Delete the node of a given data if it is found, otherwise display appropriate message.
c. Insert a node to the left of the node whose key value is read as input.
d. Display the contents of the list.
(Exercise)
6. Design, Develop and Implement a menu driven Program in C for the following operations on Binary
Search Tree (BST) of Integers.
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
b. Traverse the BST in In-order, preorder, post-Order, zigzag order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Display the height of binary trees
e. Exit
7. Design, develop a program in C to implement AVL tree operations.
16
8. Design, Develop a program in C to implement various operations on Red-Black Tree.
9. Design, Develop and Implement a Program in C for the following operations on Graph (G) of Cities
a. Create a Graph of N cities using Adjacency Matrix.
b. Print all the nodes reachable from a given starting node in a digraph using the DFS / BFS method
(Exercise)
10. Given a File of N employee records with a set K of Keys (4-digit) which uniquely determine the records in
file F.
a. Assume that file F is maintained in memory by a Hash Table (HT) of M memory locations with L as the
set of memory addresses (2-digit) of locations in HT.
b. Let the keys in K and addresses in L are Integers. Design and develop a Program in C that uses Hash
Function H: K%L as I (remainder method), and implement hashing techniques to map a given key K to
the address space L.
c. Resolve the collision (if any) using linear probing
Part B
Open ended Problems
1. Design and Develop C program to implement following
a. Shell sort
b. Heap sort
c. Merge sort
d. Quick sort
e. Bucket sort
17
2. Design and Develop C program to implement following search algorithms
a. Jump Search.
b. Interpolation Search.
c. Exponential Search.
d. Sub list Search (Search a linked list in another list) Fibonacci Search.
e. The Ubiquitous Binary Search.
Weightages:
Type of Experiment Program Numbers Weightage
Demonstration 1&2 16%
Exercise 3,4,5 & 10 33.33%
Structured Enquiry 6,7,8,9 33.33%
Open Ended 10%

CO1 Demonstrate the various data structures and its operations
CO2 Design and Develop C programs to implement data structure and its applications
CO3 Implement searching and sorting algorithms in a collaborative environment
CO1 2
CO2 2 2 2 2
CO3 2 2
Avg. 2 2 2 2 2 2
18
Semester – III
Course Name : Python Programming Laboratory Course Code: 20CS38
No. of Lecture Hours /
: 01 CIE Marks: 50
Week
: 02 SEE Marks: 50
Hours / Week
Course Overview
The laboratory course Python Application Programming aims to introduce the students about the basics of
writing and running python scripts. The students will be able to enhance their analysing and problem-solving
skills by implementing suitable functionality using core data structures like lists, dictionaries, tuples and sets
in Python to store and process the data.
• Learn the syntax and semantics of Python
• Interpret the use of procedural statements like assignments, conditional statements, loops and
function calls
• Demonstrate the use of built-in functions
• Infer the supported data structures like list, dictionaries and tuples in Python
Part – A
1. Develop a Python program to
a) Calculate the sum of digits of an input number & repeat it until you get single digit. If resultant sum is
equal to 1 then print it as a Magic number.
b) Print all prime numbers smaller than or equal to a specified number.
2. Design a Python program to implement the Rock-Paper-Scissor game.

a) Extract the substring present between @ and #.
b) Count occurrence of character ‘e’ in a string.
c) Remove the word “the” present in a string.
d) Count the total number of apples bought by the guests in the given dictionary
AllGuests = {'Alice': {'apples': 5, 'pretzels': 12}, 'Bob': {'ham sandwiches': 3, 'apples': 2}, 'Carol': {'cups': 3, 'apple pies': 1}}

a) Accept a string and display the string in reverse order. The displayed string must contain all characters
at the even position of accepted string ignoring the blank spaces.
b) Print all ‘;’ separated email IDs present in a string.
19
c) Count the occurrence of all the characters in the string.
5. Develop a Python program to implement the Hangman Game (guessing game) for two or more
players. One player thinks of a word, phrase or sentence and the other(s) tries to guess it by
suggesting letters or numbers, within a certain number of guesses.

a) Print all words present in a string along with their length and total words present in the string.
b) Display first ‘n’ Fibonacci numbers in reverse order.
7. Design a Python program using Regular expressions to

a) Extract Email IDs from a given text.
b) Validate the user password with minimum length=6 and maximum length=16 and must have at
least one lower-case letter, upper-case letter, number and special symbol (#, @, $, _).
8. Perform the following file operations using Python program:

a) Traverse a path and display all the files and subdirectories in each level till the deepest level for a
given path. Also, display the total number of files and subdirectories.
b) Read a file content and copy only the contents at odd lines into a new file.
9. Develop an application using ‘tkinter’ package to randomly assign program numbers for students and
store the assigned details in a CSV file.
10. Create an Interactive Dictionary Application in Python by reading the external JSON file which contains
words and different meanings associated with it. Program will ask the user for a word and returns the
meaning for the user given word from the JSON file, if the actual meaning is not available for the user
given word, the program should through suggestion to user by analyzing the word to check if a user
somehow mistypes the word and meant something else.
20
Part B
Open-Ended Experiments: The student can choose to solve any one open-ended problem to illustrate
python application in the domains specified below (but not restricted to) using various python packages
• Excel file handling
• PDF/word file manipulation
• CSV file analysis
• Web scraping
• Chabot
• Image processing
• Database Management
• Network Programming
• GUI development for python application
• Simple Games
Experiment Weightage
Type of Experiment Program-No Weightage

Demonstration 1, 3 18%
Exercise 2,4,5,6 36%
Structured Enquiry 7,8,9,10 36%
Open ended - 10%

CO1 Demonstrate the usage of Python language constructs
CO2 Design and Develop Python programs using data structures like lists, dictionaries, tuples and sets
CO3 Employ various IDEs and packages for the development of python application for the given problem
CO1 2 2
CO2 3 3
CO3 2 1
Avg. 2 3 2 2
21
Semester – III
Course Name : Skill Development-I Course Code: 20HS32

: 02 SEE Marks: 50
Hours / Week
/ Practical Hours
Course Overview
Skill development is/are personal attributes that influence how well an individual can work or interact with
others. These skills make it easier to form relationships with people, create trust and dependability, and lead
teams. In essence, they are essential for individual success in the workplace, their company’s success, and
their personal life as well.
• To provide exposure to soft skills in life sciences to develop all-round personalities with a mature outlook
to function effectively in different circumstances
• To provide innovative methods for enhancing problem solving skills in general aptitude
Teaching
MODULE Hours
MODULE 1
Propelling Self: Building self with Competence and Adaptability
1. Components of attitude, taking ownership, focusing on goals and not obstacles, factors
affecting self-confidence, developing interpersonal skills, confident behaviour patterns,
04
asserting yourself and the art of saying no, activities on building self confidence
2. Elements of continuous learning, the continuous learning model, benefits of continuous
learning, strategies for continuous learning, implementing continuous learning, SWOT
analysis, Rosenberg self-esteem scale
MODULE 2
General Aptitude 1.1
Quantitative Aptitude: Number System HCF and LCM, Decimal Fractions, Simplification, 06
Logical Reasoning: Number Series, Introduction and explanation of concepts with their
applications, focus on concepts and different methods and shortcuts to solve problems
MODULE 3
Improve Sense of Belongingness: Conflict Resolution, team working and critical thinking
1. Defining Teams, Team vs. Group, Benefits, and challenges of working in teams,
04
Importance of teamwork, how to be an effective team player
2. Common causes of workplace conflict, Importance of interpersonal relationship at
workplace, Effects of conflicts, Types of conflict, understanding conflict styles, Ways to
22
deal with conflict management, Effective conflict management
MODULE 4
General Aptitude – 1.2
Understanding Quantitative Aptitude: Ratio and Proportion, Partnership; Understanding
06
Logical Reasoning: Letter Series, Verbal: Comprehension Passage based reading
comprehension, Introduction and explanation of concepts with their applications. Focus on
concepts and different methods and shortcuts to solve problems
MODULE 5
Understanding Quantitative Aptitude – Averages; Understanding Logical Reasoning: Blood
06
Relations; Cause and Effect, Clocks; Understanding, Introduction and explanation of
concepts with their applications. Focus on concepts and different methods and shortcuts to
solve problems
Textbooks
1. Notes and Textbooks are part of learning methodology
Reference Books
1. The Official Cambridge Guide to IELTS
2. Quantitative Aptitude for Competitive Examinations by R.S Aggarwal
3. A Modern Approach to Verbal & Non-Verbal Reasoning by R.S. Aggarwal
4. AMCAT Preparation Guide
5. You Are the Team: 6 Simple Ways Teammates Can Go from Good to Great by Michael G. Rogers
6. Six Thinking Hats – by Stephen Covey
7. How to Win Friends and Influence People by Dale Carnegie
Understand the importance of continuous learning and implement it successfully
CO1 Understand the basic concepts of the topics covered
Understand what conflict is and how it escalates within the workplace
Apply concepts of goal setting, interpersonal behaviors in life
CO2
Appreciate team skills and dynamics. Identify Critical Thinking
Self-Analyze and develop self-confidence and a positive attitude
CO3
Analyze common conflict resolution styles and use them effectively in teamwork
Compete in various competitive exams with positive mind set
CO4
Practice Positive thinking and Attitude in walks of life
23
CO1 3
CO2 2
CO3 3
CO4 2
Avg. 2 2.5 3
24
Semester – III
Course Name : Balake kannada Course Code: 20HS34

: 00 SEE Marks: 50
Hours / Week
: 15 SEE Duration: 02hr.
/ Practical Hours
Course Overview
People staying in the state of Karnataka need to use Kannada for day today conversation and transactions
with ease and confidence. In fact, learning Kannada language is fascinating, fun, and incredibly rewarding.
This course orients the students to articulate language, literature and culture in a conceptual mode where in
ideas, debates and ideological affiliations are understood and motivate students to explore all that is related
to Kannada.
• ಕನ್ನ ಡ ಸಾಹಿತ್ಯ – ಸಂಸ್ಕ ೃತಿ ಮತ್ತು ನಾಡು ನುಡಿಯ ಪರಿಚಯ ಮಾಡಿಕೊಡುವುದು
• ತಾಂತಿಿ ಕ ಪದಗಳನುನ ಕನ್ನ ಡ ಭಾಷೆಗೆ ಭಾಷಾಂತ್ರಿಸುವ ಪಿ ಕ್ರಿ ಯೆಯನುನ ವಿಶ್ವ ೇಷಿಸುವರು.
• ಗಣಕ ಯಂತ್ಿ ದ ಬಳಕೆ ಮತ್ತು ಮಾಹಿತಿ ತಂತ್ಿ eÁ Õನ್ವನುನ ಬಳಸಿ ಕನ್ನ ಡ ಭಾಷೆಗೆ ಸಂಬಂಧಿಸಿದಂತೆ
ಕೌಶಲಗಳನುನ ಬೆಳೆಸಿಕೊಳ್ಳು ವುದು.
Teaching
MODULE Hours
ಭಾಗ-1, ಲೇಖನಗಳು
ಕನನ ಡ ನಾಡು, ನುಡಿ ಮತ್ತು ಸಂಸ್ಕ ೃತಿಗೆ ಸಂಬಂಧಿಸಿದ ಲೇಖನಗಳು
1. ಕನಾಾಟಕ ಸಂಸ್ಕ ೃತಿ : ಹಂಪ ನಾಗರಾಜಯಯ 03
2. ಕನಾಾಟಕದ ಏಕ್ರೇಕರಣ : ಒಾಂದು ಅಪೂವಾ ಚರಿತೆಿ - ಜಿ. ವಾಂಕಟಸುಬಬ ಯಯ
ಆಡಳಿತ್ ಭಾಷೆಯಾಗಿ ಕನ್ನ ಡ - ಡಾ. ಎಲ್. ತಿಮ್ಮ ೇಶ ಮತ್ತು ಪ್ರಿ . ವಿ. ಕೇಶವಮೂತಿಾ
ಭಾಗ-2, ಕಾವ್ಯ ಭಾಗ (ಆಧುನಿಕ ಪೂವ್ವ)
1. ವಚನ್ಗಳ್ಳ : ಜೇಡರದಾಸಿಮಯಯ , ಅಲಲ ಮಪಿ ಭು, ಬಸ್ವಣಣ , ಅಕಕ ಮಹಾದೇವಿ.

03
2. ಕ್ರೇತ್ಾನೆಗಳ್ಳ : ಅದರಿಾಂದೇನು ಫಲ ಇದರಿಾಂದೇನು ಫಲ - ಪುರಂದರದಾಸ್
25
3. ತ್ತ್ವ ಪದಗಳ್ಳ : ಸಾವಿರ ಕೊಡಗಳ ಸುಟ್ಟು – ಶಿಶುನಾಳ ಷರಿೇಫ , ಜನ್ಪದ ಗಿೇತೆ
ಬೇಸುವ ಪದ
ಭಾಗ – 3, ಕಾವ್ಯ ಭಾಗ (ಆಧುನಿಕ)

1. ಮಂಕುತಿಮಮ ನ್ ಕಗಗ : ಡಿ.ವಿ.ಜಿ
2. ಹೊಸ್ಬಾಳಿನ್ ಗಿೇತೆ : ಕುವಾಂಪು

03
3. ಹಾಂಡತಿಯ ಕಾಗದ : ಕೆ. ಎಸ್. ನ್ರಸಿಾಂಹಸಾವ ಮಿ
4. ಮಬಬ ನಾಂದ ಮಬಬ ಗೆ : ಜಿ.ಎಸ್. ಶಿವರುದಿ ಪಪ
ಚೇಮನ್ ಮಕಕ ಳ ಹಾಡು : ಸಿದಧ ಲಾಂಗಯಯ

ಭಾಗ-4, ತಾಂತಿಿ ಕ ವ್ಯ ಕ್ತು ಪರಿಚಯ, ಕಥೆ ಮತ್ತು ಪಿ ವಾಸ್ ಕಥನ
1. ಡಾ. ಸ್ರ್ ಎಾಂ ವಿಶ್ವ ೇಶವ ರಯಯ - ವಯ ಕ್ರು ಮತ್ತು ಐತಿಯಯ : ಎ ಎನ್ ಮೂತಿಾರಾವ್
03
2. ಯುಗಾದಿ : ವಸುಧಾಂದಿ
ಮ್ಗಾನೆ ಎಾಂಬ ಗಿರಿಜನ್ ಪವಾತ್ : ಹಿ. ಚಿ. ಬೇರಲಾಂಗಯಯ

ಭಾಗ-5, ವಿeÁ Õನ ಮತ್ತು ತಂತ್ಿ eÁ Õನ
1. ಕರಕುಶಲ ಕಲೆಗಳ್ಳ ಮತ್ತು ಪರಂಪರೆಯ ವಿeÁ Õನ್ : ಕರಿೇಗೌಡ ಬೇಚನ್ಹಳಿು
03
2. ’ಕ’ ಮತ್ತು ’ಬ’ ಬರಹ ತಂತಿ ಾಂಶಗಳ್ಳ ಮತ್ತು ಕನ್ನ ಡದ ಟೈಪಾಂಗ್
ತಾಂತಿಿ ಕ ಪದಕೊೇಶ : ತಾಂತಿಿ ಕ ಹಾಗೂ ಪಾರಿಭಾಷಿಕ ಕನ್ನ ಡ ಪದಗಳ್ಳ.

Textbooks
ಸಾಾಂಸ್ಕ ೃತಿಕ ಕನ್ನ ಡ: ಪಿ ಸಾರಾಾಂಗ, ವಿಶ್ವ ೇಶವ ರಯಯ ತಾಂತಿಿ ಕ ವಿಶವ ವಿದಾಯ ಲಯ

ಕನ್ನ ಡ ಭಾಷೆಯ ಮಹತ್ವ ವನುನ ಅರಿಯುವುದು
CO1
Understanding the importance of kannada language
ಕನ್ನ ಡ ಭಾಷೆಯನುನ ಬರೆಯುವ, ಓದುವ ಮತ್ತು ಸಂವಹಿಸುವ ಕೌಶಲವನುನ ಬೆಳೆಸಿಕೊಳ್ಳು ವರು
CO2
They will develop the skills of reading and communication in kannada language
26
Semester – III
Course Name : Samsktuthika kannada Course Code: 20HS35

: 00 SEE Marks: 50
Hours / Week
/ Practical Hours
Course Overview
People staying in the state of Karnataka need to use Kannada for day today conversation and transactions
with ease and confidence. In fact, learning Kannada language is fascinating, fun, and incredibly rewarding.
This course orients the students to articulate language, literature and culture in a conceptual mode where in
ideas, debates and ideological affiliations are understood and motivate students to explore all that is related
to Kannada.
• To read and understand the simple words in Kannada language
• To learn Vyavaharika Kannada (Kannada for Communication)
• To create awareness and interest on Kannada Language and Literature
Teaching
MODULE Hours
Part-1 Lessons to teach and Learn Kannada Language
Lesson-1 ವೈಯಕ್ರು ಕ, ಸಾವ ಮಯ ಸೂಚಕ/ ಸಂಬಂಧಿತ್ ಸ್ವಾನಾಮಗಳ್ಳ ಮತ್ತು ಪಿ ಶ್ನನ ರ್ಾಕ
01
ಪದಗಳ್ಳ- Personal Pronouns, Possessive Forms, Interrogative Words.
Lesson-2 ನಾಮಪದಗಳ ಸಂಬಂಧಾರ್ಾಕ ರೂಪಗಳ್ಳ, ಸಂದೇಹಾಸ್ಪ ದ ಪಿ ಶ್ನ ಗಳ್ಳ ಮತ್ತು
ಸಂಬಂಧವಾಚಕ ನಾಮಪದಗಳ್ಳ- Possessive forms of nouns, dubitive question and Relative 01
nouns.
Lesson-3 ಗುಣ, ಪರಿಮಾಣ ಮತ್ತು ವಣಾಬಣಣ ವಿಶೇಷಣಗಳ್ಳ, ಸಂಖ್ಯಯ ವಾಚಕಗಳ್ಳ
01
Qualitative, Quantitative and colour Adjectives, Numerals.
Lesson-4 ಕಾರಕ ರೂಪಗಳ್ಳ ಮತ್ತು ವಿಭಕ್ರು ಪಿ ತ್ಯ ಯಗಳ್ಳ- ಸ್ಪು ಮಿ ವಿಭಕ್ರು ಪಿ ತ್ಯ ಯ- (ಆ,
01
ಅದು, ಅವು, ಅಲಲ ) Predictive Forms, Locative Case
Lesson-5 ಚತ್ತರ್ಥಾ ವಿಭಕ್ರು ಪಿ ತ್ಯ ಯದ ಬಳಕೆ ಮತ್ತು ಸಂಖ್ಯಯ ವಾಚಕಗಳ್ಳ- Dative Cases,
01
and Numerals
Lesson-6 ಸಂಖ್ಯಯ ಗುಣವಾಚಕಗಳ್ಳ ಮತ್ತು ಬಹುವಚನ್ ನಾಮರೂಪಗಳ್ಳ - Ordinal
01
Numerals and Plural Markers
Lesson-7 ನ್ಯಯ ನ್/ ನಷೇಧಾರ್ಾಕ ಕ್ರಿ ಯಾಪದಗಳ್ಳ ಮತ್ತು ಗುಣವಾಚಕಗಳ್ಳ - Defective /
01
Negative Verbs and Colour Adjectives
Lesson-8 ಅಪಪ ಣೆ / ಒಪಪ ಗೆ, ನದೇಾಶನ್, ಪ್ರಿ ೇತಾ ಹ ಮತ್ತು ಒತು ಯ ಅರ್ಾರೂಪ
01
ಪದಗಳ್ಳ ಮತ್ತು ವಾಕಯ ಗಳ್ಳ - Permission, Commands, Encouraging and Urging words
27
(Imperative words and sentences)
Lesson-09 “ಇರು ಮತ್ತು ಇರಲಲ ” ಸ್ಹಾಯಕ ಕ್ರಿ ಯಾಪದಗಳ್ಳ, ಸಂಭಾವಯ ಸೂಚಕ ಮತ್ತು
ನಷೇಧಾರ್ಾಕ ಕ್ರಿ ಯಾಪದಗಳ್ಳ - Helping Verbs “iru and iralla”, Corresponding Future and 01
Negation Verbs
Lesson-10 ಹೊೇಲಕೆ (ತ್ರತ್ಮ), ಸಂಬಂಧ ಸೂಚಕ ಮತ್ತು ವಸುು ಸೂಚಕ ಪಿ ತ್ಯ ಯಗಳ್ಳ
ಮತ್ತು ನಷೇಧಾರ್ಾಕ ಪದಗಳ ಬಳಕೆ - Comparitive, Relationship, Identification and Negation 01
Words
Lesson-11 ಕಾಲ ಮತ್ತು ಸ್ಮಯದ ಹಾಗೂ ಕ್ರಿ ಯಾಪದಗಳ ವಿವಿಧ ಪಿ ಕಾರಗಳ್ಳ - Different
01
types of forms of Tense, Time and Verbs
Lesson-12 ದ್, ತ್, ತ್ತ, ಇತ್ತ, ಆಗಿ, ಅಲಲ , ಗ್, ಕ್, ಇದೆ,ಕ್ರಿ ಯಾ ಪಿ ತ್ಯ ಯಗಳಾಂದಿಗೆ ಭೂತ್,
ಭವಿಷಯ ತ್ ಮತ್ತು ವತ್ಾಮಾನ್ ಕಾಲ ವಾಕಯ ರಚನೆ - Formation of Past, Future and Present 01
Tense Sentences with Verb Forms
Lesson-13 ಕನಾಾಟಕ ರಾಜಯ ಮತ್ತು ರಾಜಯ ದ ಬಗೆಗ ಕುರಿತದ ಇತ್ರೆ ಮಾಹಿತಿಗಳ್ಳ - Karnataka
01
State and General Information about the State
Lesson-14 ಭಾಷೆ ಕಲಯಲು ಏನ್ನುನ ಮಾಡಬೇಕು ಮತ್ತು ಮಾಡಬಾರದು - Do’s and Don’ts
01
in Learning a Language
Lesson-15 PART- II
01
Kannada Language Script Part-1
Lesson-16 PART-III
Kannada Vocabulary List: ಸಂಭಾಷಣೆಯಲಲ ದಿನೇಪಯೇಗಿ ಕನ್ನ ಡ ಪದಗಳ್ಳ - Kannada 01
Words in Conversation
Textbooks
ಬಳಕೆ ಕನ್ನ ಡ: ಪಿ ಸಾರಾಾಂಗ, ವಿಶ್ವ ೇಶವ ರಯಯ ತಾಂತಿಿ ಕ ವಿಶವ ವಿದಾಯ ಲಯ
ಕನ್ನ ಡ ಭಾಷೆಯ ಮಹತ್ವ ವನುನ ಅರಿಯುವುದು
CO1
Understanding the importance of kannada language
ಕನ್ನ ಡ ಭಾಷೆಯನುನ ಬರೆಯುವ, ಓದುವ ಮತ್ತು ಸಂವಹಿಸುವ ಕೌಶಲವನುನ ಬೆಳೆಸಿಕೊಳ್ಳು ವರು
CO2
Develop the skills of reading and communication in kannada language
28
Semester – III
Course Name : Additional Mathematics-I Course Code: 20MADIP31

: 00 SEE Marks: 50
Hours / Week
/ Practical Hours
L:T:P : 3:2:0 Credits: -
Course Overview
The course provides mathematical techniques to support the lateral entry students that are of at most
relevance to Engineering disciplines. The major focus of the course are Complex numbers, Differential and
Partial derivative of real functions, Probability theory, Numerical methods, and Ordinary differential
equations. The purpose of this course is to provide the skills and knowledge required to perform
mathematical procedures and processes for solution of Engineering problems. The course aims to show the
relevance of mathematics to Engineering and applied science.
• Explain the concept of Complex algebra, Differential and Partial derivative of real functions, Numerical
methods and Probability theory to back up the advance mathematics in solving Engineering problems
• Explain how to analyze the system in various Engineering domain using Complex algebra, Differential and
partial derivative of real function, Numerical Methods, Probability theory
Teaching
MODULE Hours
MODULE 1
Complex Numbers: Definitions and operations. Modulus and amplitude of a complex number.
Basic Linear Algebra: Introduction, Rank of matrix by elementary row operations - Echelon form. 10
Consistency of system of linear equations - Gauss elimination method. Eigen values and Eigen vectors
of a square matrix, Problems
MODULE 2
Differential Calculus: Review of differentiation. Maclaurin’s series expansions-Illustrative
10
examples. Partial Differentiation: Euler’s theorem (Problems on first order derivatives only).
Total derivatives-Differentiation of composite functions. Jacobians of order two-Problems
MODULE 3
Probability: Introduction, Sample space and events. Axioms of probability, Addition &
10
multiplication theorems, conditional probability. Discrete random variable and Binomial
distribution
MODULE 4
Numerical Methods: Finite differences. Interpolation/extrapolation using Newton’s forward and
backward difference formulae (Only statement)-problems. Solution of polynomial and 10
transcendental equations – Newton-Raphson method (only formula)- Illustrative examples.
Numerical integration: Simpson ‘s one third rule.
29
MODULE 5
Ordinary Differential Equations (ODE’s): Introduction, Solutions of first order and first-
10
degree differential equations: Exact, Equations reducible to exact (IF = xhyk) and Bernoulli’s
equation. Orthogonal Trajectory (Cartesian)
Textbooks
1. B.S. Grewal, Higher Engineering Mathematics, Latest edition, Khanna Publishers
2. B.V. Ramana, Higher Engineering Mathematics, Latest edition, Tata Mc. Graw Hill Publications
Reference Books
1. Erwin Kreyszig, Advanced Engineering Mathematics, Latest edition, Wiley Publications
2. Peter V. O’Neil, Engineering Mathematics, CENGAGE Learning India Pvt Ltd. Publishers
Understand the basic concepts of Complex algebra, Differential and Partial derivative of real
CO1
function, Numerical methods, Probability theory
Apply the concept of Complex algebra, Differential and Partial derivative of real function,
CO2
Numerical methods, Probability theory
CO1 2
CO2 2
Avg. 2
30
Semester – IV
Course Name : Advanced Mathematics-IV Course Code: 20MA41

: 02 SEE Marks: 50
Hours / Week
: 36 + 24 = 50 SEE Duration: 03 hr.
/ Practical Hours
Course Overview
The course provides mathematical techniques in the advanced areas of mathematics that are of at most
relevance to Engineering disciplines. The major focus of the course is Complex Analysis, Statistical Methods,
Probability Distributions, Sampling Theory, Statistics, Queueing Theory and Reliability Engineering/
Optimization. The purpose of this course is to provide the skills and knowledge required to perform
• Explain the concept of Complex Analysis, Statistical Methods, Probability Distributions, Sampling Theory,
Statistics, Queueing Theory and Reliability Engineering / Optimization in solving Engineering problems
• Explain how to analyze the system in various Engineering domain using Complex Analysis, Statistical
Methods, Probability Distributions, Sampling Theory, Statistics, Queueing Theory and Reliability
Engineering / Optimization
• Explain the usage of modern tools to understand the concepts Complex Analysis, Statistical Methods,
Probability Distributions, Sampling Theory, Statistics, Queueing Theory and Reliability Engineering /
Optimization
Teaching
MODULE Hours
MODULE 1: Complex Analysis (I-C)
Complex Differentiation: Analytic functions, Cauchy-Riemann equations in cartesian and
polar forms (without proof). Construction of analytic functions, Problems on Harmonic
conjugate, Complex Integration: Cauchy’s theorem (no proof), Residue, poles, Problems on
Cauchy’s Residue theorem (without proof).
08
Conformal transformations: Discussion of transformations
Bilinear transformations-problems.
SLE: Derivation of C-R Equations (Cartesian and Polar).
31
MODULE 2: Statistical Methods
Correlation and Regression-Karl Pearson’s coefficient of correlation and rank correlation -
Problems. Regression analysis- lines of regression –Problems.
08
Curve Fitting: Curve fitting by the method of least squares- fitting the curves of the form
and
SLE: Fitting the curve
MODULE 3: Probability Distribution and Joint Probability Distribution(I-C)
Probability Distribution: Review of basic probability theory. Random variables (discrete),

Probability mass function, Statistical values (Mean and Variance). Poisson and Normal
distributions- Problems (No derivation for mean and standard deviation) 08
Joint Probability Distribution: Joint probability distribution for two discrete random
variables, Marginal distribution, Covariance, and Coefficient of correlation
SLE: Problems on exponential distribution.

MODULE 4: Stochastic Process and Sampling Theory
Stochastic Theory: Stochastic process, Markov chain, Transition matrix, Steady state
analysis.
Sampling Theory: Introduction to sampling distributions, Standard error, Type-I and Type-II 08
errors. Test of hypothesis, Z-test (proportions), Chi-square distribution as a test of goodness
of fit (Uniform, Poisson’s distribution ratio and proportion)
SLE: Student’s t-distribution (both one and two samples)

MODULE 5
Optimization Technique: Basics of optimization, formulation of the problems, maxima and

minima, convex function, global solution. Linear programming, simplex algorithm, 08
degeneracy, Big-M method.
SLE: Duality
Textbooks
1. B. S. Grewal, Higher Engineering Mathematics, 43 Edition, Khanna Publishers
32
2. B. V. Ramana, Higher Engineering Mathematics, Latest edition, Tata Mc. Graw Hill Publications
3. G. Haribhaskaran, Probability, Queueing Theory & Reliability Engineering, Lakshmi Publication
4. Taha Hamdy A, Operational Research, 6th edition, Prentice Hall of India
Reference Books
1. Erwin Kreyszic, Advanced Engineering Mathematics, Latest edition, Wiley Publications.
2. Peter V. O’Neil, Advanced Engineering Mathematics, 7th edition CENGAGE Learning India Pvt. Ltd.
Publishers
3. A M Natarajan, Probability, Random Processes and Queueing Theory, New Age International, 2005
4. Kishore S Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications,
2nd Edition, Kindle Edition
5. V. Sundarapandian, Probability, Statistics and Queueing Theory, Sultan Chand & Sons Pub.
6. S D Sharma, Operation Research, Kedarnath Ramnath & Co.

Understand the basic concepts of Complex Analysis, Statistical Methods, Probability Distributions,
CO1
Sampling Theory, Statistics, Queueing Theory and Reliability Engineering / Optimization
Apply the concept of Complex Analysis, Statistical Methods, Probability Distributions, Sampling
CO2 Theory, Statistics, Queueing Theory and Reliability Engineering / Optimization to solve the problems
arising in Engineering field
Analyze mathematical problems arising in Engineering using the Complex Analysis, Statistical
CO3 Methods, Probability Distributions, Sampling Theory, Statistics, Queueing Theory and Reliability
Engineering / Optimization
CO4 Use modern tools to solve/visualize mathematical problems arising in Engineering (Additional CO-PO5)
CO1 1
CO2 2
CO3 2
CO4 2
Avg. 1.5 2 2
33
SEMESTER – IV
Course Name : Design and Analysis of Algorithms Course Code: 20CS42
No. of Tutorial / Practical Hours
: 00 SEE Marks: 50
/ Week
Total No. of Lecture + Tutorial /
Practical Hours
L: T: P : 3:0:0 CREDITS: 03
Course Overview
Design and Analysis of Algorithms is very important for designing algorithms to solve different
types of problems in the branch of Computer Science and Information Technology. As a
fundamental subject, this course equips the students with theory and hands-on with respect to
mathematical analysis of algorithms and problem-solving skills.
• To describe various methods of algorithm analysis
• To explain various computational problem-solving techniques
• To analyse the computational complexity of different algorithms
• To design algorithms using various strategies
TEACHING
MODULES
HOURS
MODULE 1
Introduction: What is an Algorithm? Fundamentals of algorithmic problem solving,
The Analysis Framework, Asymptotic notations and Basic efficiency classes,
Mathematical analysis of Non recursive algorithms, Mathematical analysis of 08
recursive algorithms
SLE: Important problem types
Textbook1: Ch. 1.1,1.2,1.3, Ch. 2.1,2.2,2.3,2.4
MODULE 2
Divide and Conquer: Merge sort, Quick sort, Binary tree traversals and related
properties, Multiplication of large integers and Strassen’s Matrix Multiplication, the
08
closest pair of points
SLE: Convex hull problems by divide and conquer
Textbook 1: Ch.5.1-5.5
MODULE 3
Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra's Algorithm,
Knapsack Problem, Job sequencing with deadlines, Transform and conquer: Heaps
08
and Heap sort
SLE: Huffman Trees and Codes
Textbook 1: Ch. 9.1-9.4, Ch. 6.4 Textbook 2: Ch. 4.3,4.5
MODULE 4
Dynamic Programming: Warshall’s Algorithm, Floyd's Algorithm, The Knapsack
08
problem and memory functions, All-pairs shortest paths, The Travelling
Salesperson problem
34
SLE: Backtracking
Textbook 1: Ch. 8.2,8.4, Ch. 12.1 Textbook 2: 5.3,5.9
MODULE 5
Branch and Bound solution: Assignment problem, Knapsack problem, Travelling
salesman problem, Decision trees 08
SLE: P, NP and NP complete problems
Textbook1: Ch. 11.2,11.3, Ch. 12.2
Textbooks
1. Introduction to the Design and Analysis of Algorithms, Anany Levitin: 3rd Edition, 2017, Pearson.
2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2017,
Universities Press.
Reference Books
1. Algorithm Design, John Kleinberg, Eva Tardos, 1st Edition, 2013, Pearson.
2. Algorithms, S. Dasgupta, C.H. Papadimitrou and U. Vazirani, Indian Edition ,2017, McGraw-Hill
Education.
3. Introduction to Algorithms by Thomas H Cormen, 2nd Edition, MIT Press, 2009
CO1 Describe computational solutions to well-known problems
CO2 Apply the appropriate design strategies for problem solving
CO3 Analyse the computational complexity of various algorithms
Explore various algorithms and design strategies for a given problem (Additional CO-
CO4
PO11)
CO1 2 1
CO2 3 3
CO3 2 2
CO4 1
Avg. 2.5 2 1 2 2
35
SEMESTER – IV
Course Name : Web Technology and its Applications Course Code: 20CS43
: 00 SEE Marks: 50
Hours / Week
/ Practical Hours
L:T:P : 3:0:0 CREDITS: 03
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, XHTML and 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.
• 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
Introduction to XHTML: Origins and Evolution of HTML and XHTML, Basic Syntax, Standard
HTML Document Structure, Basic Text Markup, Images, Hypertext Links, Lists, Tables, Forms,
Cascading Style Sheets: Introduction, Levels of Style Sheets, Style Specification Formats,
08
Selector Forms, Property Value Forms, Font Properties, List Properties, Alignment of Text,
Colour, The Box Model, Background Images, The <span> and <div> Tags, Conflict Resolution
SLE: Syntactic Differences between HTML and XHTML
Textbook 1: Ch. 2.1-2.9, 2.14, Ch. 3.1-3.13
MODULE 2
The Basics of JavaScript: Overview of JavaScript, Object Orientation and JavaScript, General
Syntactic Characteristics, Primitives, Operations, and Expressions, Screen Output and
Keyboard Input, Control Statements, Object Creation and Modification, Arrays, Functions, An
Example, Constructors, Pattern Matching Using Regular Expressions, Another Example, Errors
in Scripts
08
JavaScript and XHTML Documents: The JavaScript Execution Environment, The Document
Object Model, Element Access in JavaScript, Events and Event Handling, Handling Events
from Body Elements, Handling Events from Button Elements, Handling Events from Text Box
and Password Elements, The DOM 2 Event Model, the canvas element, The navigator Object
SLE: DOM Tree Traversal and Modification
Textbook 1: Ch. 4.1-4.14, Ch. 5.1-5.11
36
MODULE 3
Dynamic Documents with JavaScript: Introduction, Positioning Elements, Moving Element,
Element Visibility, Changing Colours and Fonts, Dynamic Content, Stacking Elements, Locating
the Mouse Cursor, reacting to a Mouse Click, Slow Movement of Elements
Introduction to XML: Introduction, uses of XML, The Syntax of XML, XML Document 08
Structure, Namespaces, XML Schemas, Displaying Raw XML Documents, Displaying XML
Documents with CSS, XSLT Style Sheets, XML Processors, Web Services
SLE: Dragging and Dropping Elements
Textbook 1: Ch. 6.1-6.11, Ch. 8.1-8.11
MODULE 4
Introduction to PHP: Origins and Uses of PHP, Overview of PHP, General Syntactic
Characteristics, Primitives, Operations, and Expressions, Output, Control Statements, Arrays,
Function, Pattern Matching, Form Handling, Cookies
08
Introduction to Ajax: Overview of Ajax, The Basics of Ajax, Return Document Forms, Ajax
Toolkits, Security and Ajax.
SLE: Session Tracking
Textbook 1: Ch. 7.1-7.12, Ch. 9.1-9.5
MODULE 5
Database Access through the Web: Relational Databases, An Introduction to the Structured
Query Language, Architectures for Database Access, The MySQL Database System, Database
08
Access with PHP and MySQL
SLE: Database Access with JDBC and MySQL
Textbook 1: Ch. 12.1-12.6
Textbooks
1. Robert W. Sebesta : Programming the World Wide Web-8th Edition, Pearson Education, 2015
Reference Books
1. Robin Nixon, “Learning PHP, MySQL & JavaScript with jQuery, CSS and HTML5”,4thEdition, 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
Publishers & Distributors Pvt Ltd, 2014
Course Outcomes (COs):

At the end of the course, the students will be able to
CO1 Explain the fundamental concepts of Web tools and technologies
CO2 Illustrate the concepts of Web page designing using HTML & CSS, PHP and its application & JSON
CO3 Design webpages using various PHP concepts
37
Contribute to design and development of web-based solutions for societal problems (Additional
CO4
CO-PO6)
CO1 2 1
CO2 3 1
CO3 2 1
CO4 2
Avg. 2.5 2 2 1
38
SEMESTER – IV
Course Name : Data Communication Course Code: 20CS44
: 00 SEE Marks: 50
Hours / Week
/ Practical Hours
L: T:P : 3:0:0 CREDITS: 03
Course Overview
The course provides fundamental understanding of two layers for TCP/IP model, different networking layers
and its security. Provides basic knowledge of different types of networks and their limitations.
• To understand the transmission technique of digital data between the computers and a computer
network that allows computers to exchange data
• To learn the basics of data communication and various types of computer networks
• To study the TCP/IP protocol suite, switching criteria and Medium Access Control protocols for reliable
and noisy channels
• To explore wireless and wired LANs along with IP version
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-1: Data and Signals, Digital Signals, Transmission, Impairment, Data Rate 08
limits, Performance.
SLE: Internet History, Standards and Administration
Textbook 1: Ch. 1.1 - 1.5, Ch. 2.1 - 2.3, Ch. 3.1, 3.3 - 3.6
MODULE 2
Digital Transmission: Digital to digital conversion: Line coding: Polar, Bipolar, Manchester
coding, AMI , Pseudo ternary, 2 B/1Q, 8B/6D, 4D-PAM 5 and MLT-3
Physical Layer-2: Analog to digital conversion, Pulse Code Modulation, Delta Modulation,
08
Transmission Modes Analog Transmission: Digital to analog conversion. Bandwidth
Utilization: Multiplexing
SLE : Spread Spectrum
Textbook 1: Ch. 4.1.1 - 4.1.2, Ch. 4.2 - 4.3, Ch. 5.1, Ch. 6.1 - 6.2
MODULE 3
Transmission Media: Introduction, Guided Media: Twisted Pair Cable, Coaxial Cable, Fiber
Optics Cable ; Unguided Media-Wireless: Radio Waves, Micro Waves, Infrared
Switching: Introduction, Circuit Switched Networks and Packet switching 08
Data Link Layer: Error Detection and Correction: Introduction, Block Coding, Cyclic Code
SLE: Checksum
Textbook 1: Ch. 7.1-7.3, Ch. 8.1 - 8.3, Ch. 10.1 - 10.4
39
MODULE 4
Data link control: DLC Services: Framing, Flow Control, Error Control, Connectionless and
Connection Oriented, High Level Data Link Control (HDLC), Media Access control: Random
08
Access, Controlled Access, and
SLE: Channelization
Textbook 1 Ch. 11.1 – 11.3, Ch. 12.1 - 12.3
MODULE 5
Wired LANs Ethernet: Ethernet Protocol, Standard Ethernet, Fast Ethernet, Gigabit Ethernet
and 10 Gigabit Ethernet, Wireless LANs: Introduction, IEEE 802.11 Project, Bluetooth,
WiMAX,
08
SLE: Cellular Telephony
Textbook 1: Ch. 13.1 - 13.5, Ch. 15.1-15.3, Ch. 16.1 – 16.2
Textbooks
1. Behrouz A. Forouzan, Data Communications and Networking 5E, 5th Edition, Tata McGraw-Hill,2013.
Reference Books
1. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th Edition, Elsevier,
2019
2. Nader F. Mir: Computer and Communication Networks, 2nd Edition, Pearson Education, 2015.
3. William Stallings, Data and Computer Communication 10 Edition, Pearson Education, Inc., 2014
At the end of the course students will be able to
CO1 Explain the fundamentals of data communication
CO2 Illustrate the techniques for digital transmission and bandwidth utilization using various
transmission media.
CO3 Analyze the principles of protocol layering in modern communication systems.
CO4 Demonstrate the working of physical and data link layer services using simulation tools
(Additional CO)
CO1 1
CO2 3 3
CO3 2 2
CO4 2 2
Avg. 2 2 2 2.33
40
SEMESTER – IV
Course Name : Software Engineering and Testing Course Code: 20CS45
No. of Lecture Hours / Week :03 CIE Marks: 50
No. of Tutorial / Practical Hours /
:00 SEE Marks: 50
Week
Total No. of Lecture + Tutorial /
:40 SEE Duration: 03 hr.
Practical Hours
Course Overview
Software engineering is a detailed study of engineering to the design, development, testing and
maintenance of software. Students will gain experience on various processes used in the Software
industry for the development of a software product. They also learn about testing and maintenance
of software products.
• 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: Software Crisis, Need for Software Engineering. Professional Software
Development, Software Engineering Ethics. Case Studies. Software Processes: Models:
Waterfall Model, Incremental Model and Integration and Configuration. Process
activities. Requirements Engineering: Functional and non-functional requirements, 08
Requirements Engineering Processes, Requirements Elicitation, Requirements
Specification, Requirements validation, Requirements change
SLE: Case Study-Insulin Pump
Textbook 1: Ch. 1, Ch. 2.1 - 2.2, Ch. 4
MODULE 2
System Models: Context models. Interaction models. Structural models. Behavioural
models. Design and Implementation: Design Principles. Agile Software Development:
Coping with Change, Agile methods. Agile development techniques. Agile project 08
management. Scaling agile methods
SLE: Model-driven engineering
Textbook 1: Ch. 5, Ch. 7, Ch. 2.3, Ch. 3
MODULE 3
Project planning and quality management: Project Planning: Software pricing, Plan-
driven development, Project scheduling: Estimation techniques. Quality management:
Software quality. Reviews and inspections. Software measurement and metrics
41
SLE: Software standards
Textbook 1: Ch. 23, Ch. 24
MODULE 4
Software Testing: Fundamentals of Testing: Why is testing necessary? What is testing?
Testing principles, Fundamental test process, The psychology of testing. Testing
throughout the software life cycle: Software development models, Test levels, Test
08
types: the targets of testing, Maintenance testing. Static techniques: Reviews and the
test process, Review process
SLE: Static analysis by tools
Textbook 2: Ch. 1, Ch. 2, Ch. 3
MODULE 5
Software Testing Types and tools: Development testing, Test-driven development,
Release testing, User testing. Tools support for testing: Types of test tool, Effective use 08
of tools: Potential benefits and risks
SLE: Introducing a tool into an organization
Textbook 1: Ch. 8.1 - 8.4 Textbook 2: Ch. 6
Textbooks
1. Ian Sommerville Software Engineering, 10th Edition, Pearson Education, 2017.
2. Rex Black, Dorothy Graham Foundations of Software Testing ISTQB Certification, 4th Edition,
Cengage Learning, 2019
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 Outcome (COs)
At the end of the course, the student will be able to
Explain the concepts of software development with professional, ethical responsibility as a
CO1
software engineer
CO2 Model system requirement specifications of a given system
CO3 Compare and contrast different types of software testing
Identify, collect and analyze various requirement specifications of the system for
CO4
developing software-based solutions for societal problems (Additional CO - PO6)
CO – PO – PSO MAPPING
CO1 2
CO2 2 1
CO3 2 2
42
CO4 2
Avg. 2 2 2 1.5
43
SEMESTER – IV
Course Name : Operating Systems Course Code: 20CS46
: 03 CIE Marks: 50
Week
: 00 SEE Marks: 50
Hours / Week
Course Overview
This course introduces the concepts of operating systems and supports the usage of computer
systems. Students can analyze and compare the different components of the operating system,
different CPU scheduling algorithms, virtual memory and paging techniques for memory
management.
• To make aware of different types of Operating System and their services
• To learn different process scheduling algorithms and synchronization techniques
• To know virtual memory concepts
• To learn secondary memory management
TEACHING
MODULES
HOURS
MODULE 1
Introduction to operating systems: Operating system objectives and functions,
Operating system services, System Calls, Process concepts, thread concepts, Virtual
machines.
08
SLE: System boot
TextBook1: Ch.2 : 2.1, 2.3, 3.1
MODULE 2
Process Scheduling and coordination: Process concept; Process scheduling;
Operations on processes; Inter process communication. Scheduling criteria and
algorithms, Background, critical section problem, Peterson’s solution, 08
synchronization hardware, Semaphores.
SLE: Thread scheduling
TextBook1: Ch.6 : 6.1- 6.4, 6.6 Ch. 5: 5.1-5.3
MODULE 3
Process Synchronization and Deadlocks: Classic problems of synchronization,
Monitors. Principles of Deadlocks, Methods for handling deadlocks, deadlock
prevention, Deadlock avoidance: Banker’s algorithm, Deadlock detection and 08
recovery from deadlock.
SLE: Case-study on Deadlocks
TextBook1: Ch.6 : 6.7 , Ch. 7 : 7.1 Ch.8: 8.4 -8.8
MODULE 4 08
44
Virtual Memory Management: Background, Contiguous Memory allocation, Paging,
Structure of page table, Swapping, Virtual memory: Background, Demand paging,
Page replacement algorithms: FIFO page replacement, Optimal page replacement,
LRU page replacement, Allocation of frames, Thrashing.
SLE: Swap-Space Management, Copy-on-write
TextBook1: Ch. 9 : 9.1- 9.5 Ch.10: 10.1- 10.2,10.4-10.6
MODULE 5:
File System and Secondary Storage Structures: File Organization and access, File
directories, Secondary storage management, Overview of mass storage structure,
HDD scheduling.
08
SLE: File sharing.
TextBook1: Ch: 11: 11.1,11.2 TextBook2: Ch.12.1-12.4
Textbooks
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles, 10th
edition, Wiley-India, 2018.
2. William Stallings, Operating Systems internals and design Principles, 7th Edition, 2017.
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, 2014.
3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition,
PHI(EEE), 2014.
CO1 Explain the functions of the Operating System.
Apply the concepts of memory management policies, virtual memory, and scheduling
CO2
techniques for process.
Analyze process management, memory management and file management in
CO3
operating systems.
Identify and present the insights of various features of a given operating systems.
CO4
(Additional CO- PO10)
CO1 2
CO2 3 2
CO3 2
CO4 2
Avg. 2.5 2 2 2
45
SEMESTER – IV
Course Name : Design and Analysis of Algorithms Laboratory Course Code: 20CS47
: 00 CIE Marks: 50
Week
No. of Practical Hours /
: 02 SEE Marks: 50
Week
Course Overview
After the students have gone through a course on discrete structures, where they learn formal and abstract
representations of data and its manipulation, and another course on data structures, where they learn
concrete implementations and usage of such discrete structures, a first course on algorithm design and
analysis should teach the students how to design an efficient algorithm for a given computational task using
one or more of such data structures, analyze performance of a given algorithm, and provide performance
guarantees.
• Performance analysis of Algorithms using asymptotic and empirical approaches
• Demonstrate a familiarity with major algorithms and data structures
• To give clear idea on algorithmic design paradigms like Divide-and-Conquer, Dynamic Programming,
Greedy, Branch and Bound etc.
• Construct efficient algorithms for common computer engineering design problems
PART – A
1. Sort a given set of elements using the quick sort method and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the 1st to be
sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.
2. Implement merge sort algorithm to sort a given set of elements and determine the time required to sort
the elements. Repeat the experiment for different values of n, the number of elements in the list to be
sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.
3. For the given directed graph, implement the Topological ordering of vertices and compute the transitive
closure using Warshall's algorithm.
46
4. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s
algorithm.
2. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm.
3. Implement 0/1 Knapsack problem using Dynamic Programming.
4. Find a subset of a given set S = {sl, s2,.....,sn} of n positive integers whose sum is equal to a given positive
integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions {1, 2, 6} and {1,8}.A suitable
message is to be displayed if the given problem instance doesn't have a solution.
5. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then
solve the same problem instance using any approximation algorithm and determine the error in the
approximation.
6. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
47
7. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
PART - B
Open Ended Enquiry problems
Students have to solve a problem*(either given by the staff or student may come up with their own
problem) using the design techniques such as
1. Divide and Conquer
2. Decrease and Conquer
3. Dynamic Programming
4. Greedy Technique
5. Back Tracking
*The problem may be (not limited to)
1. Finding the maximum and minimum in the given set of elements
2. Sorting
3. To count the number of nodes or leaf nodes in a binary tree.
4. To find the shortest path.

Exercise 1,2,10 30%
Structured Enquiry 3,4,6,9 40%
Open ended enquiry 8 10%
48
At end of this course, students will be able to
CO1 Demonstrate their knowledge of major algorithms and data-structures corresponding to each
algorithm design paradigm
CO2 Analyze the Performance of various Algorithms using asymptotic and empirical approaches
CO3 Implement the design of an algorithm for solving a given problem
CO1 2 2
CO2 3 3
CO3 1 1
Avg. 2 3 1 2
49
SEMESTER – IV
Course Name : Web Technology Laboratory Course Code: 20CS48
No. of Practical Hours / Week : 02 SEE Marks: 50

/ Practical Hours
Course Overview
The laboratory course Web Technology lab aims to introduce students to basics of HTML & CSS to design
visually appealing web pages. Learn about JavaScript to modify the DOM objects and perform some
operations using functions. To write regular expressions in PHP as search patterns.
• Learn the syntax and semantics of HTML & CSS
• Interpret the use of basic HTML tags
• Demonstrate the use of built-in and user-defined functions in PHP
• Infer the database connectivity and regular expression for search operation
1. a) Develop static pages (using only HTML) of an online Book store. The
pages should resemble: www.flipkart.com pages.

b) The website should consist of the following
Home page, Registration and user Login, User profile page, Books
catalogue, Shopping cart, Payment By credit card, order confirmation.
2. 1. Develop and demonstrate a XHTML file that includes JavaScript script for the following problems:
a) Input: A number n obtained using prompt

Output: The first n Fibonacci numbers
b) Input: A number n obtained using prompt
Output: A table of numbers from 1 to n and their squares using alert.
3. Create a html registration form and to validate the form using JavaScript code.
4. Validate the registration, user login, user profile and payment by credit card pages using JavaScript.
5. Display the calendar using JavaScript code by getting the year from the user.
50
6. Write an XML file which will display the Book information which includes the following:
1) Title of the book

2) Author Name
3) ISBN number
4) Publisher name
5) Edition
6) Price
7. a) Write a PHP program to keep track of the number of visitors visiting the web page and to display
this count of visitors, with proper headings.
b) Write a PHP program to display a digital clock which displays the current time of the server.
8. Some PHP Programs for Application Development.
Example 1: Write a program to enter TWO numbers and print the Swap Numbers using PHP.
Example 2: Write a program to do PHP Functions - Adding parameters.
Example 3: Write a program to do Array Operation in PHP.
Example 4: Write a program to do Multidimensional array in PHP.
9. Write a PHP program named states.py that declares a variable state with value "Mississippi Alabama
Texas Massachusetts Kansas".
write a PHP program that does the following: a. Search for a word in variable states that ends in xas.
Store this word in element 0 of a list named statesList.
b. Search for a word in states that begins with k and ends in s. Perform a case-insensitive
comparison. [Note: Passing re.Ias a second parameter to method compile performs a case-
insensitive comparison.] Store this word in element1 of statesList.
c. Search for a word in states that begins with M and ends in s. Store this word in element 2 of the
list.
d. Search for a word in states that ends in a. Store this word in element 3 of the list.
10. Create a HTML form, add the data into it and submit it to the database
by connecting it to MySQL database using PHP.

Exercise 3-7 30%
Structured enquiry 8-10 40%
Open ended enquiry - 10%
51
CO1 Illustrate the usage of HTML and CSS tags
CO2 Design and Develop HTML, JavaScript programs to implement functions, DOM changes
CO3 Design and Develop PHP programs using any web server
CO4 Build a web application for given specification (Additional CO-P11)
CO1 2
CO2 2 2
CO3 2 2
CO4 1 3
Avg. 2 2 1 2.33
52
Semester – IV
Course Name : Skill Development-II Course Code: 20HS42

: 02 SEE Marks: 50
Hours / Week
/ Practical Hours
Course Overview
Skill development is/are personal attributes that influence how well an individual can work or interact with
others. These skills make it easier to form relationships with people, create trust and dependability, and lead
teams. In essence, they are essential for individual success in the workplace, their company’s success, and
their personal life as well.
• To provide exposure to soft skills in life sciences to develop all-round personalities with a mature outlook
to function effectively in different circumstances
• To provide innovative methods for enhancing problem solving skills in general aptitude
Teaching
MODULE Hours
MODULE 1
Managing Success and Failure
Describe the Relation between Fears and Failures; Desires and Success; Understand how to
overcome fear of success; steps to succeed and overcome failure; steps to identify root
cause of emotions; how to overcome fear of failure; Describe role of Internal beliefs in 04
success / failure; role of self in managing success / failures; How to enhance your self-
esteem, how to manage success / failures at workplace and manage your success and failure
Kolb’s Learning Style Questionnaire to determine your learning styles and ability to manage
self
MODULE 2
General Aptitude 2.1:
Quantitative Aptitude: Percentage ; Profit and Loss ; Logical Reasoning: Analogy ; Coding
and Decoding, Introduction and explanation of concepts with their applications. Focus on
concepts and different methods and shortcuts to solve problems 06
53
MODULE 3
Creative Approach
Introduction to Creative Problem Solving ; Developing Rough Ideas ; Strengthening Your

Problem-Solving Skills ; How to identify and assess your Creative Skills ; Making Creative
Ideas Practical and Identifying Potential Skills ; The S.C.A.M.P.E.R. Approach.
Identify roadblocks that prevent creative thinking ; Develop creative attitudes and learn to 04
see that all problems have opportunities ; Rediscover your creative ability ; Focus and direct
creative efforts ; Overcome criticism and gain acceptance for new ideas ; Learn creative and
effective techniques to recognize and identify problems ; Explore techniques for managing
creative people; Realize the significance of humor and how it impacts creativity.
Assessing your creative style – Self Analysis ; Case Study - Apply what you have learned
MODULE 4
Understanding Quantitative Aptitude: Time and work, Understanding Logical Reasoning:

06
Seating Arrangement; Data Arrangement; Verbal Comprehension, Antonyms
Introduction and explanation of concepts with their applications. Focus on concepts and
different methods and shortcuts to solve problems
MODULE 5
Understanding Quantitative Aptitude – Time, Speed and Distance; Problems on Trains boats
06
and Streams; Understanding Verbal Ability: Synonyms
Introduction and explanation of concepts with their applications. Focus on concepts and
different methods and shortcuts to solve problems
Textbooks
1. Notes and Textbooks are part of learning methodology
Reference Books
1. The Official Cambridge Guide to IELTS
2. Quantitative Aptitude for Competitive Examinations by R.S Aggarwal
3. A Modern Approach to Verbal & Non-Verbal Reasoning by R.S. Aggarwal
4. AMCAT Preparation Guide
5. Kumar VK and Holman ER & Rudgeair P - Creative Styles of Fresh men Students
6. Creative Approaches to Problem Solving: A Framework for Innovation and Change Book by Donald J.
Treffinger, K. Brian Dorval, and Scott G. Isaksen
7. How to Fail at Almost Everything and Still Win Big: Kind of the Story of My Life — By Scott Adams.
8. Failing Forward: Turning Mistakes into Stepping, Stones for Success by John C
54
Understand the importance of continuous learning and implement it successfully
CO1 Understand the basic concepts of the topics covered
Understand what conflict is and how it escalates within the workplace
Apply concepts of goal setting, interpersonal behaviors in life
CO2
Appreciate team skills and dynamics. Identify Critical Thinking
Self-Analyze and develop self-confidence and a positive attitude
CO3
Analyze common conflict resolution styles and use them effectively in teamwork
Compete in various competitive exams with positive mind set
CO4
Practice Positive thinking and Attitude in walks of life
CO1 3
CO2 2
CO3 3
CO4 2
Avg. 2 2.5 3
55
Semester – IV
: Constitution of India, Professional Ethics
Course Name Course Code: 20HS43
and Cyber Law
: 00 SEE Marks: 50
Hours / Week
/ Practical Hours
Course Overview

• Know the fundamental political codes, structure, procedures, powers and duties of Indian government
institutions, fundamental rights, directive principles, and the duties of the citizens.
• Understand engineering ethics and their responsibilities; identify their individual roles and ethical
responsibilities towards society.
• Know about the cybercrimes and cyber laws for safety measure.
Teaching
MODULE Hours
MODULE 1
Introduction to Indian Constitution

The necessity of the Constitution, The societies before and after the Constitution adoption.
Introduction to the Indian constitution, Making of the Constitution, The Role of the Constituent 03
Assembly – Preamble and Salient features of the Constitution of India. Fundamental Rights and
its Restriction and limitations in different Complex situations, Directive Principles of State Policy
(DPSP) and its present relevance in our society with examples, Fundamental Duties and its scope
significance in Nation building
MODULE 2
Union Executive and State Executive

Parliamentary System, Federal System, Centre-State Relations. Union Executive – President,
Prime Minister, Union Cabinet, Parliament – LS and RS, Parliamentary Committees, Important 03
Parliamentary Terminologies. Supreme Court of India, Judicial Reviews and Judicial Activism.
State Executives – Governor, Chief Minister, State Cabinet, State Legislature, High Court and
Subordinate Courts, Special Provisions (Articles 370, 371, 371) for some states.
MODULE 3
Elections, Amendments and Emergency Provisions

Elections, Electoral Process and Election Commission of India, Election Laws. Amendments – 03
Methods in Constitutional Amendments (How and Why) and Important Constitutional
Amendments. Amendments – 7, 9, 10, 12, 42, 44, 61, 73, 74, 75, 86, 91, 94, 95, 100, 101, 118
and some important Case studies, Emergency Provisions, types of Emergencies and its
56
consequences.
Constitutional Special Provisions
Special Provisions for SC and ST, OBC, Women, Children and Backward Classes
MODULE 4
Professional Engineering Ethics

Scope & Aims of Engineering & Professional Ethics – Business Ethics, Corporate Ethics, Personal
Ethics. Engineering and Professionalism, Positive and Negative faces of Engineering Ethics, Code
of Ethics as defined on the website of Institution of Engineers (India): Profession, 03
Professionalism and Professional Responsibility. Clash of ethics, Conflicts of Interest.
Responsibilities in Engineering, Responsibilities in Engineering and Engineering standards, the
impediments to responsibility. Trust and Reliability in Engineering, IPRs (Intellectual Property
Rights), Risks, Safety, and liability in Engineering
MODULE 5
Internet Laws, Cyber Crimes and Cyber Laws

Internet and Need for Cyber Laws, Modes of Regulation of Internet, Types of Cyber terror 03
capability, Net neutrality, Types of Cyber Crimes, India and Cyber law, Cyber Crimes and the
Information Technology Act 2000, Internet Censorship. Cybercrimes and enforcement agencies
Textbooks
1. Shubham Singles, Charles E. Haries, and et al, Constitution of India, Professional Ethics and Human Rights,
Cengage Learning India, 2018
2. Alfred Basta and et al, Cyber Security and Cyber Laws, Cengage Learning, 2018
Reference Books
1. Durga Das Basu, Introduction to Constitution of India, Prentice – Hall, 2008
2. M. Govindarajan, S. Natarajan, V.S. SenthilKumar, Engineering Ethics, Prentice – Hall, 2004
CO1 Explain Constitutional knowledge and legal literacy
CO2 Understand Engineering and Professional ethics and responsibilities of Engineers
CO3 Understand the cybercrimes and cyber laws for cyber safety measures
57
Semester – III
Course Name : Additional Mathematics-II Course Code: 20MADIP41

: 00 SEE Marks: 50
Hours / Week
Total No. of Lecture + Tutorial : 50
SEE Duration: 03 hr.
/ Practical Hours
Course Overview
The course provides mathematical techniques to support the lateral entry students that are of at most
relevance to Engineering disciplines. The major focus of the course are Complex numbers, Differential and
Partial derivative of real functions, Probability theory, Numerical methods, and Ordinary differential
equations. The purpose of this course is to provide the skills and knowledge required to perform
• Explain the concept of Linear algebra, Special function, Higher order differential equations, Vector
calculus and transformation appropriately in solving Engineering problems
• Explain how to analyze the system in various Engineering domain using Linear algebra, Special function,
Higher order differential equations, Vector calculus and transformation
Teaching
MODULE Hours
MODULE 1
Linear Algebra: Vectors-Linearly dependent and independent 10
Vector Space: Span, Basis. Linear Transformation: - Matrix representation, Rank-Nullity
MODULE 2
Special Functions: Gamma and Beta functions, Properties of gamma. Relation between
10
gamma and beta (no proof). Problems on gamma and beta leading to reduction formula
Multiple Integral: Double Integration-application on area (Simple examples)
MODULE 3
Higher Order ODE’s: Linear differential equations of second and third order equations with
constant coefficients (Homogeneous, Non-homogeneous equations). Inverse differential 10
operators. (Particular Integral restricted to , polynomia (2nd order
only))
MODULE 4
Laplace Transforms: Laplace transforms of elementary functions (without proof). Properties: First
and second shifting, multiplication, and division by t (only problems) 10
Inverse Laplace Transforms: Definition of inverse Laplace transforms. Evaluation of inverse
transforms by partial fraction method, Application to solve linear differential equations
MODULE-5
10
Vector Calculus: Differentiation of vector functions. Scalar and vector point functions,
58
Gradient, Divergence, Curl (Simple problems). Solenoidal and irrotational vector field
(Problems)
Vector Integration: Only line integral (Simple problems)
Textbooks
3. B. S. Grewal, Higher Engineering Mathematics, Latest edition, Khanna Publishers
4. B.V.Ramana, Higher Engineering Mathematics, Latest edition, Tata Mc. Graw Hill Publications
5. David C. Lay, Linear Algebra and its Applications, Third edition, Pearson Publication
Reference Books
3. Erwin Kreyszig, Advanced Engineering Mathematics, Latest edition, Wiley Publications
4. Peter V. O’Neil, Engineering Mathematics, CENGAGE Learning India Pvt Ltd. Publishers
5. Gilbert Strang, Linear Algebra and its Application, Fourth edition, Cengage learning

Understand the basic concepts of Linear algebra, Special function, Higher order differential
CO1
equations, Vector calculus
Apply the concept of Linear algebra, Special function, Higher order differential equations, Vector
CO2
calculus
CO1 2
CO2 2
Avg. 2 2
59

III and IV Sem Autonomous Scheme and Syllabus

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

III and IV Sem Autonomous Scheme and Syllabus

Uploaded by

Copyright:

Available Formats

Vidyavardhaka College of Engineering

Gokulam III stage, Mysuru – 570 002

Department of Computer Science & Engineering

Sl. Teaching week

Course Name Credits

NOTE: PC:Professional Core CREDIT Definition

Department of Computer Science & Engineering

Sl. Teaching Hours/ week

Course Name Credits

NOTE: PC:Professional Core CREDIT Definition

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

SLE: Half range harmonic series

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

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

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

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

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

1. Design and Develop C program to implement following

Course Outcomes (COs)

2. Design a Python program to implement the Rock-Paper-Scissor game.

3. Develop a Python program to

4. Develop a Python program to

6. Develop a Python program to

7. Design a Python program using Regular expressions to

8. Perform the following file operations using Python program:

Type of Experiment Program-No Weightage

Course Outcomes (COs)

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

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

• ತಾಂತಿಿ ಕ ಪದಗಳನುನ ಕನ್ನ ಡ ಭಾಷೆಗೆ ಭಾಷಾಂತ್ರಿಸುವ ಪಿ ಕ್ರಿ ಯೆಯನುನ ವಿಶ್ವ ೇಷಿಸುವರು.

ಕೌಶಲಗಳನುನ ಬೆಳೆಸಿಕೊಳ್ಳು ವುದು.

ಕನನ ಡ ನಾಡು, ನುಡಿ ಮತ್ತು ಸಂಸ್ಕ ೃತಿಗೆ ಸಂಬಂಧಿಸಿದ ಲೇಖನಗಳು

1. ಕನಾಾಟಕ ಸಂಸ್ಕ ೃತಿ : ಹಂಪ ನಾಗರಾಜಯಯ 03

2. ಕನಾಾಟಕದ ಏಕ್ರೇಕರಣ : ಒಾಂದು ಅಪೂವಾ ಚರಿತೆಿ - ಜಿ. ವಾಂಕಟಸುಬಬ ಯಯ

1. ವಚನ್ಗಳ್ಳ : ಜೇಡರದಾಸಿಮಯಯ , ಅಲಲ ಮಪಿ ಭು, ಬಸ್ವಣಣ , ಅಕಕ ಮಹಾದೇವಿ.

ಭಾಗ – 3, ಕಾವ್ಯ ಭಾಗ (ಆಧುನಿಕ)

2. ಹೊಸ್ಬಾಳಿನ್ ಗಿೇತೆ : ಕುವಾಂಪು

4. ಮಬಬ ನಾಂದ ಮಬಬ ಗೆ : ಜಿ.ಎಸ್. ಶಿವರುದಿ ಪಪ

ಚೇಮನ್ ಮಕಕ ಳ ಹಾಡು : ಸಿದಧ ಲಾಂಗಯಯ

ಮ್ಗಾನೆ ಎಾಂಬ ಗಿರಿಜನ್ ಪವಾತ್ : ಹಿ. ಚಿ. ಬೇರಲಾಂಗಯಯ

ತಾಂತಿಿ ಕ ಪದಕೊೇಶ : ತಾಂತಿಿ ಕ ಹಾಗೂ ಪಾರಿಭಾಷಿಕ ಕನ್ನ ಡ ಪದಗಳ್ಳ.

Course Outcomes (COs)

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

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

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

SLE: Derivation of C-R Equations (Cartesian and Polar).

Probability Distribution: Review of basic probability theory. Random variables (discrete),

SLE: Problems on exponential distribution.

SLE: Student’s t-distribution (both one and two samples)

Optimization Technique: Basics of optimization, formulation of the problems, maxima and

3. G. Haribhaskaran, Probability, Queueing Theory & Reliability Engineering, Lakshmi Publication

4. Taha Hamdy A, Operational Research, 6th edition, Prentice Hall of India

6. S D Sharma, Operation Research, Kedarnath Ramnath & Co.

Course Outcomes (COs)

Course Outcomes (COs):

3. Implement 0/1 Knapsack problem using Dynamic Programming.

7. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.

Type of Experiment Program-No Weightage

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

No. of Practical Hours / Week : 02 SEE Marks: 50

pages should resemble: www.flipkart.com pages.

a) Input: A number n obtained using prompt