CURRICULUM & SYLLABUS

CHOICE BASED CREDIT SYSTEM (CBCS)

FOR
BACHELOR OF TECHNOLOGY (B.Tech.)
(4 Year Undergraduate Degree Programme)
IN

COMPUTER SCIENCE AND ENGINEERING

[w. e. f. 2021-2022]

FACULTY OF ENGINEERING AND TECHNOLOGY

SRM UNIVERSITY DELHI-NCR, SONEPAT
39, Rajiv Gandhi Education City, Sonepat
Haryana-131029
 SEMESTER – IV
PYTHON PROGRAMMING
Course Code: 21CS2012 Continuous Evaluation: 40 Marks
Pre-Requisite : Basic Programming Fundamentals End Semester Examination: 60 Marks
LT P:3 00
Credits: 3

COURSE OBJECTIVE
1. To study the basic taxonomy, terminology and components of the python programming.
2. To study about the control flow and different type of functions in python programming language.
3. To study the different data types and their usage in python programming language.
4. To study different modules and libraries associated with python programming.
5. To study the visualization and plotting functions provided by python programming language.

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course the students will be able to:
1. Demonstrate the usage of basic programs of python programming.
2. Demonstrate the usage of loops, control flow and different functions.

3. Classify the different data types and their application in different scenarios.
4. Develop advanced programs in python programming using the libraries.
5. Use various visualization tools to develop graphs for data analysis.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4 CLO5

CO1     
CO2     
CO3     
CO4     
CO5     

COURSE CONTENTS

UNIT
CONTENTS
NUMBER

UNIT-I OVERVIEW OF PYTHON

Introduction to programming languages – Machine language, Assembly language,
High level language, Software development, History of Python, Thrust areas of
Python, Parts of Python programming language – Identifiers, Keywords, Statements
97
 and Expressions, Variables, Operators, Precedence and associativity, Data types,
Indentation, Comments, Reading Input, Print Output.

UNIT-II FUNCTIONS AND CONTROL FLOW

Type of Control Flow statements; loops; exception handling; Functions – Built-In
Functions, Commonly Used Modules, Function Definition and Calling the Function,
The return Statement and void Function, Scope and Lifetime of Variables, Default
Parameters, Keyword Arguments, *args and **kwargs, Command Line Arguments;
Type conversion functions - int(), float(), str(), chr(),complex(), ord(), hex(),
oct();Functional Programming – lambda, iterators and generators; Strings.

UNIT-III PYTHON DATA STORAGE FORMATS

Lists – Creating Lists, Basic List Operations, Indexing and Slicing in Lists, Built-In
Functions Used on Lists, List Methods, The del Statement; Dictionaries –
Creating Dictionary, Accessing and Modifying key, Built-In Functions, Dictionary
Methods; Tuples and Sets – Creating Tuples, Tuple Operations, Indexing and Slicing
in Tuples, Built-In Functions, Tuple Methods, Sets, Set Methods, Set Traversal,
Frozen Set, Relation between Tuples and Dictionary, Relation between Tuples and
Lists.

UNIT-IV FILES AND REGULAR EXPRESSIONS

Files – Types of Files, Creating and Reading Text Data, File Methods to Read and
Write Data, Reading and Writing Binary Files, The Pickle Module, Reading and
Writing CSV Files, Python os and os.path Modules; Regular Expression – RE
Operations, Using Special Characters, Regular Expression Methods, Named Groups
in Python Regular Expressions, Regular Expression with glob Module.

UNIT-V Visualizing Data

NumPy with Python; Pandas series and dataframe; Altair; Matplotlib – graphs and
plots, appearance, axis, labels, annotations, legends; plotting pie-chart, histogram,
bar charts, box plot, scatterplot; Introduction to Machine learning and essential
packages: Scikit, SciPy, BeautifulSoup, statsmodel, IPython ;

TEXT/REFERENCE BOOKS
 S, G., & A, V. (2018). Introduction to Python Programming (1st ed.). Chapman and Hall/CRC.
 Boschetti, A., & Massaron, L. (2018). Python Data Science Essentials: A practitioner’s guide
