CSE 3rd Sem Syllabus

Course Course Course L T P C
21MAB201T TRANSFORMS AND BOUNDARY VALUE PROBLEMS Category B Basic Sciences

Code Name 3 1 0 4
Pre- Co- Progressi

requisite Nil requisite Nil ve Nil
Courses Courses Courses
Data Book / Codes /
Course Offering Department Mathematics Nil
Standards
Course Learning Rationale

The purpose of learning this course is to: Program Outcomes (PO) Program
(CLR):
Specific
Analyze partial differential equations, and interpret the solutions related to PDE in engineering
CLR-1 : 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
problems.
CLR-2 : Compute the Fourier series expansion and express the sine and cosine series. Co
nd
CLR-3 : Analyze one-dimensional wave and heat equations using PDE and Fourier series concepts. De
uct
sig En
CLR-4 : Analyze Fourier transforms and their properties. inv Th In Pr
En n/ vir
est M e div oj
CLR-5 : Analyze Z transform for solving discrete-time Signal problems. gi de on
Pr iga od en id Co ec Lif
ne vel m
ob tio er gi ua m t e
eri op en P P P
le ns n ne Et l& m M Lo
ng m t& S S S
m of To er hic Te un gt. ng
Kn en Su O O O
An co ol an s a ica & Le
ow t st -1 -2 -3
aly m Us d m tio Fi arn
le of ai
sis ple ag so W n na ing
Course Outcomes (CO): At the end of this course, learners will be able to: dg sol na
x e cie or nc
e uti bili
pr ty k e
on ty
obl
s
e
ms
CO-1: Construct and solve partial differential equations using various techniques. 3 3 - - - - - - - - - - - - -
CO-2: Explain the Fourier series expansion of a function in terms of sine and cosine series. 3 3 - - - - - - - - - - - - -
Identify partial differential equations and utilize Fourier series techniques to solve one dimensional
CO-3: 3 3 - - - - - - - - - - - - -
wave and heat equations.
CO-4: Apply Fourier transforms techniques in signal analysis. 3 3 - - - - - - - - - - - - -
CO-5: Solve discrete-time signal problems using Z transforms. 3 3 - - - - - - - - - - - - -
Unit-1 - Partial Differential Equations 12 Hour
1
B.Tech/M.Tech(Integrated) Programmes-Regulations 2021- Volume-2-First Year Syllabi-Control Copy
Formation of partial differential equations by eliminating arbitrary constants & arbitrary functions- Solutions of standard types of first order partial differential equations – Lagrange’s linear equation – Linear partial
differential equations of second and higher order with constant coefficients of homogeneous types.
Unit-2 - Fourier Series 12 Hour
Dirichlet’s conditions – General Fourier series – Odd and even functions - Half range sine and cosine series - Parseval’s identity – Harmonic Analysis
Unit-3 - Applications of Partial differential equations 12 Hour
Classification of second order partial differential equations - Method of separation of variables – Solutions of one dimensional wave equation - One dimensional equation of heat conduction (Insulated edges
excluded) - Steady state condition with zero boundary - Steady state condition with non-zero boundary conditions
Unit-4 - Fourier Transforms 12 Hour
Fourier transform pair – Properties -Fourier sine and cosine transforms – Properties– Transforms of simple functions - Convolution theorem (without proof) – Parseval’s identity.
Unit-5 - Transforms 12 Hour
Z - transforms – Properties of Z transforms – Inverse Z transforms – Convolution theorem (without Proof) – Solution of linear difference equations with constant coefficients using Z-transform
1. Erwin kreyszig, Advanced Engineering Mathematics, 10th Edition, John Wiley & 5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Sons, 2015. New Delhi, 10th edition,2016.
2. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 43rd Edition, 6. Kandasamy P., etal. Engineering Mathematics, Vol.II & Vol.III (4 th revised edition), S. Chand
Learning 2015. & Co., New Delhi,2000
Resources 3. Veerarajan T., Transforms and Partial Differential Equations, Tata McGraw-Hill,
New Delhi, 3rd edition,2012.
4. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi,
2010 3rd Edition.
Learning Assessment
Continuous Learning Assessment (CLA)
Summative
Formative Life-Long Learning
Bloom’s Final Examination
CLA-1 Average of unit test CLA-2
Level of Thinking (40% weightage)
(50%) (10%)
Theory Practice Theory Practice Theory Practice
Level 1 Remember 20% - 20% - 20% -
Level 2 Understand 20% - 20% - 20% -
Level 3 Apply 30% - 30% - 30% -
Level 4 Analyze 30% - 30% - 30% -
Level 5 Evaluate - - - - - -
Level 6 Create - - - - - -
Total 100 % 100 % 100 %
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mr. Madhan Shanmugasundaram, Infosys Technologies 1. Prof. Y.V.S.S. Sanyasiraju, IIT Madras 1. Dr. B.Vennila hod.maths.ktr@srmist.edu.in
2. Prof. K.C. Sivakumar, IIT Madars
2
21DCS201P DESIGN THINKING AND METHODOLOGY Category S ENGINEERING SCIENCES
Code Name 1 0 4 3
Pre- Co- Progressi

Data Book / Codes /
Course Offering Department SRM Innovation and Design Centre Nil
Standards
Course Learning Rationale Program

