IV Semester

DEPARTMENT Computer Science and Engineering

Course Code 22MA412 Total 3 Course Type Basic Science Course
Credits
Course Title Linear Algebra
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 39 3 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100
Marks Marks Marks
Total 39 3 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Engineering Mathematics-I, II, III.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Understand several important concepts in linear algebra, including systems of linear
equations and their solutions; matrices and their properties; vector spaces; linear
independence of vectors; subspaces, bases, and dimension of vector spaces; inner
product spaces; linear transformations; and Eigen values and eigenvectors.
2 Apply these concepts to such real-world phenomena as electrical networks, traffic
flow, archeological dating, economic interdependencies, population movement,
communication networks, and weather prediction.
3 Learn to use the computer package MATLAB to perform matrix computations and
to explore and analyze linear algebra concepts.
4 Improve the ability to think logically, analytically, and abstractly.
5 Improve the ability to communicate mathematics, both orally and in writing.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Apply the numerical methods to solve Systems of linear equations, row L2
reduction and Echelon form, vector equations, Matrix equation, solution
sets of linear systems.
CO2 Linear independence, Solve the linear transformations, Matrix of a L2
linear transformation. Matrix operations, Inverse of a matrix,
characterization of invertible matrices, partitioned matrices, matrix
factorizations.
CO3 Determine the Vector spaces and subspaces, Null spaces, column L3
spaces, linear transformations, linearly independent sets, bases,
dimension of a vector space, rank, and change of basis.
CO4 Determine and describe the characteristic equation, diagonalization, L3
Eigen vectors and linear transformations, Complex Eigen values.
Orthogonality-Inner product, length, and orthogonality, orthogonal sets, 122
orthogonal projections.
 CO5 Determine and describe the Gram-Schmidt process, least squares L3
problems, Inner product spaces, diagonalization of symmetric matrices,
quadratic forms.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

UNIT Hours
Content
No. Lecture
1 Linear equations: Systems of linear equations, row reduction and 07
Echelon form, vector equations, Matrix equation, solution sets of linear
systems, Linear independence.
2 Matrix Algebra: Introduction to linear transformations, Matrix of a linear 08
transformation. Matrix operations, Inverse of a matrix, characterization of
invertible matrices, matrix factorizations.
3 Vector spaces: Vector spaces and subspaces, Null spaces, column spaces, 08
linear transformations, linearly independent sets, bases, dimension of a
vector space, rank, change of basis.
4 Eigen values, Eigen vectors and Orthogonality: Introduction, 08
characteristic equation, diagonalization, Eigen vectors and linear
transformations. Orthogonality- Inner product, length, and orthogonality,
orthogonal sets, orthogonal projections.
5 Orthogonality and least squares: Gram-Schmidt process, least squares 08
problems, Inner product spaces, diagonalization of symmetric matrices,
quadratic forms.

Text Book:
Sl.No. Author/s Title Publisher Details
th
1 David C. Lay Linear algebra and its 4 Edition, Pearson
applications Education, 20123.

Reference Book:
Sl.No. Author/s Title Publisher Details
rd
Linear algebra and its 3 Edition, Thomson Asia
1 Gilbert Strang
applications Pvt. ltd., 2003.
Kenneth Hoffman, Ray Prentice-Hall of India Pvt.
2 Linear algebra
Kunze Ltd., 2002.

Web Resources:
Sl.No. Web Link
1 https://www.classcentral.com/subject/maths
2 https://academicearth.org/

123
Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 - - - - - - - - - - - 2 - - -
CO2 3 - - - - - - - - - - - 2 - 2 -
CO3 3 1 - - - - - - - - - - 2 - 2 -
CO4 3 1 - - - - - - - - - - 2 - 2 -
CO5 3 1 - - - - - - - - - - 2 - 2 -
High – 3, Medium – 2, Low – 1

124
DEPARTMENT Computer Science and Engineering
Course Code 22MATDIP410 Total 0 Course Type Basic Science Course
Credits
Course Title Foundations of Engineering Mathematics-II
(For IV Semester Lateral Entry Students)
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 39 0 CIE SEE Total
Process
Tutorial 0 0 Weightage - 100 % 100 %
Practical 0 0 Maximum - 50 Marks 50 Marks
Marks
Total 39 0 Minimum - 20 marks 20 marks
Marks

COURSE PREREQUISITE: Basics in differential calculus, Integral calculus and vectors.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Solve second and higher order differential equations.
2 Find the Laplace transform of the function f(t).
3 Find the Inverse Laplace transform of the function F(s).
4 Apply the knowledge of numerical methods in the models of various physical and
Engineering phenomena.
5 Solve the integral by using standard integrals (Beta and Gamma) and multiple
integrals.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Explain various physical models through higher order differential L2
equations and solve such linear ordinary differential equations
CO2 Understand the concept of Laplace transform and obtain Laplace L2
transform of periodic functions and unit step functions
CO3 Apply the concept of Laplace transform in solving Linear Differential L2
equations
CO4 Apply the Numerical methods to solve Algebraic and transcendental L2
equations and find the polynomials by finite difference method.
CO5 Apply the concept of to evaluate multiple integrals and Beta and Gamma L2
functions
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