covering essential data science principles, tools, and techniques, 3rd Edition. Packt Publishing.

REFERENCE BOOKS
 Shovic, J. C., & Simpson, A. (2019). Python All-In-One For Dummies (1st ed.). For Dummies.

98
 THEORY OF COMPUTATION
Course Code: 21CS2004 Continuous Evaluation: 40 Marks
Pre-Requisite : NIL End Semester Examination: 60 Marks
LTP:310
Credits: 4

COURSE OBJECTIVES
1. To understand and design various finite Computing models.

2. To gain knowledge about the concepts of grammar, normal forms and regular expressions and
PDA.
3. To understand the Recursive and Recursively enumerable languages , Decidability and
Undecidability of various problems

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course the students will be able to:
1. Comprehend regular languages and finite automata and develop ability to provide the
equivalence between regular expressions, NFAs, and DFAs.
2. Student understands the basics of regular expression and its equivalence.
3. Disambiguate context-free grammars by mastering the concepts of context‐ free languages and
push‐ down automata
4. Study the concepts of Push Down Automata and its applications.
5. Apply the concepts of recursive and recursively enumerable languages and design efficient
Turing Machines.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4 CLO5

CO1  
CO2    
CO3   

COURSE CONTENTS

UNIT COURSE CONTENTS

NUMBER

UNIT-I
BASIC COMPUTATIONAL CONSTRUCTS

99
 UNIT COURSE CONTENTS
NUMBER

Finite State Systems, Basic Definitions Non-Deterministic finite automata(NDFA),

Deterministic finite automata (DFA), Equivalence of DFA and NDFA Finite automata
with Ԑ-moves, minimization of finite Automata, Concept of basic Machine, Properties
and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy
machines, pumping lemma.

UNIT-II REGULAR EXPRESSIONS

Regular grammars, regular expressions, equivalence between regular languages,
properties of regular languages, Regular Expressions, Equivalence of finite automata
and Regular Expressions, Regular expression conversion and vice versa. Conversion
of NFA to DFA by Arden’s Method.

UNIT-III GRAMMAR
Context Free Languages – Leftmost and rightmost derivation, parsing and ambiguity,
Chomsky Hierarchy, LR(k) Grammars, properties of LR(k) grammars, Simplification
of CFG, Normal forms

UNIT-IV PUSHDOWN AUTOMATA

Pushdown Automata –Definition, Instantaneous Description, Applications of
Pushdown Machines, NDPDA and DPDA, Equivalence: PDA to CFL and vice-versa,
pumping lemma for CFL..

UNIT-V TURING MACHINES & COMPUTATIONAL COMPLEXITY

Turing Machines- Introduction, Definition, Instantaneous Description, Turing
machine as Acceptors, Halting problem of T.M., Undecidability: Basics, Post’s
Correspondence Problem, Rice’s Theorem, Properties of Recursive and Recursively
Enumerable Languages, Introduction to NP-Hardness and NP-Completeness.

TEXT BOOKS

 E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Languages and Computation”,

Pearson, Education Publishers, 2nd Edition, 2004

REFERENCE BOOKS

 Michael Sipser, “Introduction to the Theory of Computation”, Thomson Asia, 2004

 J.C.Martin, “Introduction to Languages and Theory of Computation”, McGraw Hill,2003

 K.L.P. Mishra, N.Chandrasekaran , “ Theoretical Computer Science “, PHI, 3rd Edition, 2007

100
 OPERATING SYSTEMS
Course Code: 21CS2006 Continuous Evaluation: 40 Marks
Pre-Requisite : NIL End Semester Examination: 60 Marks
LT P:3 00
Credits: 3