The purpose of learning this course is to: Program Outcomes (PO)
(CLR): Specific
CLR-1 : Designed to explores mindset, skill set and toolset associated with design 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
Designed to work with guided applications to framing and solving problems from the perspectives of Co
CLR-2 : both business and engineering writing nd
Exposing students diverging to generate solutions and converging to select among them De
CLR-3 : uct
sig
Design methods to create concept generation methods, concept selection methods, imagining inv Th In Pr
CLR-4 : En n/ En
alternative futures est M e vir
div oj
gi de
Pr iga od en on id Co ec Lif
ne vel
ob tio er gi me ua m t e
eri op P P P
le ns n ne nt Et l& m M Lo
ng m S S S
m of To er & hic Te un gt. ng
Kn en Su O O O
ow t sta -1 -2 -3
le of ina
Course Outcomes (CO): At the end of this course, learners will be able to: sis ple ag so W n na ing
dg sol bili
x e cie ty
or nc
e uti
pr ty k e
on
obl
s
e
ms
CO-1: learn and understand technology design concepts - - 2 - - - - - - - - - - - -
3
CO-2: learning mindset, skillset and toolset associated with design - - - 3 - - - - - - - - - - -
CO-3: identify the best solutions and converging to select among them. - 2 - - - - - - - - - - - - -
CO-4: understand concept generation methods, concept selection methods, imagining alternative futures - - 3 2 - - - - - - - - - - -
Unit-1 - Introduction to Design Methodology 15 Hour

Design Frameworks - Engineering Design Problem Solving - Developing Design Solutions - Making Design Solutions - Evaluating Design Solutions - Project Introduction and Team formation -Stakeholder Map -
Brainstorming
Unit-2 - Prototyping 15 Hour
Prototyping Planning - Concept Refinement and Storyboard - Envisioning Future - Conceptual design - Creative Matrix, Morphological Synthesis, Concept Poster - Basic Presentation - Project Discussion with Teaching Team
– Usability Test Demo
Unit-3 - User Assessment 15 Hour
Usability Test - Understanding Users - Learning about Customer - Clustering & Abstract Laddering - User Testing - Project Discussion with Teaching Team
Unit-4 - Value Proposition Design 15 Hour
Value Proposition Design and Mapping, - Prototyping & Competitor Study - Competitors / Complementor’s Map - Design Methodologies - Capital Budgeting: Risk Analysis with Scenarios - Project Discussion with Teaching
Team - Project Mini-showcase - Project Discussion with Teaching Team
Unit-5 - Business Model 15 Hour
Business Model Canvas - Business pitch - Pitching strategies - IP and Partnerships - Forecasting Financial Statements - Project Discussion with Teaching Team - Final Project Presentation - Design Showcase
Dr. R. Thomas Wright, Dr. Greg J. Strimel, and Dr.Michael E. Grubbs Foundations of Engineering &
Learning Technology, 7th Edition
Resources Ikhlaqsidhu , Innovation Engineering; a practical guide to creating anything new
Learning Assessment
Formative Project Based Learning Report and Viva Voce Final Examination
Bloom’s (0% weightage)
CLA-1 Average of unit test CLA-2 (20%)
Level of Thinking (20%) (60%)
Theory Practice Theory Practice Theory Practice Theory Practice
Level 1 Remember 10% - - 10% - 10% - -
Level 2 Understand 20% - - 20% - 20% - -
Level 3 Apply 20% - - 20% - 20% - -
Level 4 Analyze 20% - - 20% - 20% - -
Level 5 Evaluate 20% - - 20% - 20% - -
Level 6 Create 10% - - 10% - 10% - -
Total 100 % 100 % 100% -
Course Designers
1. Dr.Ramakrishnan R,CDOO,Intellect Design Arena,
1. 1. Dr Shantanu Patil, SRMIST.
Chennai
4
2. Mr Ramakrishnan, CDOO,Intellect Design Arena, Chennai 2. 2. Dr. Ananth Kumar R, SRMIST
3. Mr Anirban Chowdhury, Co-Founder & Director, Frugal
3. 3. Dr.M.B Mukesh Krishnan, SRMIST
Labs,Bengaluru

21CSS201T COMPUTER ORGANIZATION AND ARCHITECTURE Category S Engineering Sciences
Code Name 3 0 0 3
Pre- Co- Progressi

Data Book / Codes /
Course Offering Department School of Computing Nil
Standards

(CLR): Specific
CLR-1 : Understand the Fundamentals of computers, Memory operations and Addressing Modes 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
CLR-2 : Know about Functions of Arithmetic and Logic unit En Pr De Co M Th En In Co Pr Lif P P P
Et
gi ob sig nd od e vir div m oj e S S S
CLR-3 : Explore the Operations of Control Unit, Execution of Instruction and Pipelining hic
ne le n/ uct er en on id m ec Lo O O O
s
CLR-4 : Classify the Need for Parallelism, Multicore and Multiprocessor Systems eri m de inv n gi m ua un t ng -1 -2 -3
5
CLR-5 : Understand the Concepts and functions of Memory unit, I/O unit ng An vel est To ne en l& ica M Le
Kn aly op iga ol er t& Te tio gt. arn
ow sis m tio Us an Su a n & ing
le en ns ag d st m Fi
dg t of e so ai W na
e of co cie na or nc
sol m ty bili k e
Course Outcomes (CO): At the end of this course, learners will be able to: uti ple ty
on x
s pr
obl
e
ms
CO-1: Identify the computer hardware and how software interacts with computer hardware 3 2 - - - - - - - - - - 1 - -
Apply Boolean algebra as related to designing computer logic ,through simple combinational and
CO-2: 3 2 - - - - - - - - - - - 2 -
sequential logic circuits
CO-3: Examine the detailed operation of Basic Processing units and the performance of Pipelining 3 - - - - - - - - - - - - - 1
CO-4: Analyze concepts of parallelism and multi-core processors. 3 - - - - - - - - - - - - 2 -
Classify the memory technologies, input-output systems and evaluate the performance of memory
CO-5: 3 2 - - - - - - - - - - - 3 -
system
Unit-1 - Introduction to Number System and Logic Gates 9 Hour