125
Course Content / Syllabus:
Unit Content Hours
No. Lecture
1 Linear Differential Equations: Solution of second and higher order 08
equations with constant coefficients by inverse differential operator method,
method of variation of parameters.
2 Laplace Transform: Definition, Transforms of elementary functions, 08
properties of Laplace Transform, Laplace Transform of
𝒇(𝒕)
𝒆𝒂𝒕 𝒇(𝒕),𝒕𝒏 𝒇(𝒕), 𝒕 , derivatives and Integrals. Laplace Transform of
Periodic functions.
3 Inverse Laplace Transform: Inverse Laplace Transform, Convolution 07
theorem (without proof) and problems. Applications –Solution of Linear
differential equations using Laplace Transform.
4 Elementary Numerical Methods: Finite differences. 08
Interpolation/extrapolation using Newton’s forward and backward
difference formulae, Newton’s divided difference and Lagrange’s formulae
(All formulae without proof). Solution of polynomial and transcendental
equations - Newton-Raphson method (only formula) – Illustrative
examples.
5 Integral Calculus: 08
Multiple integrals –Evaluation of double and triple Integrals, Beta and
Gamma functions: Definition, relation between Beta and Gamma
functions and simple problems.

Text Books:
Sl.No. Author/s Title Publisher Details
1 B. S. Grewal Higher Engineering 44th Edition, Khanna
Mathematics Publications, 2015.
2 Erwin Kreyzig Advanced Engineering 10th Edition, Wiley
Mathematics Publications, 2016.
3 M.K. Jain, S.R.K. Numerical methods for 6th Edition, New Age
Iyenger and R.K. scientific and engineering International Publisher,
Jain computation 2012.

Reference Books:
Sl.No. Author/s Title Publisher Details
1 N. P. Bali and Manish A Textbook of 10th Edition, Laxmi
Goyal Engineering Mathematics Publications Pvt Ltd, 2019.
2 Maurice D. Weir, Joel Thomas’ calculus: Early 12th Edition, Pearson
R. Hass and George B. Transcendentals Education, 2016.
Thomas
3 RamanaB.V Higher Engineering 11th edition, Tata-McGraw
Mathematics Hill. 2010.
4 Peter V.O ’Neil Advanced Engineering 7th Edition, CENGAGE
Mathematics Learning India Pvt. Ltd.
Publishers, 2012.
126
Web Resources:
Sl.No. Web Link
1 https://www.classcentral.com/subject/maths
2 https://academicearth.org/
Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 - - - - - - - - - - - 2 - 1 -
CO2 3 - - - - - - - - - - - 2 - 2 -
CO3 3 - - - - - - - - - - - 2 - - -
CO4 3 - - - - - - - - - - - 2 - - -
CO5 3 - - - - - - - - - - - 2 - - -
High – 3, Medium – 2, Low – 1

127
DEPARTMENT Computer Science and Engineering
Course Code 22CS410 Total 4 Course Type Professional Core Course
Credits
Course Title Operating Systems
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 52 4 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100
Marks Marks Marks
Total 52 4 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Computer Organization, Data Structures, C Programming.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Understand the concepts that underlie operating systems.
2 Illustrate process management, inter-process communication, process
synchronization, multithreading and deadlock handling mechanisms through
examples.
3 Comprehend different memory management techniques and file system.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Explain the concepts, goals, design and construction of operating L2
systems.
CO2 Illustrate inter-process communication, multithread handling and L4
analyse various CPU scheduling algorithms.
CO3 Solve process synchronization problems and Deadlock handling L3
mechanisms.
CO4 Apply the knowledge of main memory and virtual memory to solve L3
paging and page replacement problems.
CO5 Explain the concept of storage management, file system and analyse L4
different disk scheduling techniques.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

UNIT Hours
Content
No. Lecture
1 Introduction and Operating System Structures: What operating 10
systems do; Computer System organization; Computer System
architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management;
Protection and security; Computing environments 128
Operating System structures: Operating System services; User -
 Operating System interface; System calls and its types System programs;
Operating System design and implementation; Operating System
structure; Virtual machines; Operating System generation; System boot.
2 Processes, Threads and CPU Scheduling: Process concept; Process 11
scheduling; Operations on processes; Interprocess communication.
Threads: Overview; Multicore programming; Multithreading models;
Thread Libraries; Threading issues.
CPU Scheduling: Basic concepts; Scheduling criteria; Scheduling
algorithms.
3 Process Synchronization and Deadlocks: Basic concepts, The Critical 11
section problem; Peterson’s solution; Synchronization hardware;
Semaphores; Classic problems of synchronization; Monitors.
Deadlocks: System model; Deadlock characterization; Methods for
handling deadlocks; Deadlock prevention; Deadlock avoidance;
Deadlock detection; Recovery from deadlock.
4 Main Memory and Virtual Memory: Background; Swapping; 10
Contiguous memory allocation; Paging; Structure of page table;
Segmentation.
Virtual Memory: Background; Demand paging; Copy-on-write; Page
replacement; Allocation of frames; Thrashing.
5 Mass Storage Structure and File System: Overview of Mass storage 10
structure; Disk structure; Disk attachment; Disk scheduling.
File System: File concept; Access methods; Directory structure; File
system mounting; File sharing; Protection. Implementing File System:
File system structure; File system implementation; Directory
implementation; Allocation methods; Free space management.

Text Book:
Sl.No. Author/s Title Publisher Details
th
1 Abraham Operating system concepts 9 Edition, Wiley
Silberschatz, Peter India, 2013
Baer Galvin, Greg
Gagne