COURSE OBJECTIVES
1. To understand the main components of an OS & their functions.
2. To study the process management and scheduling.
3. To understand various issues in Inter Process Communication (IPC) and the role of OS in IPC.
4. To understand the concepts and implementation Memory management policies and virtual
memory.
5. To understand the working of an OS as a resource manager, file system manager, process manager,
memory manager and I/O manager and methods used to implement the different parts of OS

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course, students will be able to:
1. Understand the basic operating system concepts such as overall architecture, interrupts,
APIs, user mode and kernel mode.
2. Understand the process management policies and scheduling of processes by CPU .
3. Distinguish between concepts related to concurrency including synchronization primitives, race
conditions, critical sections and multi-threading.
4. Describe and analyze the memory management and its allocation policies.
5. Identify use and evaluate the storage management policies with respect to different storage management
technologies.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4 CLO5

CO1 
CO2   
CO3   
CO4   
CO5   

COURSE CONTENTS

UNIT
COURSE CONTENTS
NUMBER

UNIT-I INTRODUCTION

101
 UNIT
COURSE CONTENTS
NUMBER

Operating system overview-objectives and functions, Concept of Multitasking,

multiprogramming, multi user, Multithreading etc, Types of Operating Systems
;Various Operating system services, architecture, System programs and calls

UNIT-II PROCESSES & SCHEDULING

Process concept, process scheduling, operation on processes; CPU scheduling,
scheduling criteria, scheduling algorithms.
Process Synchronization : Critical section Problem , Classical synchronization
Problem

UNIT-III CONCURRENCY
Principles of concurrency - mutual exclusion, semaphores, monitors,
Readers/Writers problem; Deadlocks – prevention- avoidance – detection

UNIT-IV MEMORY
Logical Physical Address Space, swapping, contiguous memory allocation, non-
contiguous memory allocation paging and segmentation techniques, segmentation
with paging; virtual memory management - Demand Paging & Page-Replacement
Algorithms; Demand Segmentation.

UNIT-V INPUT/OUTPUT AND FILE SYSTEMS

I/O management and disk scheduling – I/O devices, organization of I/O functions;
OS design issues, I/O buffering, disk scheduling, Disk cache, File management –
organization, directories, file sharing, record blocking, secondary storage
management .

TEXT BOOKS
 William Stallings, “Operating Systems – internals and design principles”, Prentice Hall
India, 5 th Edition, 2005.
 Silberschatz, Peter Galvin, “Operating System Concepts”, AWL 6 th Edition, 2002,.
REFERENCE BOOKS
 Andrew S. Tannenbaum & Albert S. Woodhull, “Operating System Design and
Implementation”, Prentice Hall India, 2 nd Edition, 1998.
 Ida M. Flynn, Ann Mclver McHoes, “Understanding Operating Systems”, 3 rd
Edition,Thomson Learning 2001s
 Gary Nutt, “Operating System - A Modern Perspective”, Pearson Education Asia, 2 nd
Edition 2000. Harvey .M. Deitel, “Operating Systems”, 2 nd Edition , 2000.

102
 ANALYSIS AND DESIGN OF ALGORITHMS
Course Code: 21CS2008 Continuous Evaluation: 40 Marks
Pre-Requisite : NIL End Semester Examination: 60 Marks
LT P:3 00
Credits: 3

COURSE OBJECTIVES
1. To analyze the asymptotic performance of algorithms and to write rigorous correctness proofs for
algorithms.
2. To demonstrate a familiarity with major Divide and conquer algorithms and data structures.
3. To apply important Dynamic programming design paradigms and methods of analysis.
4. To demonstrate through examples greedy design paradigm.
5. To Synthesize efficient algorithms in common engineering design situations

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course, students will be able to:
1. Analyze worst-case running times of algorithms based on asymptotic analysis and justify the
correctness of algorithms
2. Describe the divide-and-conquer paradigm and explain when an algorithmic design situation
calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrence relation.
3. Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the dynamic
programming algorithms, and analyze it to determine its computational complexity.
4. Describe the greedy paradigm and explain when an algorithmic design situation calls for it. For
a given problem develop the greedy algorithms.
5. Model a engineering problem using graph and write the corresponding algorithm to solve the
problems.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4 CLO5

CO1  
CO2   
CO3   
CO4  
CO5  

COURSE CONTENTS

103
 UNIT COURSE CONTENTS
NUMBER