Number Systems- Binary, Decimal, Octal, Hexadecimal; Codes- Grey, BCD,Excess-3, ASCII, Parity; Binary Arithmetic- Addition, Subtraction, Multiplication, Division using Sign Magnitude,1’s compliment, 2’s
compliment, BCD Arithmetic; Logic Gates-AND, OR, NOT, NAND, NOR, EX-OR, EX-NOR.
Unit-2 - Basic Structure of computers 9 Hour
Functional Units of a computer, Operational concepts, Bus structures, Memory addresses and operations, assembly language , Instructions, Instruction sequencing, Addressing modes. Case study: 8086.
Unit-3 - Design of ALU 9 Hour
De Morgan’s Theorem, Adders, Multiplier – Unsigned, Signed, Fast, Carry Save Addition of summands; Division–Restoring and Non-Restoring; IEEE 754 Floating point numbers and operations.
Unit-4 - Control Unit 9 Hour
Basic processing unit, ALU operations, Instruction execution, Branch instruction, Multiple bus organization, Hardwired control, Generation of control signals, Micro-programmed control; Pipelining: Basic concepts
of pipelining, Performance, Hazards-Data, Instruction and Control, Influence on instruction sets.
Unit-5 - Parallelism 9 Hour
Need, types , applications and challenges, Architecture of Parallel Systems-Flynn’s classification; ARM Processor: The thumb instruction set, Processor and CPU cores, Instruction Encoding format, Memory load
and Store instruction, Basics of I/O operations. Case study: ARM 5 and ARM 7 Architecture
1. CarlHamacher,ZvonkoVranesic,SafwatZaky,ComputerOrganization,5thed.,McGraw- 5. WilliamStallings,ComputerOrganizationandArchitecture–
Learnin Hill,2015 DesigningforPerformance,10thed.,Pearson Education,2015
g 2. KaiHwang,FayeA.Briggs,ComputerArchitectureandParallelProcessing”,3rded.,McGrawHill,2 6. DavidA.PattersonandJohnL.HennessyComputerOrganizationandDesign-
Resour 016 AHardwaresoftwareinterface,5thed.,Morgan Kaufmann,2014
ces 3. GhoshT.K.,ComputerOrganizationandArchitecture,3rded.,TataMcGraw-Hill,2011
4. P.Hayes,ComputerArchitectureandOrganization,3rded.,McGrawHill,2015.
6
Learning Assessment
Summative
(50%) (10%)
Level 1 Remember 30% - 30% - 30% -
Level 2 Understand 30% - 30% - 30% -
Level 3 Apply 20% - 20% - 20% -
Level 4 Analyze 20% - 20% - 20% -
Level 5 Evaluate - - - - - -
Total 100 % 100 % 100 %
Course Designers
1. Mr.Saminath Sanjai, Borqs Technologies,Inc. Bengaluru 1. Dr.K.Vijaya, Dr.Anitha D, SRMIST

21CSC201J DATA STRUCTURES AND ALGORITHMS Category C Professional Core
Code Name 3 0 2 4
Pre- Co- Progressi

7
Data Book / Codes /
Standards
Course Learning Rationale (CLR): The purpose of learning this course is to: Program Outcomes (PO) Program
Structures, pointers, searching, sorting techniques used to handle a set of data along with time and Specific
CLR-1 : 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
space complexity
CLR-2 : List structure and its categories C
on
CLR-3 : Linear structures Stack and Queue D du
CLR-4 : Tree structure with its applications and hashing methods es ct
CLR-5 : Structures Graphs and implement them ig in Th En In
Pr
En n/ ve e vir di
M oj
gi Pr de sti en on vi C Lif
od ec
ne ob ve ga gi m du o e
er t
eri le lo tio ne en al m Lo P P P
n Et M
ng m p ns er t& & m ng S S S
To hi gt.
Kn An m of an Su Te un Le O O O
ol cs &
o al en co d st a ic ar -1 -2 -3
Us Fi
wl ysi t m so ai m ati ni
Course Outcomes (CO): At the end of this course, learners will be able to: ag na
ed s of pl ci na W on ng
e nc
ge so ex et bili or
e
lut pr y ty k
io ob
ns le
m
s
Develop programs using data types like structures, pointers and arrays supported by C programming
CO-1: 1 - 3 - - - - - 2 - - - 1 - 2
language
CO-2: Analyze the complexity of algorithm and if needed, modify it to improve its efficiency 2 3 - 1 - - - - - - - - 1 2 -
CO-3: Identify and Use appropriate data structure for devising solution 1 3 2 - - - - - - - - - 1 1 2
CO-4: Describe and use tree structure while developing programs 2 - 3 2 - - - - - - - - 1 - 2
CO-5: Implement the Graph structure and use it whenever deemed necessary for providing better solution 3 2 3 - - - - - - - - - 1 1 2
Unit-1 - Introduction 9 Hour