Reference Books:
Sl.No. Author/s Title Publisher Details
1 D.M Dhamdhere Operating systems-A concept-based 4th Edition, Tata
Approach McGraw- Hill, 2013
2 P.C.P.Bhatt Introduction to Operating Systems Concepts and Practice,
4th Edition, PHI, 2014
3 William Stallings Operating Systems: Internals and 7thEdition,Prentice
Design Principles Hall of India,2017
4 Harvey M Deital Operating Systems 3rd Edition, Pearson
Education, 2007

129
 Web Resources:
Sl.No. Web Link
1 https://www.youtube.com/playlist?list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG
2 https://youtu.be/783KAB-tuE4 - NPTEL IIT, Madras

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 - - - - - - - - - - - 3 - 3 -
CO2 3 3 3 3 - - - - - - - - 3 3 3 -
CO3 3 3 3 - - - - - - - - - 3 - 3 -
CO4 3 3 3 3 - - - - - - - - 3 3 3 -
CO5 3 3 3 - - - - - - - - - 3 3 3 -
High – 3, Medium – 2, Low – 1

130
DEPARTMENT Computer Science and Engineering
Course Code 22CS420 Total 4 Course Type Professional Core Course
Credits
Course Title Design and Analysis of Algorithms
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 52 4 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100
Marks Marks Marks
Total 52 4 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Data Structures.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Introduce various design techniques and paradigms for designing algorithms.
2 Analyze the performance of various algorithms for their time and space complexity.
3 Identify, choose appropriate design technique and data structures for developing
efficient algorithm for a given problem.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Use mathematical analysis model to analyse, the time complexity of L3
iterative and recursive algorithms.
CO2 Apply brute force and divide and conquer algorithm design techniques to L4
solve different problems and perform comparative analysis by finding
time complexity.
CO3 Use Decrease and Conquer, Transform and Conquer, Space-Time L4
Tradeoffs design strategy to solve different problems and perform
comparative analysis by finding time complexity.
CO4 Solve problems such as Computing binomial coefficient, transitive L4
closure, shortest path, Knapsack Problem using dynamic programming
technique, apply Greedy technique to solve problems such minimum
spanning, shortest path, encoding and perform analysis by finding time
complexity.
CO5 Use decision tree to find the lower bound of searching and sorting L3
problems and apply Backtracking / Branch and bound technique to solve
various combinatorial problems.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

131
Course Content / Syllabus:
UNIT Hours
Content
No. Lecture
1 Introduction to Algorithms and Problem Solving: Introduction: Notion 12
of Algorithms, Fundamentals of Algorithmic approach to problem
Solving, Important Problem Types, Fundamental data Structures. Analysis
Framework, Asymptotic Notations and Basic efficiency classes,
Mathematical analysis of Recursive and Non recursive algorithms,
Examples.
2 Brute force and Exhaustive Search, Divide and Conquer Design 10
Techniques: Brute Force Approaches: Introduction, Selection Sort,
Bubble Sort, Sequential Search, Brute Force String Matching and
Exhaustive search. Divide and conquer: General Divide and Conquer,
Masters theorem, Recurrence relations, Binary Search, Merge Sort, Quick
Sort, Multiplication of large integers and Strassen's Matrices.
3 Decrease and Conquer, Transform and Conquer, Space-Time 10
Tradeoffs Decrease-and-Conquer Approaches: Introduction, Insertion
Sort, Depth First Search and Breadth First Search, Topological Sorting.
Transform-and-Conquer: Presorting, Balanced Search Trees, Heaps and
Heapsort. Space-Time Tradeoffs: Introduction, Sorting by Counting, Input
Enhancement in String Matching, Hashing.
4 Dynamic Programming and Greedy Technique: Dynamic 10
programming: Computing binomial coefficient, Warshall’s and Floyd’s
Algorithms, Knapsack Problem and Memory Functions. Greedy
Technique: Prim’s Algorithm, Kruskal’s Algorithm Dijkstra’s Algorithm,
Huffman Trees.
5 Limitations of Algorithmic Power and Coping with Limitations: 10
Lower-Bound Arguments, Decision Trees, P, NP, and NP-Complete
Problems. Coping With Limitations of Algorithmic Power:
Backtracking: N-Queens Problem, Hamiltonian Circuit Problem, Subset-
Sum Problem. Branch-and-Bound: Assignment Problem, Knapsack
Problem, Traveling Salesman Problem.

Text Books:
Sl.No. Author/s Title Publisher Details
rd
1 Anany Levitin Introduction to The Design 3 Edition, Pearson
& Analysis of Algorithms Education, 2012

Reference Books:
Sl.No. Author/s Title Publisher Details
rd
1 Thomas H. Cormen, Introduction to Algorithms 3 Edition, PHI ,2010
Charles E. Leiserson,
Ronal L. Rivest, Clifford
Stein
2 Ellis Horowitz, Sartaj Fundamentals of Computer 2ndEdition,
Sahni, Sanguthevar Algorithms Universities Press,
Rajasekaran 2013
3 R.C.T. Lee, S.S. Tseng, Introduction to the Design Tata McGraw Hill, 132
R.C. Chang &Y.T.Tsai and Analysis of Algorithms 2012
 A Strategic Approach
4 Dave and Dave Design and Analysis of 2nd Edition, Pearson
Algorithms