UNIT-I ANALYSIS OF ALGORITHM

Introduction - Algorithms – Pseudo code for algorithms – present – future.
Mathematics for Algorithms – Definitions – Notation and Basic results – Asymptotic
Notation- Mathematical Induction– Analysis of Algorithms.

UNIT-II DIVIDE AND CONQUER METHOD

General Method - Binary Search – Finding Maximum and Minimum – Merge Sort –
Quick Sort Greedy Method – General Method – KnapSack Problem – Minimum
Spanning Tree Algorithm – Single Source Shortest Path Algorithm.

UNIT-III DYNAMIC PROGRAMMING

General Method–Multistage Graph – All Pairs Shortest Path Algorithm – 0/1
Knapsack Problem – Traveling Salesman Problem - Basic search techniques and
traversal techniques –bi-connected components – Depth First Search – Breadth First
Search.

UNIT-IV BACKTRACKING
The General Method – 8-Queens Problem- Sum of Subsets – Graph Coloring-
Hamiltonian Cycle-Knapsack Problem – Branch and Bound Method – 0/1 Knapsack
Problem – Traveling Salesman Problem

UNIT-V P and NP
Polynomial time – Nondeterministic Algorithms and NP – Reducibility and NP
completeness – NO complete Problems – More on NP completeness. Case studies

TEXT BOOKS
 E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”,
Galgotia Publications,1997

 Cormen, T. H. (2009). Introduction to Algorithms, 3rd Edition (The MIT Press) (3rd ed.). MIT
Press.

 Richard Johnsonbaugh , Marcus Schaefer , “ Algorithms “ , Pearson Education, 2006 3rd edition

REFERENCE BOOKS
 Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Pearson Education, 2001

 S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of Algorithms”,

McGraw Hill , 2002

 Sara Baase , “Computer Algorithms - Introduction to design and analysis”, Pearson

104
 JAVA PROGRAMMING
Course Code: 21CS2010 Continuous Evaluation: 40 Marks
Pre-Requisite : NIL End Semester Examination: 60 Marks
LT P:3 00
Credits: 3

COURSE OBJECTIVES
1. To understand the concepts of OOP and Java Environment.

2. To define the concepts, their role and implications in OOP features for Java.

3. To understand event driven, and concurrent programming paradigms.

4. To develop skills in using these paradigms using Java.

COURSE LEARNING OUTCOMES (CLO)

The syllabus adheres to all Bloom’s Taxonomy Levels and has been prepared in accordance with
National Education Policy (NEP). After completion of course, students will be able to:
1. Specify simple abstract data types and design implementations, using abstraction functions to
document them.
2. Recognize features of object-oriented design such as encapsulation, polymorphism, inheritance,
and composition of systems based on object identity.
3. Name, design and apply some common object-oriented design patterns and give examples of their
use.
4. Design applications with an event-driven graphical user interface.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4

CO1    
CO2   
CO3   
CO4   

COURSE CONTENTS

UNIT COURSE CONTENTS

NUMBER

UNIT-I INTRODUCTION
Introduction to Java Language, the Evolution of Java, Object-Oriented Programming
Concepts and Java, Differences between C++ and Java, the Primary Characteristics of
Java, the Architecture, Programming with Java, Tokens, Expressions, Using Data
Types, Declarations, Control Flow, operators, Java Program Compilation and
Execution.

105
 UNIT COURSE CONTENTS
NUMBER

UNIT-II CLASSES, PACKAGES AND INTERFACES

Introduction, Classes, Working with Objects, Constructor, De-constructor, Packages,
Abstract Classes, Interfaces Java Streams, Input Streams, Output Streams, Inheritance
& Polymorphism.

UNIT-III EXCEPTION HANDLING and THREAD

Introduction, Exception Methods, Try-catch block, Threads, Creating Threads, Life
Cycle of a Thread, Thread Methods, Using Threads, Multi-Threading, Synchronization
of Threads.

UNIT-IV APPLETS ,AWT AND DATABASE CONNECTIVITY