Programming in C - Primitive data types, Structures, Self-referential structures, Pointers and structures, Dynamic memory allocation, Matrix multiplication; Data Structure – Definition, Types, ADT, Operations;
Mathematical notations - Big O, Omega and Theta, Complexity – Time, Space, Trade off.
Unit-2 - List Structure 9 Hour
Operations on List ADT – Create, Insert, Search, Delete, Display elements; Implementation of List ADT– Array, Cursor based and Linked; Types – Singly, Doubly, Circular; Applications - Sparse Matrix, Polynomial
Arithmetic, Joseph Problem
Unit-3 - Stack and Queue 9 Hour
Operations on Stack ADT – Create, Push, Pop, Top; Implementation of Stack ADT – Array and Linked; Applications - Infix to Postfix Conversion, Postfix Evaluation, Balancing symbols, Function Calls, Tower of
Hanoi; Operations on Queue ADT - Create, Enqueue and Dequeue; Implementation of Queue ADT – Array and Linked; Types of Queue - Circular, Double ended and Priority Queue, Applications – Scheduling
8
Unit-4 - Trees and Hashing 9 Hour
Introduction to Trees, Tree traversals, Complete Binary Tree and its height, Binary Search Trees, Need for Balance, Rotation, AVL trees, B Trees, Heaps, trees and array implementations and applications; Hash
functions - Introduction, functions, Collision avoidance, Separate chaining, Open Addressing, Linear Probing, Quadratic probing.
Unit-5 - Graph 9 Hour
Introduction to Graph, Graph Traversal, Topological sorting, Minimum spanning tree – Prims Algorithm, Kruskal’s Algorithm, Shortest Path Algorithm - Dijkstra’s Algorithm
Lab 30 Hour
Lab 1: Implementation of Structures
Lab 2: Implementation of Structures using Pointers
Lab 3: Implementation of Matrix Multiplication – Dynamic Memory allocation
Lab 4: Array Implementation of List
Lab 5: Implementation of Linked List
Lab 6: Implementation of Doubly linked List
Lab 7: Implementation of Stack using array and Linked List
Lab 8: Implementation of Queue using array and Linked list
Lab 9: Applications of Stack, Queue
Lab 10: Implementation of Tree using array
Lab 11: Implementation of BST using linked list
Lab 12: Implementation of B-Trees
Lab 13: Implementation of Graph using Array
Lab 14: Implementation of Shortest path Algorithm
Lab 15: Implementation of Minimal Spanning Tree
1. Seymour Lipschutz, Data Structures with C, McGraw Hill, 2014 4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd ed., Pearson Education, 2015
Learning 2. R.F.Gilberg, B.A.Forouzan, Data Structures, 2nd ed., Thomson India, 2005 5. Reema Thareja, Data Structures Using C, 1st ed., Oxford Higher Education, 2011,
Resources 3. A.V.Aho, J.E Hopcroft , J.D.Ullman, Data structures and Algorithms, Pearson 6. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein, Introduction to
Education, 2003 Algorithms 3rd ed., The MIT Press Cambridge, 2014
Learning Assessment
Summative
(45%) (15%)
Level 1 Remember 25% - - 10% 25% -
Level 2 Understand 25% - - 20% 25% -
Level 3 Apply 20% - - 30% 20% -
Level 4 Analyze 20% - - 30% 20% -
Level 5 Evaluate 10% - - 10% 10% -
Total 100 % 100 % 100 %
9
Course Designers
1. Dr. Mariappan Vaithilingam, Senior Engineering Manager, Uber 1. Dr. Venkatesh Raman, Professor Mathematical Institute of 1. Dr. K. Vijaya, SRMIST
India Research and Development Pvt Centre, Bangalore. Science
2. Dr. S. Poornima, SRMIST
3. Dr. K. Venkatesh, SRMIST
21CSC202J OPERATING SYSTEMS Category C Professional Core
Code Name 3 0 2 4
Pre- Co- Progressi

Data Book / Codes /
Standards
Specific
CLR-1 : Outline the structure of OS and basic architectural components involved in OS design 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
CLR-2 : Introduce the concept of deadlock and various memory management mechanism C
on
CLR-3 : Familiarize the scheduling algorithms, file systems, and I/O schemes D du
CLR-4 : Identify and tell the various embedded operating systems and computer security concepts es ct
CLR-5 : Name the various computer security techniques in windows and Linux ig in Th En In
Pr
En n/ ve e vir di
M oj
gi Pr de sti en on vi C Lif
od ec
ne ob ve ga gi m du o e
er t
eri le lo tio ne en al m Lo P P P
n Et M
ng m p ns er t& & m ng S S S
To hi gt.
Kn An m of an Su Te un Le O O O
ol cs &
o al en co d st a ic ar -1 -2 -3
Us Fi
wl ysi t m so ai m ati ni
Course Outcomes (CO): At the end of this course, learners will be able to: ag na
ed s of pl ci na W on ng
e nc
ge so ex et bili or
e
lut pr y ty k
io ob
ns le
m
s
CO-1: Use the appropriate concepts of operating system for resource utilization 3 3 2 2 - - - - - - - 3 - - -
CO-2: Choose the relevant process and thread concepts for solving synchronization problems 3 3 3 2 - - - - - - - 3 - - -
CO-3: Exemplify different types of scheduling algorithms and deadlock mechanism. 3 3 3 2 - - - - - - - 3 - - -
10
Experiment the performance of different algorithms used in management of memory, file and I/O and
CO-4: 3 3 3 2 - - - - - - - 3 - - -
select the appropriate one.
Demonstrate different device and resource management techniques for memory utilization with security
CO-5: 3 2 3 2 - - - - - - - 3 - - -
mechanisms
Unit-1 - Introduction 9 Hour