Web Resources:
Sl.No. Web Link
1 https://nptel.ac.in/courses/106101060/
2 https://nptel.ac.in/courses/106106131/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 P012 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 - - - - - - - - - 3 - 3 -
CO2 3 3 3 3 - - - - - - - - 3 - 3 -
CO3 3 3 3 3 - - - - - - - - 3 - 3 -
CO4 3 3 3 3 - - - - - - - - 3 - 3 -
CO5 3 3 3 - - - - - - - - - 3 - 3 -
High – 3, Medium – 2, Low – 1

133
DEPARTMENT Computer Science and Engineering
Course Code 22CS430 Total 4 Course Type Professional Core Course
Credits
Course Title Data Communication
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 52 4 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100
Marks Marks Marks
Total 52 4 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Data Structures.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Introduce the basic concepts of data communication
2 Learn and analyse the working of physical, data link and network layers.
3 Learn to solve the problems related to TCP/IP protocols, Line coding, Switching,
Error detection and other related protocols.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Explain the basic concepts of computer networks and different types of L2
network models.
CO2 Discuss various elements of physical layer and different data transmission L2
modes.
CO3 Explain the fundamental concepts of multiplexing, transmission media L2
and switching.
CO4 Apply various error detection and correction methods. L3
CO5 Illustrate data link layer services and different media access control. L3
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

UNIT Hours
Content
No. Lecture
1 Introduction: Data Communications, Networks, Network Types, 10
Standards and Administration, Networks Models: Protocol Layering,
TCP/IP Protocol suite, The OSI model.
2 Introduction to Physical Layer-1: Data and Signals, Digital Signals, 10
Transmission Impairment, Data Rate Limits, Performance. Digital
Transmission: Digital to Digital Conversion (Only Line coding: Polar,
Bipolar and Manchester coding), Analog to Digital conversion (only
PCM), Transmission Modes. 134
3 Bandwidth Utilization: Multiplexing, Transmission Media: Guided 10
 Media, Unguided Media Switching: Introduction, Circuit Switched
Networks and Packet switching, Structure of a Switch.
4 Error Detection and Correction: Introduction, Block Coding, Cyclic 12
Codes: Cyclic Redundancy Checksum, Forward Error Correction:
Hamming distance, XOR.
5 Data link Layer: Introduction to Data-Link Layer: Introduction, 12
Link-Layer Addressing, Data link Services: DLC services, Data link
layer protocols, Point to Point protocol (Framing, Transition phases
only). Media Access control: Random Access, Controlled Access and
Channelization.

Text Book:
Sl.
Author/s Title Publisher Details
No
1 Behrouz A. Forouzan Data Communications and 5th Edition, Tata McGraw-
Networking Hill, 2013

Reference Books:
Sl.
Author/s Title Publisher Details
No
1 William Stallings Data and Computer 10th Edition, Pearson
Communication Education, 2014
2 Alberto Leon-Garcia Communication Networks - 2nd Edition Tata McGraw-
and Indra Widjaja Fundamental Concepts and Key Hill, Reprint 2017
architectures
3 Larry L. Peterson and Computer Networks – A Systems 5th Edition, Elsevier, 2012
Bruce S. Davie Approach
4 Nader F. Mir Computer and Communication Pearson Education, 2007
Networks

Web Resources:
Sl.No. Web Link
1 https://nptel.ac.in/courses/106105183/
2 https://nptel.ac.in/courses/106/105/106105082/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 P012 PSO1 PSO2 PSO3 PSO4
CO1 3 - - - - - - - - - - - 3 - -
CO2 3 3 - - - - - - - - - - 3 3 - -
CO3 3 3 - - - - - - - - - - 3 3 3 -
CO4 3 3 3 1 - - - - - - - - 3 3 3 -
CO5 3 3 3 - - - - - - - - - - 3 - -
High – 3, Medium – 2, Low – 1

135
DEPARTMENT Computer Science and Engineering
Course Code 22CS440 Total 4 Course Type Professional Core Course
Credits
Course Title Software Engineering
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 52 4 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100
Marks Marks Marks
Total 52 4 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Nil

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Give insight into basics of software engineering methods, practices, models and their
appropriate applications.
2 Provide an idea of building requirement model and managing requirement analysis.
3 Furnish knowledge on design concepts and various forms of software architectural
styles.
4 Emphasize on software testing approaches, levels and art of debugging.
5 Understand the project management activities such as planning, estimation and
scheduling.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Explain concepts of software engineering and software process models. L2
CO2 Analyze the software requirements. L4
CO3 Explain system design concepts and process. L2
CO4 Apply software testing strategies. L3
CO5 Demonstrate an ability to use the Agile techniques and tools necessary for L3
engineering practices.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

UNIT Hours
Content
No. Lecture
1 Software Process: Software and Software engineering: The Nature of
Software, Defining the discipline, The software Process, Software
Engineering Practice. Software Process structure: A Generic Process 8
Model, Defining Framework activity, identifying a task set. Process
Models: Prescriptive Process Models. 136
2 Software Analysis: Understanding Requirements: Requirements 12
 Engineering, Establishing the Groundwork, Developing Use Cases, and