Introduction of Applet, Examples, Applet's Life Cycle, Methods for Adding UI
Components, Methods for Drawing and Event Handling, AWT- Introduction, Control
Classes, layout manager, different layout, Event handling .
JDBC: Java Database Connectivity, JDBC Product, Types of Drivers, Two-Tier
Client/Server Model, Three-Tier Client/Server Model, Basic Steps of JDBC, Creating
and Executing SQL Statement, The Result Set Object, Working with Database
Metadata, Connection Pool.

UNIT-V MISCELLANEOUS CONCEPTS

Wrapper classes, enumeration, autoboxing, annotation, collections, generics and
lambda Expressions.

TEXT BOOKS
 Java: The Complete Reference, Ninth Edition Paperback by Herbert Schildt

 The Java Handbook, by Patrick Naughton, Michael Morrison

 Advanced Java Programming by Uttam K. Roy, Publisher: Oxford University Press

REFERENCE BOOK
 Head First Servlets and JSP by Bryan Basham, Kathy Sierra & Bert Bates, Publisher: O'Reilly
Media

 http://www.nptelvideos.com/java/java_video_lectures_tutorials.php

 https://nptel.ac.in/courses/106105084/28

106
 TEAMWORK & INTERPERSONAL SKILLS
Course Code: 21SS452 Continuous Evaluation: 70 Marks
Pre-Requisite : NIL End Semester Examination: 30 Marks
LT P:002
Credits: 1

Training Objective:-

 TO1. To make the students learn & demonstrate effective team work, leadership &
interpersonal skills.
 TO2. To equip the students with capability of handling stress and utilisation of work time
effectively.
 TO3. To make the student understand the importance and application of Emotional Quotient,
Critical Thinking & Problem Solving Skills.

Training Learning Outcome: -

After the completion of the training, the student will have ability:

 TLO1. To be confident working in a team and leading it as well.

 TLO2. To categorise the work and achieve expected performance within the time frame & will
be able to adapt himself to work under various kinds of stress and re-energise himself to
bounce back from such situations.
 TLO3. The student will get benefitted from Emotional Quotient in building stronger
professional relationships and achieveing career and personal goals.
 TLO4. The student will be able to face complex problems and effectively deal with it in the job
due to Critical Thinking & Problem Solving Skills.

Mapping Matrix of Training Objectives (TO) & Training Learning Outcomes (TLO)
Training Learning Outcomes (TLO)
Training Objectives(TO) TLO1 TLO2 TLO3 TLO4

TO1
TO2
TO3

Student Engagement
Unit Course Contents Activity
Team Management
 Team communication & team conflict resolution
Unit - I  Role of a team leader Collaborative Working
 Team goal setting & understanding team Game Activity
development
 Team dynamics & multicultural team activity
 Johari Window Model

107
 Time Management
Unit-II  Time management matrix What You Did Yesterday
 Pareto Principle (80/20 rule) Activity
 Development process of plan of action
Leadership
Unit-III  Difference between leadership & management Lead The Blindfolded
 Types of leadership style Activity
 Core leadership skills
Stress Management
Unit-IV  Sign of stress & its impact
 Types of stress Keeping Cool Activity
 Techniques of handling stress
Emotional Intelligence
 Emotional intelligence & emotional competence Guess The Emotion Game
Unit - V  Components & behavioural skills of emotional Activity
intelligence
Critical Thinking
 Types of thinking & Characteristics
Unit - VI  Critical thinking standards Think Pair Share Activity
 Barriers to critical thinking
Problem Solving
Unit-VII  Types of problems & its solutions Think Pair Share Activity
 Problem solving process & tools

Learning Resources
Communication Skills by Sanjay Kumar & Pushp Lata: Oxford
Text Book University Press, 2018.
Personality Development & Communication Skills-1 by C B Gupta:
Reference Book Scholar Tech Press,2019.(ISBN No. – 9382209131)

Pedagogy

 The training will be based on the conept of learning by practice.

 The training will involve 30% of the training time on briefing and demonstration & the remaining
70% will be focussing on student’s engagement in training activities.
 The training will follow a circular approach where students are engaged, evaluated,given feedback