Computer-System Organization, Computer-System Architecture, Operating-System Structure, Operating-System Operations, Process Management, Memory Management, Storage Management, Protection and
Security, Kernel Data Structures, Computing Environments, Open-Source Operating Systems, Operating-System Services, User and Operating-System Interface, System Calls, Types of System Calls, System
Programs, Operating-System Design and Implementation, Operating-System Structure, Operating-System Debugging, Operating-System Generation, System Boot.
Unit-2 - Process Management 9 Hour
Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication, Communication in Client– Server Systems, Threads: Multicore Programming, Multithreading Models, Thread
Libraries, Implicit Threading, Threading Issues. Process Synchronization: The Critical-Section Problem, Peterson’s Solution, Synchronization Hardware, Mutex Locks, Semaphores, Classic Problems of
Synchronization, Monitors
Unit-3 - CPU Scheduling: 9 Hour
Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling, Multiple-Processor Scheduling, Real-Time CPU Scheduling. Deadlocks: System Model, Deadlock Characterization, Methods for
Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock
Unit-4 - Memory Management 9 Hour
Main Memory, Swapping, Contiguous Memory Allocation, Segmentation, Paging, Structure of the Page Table. Virtual Memory: Introduction, Demand Paging, Copy-on-Write, Page Replacement, Allocation of
Frames, Thrashing, Memory-Mapped Files, Allocating Kernel Memory. STORAGE MANAGEMENT: Disk Structure, Disk Attachment, Disk Scheduling, Disk Management, Swap-Space Management, RAID
Structure. File-System Interface: File Concept, Access Methods, Directory and Disk Structure, File-System Mounting, File Sharing, Protection. .
Unit-5 - Protection and Security 9 Hour

Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix, Implementation of the Access Matrix, Access Control, Revocation of Access Rights, Capability-Based Systems, Language-Based
Protection, The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool, User Authenti cation, Implementing Security Defenses, Firewalling to Protect Systems and
Networks, Computer-Security Classifications.
Lab 30 Hour
Lab 1: Operating system Installation, Basic Linux commands
Lab 2: Process Creation using fork() and Usage of getpid(), getppid(), wait() functions
Lab 3: Multithreading
Lab 4: Mutual Exclusion using semaphore and monitor
Lab 5: Reader-Writer problem
Lab 6: Dining Philosopher problem
Lab 7: Bankers Algorithm for Deadlock avoidance
Lab 8: FCFS and SJF Scheduling
Lab 9: Priority and Round robin scheduling
Lab 10: FIFO Page Replacement Algorithm
Lab 11: LRU and LFU Page Replacement Algorithm
Lab 12: Best fit and Worst fit memory management policies
Lab 13: Disk Scheduling algorithm
Lab 14: Sequential and Indexed file Allocation
Lab 15: File organization schemes for single level and two level directory
Learning 1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, John Wiley & Sons (Asia) Pvt. 6. Charles Crowley, “Operating Systems: A Design-
11
Resources Ltd, Tenth Edition, 2018 Oriented Approach”, Tata McGraw Hill Education, 2017
2. RamazElmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral Approach “, Tata McGraw Hill Edition, 2010 7. https://nptel.ac.in/courses/106/105/106105214/
3. Dhananjay M. Dhamdhere, “Operating Systems – A Concept Based Approach”, Third Edition, Tata McGraw Hill Edition, 8. https://nptel.ac.in/courses/106/106/106106144/
2019 9. https://nptel.ac.in/courses/106/102/106102132/
4. Andrew S. Tanenbaum, “Modern Operating Systems”, Fourth Edition, Global Edition, Pearson, 2015. 10. https://onlinecourses.nptel.ac.in/noc21_cs44/preview
5. William Stallings, “Operating Systems: Internals and Design Principles”, Pearson Education, Sixth Edition, 2018. 11. https://nptel.ac.in/courses/106/105/106105172/
Learning Assessment
Summative
(45%) (15%)
Level 1 Remember 20% - - 0% 20% -
Level 2 Understand 40% - - 40% 40% -
Level 3 Apply 20% - - 40% 20% -
Level 4 Analyze 20% - - 10% 10% -
Level 5 Evaluate - - - 10% 10% -
Total 100 % 100 % 100 %
Course Designers
1. Mr.T.Madhan, Team Leader, Tata Consultancy Services, 1. Dr. S. Janakiraman, Associate Professor, Pondicherry University, 1. Dr. N. Prasath, Associate Professor, SRMIST
siruseri Campus, Chennai, madhan.tk@gmail.com sj.dbt@pondiuni.edu.in
2. Mrs.K.Saranya, IT Analyst, Tata Consultancy Services, 2. Dr. R.Shyamala, Associate Professor, Anna University College of 2. Dr. M. Eliazer, Assistant Professor, SRMIST
siruseri Campus, Chennai, saranya.k6@gmail.com Engineering Tindivanam, vasuchaaru@gmail.com
12
21CSC203P ADVANCED PROGRAMMING PRACTICE Category C Professional Core
Code Name 3 1 0 4
Pre- Co- Progressi