Elements of analysis model, Negotiating Requirements, Validating
Requirements. Requirements Analysis: overall objectives and philosophy,
analysis rules of thumb, domain analysis, Requirement modeling
approaches.
3 Software Design: Design Concepts:- Design within the Context of
Software, The Design Process, Abstraction, architecture, modularity,
information hiding, functional independence, Refinement, Refactoring;
12
The Design Model. Architectural Design: Software Architecture,
Architectural Styles. Component Level Design: Component Views,
Designing class based components, Conducting component level design.
4 Software Testing: Quality Concepts:- Introduction to quality, McCall’s
Quality factors; Testing conventional applications: Software Testing
Fundamentals, White-Box Testing v/s Black box testing, Basis Path
Testing, Control Structure Testing; Software Testing Strategies: A 12
Strategic Approach to Software Testing, Strategic Issues, Test Strategies
for Conventional Software, Validation Testing, System Testing, The Art
of Debugging.
5 Agile Development: Quick Look: What it is, Who does it, Why it is
important; What Is Agility, Agility and the Cost of Change, What Is an
Agile Process, Agility Principles, The Politics of Agile Development,
Extreme Programming, The XP Process, Industrial XP, Other Agile
8
Process Models, Scrum, Dynamic Systems Development Method, Agile
Modeling, Agile Unified Process, Tool Set for the Agile Process. Software
Team, Team Structure, Agile Team: The Generic Agile Team, The XP
Team.

Text Book:
Sl.No. Author/s Title Publisher Details
th
1 Roger S Software Engineering-A 8 Edition, McGraw-Hill
Pressman Practitioners approach Publication, 2017

Reference Books:
Sl.No. Author/s Title Publisher Details
rd
1 Pankaj Jalote An Integrated Approach to 3 Edition, 2019Reprint, Narosa
Software Engineering Publications
2 Ian Sommerville Software Engineering 10th Edition, Person Education
Ltd, 2016
3 Rajib Mall Fundamentals of Software 4th Edition PHI Publications, 2014
Engineering
4 Hitesh Fundamentals of Software BPB Publications, 2010
Mohapatra, Engineering
Amiya Kumar
Rath

137
Web Resources:
Sl.No. Web Link
1 http://nptel.ac.in/courses/106101061
2 https://nptel.ac.in/courses/106/105/106105182/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 - - - - - - - - - - 3 - 2 -
CO2 3 3 3 - - - - - - - - - 3 - 2 -
CO3 3 3 - - - - - - - - - - 3 - 2 -
CO4 3 3 3 - - - - - - - - - 3 - 2 -
CO5 3 3 3 - 3 - - - - - - - 3 - 2 -
High – 3, Medium – 2, Low – 1

138
DEPARTMENT Computer Science and Engineering
Course Code 22CS450 Total 3 Course Type Professional Core Course
Credits
Course Title Theory of Computation
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 39 3 CIE SEE Total
Process
Tutorial 0 0 Weightage 40 % 60 % 100 %
Practical 0 0 Maximum 40 60 Marks 100 Marks
Marks Marks
Total 39 3 Minimum 20 25 marks 45 Marks
Marks marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Discrete Mathematical Structure.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Introduce core concepts in Automata and Theory of Computation.
2 Identify different Formal Language Classes and their Relationships.
3 Design finite state machine, Grammars and Recognize for different formal
Languages.
4 Prove or disprove theorems in automata theory using their properties.
5 Determine the decidability and intractability of Computational problems.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Design automata for given regular languages. L3
CO2 Define Regular expression, and check its equivalence among automata. L3
CO3 Write grammars for context free languages and parse the given input. L3
CO4 Design pushdown Automata and show the equivalence of CFG and PDA L3
CO5 Apply the techniques of Turing machine, decidability and intractability of L3
Computational problems.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

UNIT Hours
Content
No. Lecture
1 Introduction to Finite Automata: The central concepts of Automata 08
theory; Deterministic finite automata; Nondeterministic finite automata;
An application of finite automata; Finite automata with Epsilon-
transitions; Equivalence and minimization of automata.
2 Regular Expressions and Properties of Regular Languages: Regular 08
expressions; Converting DFA’s to regular expression by eliminating
139
states, Converting Regular Expressions to Finite Automata; Applications
of Regular Expressions; Proving languages not to be regular languages;
 Closure properties of regular Languages.
3 Context-Free Grammars and Languages: Context-Free Grammars; 08
Parse trees; Applications of Context-Free Grammars; Ambiguity in
Grammars and Languages; Normal forms for CFGs.
4 Pushdown AutomataDefinition of the Pushdown Automata; The 07
languages of a PDA; Equivalence of PDA’s and CFG’s; Deterministic
Pushdown Automata.
5 Introduction to Turing Machine: The Turing machine; Programming 08
techniques for Turing Machines, Extension to the basic Turing machine,
restricted Turing machine.

Text Books:
Sl.No. Author/s Title Publisher Details
rd
1 John E. Hopcroft, Rajeev Introduction to Automata 3 Edition, Pearson
Motwani, Jeffrey D. Ullman Theory, Languages and education, 2007
Computation

Reference Books:
Sl.No. Author/s Title Publisher Details
1 Peter Linz Finite Automata and Formal 4th Edition, Narosa
Languages Publication, 2010.
2 John C Martin Introduction to Languages 3rd Edition, Tata
and Automata Theory McGraw- Hill, 2007.
3 Daniel I.A. Cohen Introduction to Computer 2nd Edition, John Wiley
Theory & Sons, 2004
4 Thomas A. Sudkamp An Introduction to the 3rd Edition, Pearson
Theory of Computer Education, 2006
Science, Languages and
Machines