and then re engaged.

Internal (Continuous Assessment & Evaluation) & End Term (Assessment &
Evaluation) for Teamwork & Interpersonal Skills
End
Internal End Term
Unit Internal Assessment Term
Unit Name Marks Assessment
No. Parameter Marks
(70) Parameters
(30)
1 Team Management 10 Written Test 10
108
2 Time Management Role Play / Group 10
3 Leadership Activity 10
4 Stress Management Assignment 10
5 Emotional Intelligence 10
Written Test Viva 20
6 Critical Thinking 10
7 Problem Solving Case Story Telling 10

109
 PYTHON PROGRAMMING LAB
Course Code: 21CS2120 Continuous Evaluation: 60 Marks
Pre-Requisite : NIL End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVES
1. To implement the programs demonstrating the basic functionality and different data structures
used in python programming.
2. To implement the programs demonstrating the flow control and function calling in python
programming.
3. To implement the basic libraries supporting python programming.
4. To implement the visualization functions that can be used for data analysis and exploration.

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After completion
of course, students will be able to:

1. Understand the different data types in python and their usage according to the requirement.

2. Understand the flow control and different types of functions in python programming.

3. Use different tools and libraries for implementing particular behavior through python programming.

4. Utilize the different visualization functions to develop graph and for data exploration.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4

CO1    
CO2    
CO3    
CO4    

LIST OF PROGRAMS
1. Write a program to perform different Arithmetic Operations on numbers in Python.
2. Write a program to create, concatenate and print a string and accessing sub-string from a given
string.
3. Write a program to create, append, and remove lists in python.
4. Write a program to demonstrate working with tuples in python.
5. Write a program to demonstrate working with dictionaries in python.
6. To write a python program that takes in command line arguments as input and print the number
of arguments.
7. To write a python program to find the most frequent words in a text file.
8. Create and manipulate one-dimensional and two-dimensional numpy arrays,
9. Show the operations to manipulate pandas Series and Dataframes.
10. Create histograms and scatter plots for basic exploratory data analysis
110
TEXT BOOKS
 S, G., & A, V. (2018). Introduction to Python Programming (1st ed.). Chapman and Hall/CRC.
 Boschetti, A., & Massaron, L. (2018). Python Data Science Essentials: A practitioner’s guide
covering essential data science principles, tools, and techniques, 3rd Edition. Packt Publishing.

REFERENCE BOOKS
 Shovic, J. C., & Simpson, A. (2019). Python All-In-One For Dummies (1st ed.). For Dummies.

111
 OPERATING SYSTEMS LAB
Course Code: 21CS2114 Continuous Evaluation: 60 Marks
Pre-Requisite : NIL End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVES
1. To understand the operating system principles and its implementations.

2. To understand the main components of an OS & their functions.

3. To provide necessary skills for developing and debugging programs in order to optimize
performance of OS.

4. To study the process management and scheduling.

COURSE LEARNING OUTCOMES (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After completion
of course, students will be able to:
1. Demonstrate the various operations of file system.
2. Understand and Implement Memory management schemes, Thread and synchronization
3. Implement Deadlock algorithms and page replacement algorithms.
4. Apply the process synchronous concept using message queue, shared memory, semaphore for
given situation.
5. Implement Scheduling algorithms.

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)
CLO1 CLO2 CLO3 CLO4 CLO5
CO1 
CO2 
CO3  
CO4 

LIST OF PROGRAMS
1. Write a program to implement CPU scheduling for first come first serve.

2. Write a program to implement CPU scheduling for shortest job first.

3. Write a program to perform priority scheduling.

4. Write a program to implement CPU scheduling for Round Robin.

5. Write a program for page replacement policy using a LRU

112
 6. Write a program for page replacement policy using FIFO.

7. Write a program for page replacement policy using Optimal.

8. Write a program to implement first fit, best fit and worst fit algorithm for Memory
management.

9. Write a program to implement reader/writer problem using semaphore.

10. Write a program to implement Banker’s algorithm for deadlock avoidance.