Data Book / Codes /
Standards
Specific
CLR-1 : Understand the paradigm functionalities and their hierarchy 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
CLR-2 : Deploy structural, procedural, and Object-Oriented Programming Paradigm Co
nd
CLR-3 : Demonstrate the event, Graphical User Interface, and declarative Paradigm with a java application. uc
CLR-4 : Extended knowledge on logic, functional, network and concurrent Paradigm De t
CLR-5 : Symbolic, Automata-based, and Event with a python application. sig inv En
Th In Pr
En n/ es vir
M e div oj
gi de tig on Lif
Pr od en id Co ec
ne vel ati m e
ob er gi ua m t
eri op on en Lo P P P
le n ne Et l& m M
ng m s t& ng S S S
m To er hic Te un gt.
Kn en of Su Le O O O
An ol an s a ica &
ow t co st ar -1 -2 -3
aly Us d m tio Fi
le of m ai nin
Course Outcomes (CO): At the end of this course, learners will be able to: sis ag so W n na
dg sol pl na g
e cie or nc
e uti ex bili
ty k e
on pr ty
s ob
le
m
s
CO-1: Devise solutions to the various programming paradigm 3 2 - - - - - - - - - - - - -
CO-2: Express proficiency in the usage of structural, procedural, and Object-Oriented Program 3 2 - 1 - - - - - - - - - - -
CO-3: Determine the Java application using declarative, event, and graphical user interface paradigm 3 - 2 1 2 - - - 1 - - - - - -
CO-4: Express proficiency in the usage of logic, functional, network, and concurrent Paradigm 3 2 - 1 - - - - - - - - - - -
Determine the Python application using symbolic, automata-based, and graphical user interface
CO-5: 3 - 2 1 2 - - - 1 - - - - - -
programming paradigms
Unit-1 - Introduction to Programming Paradigm 12 Hour

Programming Languages – Elements of Programming languages - Programming Language Theory - Bohm- Jacopini structured program theorem - Multiple Programming Paradigm – Programming Paradigm
hierarchy – Imperative Paradigm: Procedural, Object-Oriented and Parallel processing – Declarative programming paradigm: Logic, Functional and Database processing - Machine Codes – Procedural and Object-
Oriented Programming – Suitability of Multiple paradigms in the programming language - Subroutine, method call overhead and Dynamic memory allocation for message and object storage - Dynamically dispatched
13
message calls and direct procedure call overheads – Object Serialization – parallel Computing
Unit-2 - Java Programming Paradigms 12 Hour
Object and Classes; Constructor; Data types; Variables; Modifier and Operators - Structural Programming Paradigm: Branching, Iteration, Decision making, and Arrays - Procedural Programming Paradigm:
Characteristics; Function Definition; Function Declaration and Calling; Function Arguments - Object-Oriented Programming Paradigm: Abstraction; Encapsulation; Inheritance; Polymorphism; Overriding -
Interfaces: Declaring, Implementing; Extended and Tagging - Package: Package Creation.
Unit-3 - Advanced Java Programming Paradigms 12 Hour
Concurrent Programming Paradigm: Multithreading and Multitasking; Thread classes and methods - Declarative Programming Paradigm: Java Database Connectivity (JDBC); Connectivity with MySQL – Query
Execution; - Graphical User Interface Based Programming Paradigm: Java Applet: Basics and Java Swing: Model View Controller (MVC) and Widgets; Develop a java project dissertation based on the programming
paradigm.
Unit-4 - Pythonic Programming Paradigm 12 Hour
Functional Programming Paradigm: Concepts; Pure Function and Built-in Higher-Order Functions; Logic Programming Paradigm: Structures, Logic, and Control; Parallel Programming Paradigm: Shared and
Distributed memory; Multi-Processing – Ipython; Network Programming Paradigm: Socket; Socket Types; Creation and Configuration of Sockets in TCP / UDP – Client / Server Model.
Unit-5 - Formal and Symbolic Programming Paradigm 12 Hour

Automata Based programming Paradigm: Finite Automata – DFA and NFA; Implementing using Automaton Library - Symbolic Programming Paradigm: Algebraic manipulations and calculus; Sympy Library - Event
Programming Paradigm: Event Handler; Trigger functions and Events – Tkinter Library. Develop a python-based project dissertation based on the programming paradigm.
1. Elad Shalom, A Review of Programming Paradigms throughout the History: With 3. Herbert Schildt, Java: The Complete Reference Seventh Edition, 2016.
Learning a suggestion Toward a Future Approach, Kindle Edition, 2018 4. Mark Lutz, Programming Python: Powerful Object-Oriented Programming, 2011.
Resources 2. Maurizio Gabbrielli, Simone Martini, Programming Languages: Principles and
Paradigms, 2010.
Learning Assessment
Formative Project Based Learning Report and Viva Voce Final Examination
Bloom’s CLA-1 Average of unit test CLA-2 (20% weightage) (0% weightage)
Level of Thinking (20%) (60%)
Level 1 Remember 30% - -- 20% - 10% - -
Level 2 Understand 30% - - 20% - 10% - -
Level 3 Apply 20% - - 20% - 10% - -
Level 4 Analyze 20% - - 20% - 10% - -
Level 5 Evaluate - - - 10% - 30% - -
Level 6 Create - - - 10% - 30% - -
Total 100 % 100 % 100 % -
Course Designers
1. Mr. N. Venkatesh, Tech Lead, Honeywell, Bengaluru, 1. Dr. Sudeepta Mishra, Assistant Professor, Computer Science and 1. Dr Ramkumar J, Assistant Professor, Computing Technologies,
Karnataka, India Engineering, Indian Institute of Information Technology, SRM Institute of Science and Technology, KTR Campus,
Ropar, Punjab. Chennai
14
21LEM201T PROFESSIONAL ETHICS Category M Mandatory Courses
Code Name 1 0 0 0
Pre- Co- Progressi