Web Resources:
Sl.No. Web Link
1 https://nptel.ac.in/courses/106104148/
2 https://nptel.ac.in/courses/106/104/106104028/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 - - - - - - - - - 3 - 2 -
CO2 3 3 3 - - - - - - - - - 3 - 2 -
CO3 3 3 3 - - - - - - - - - 3 - 2 -
CO4 3 3 3 - - - - - - - - - 3 - 2 -
CO5 3 3 3 - - - - - - - - - 3 - 2 -
High – 3, Medium – 2, Low – 1
140
DEPARTMENT Computer Science and Engineering
Course Code 22HU412 Total 0 Course Type Humanities, Social Sciences
Credits and Management Course
Course Title Environmental Studies
Contact Credits Assessment in
Teaching Hours Weightage and marks
Learning Lecture 26 0 CIE SEE Total
Process
Tutorial 0 0 Weightage 100 % -- 100 %
Practical 0 0 Maximum 50 -- 50 Marks
Marks Marks
Total 26 0 Minimum 25 -- 25 marks
Marks marks

COURSE PREREQUISITE: NIL

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 The student gains knowledge on basic concepts on Environmental aspects and
understands its importance in various disciplines for safeguarding the environment.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Understand the principles of ecology and environmental issues that apply L2
to air, land, and water attributes at regional and global scale
CO2 Develop critical thinking/observation skills - apply them to identify and L2
analyze Environmental issues.
CO3 Understand the complex ecological relationship between biotic and L2
abiotic components.
CO4 Apply ecological knowledge to illustrate and address environmental L2
problems for better management.
CO5 Understand the recent technologies and legal aspects related to the L2
environment.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

Unit Hours
Content
No. Lecture
1 Introduction: Environment - Components of Environment Ecosystem: 05
Types& Structure of Ecosystem, Balanced ecosystem Human Activities
– Food, Shelter, And Economic & Social Security.
Impacts of Agriculture & Housing Impacts of Industry, Mining &
Transportation Environmental Impact Assessment, Sustainable
Development
2 Natural Resources, Water resources– Availability & Quality aspects, 07
Water borne diseases & water induced diseases, Fluoride problem in
drinking water Mineral resources, Forest Wealth Material Cycles – Carbon 141
Cycle, Nitrogen Cycle & Sulphur Cycle. Energy – Different types of
 energy, Conventional sources & non-conventional sources of energy Solar
energy, Hydro electric energy, Wind Energy, Nuclear energy, Biomass &
Biogas Fossil Fuels, Hydrogen as an alternative energy.
3 Environmental Pollution–Water Pollution, Noise pollution, Land 05
Pollution, Public Health Aspects.
Global Environmental Issues– Population Growth, Urbanization, Land
Management, Water & Waste Water Management.
4 Air Pollution & Automobile Pollution: Definition, Effects – Global 05
Warming, Acid rain & Ozone layer depletion, controlling measures. Solid
waste Management, E - Waste Management & Biomedical Waste
Management - Sources, Characteristics & Disposal methods.
5 Introduction to GIS & Remote sensing, Applications of GIS & Remote 04
Sensing in Environmental Engineering Practices. Environmental Acts &
Regulations, Role of government, Legal aspects, Role of Non-
Governmental Organizations (NGOs), Environmental Education &
Women Education.

Text Books:
Sl.No. Author/s Title Publisher Details
1 Benny Joseph Environmental Studies, Hill Publishing Company
Tata McGraw Limited. 2005
2 R.J.Ranjit Daniels and Environmental Studies Wiley India Private Ltd., New
Jagadish Delhi 2009
Krishnaswamy
3 R Rajagopalan Environmental Studies Oxford University Press, 2005
– From Crisis to Cure
4 Aloka Debi Environmental Science Universities Press (India) Pvt.
and Engineering Ltd. 2012

Reference Books:
Sl.No. Author/s Title Publisher Details
1 Raman Sivakumar Principals of 2ndEdition, Cengage learning
Environmental Science Singapore, 2005
and Engineering
2 P. Meenakshi, Elements of Prentice Hall of India Private
Environmental Science Limited, New Delhi, 2006
and Engineering
3 S.M. Prakash Environmental Studies Elite Publishers Mangalore, 2007
4 Erach Bharucha Text Book of University press, 2005
Environmental
Studies, for UGC
5 G.Tyler Miller Jr Environmental Science Thomson Brooks /Cole, 2006
– working with the
Earth Eleventh Edition

142
 Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 - - 3 3 3 - 3 3 - - 3 3 3 3
CO2 3 3 3 - 3 3 3 3 3 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
CO4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
CO5 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
High – 3, Medium – 2, Low – 1

Evaluation Scheme:
Continuous Internal Evaluation – CIE
Event Event Type Marks Allotted Duration
CIE – 1 Written Test – 1 20 1 Hour
CIE – 2 Event 10 1 Hour
CIE – 3 Written Test – 2 20 1 Hour
Note:
1. The written test 1 & 2 (CIE – 1 & 3) both will be conducted for 20 marks each in 1 hour
duration.
2. The Event (CIE – 2) will be conducted for 20 marks and the marks scored will be
reduced proportionately to 10 marks.
3. The Event (CIE – 2) will be skill based assessment such as Seminars / Technical talks /
Case study / hands-on activity / Mini projects / Sci-tech activity / Data analysis.
4. A student must score on an average of 50% i.e., 25 marks out of 50 from all the events
(CIE - 1, 2, 3) to pass.