TEXT BOOKS
1. Abraham Silberschatz Peter B. Galvin and Greg Gagne, Operating System Concepts, Wiley 8th
Edition, 2008.

2. Garry. J. Nutt, Operating Systems: A Modern Perspective, Addison-Wesley

3. Andrew S. Tanenbaum and Herbert Bros, Modern Operating Systems (4th Edition), Pearson

REFERENCE BOOKS
1. William Stallings, “Operating Systems – internals and design principles”, Prentice Hall India, 5
th Edition, 2005.

113
 JAVA PROGRAMMING LAB
Course Code: 21CS2116 Continuous Evaluation: 60 Marks
Pre-Requisite : NIL End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVE
1. To familiarize with the Java Environment and to implement OOP concepts.
2. To understand the concepts of interface and how to create new packages.
3. To learn how to create an interactive application

COURSE LEARNING OUTCOME:

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course the students will be able to:
1. Learn & practice the Object Oriented concepts like Inheritance, Overloading etc.
2. Learn & practice Interfaces and Packages.
3. Design and implement GUI Applications using AWT.
4. Provide Error handling and Detection facility to the application

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3 CLO4

CO1    
CO2   
CO3   

LIST OF PROGRAMS
1. WAP in Java illustrating various data types in Java

2. WAP in Java illustrating class, objects and methods.

3. WAP in Java for addition and multiplication of Matrices.

4. WAP in Java illustrating the concept of Overloading.

5. WAP in Java illustrating the implementation of Various forms of Inheritance.

6. WAP in Java illustrating Overriding methods.

7. WAP in Java illustrating Exception Handling

8. WAP in Java to manipulate strings

9. WAP in Java illustrating Interfaces in Java

10. WAP in Java to create Packages.

11. WAP in Java illustrating Threads.

12. WAP in Java to manipulate labels, lists, text fields and panels using AWT.

13. WAP in Java to handle mouse events.

114
14. WAP in Java using layout mangers.

15. WAP in Java for Collections.

16. WAP in Java for both user defined and built-in annotation.

17. WAP in Java for illustrating the use of Autoboxing.

Learning Resources
Reference Book and other 1. Laboratory Manual
materials

115
 ANALYSIS AND DESIGN OF ALGORITHMS LAB
Course Code: 21CS2118 Continuous Evaluation: 60 Marks
Pre-Requisite : Data Structures End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVE
1. To study a variety of useful algorithms and analyse their complexity.

2. To gain insight into principles and data-structures useful in algorithm design.

COURSE LEARNING OUTCOME (CLO)

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course, students will be able to:
1. Contribute to a rapidly changing field by acquiring a thorough grounding in the core principles
and foundations of computer science (e.g., techniques of program design, creation, and testing;
key aspects of computer hardware; algorithmic principles).
2. Acquire a deeper understanding on (elective) topics of more specialized interest, and be able to
critically review, assess, and communicate current developments in the field.
3. Prepare for the next step in their careers, for example, by having done a research project (for those
headed to graduate school), a programming project (for those going into the software industry), or
some sort of business plan (for those going into startups).

MAPPING BETWEEN COURSE OBJECTIVES (COS) AND COURSE LEARNING

OUTCOMES (CLOS)

CLO1 CLO2 CLO3

CO1  
CO2   

LIST OF PROGRAMS

1. Methods for expressing and comparing complexity of algorithms: worst and average cases
2. Lower bounds on algorithm classes, verification of correctness.
3. Application of such analysis to variety of specific algorithms: searching, merging, sorting (including
quick and heap internal and Fibonacci external sorts); graph problems including connected
components, shortest path, minimum spanning tree and bi-connected components); language
problems (including string matching and parsing).
4. Consideration of a number of hard problems: knapsack, satisfiability, traveling salesman problems.
5. Development of NP-complete classification and its consequence.
6. Approximation algorithms.

TEXT BOOKS
 E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”,
Galgotia Publications,1997

116
 Cormen, T. H. (2009). Introduction to Algorithms, 3rd Edition (The MIT Press) (3rd ed.). MIT