Data Book / Codes /
Course Offering Department English and Foreign Languages Nil
Standards

(CLR): Specific
CLR-1 : To connect the learners to their potential - understand moral, professional and personal values. 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
CLR-2 : To introduce the learners to professional ethics and to enable them towards decision making skills Co
nd
CLR-3 : To draw the learners’ attention towards business ethics. De
uct
sig En
CLR-4 : To strengthen and enhance professional ethics through psychological approach inv Th In Pr
En n/ vir
est M e div oj
CLR-5 : To cultivate a spirit of working in diverse world by understanding workplace ethics. gi de on
ne vel m
eri op en P P P
ng m t& S S S
Kn en Su O O O
ow t st -1 -2 -3
le of ai
x e cie or nc
e uti bili
pr ty k e
on ty
obl
s
e
ms
CO-1: Equip themselves with an understanding of moral, professional and personal values - - - - - - - 3 - - - 3 - - -
Understand the need of ethics in shaping their profession The learners will hone their decision -
CO-2: - - - - - - - 3 2 - - 3 - - -
making skills.
CO-3: Refine their business ethics based on psychological and philosophical perspective. - - - - - 3 - 3 - - - - - - -
CO-4: Have an edge over the ethical systems in workplace. - - - - - - - 3 2 - - 3 - - -
CO-5: assess the need for a balance between ecology, engineering and economy - - - - - 2 3 3 - - - - - - -
Unit-1 - Introduction Hour

Individual and Professional Ethics: Introduction to Professional Ethics, Morals, Values and Ethics - Personal and Professional - Sensé of Engineering Ethics - Code of Ethics by NSPE - Making decisions with
ethical dimensions - definition - roadmap to ethical decision making - common standards - internal obstacles - bias - empathy.
Unit-2 - Business Ethics Hour
15
Philosophical approaches to Business Ethics - ethical reasoning - ethical issues in business - Social Responsibility of Business - conflict of interest - cultural relativism - Ethical leadership - Resisting un - ethical
authority and domination - Global Business Ethics.
Unit-3 - Psychological Approaches Hour
Ethical Theories - Psychological and Philosohpical approaches - Myths about Morality - conflict of interest in psychological perspective - Courage - Integrity - ethical dilemma - Emotional Intelligence.
Unit-4 - Workplace Ethic Hour
Ethics in changing domains of Research - academic integrity - intellectual honesty - Role of Engineers and Managers - Ethical issues in Diverse workplace - competition - free will - Confidentiality - employee rights
- Intellectual property rights - discrimination.
Unit-5 - Safety, Responsibilities and Rights Hour
Ecology, Engineering, Economy - Risk benefit analysis and reducing risk - SDGs - Corporate social responsibility and Corporate Sustainability - CSR in India - Sustainability Case Studies.
1. Subramanian. R., Professional Ethics, Oxford Publication, 2013. 5. https://www.nspe.org/resources/ethics/code - ethics

2. Nagarasan. R.S. Professional Ethics and Human Values. New Age International 6. https://www.toolshero.com/tag/ethical - decision - making/
Publications, 2006. 7. https://pagecentertraining.psu.edu/public - relations - ethics/introduction - to - public - relations -
Learning
3. Mike W Martin and Roland Schinzinger, Ethics in Engineering,4th edition, Tata ethics/lesson - 1/ethical - theories/
Resources
McGraw Hill Publishing Company Pvt Ltd, New Delhi,2014 8. https://www.ewh.ieee.org/soc/pes/switchgear/presentations/tp_files/2017 -
4. https://soaneemrana.org/onewebmedia/Professional%20Ethics%20and%20Hu 1_Thurs_Shiffbauer_Singer_Engineering_Ethics.pdf
man%20Values%20by%20R.S%20NAAGARAZAN. pdf 9. https://peer.asee.org/case - studies - in - engineering - ethics.pdf
Learning Assessment
Summative
Formative Life Long Learning Summative
CLA-1 Average of unit test CLA-2 – (20%)
(20%) (60%)
Level 1 Remember 30% - 20% - 20% - - -
Level 2 Understand 40% - 20% - 20% - - -
Level 3 Apply 30% - 30% - 30% - - -
Level 4 Analyze - - 30% - 30% - - -
Level 5 Evaluate - - - - - - - -
Level 6 Create - - - - - - - -
Total 100 % 100 % 100% -
Course Designers
1. Ms. Woanyuh Zoe Tsou Founder and proprietor, IF Lingua 1. Dr. S. Soundiraraj, Professor and Head, Dept.of English, College of 1. Dr. P. Tamilarasan Associate Prof & Head(i/c), Dept. of EFL,
Cultural studio, Hsinchu,Taiwan. Engineering, Anna University Guindy Campus, Chennai. SRMIST.
2. Dr. J. Mangayakarasi, Dean of Academics Affairs & Head, PG and 2. Dr. J. Michael Raj Asst. Professor (SG), Dept. of EFL SRMIST
Research, Dept.of English, Ethiraj College for Woman, Chennai.
3. Dr. S. Ramya Asst. Professor(Sr.G), Dept. of EFL, SRMIST
4. Dr. K.R. Sondaraya Asst. Professor, Dept. of EFL, SRMIST.
16
21PDM201L VERBAL REASONING Category M Mandatory Courses
Code Name 0 0 2 0
Pre- Co- Progressi