143
DEPARTMENT Computer Science and Engineering
Total Course
Course Code 22CS46L 1.5 Professional Core Course
Credits Type
Course Title Operating Systems Lab
Contact Assessment in Weightage and marks
Credits
Hours
Lecture 0 0 CIE SEE Total
Teaching Tutorial 0 0 Weightage 40 % 60 % 100 %
Learning Practical Maximum 40 60 100
39 1.5 Marks Marks Marks
Process Marks
Total Minimum 20 25 45 Marks
39 1.5 marks marks
Marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Computer Organization, Data Structures, C Programming.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Familiarize students with LINUX/UNIX OP and provide necessary skills for
developing and debugging programs in these environments.
2 Learn shell script, creation and management of processes, IPC using shared memory
and multithreads programing.
3 Analyze and develop process scheduling algorithms and process synchronization.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Implement shell programs and design process management and file L3
system management with system calls.
CO2 Design and implement Inter Process Communication and multiple L4
threads application.
CO3 Analyze and implement CPU scheduling algorithms and process L4
synchronization.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

Hours
Weeks List of Programs
Lecture
1 a. Exposure to Linux Operating System and Environment 03
b. Write Shell Scripts for the following:
i. Concatenation of two strings
ii. Comparison of two strings
iii. Maximum of three numbers
2 Write Shell Scripts for the following: 03
a. Fibonacci series 144
b. Arithmetic operation using case
 c. Check whether a given number is palindrome or not
3 Write Shell Scripts for the following: 03
a. Finding largest of N numbers (storing numbers in an array)
b. Generating prime numbers.
c. Reading two matrices and finding sum
4 Simulation of ls, rm, cat and grep commands using system calls. 03
5 a. Write a program to perform the following tasks using system calls: 03
i. Parent process should create a child process
ii. Both parent child processes should display their pid and parent’s
pid; parent process should also display its child’s pid
iii. Load a new program into child process
iv. The parent process should terminate after the child process
terminates
b. Program to demonstrate the creation of Zombie and Orphan
processes.
c. Program to perform the following task using I/O system calls for file
I/O
i. Reading first 10 characters from file
ii. Skipping 5 characters from current position in the file
iii. Going to 5thlast character in the file
iv. Going to the 3rdcharacter in the file
d. Program to read from file and write into a new file using I/O system
calls for file I/O
6 a. Program to implement Producer-consumer problem using the 03
following shared memory methods:
i. using shm_open and mmap
ii. shmget and shmat
b. Write a program to generate first N ODD numbers with the
following requirements: - Parent program should create a child and
distribute the task of generating odd
numbers to its child.
- The code for generating odd numbers should reside in different
program.
- Child should write the odd numbers to a shared memory.
- Parent process has to print the odd numbers by retrieving from
the shared memory.
i. Implement the above using shmget and shmat
Note: Shared object should be removed at the end in the program
7 a. Write a program to generate and print Fibonacci series with the 03
following requirements:
- Parent program should create a child and distribute the task of
generating Fibonacci series to its child.
- The code for generating Fibonacci series should reside in
different program.
- Child should write the generated Fibonacci series to a shared
memory.
- Parent process has to print by retrieving the Fibonacci series
from the shared memory. 145
i. Implement the above using shmget and shmat
 ii. Implement the above using shm_open and mmap
Note: Shared object should be removed at the end in the program.
b. Write a program to generate and print Prime numbers between a
given range(between M & N) with the following requirements
- M& N should be passed as command line arguments
- Error checking should be done to verify the required number of
arguments at the command line
- Parent program should create a child and distribute the task of
generating Prime numbers to its child.
- The code for generating Prime numbers should reside in
different program.
- Child should write the generated Prime numbers to a shared
memory.
- Parent process has to print by retrieving the Prime numbers from
the shared memory.
i. Implement the above using shm_open and mmap
Note: Shared object should be removed at the end in the program.
8 a. Write a program with two threads and a main thread. Schedule the 03
task of calculating the natural sum upto ‘n’ terms and factorial of ‘n’ on
these threads.
Note: The main thread should read ‘n’ from command line and pass it as
parameter to remaining threads. Terminate the threads using system calls.
b. Implement FCFS scheduling algorithm by defining the process
structure.
9 Implement the following CPU scheduling algorithms by defining the 03
process structure:
a. SJF
b. SJF (Preemptive)
10 Implement the following CPU scheduling algorithms by defining the 03
process structure:
a. Priority
b. Priority (Preemptive)
11 Implement Round Robin CPU scheduling algorithm with arrival time by 03
defining the process structure.
12 Implement the following using mutex and semaphores: 03
a. Producer – Consumer problem
b. Reader’s writers’ problem
13 Laboratory Test 03

146
Reference Books:
Sl.No. Author/s Title Publisher Details
1 Abraham Operating System Concepts 9th Edition, Wiley India, 2013
Silberschatz, Peter
Baer Galvin, Greg
Gagne
2 William Stallings Operating Systems: 7th Edition, Prentice Hall of
Internals and Design India, 2017
Principles
3 D.M Dhamdhere Operating systems - A 4th Edition, Tata McGraw Hill,
concept-based Approach 2013
4 P.C.P.Bhatt Introduction to Operating 4th Edition, PHI, 2014
Systems: Concepts and
Practice