Press.

 Richard Johnsonbaugh , Marcus Schaefer , “ Algorithms “ , Pearson Education, 2006 3rd edition

REFERENCE BOOKS
 Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Pearson Education, 2001

 S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of Algorithms”,

McGraw Hill , 2002

 Sara Baase , “Computer Algorithms - Introduction to design and analysis”, Pearson

117
 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING-LEVEL-II
Course Code: 21CS0202 Continuous Evaluation: 70 Marks
Pre-Requisite : NIL End Semester Examination:30 Marks
LT P:002
Credits: 1

TRAINING OBJECTIVES
1. To understand the need of AI

2. To describe basic AI algorithms (e.g., standard search algorithms).

3. To learn about one of the learning method of AI that is Machine Learning.

4. To identify potential application domains of AI and machine learning in practice.

TRAINING LEARNING OUTCOMES (TLOS): -

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of training the students will be able to:
1. Identify problems that are amenable to solution by AI methods, and which AI methods may be
suited to solving a given problem
2. Understands the basics and need of AI and Machine learning in global view.
3. Understands, apply and evaluate the supervised learning techniques.
4. Design and implement the different applications using the concepts of AI and ML

TRAINING LEARNING OUTCOME (TLO)-TRAINING OBJECTIVE (TO) MAPPING

TLO1 TLO2 TLO3 TLO4
TO1  
TO2  
TO3   
CO4   

TRAINING CONTENTS

STUDENTS
MODULE TRAINING CONTENTS ENGAGEMENT
ACTIVITY

INTRODUCTION:
Introduction to AI: Definitions, Historical foundations, Basic Classification of
I Elements of AI, Characteristics of intelligent algorithm, AI AI Problems into
application Area. AI task Domains

PROBLEM SOLVING: Solving manually

Depth-first, breadth-first search, Problem Reduction, Constraint constraint
II
Satisfaction , Means-End Analysis. satisfaction
problem

118
 STUDENTS
MODULE TRAINING CONTENTS ENGAGEMENT
ACTIVITY

INTRODUCTION TO MACHINE LEARNING Machine Identification of

III Learning Basics, Need of Machine Learning, Application Domains, ML Model based
Basic Learning Techniques. on Application

CLASSIFICATION PROBLEM Design decision

IV Machine learning Algorithms for classification problem: Decision trees and apply K-
Trees, K-NN, SVM. NN algorithm

HANDS ON ACTIVITY :
Students will apply the methods learnt to design applications for
a) Constraint Satisfaction Problem Implement the
V
b) Robot Traversal given activity.
c) Classification problems like COVID Detection, Spam
classification etc.

Learning Resources
1. Introduction to Machine Learning, E. Alpaydin. MIT Press
2. Machine Learning, T.M. Mitchell, Mc-Graw Hill
3. Stuart Russell, Peter Norvig, Artificial intelligence : A Modern Approach, Prentice Hall,
Fourth edition, 2020.
4. Rich and K. Knight," Artificial Intelligence", Tata McGraw Hill.

119
 LIVE PROJECT-I & INDUSTRIAL VISIT
Course Code: 21CS0204 Continuous Evaluation: 60 Marks
Pre-Requisite : NIL End Semester Examination: 40 Marks
LT P:0 02
Credits: 1

COURSE OBJECTIVE
To provide hands-on experience at site where Computer Science and engineering projects are executed.

COURSE LEARNING OUTCOMES:

The syllabus has been prepared in accordance with National Education Policy (NEP). After the
completion of course the students will be able to:
1. Gather a first-hand experience on sites.
2. Apply the concepts learnt to design and create a application.

MAPPING BETWEEN COURSE OBJECTIVES (COs) AND COURSE LEARNING

OUTCOMES (CLOs)

CLO1 CLO2
CO1  

LIVE PROJECT-I
Students have to undergo three weeks practical training at the end of third semester in Computer
Science and Engineering related project sites or with the faculty members of parent or any other
institute of repute. At the end of the training they have to submit a report together with a certificate in
the format prescribed and make a power point presentation which shall be evaluated.

120