Data Book / Codes /
Course Offering Department Career Development Centre Nil
Standards

(CLR): Specific
CLR-1 : Understand the structure, organization, tone, and main idea of the passage 1 2 3 4 5 6 7 8 9 10 11 12 outcomes
CLR-2 : Determine the grammatical, syntactical, and logical accuracy of sentences Co
nd
CLR-3 : Comprehend an argument’s line of reasoning De
uct
sig En
CLR-4 : Enable students understand subtle meanings of words used in academic texts inv Th In Pr
En n/ vir
est M e div oj
CLR-5 : Recognize the logical coherence of ideas in a text gi de on
ne vel m
eri op en P P P
ng m t& S S S
Kn en Su O O O
ow t st -1 -2 -3
le of ai
x e cie or nc
e uti bili
pr ty k e
on ty
obl
s
e
ms
CO-1: Build vocabulary through methodical approaches and nurture passion for enriching vocabulary - - - - - - - - 2 3 - 3 - - -
CO-2: Detect and correct grammatical, syntactical, and logical fallacies - - - - - - - - 2 3 - 3 - - -
17
Hone critical thinking skills by analyzing arguments with explicit and implicit premises to validate the
CO-3: - - - - - - - - 2 3 - 3 - - -
author’s point of view
CO-4: Analyze and evaluate texts critically in multifarious ways - - - - - - - - 2 3 - 3 - - -
CO-5: Identify relationships between sentences based on their function, usage and characteristics - - - - - - - - 2 3 - 3 - - -
Unit-1 - 6 Hour
Reading Comprehension, Spotting Errors – Subject Verb Agreement, Pronouns, Tense, Comparisons
Unit-2 - 6 Hour
Sentence Correction – Modifiers, parallelism, Subjunctive Mood
Unit-3 - 6 Hour
Sentence Completion – Single Blank, Double and Triple blanks, Sentence Completion- Grammar, Synonyms and Antonyms
Unit-4 - 6 Hour
Critical Reasoning – Facts, Inference, Judgement, Strengthening and Weakening an Argument
Unit-5 - 6 Hour
Para jumble, Para Completion, One word substitution,
1. Charles Harrington Elstor, Verbal Advantage: Ten Easy Steps to a Powerful 3. Franklin GRE Word List, 3861 GRE Words, Franklin Vocab System, 2014Wiley’s GMAT
Learning
Vocabulary, Random House Reference, 2002 Reading Comprehension Grail, Wiley, 2016
Resources
2. Norman Lewis, How to Read Better and Faster, Goyal, 4th Edition 4. Manhattan Prep GRE : Reading Comprehension and Essays, 5th Edition
Learning Assessment
Summative
CLA-1 Average of first cycle CLA-2 Average of second cycle
Bloom’s Practical Examination Final Examination
experiments experiments
Level of Thinking (40% weightage) (0% weightage)
(30%) (30%)
Level 1 Remember 40% 30% 30%
Level 2 Understand
Level 3 Apply 40% 40% 40%
Level 4 Analyze
Level 5 Evaluate 20% 30% 30%
Level 6 Create
Total 100 % 100 % 100% -
Course Designers
1. Mr.Pratap Iyer, Study Abroad 1. Mr Nishith Sinha, dueNorth India Academics LLP, nsinha.alexander@gmail.com 1. Dr. P. Madhusoodhanan, SRMIST
18
Mentors,pratap.iyer30@gmail.com
2. Mr. Ajay Zener, Director, Gradsquare ajayzenner@gmail.com 2. Dr.Dinesh Khattar, Delhi University, dinesh.khattar31@gmail.com 2. Dr Jayapragash J, SRMIST
3. Dr. M. Snehalatha, SRMIST
19

CSE 3rd Sem Syllabus

Uploaded by

Copyright:

Available Formats

CSE 3rd Sem 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

CSE 3rd Sem Syllabus

Uploaded by

Copyright:

Available Formats

Course Course Course L T P C

21MAB201T TRANSFORMS AND BOUNDARY VALUE PROBLEMS Category B Basic Sciences

Pre- Co- Progressi

Course Learning Rationale

Unit-1 - Partial Differential Equations 12 Hour

Pre- Co- Progressi

Course Learning Rationale Program

Unit-1 - Introduction to Design Methodology 15 Hour

Course Course Course L T P C

Pre- Co- Progressi

Course Learning Rationale Program

Unit-1 - Introduction to Number System and Logic Gates 9 Hour

Course Course Course L T P C

Pre- Co- Progressi

Unit-1 - Introduction 9 Hour

Pre- Co- Progressi

Unit-1 - Introduction 9 Hour

Unit-5 - Protection and Security 9 Hour

Pre- Co- Progressi

Unit-1 - Introduction to Programming Paradigm 12 Hour

Unit-5 - Formal and Symbolic Programming Paradigm 12 Hour

Pre- Co- Progressi

Course Learning Rationale Program

Unit-1 - Introduction Hour

1. Subramanian. R., Professional Ethics, Oxford Publication, 2013. 5. https://www.nspe.org/resources/ethics/code - ethics

Pre- Co- Progressi

Course Learning Rationale Program

You might also like