Web Resources:
Sl.No. Web Link
1 https://youtu.be/783KAB-tuE4 - NPTEL IIT, Madras
2 https://nptel.ac.in/courses/106108101/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 - - - - - 3 3 - - 3 - 3 -
CO2 3 3 3 3 - - - - 3 3 - - 3 - 3 -
CO3 3 3 3 3 - - - - 3 3 - - 3 - 3 -
High – 3, Medium – 2, Low – 1

147
DEPARTMENT Computer Science and Engineering
Total Course
Course Code 22CS47L 1.5 Professional Core Course
Credits Type
Course Title Design and Analysis of Algorithms Lab
Contact Assessment in Weightage and marks
Credits
Hours
Lecture 0 0 CIE SEE Total
Teaching Tutorial 0 0 Weightage 40 % 60 % 100 %
Learning Practical Maximum 40 60 100
39 1.5 Marks Marks Marks
Process Marks
Total Minimum 20 25 45 Marks
39 1.5 marks marks
Marks
Note: *For passing the student has to score a minimum of 45 Marks (CIE+SEE: 20 + 25 or 21 + 24)

COURSE PREREQUISITE: Data Structures.

COURSEOBJECTIVES:
Sl.No. Course Objectives
1 Analyze the problem domain; Choose the appropriate data structures and design
technique based on the problem domain.
2 Implement algorithms and perform analysis with empirical method.
3 Evaluate the performance of different algorithms using different design techniques
for solving the same problem.

COURSE OUTCOMES (COs)

Highest
Level of
CO# Course Outcomes
Cognitive
Domain
CO1 Implement searching and sorting algorithms. L4
CO2 Implement graph based searching and sorting algorithms using Divide L4
and Conquer and Decrease and Conquer techniques.
CO3 Implement spanning tree and shortest path algorithms using Greedy and L4
Dynamic techniques.
L1 – Remember, L2 – Understand, L3 – Apply, L4 – Analyze, L5 – Evaluate, L6 - Create

Course Content / Syllabus:

No. of
Weeks List of Programs
Hours
1 Implement Euclid’s, consecutive integer checking and modified Euclid’s 03
algorithms to find GCD of two nonnegative integers and perform
comparative analysis.
2 03
Implement the following searching algorithms and perform their analysis
for worst case, best-case and average inputs.
a) Sequential Search
b) Binary Search(Recursive)
148
3 03
Implement the following elementary sorting algorithms and perform their
 analysis for worst case, best-case and average inputs
a) Selection Sort b) Bubble Sort c) Insertion Sort
4 Implement Brute force string matching algorithm to search for a pattern of 03
length ‘M’ in a text of length ‘N’ (M<=N) and perform its analysis for
worst case, best-case and average inputs.
5 Implement Merge Sort algorithm and perform its analysis for worst case, 03
best-case and average inputs.
6 Implement Quick Sort algorithm and perform its analysis for worst case, 03
best-case and average inputs.
7 a) Implement DFS algorithm to check for connectivity and acyclicity of a 03
graph. If not connected, display the connected components. Perform its
analysis for different inputs
b) Implement BFS algorithm to check for connectivity and acyclicity of a
graph. If not connected, display the connected components. Perform its
analysis for different inputs
8 a) Implement DFS based algorithm to list the vertices of a directed graph in 03
Topological ordering. Perform its analysis for different inputs
b) Implement source removal algorithm to list the vertices of a directed
graph in Topological ordering. Perform its analysis for different inputs
(Note: use efficient method to identify the source vertex).
9 Implement heap sort algorithm with bottom-up heap construction. Analyze 03
its efficiency for worst case, best-case and average case inputs.
10 a) Implement Warshall’s Algorithm to find the transitive closure of a 03
directed graph and perform its analysis for different inputs.
b) Implement Floyd’s Algorithm to find All-pair shortest paths for a graph
and perform its analysis for different inputs
11 a) Implement an algorithm to solve Knapsack problem with Dynamic 03
Programming approach and perform its analysis for different inputs.
b) Implement Prim’s algorithm to find Minimum Spanning Tree of a
graph and perform its analysis for different inputs
12 Implement Dijkstra’s algorithm to find shortest paths to other vertices in a 03
graph and perform its analysis for different inputs.
13 Laboratory Test 03

Reference Books:
Sl.No. Author/s Title Publisher Details
1 Anany Levitin Introduction to The Design 3rd Edition, Pearson
& Analysis of Algorithms Education, 2012.
2 Ellis Horowitz, Sartaj Fundamentals of Computer 2nd Edition,
Sahni, Sanguthevar Algorithms Universities Press,
Rajasekaran 2013.
3 Thomas H. Cormen, Charles Introduction to Algorithms 3rd Edition, PHI,
E. Leiserson, Ronal L. 2010
Rivest, Clifford Stein
4 R.C.T. Lee, S.S. Tseng, Introduction to the Design Tata McGraw Hill,
149
R.C. Chang &Y.T.Tsai and Analysis of Algorithms 2012.
A Strategic Approach
Web Resources:
Sl.No. Web Link
1 https://nptel.ac.in/courses/106101060/
2 https://nptel.ac.in/courses/106106131/

Course Articulation:
PROGRAM SPECIFIC
COURSE PROGRAM OUTCOMES
OUTCOMES
OUTCOMES
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 3 3 - - - - - 3 3 - - 3 - 3 -
CO2 3 3 3 3 - - - - 3 3 - - 3 - 3 -
CO3 3 3 3 3 - - - - 3 3 - - 3 - 3 -
High – 3, Medium – 2, Low – 1

150