MINOR DEGREE STRUCTURE

Offered by Department of Computer Science and Engineering

Minor in Computer Science and Engineering

Computer Science Engineering (CSE) transforms our day-to-day lives through a multitude of innovative
technologies and products. The Computer Science Engineering (CSE) minor is intended to expose students
from other disciplines to the unlimited opportunities for innovation in this exciting field, and to the
methodologies and tools used by Computer Science engineers for the exploration and design of new
technologies and products. Undergraduate students of the university who are not majoring in CSE have the
option to take a Minor in Computer Science Engineering. The program is expected to accommodate students
of diverse backgrounds.

• An academic major is the academic discipline to which an undergraduate student formally

commits. A student who successfully completes all courses required for the major qualifies for
an undergraduate degree.
• Academic minor is an academic discipline outside of the student's academic major in which he or
she takes a small number of classes.
• An academic major or major field refers to a student's primary focus within their degree program
while a minor or minor field refers to his or her secondary focus.
• Minors are optional. You may complete multiple minors or none at all.
• Some students will prepare for their intended career with their major, while pursuing personal
interests with a minor, for example, majoring in Computer Science while minoring in a foreign
language or performing arts or Economics or Management Studies. Other students may pursue a
minor to provide specific specialization and thus make themselves more attractive to employers.

Why Choose a Minor?

• Adding depth to your studies
• Adding breadth to your studies
• An area of passion
• An alternative to double majoring

Objectives of this minor program

1. To impart to students basic fundamental and applied knowledge in the Computer Science discipline.
2. To convey an understanding of the continuously increasing contributions of Computer Science to
society.
3. To obtain a working knowledge of core Computer Science principles.
4. To understand the current state-of-the-art within the Computer Science discipline, and to bridge
between their major discipline of study and that of Computer Science.
Minors: Rules and Regulations
1. Pursuing a major/minor program is a highly individual decision, and should be based on a student's
educational and career goals.
2. Minors must be completed simultaneously with a major degree program. You cannot earn a minor after
you have already earned your bachelor’s degree(s).
3. You need at least one active major in order to pursue a minor.
4. Also be aware that since the minor must be completed with a major, any outstanding minor requirements
will prevent the awarding of the degree for your major. If you ultimately decide to graduate without the
minor, the minor must be removed from your records before your degree can be processed.
5. The Certification for Minor will NOT be issued until the Major degree is successfully completed, even
though all requirements for the Minor have been satisfied.
6. All requirements for the Minor must be completed within a maximum of ONE semester of the completion
of the Major degree but NOT LATER THAN the maximum duration of study of the Major degree
permitted by UGC i.e., not more than N+2 years where ‘N’ is the normal duration of study as per
regulations.
7. If a student drops from a Minor or is NOT able to fulfil all the requirements for the certification of Minor,
within the maximum period of study permitted by UGC, the student will NOT be issued the Certification.
Nevertheless, the transcripts for the completed courses will be issued.
8. Courses offered for a Certification in Minor will be treated on par with the regular courses of a Major in
respect of attendance requirements, assessment and examination requirements.
9. The number of seats for minor in Computer Science is limited and subject to availability and academic
performance.
10. Register for a Minor any time after 3rd Semester of B.Tech
11. The offering Department scrutinises the credentials of registered students and announces the list of
selected students who fulfil the minimum eligibility criteria for admission into a Minor Certificate
programme.
12. The selected students enrol into the Minor Certificate programme by paying a one-time programme fee
of Rs. 75,000/- that includes the tuition fee, examination fee and fee for transcript and certificate.
13. The student is permitted to register for a maximum of 2 courses per semester, over and above the
maximum credits permitted (26 credits) for a Major degree of study.
14. A minor requires 18-20 credits to be acquired from the courses offered by the Dept. of Computer
Science.

Eligibility Criteria
A student will be permitted to pursue a Minor, if and only if, he / she fulfils the following criteria:
i. Must have secured a minimum of 7.0 CGPA* at the time of admission to a Minor
ii. There must NOT be any standing arrears / Backlogs.
iii. Must be in the active rolls of the department without any break of study or disciplinary action
pending against the student
iv. Must have NO outstanding fee dues
* CGPA cut off is subject to change based on the demand and competition.
 MINOR IN COMPUTER SCIENCE ENGINEERING

Credits
Category Course Code Course Title L T P C Pre-Requisite to be
earned

18CSC001J Data Structures and Algorithms 3 0 2 4

Professional
Core 18CSC002J Object Oriented Design and Programming 3 0 2 4 11

18CSC003J Computer Organization and Architecture 2 0 2 3

18CSE001J Operating Systems 2 0 2 3

Software Engineering and Project
18CSE002T 2 1 0 3
Management
18CSE003J Python Programming 2 0 2 3

18CSE004T Formal Language and Automata 3 0 0 3

Professional
Electives (To 18CSE005J Computer Networks 2 0 2 3 09
choose any
Three) 18CSE006J Database Management Systems 2 0 2 3
18CSE007J Compiler Design 2 0 2 3

18CSE008J Artificial Intelligence 2 0 2 3

18CSE009T Network Security 3 0 0 3
18CSE010T Data Mining and Analytics 3 0 0 3

Total Credits 20
Course Course Course L T P C
18CSC001J DATA STRUCTURES AND ALGORITHMS C Professional Core
Code Name Category 3 0 2 4

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
1 1 1 1 1 1
CLR-1 : Utilize the different data types; Utilize searching and sorting algorithms for data search 1 2 3 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5
CLR-2 : Utilize linked list in developing applications E
CLR-3 : Utilize stack and queues in processing data for real-time applications A n
CLR-4 : Utilize tree data storage structure for real-time applications L E n v
E
CLR-5 : Utilize algorithms to find shortest data search in graphs for real-time application development e x E a i
x I P
Utilize the different types of data structures and its operations for real-time programming v p n D l r
CLR-6 : p n r
applications e e g e y o L
e P M S d o
l c i s s n i
c r o o i C j
o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
Course Learning Outcomes n l U l e t F
At the end of this course, learners will be able to: g i o o , a r
(CLO): m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
Identify linear and non-linear data structures. Create algorithms for searching and sorting 8 7 L H - H L - - - L L - H - - -
CLO-1 : 3
0 0
Create the different types of linked lists and evaluate its operations 8 7 M H L M L - - - M L - H - - -
CLO-2 : 3
5 5
Construct stack and queue data structures and evaluate its operations 7 7 M H M H L - - - M L - H - - -
CLO-3 : 3
5 0
Create tree data structures and evaluate its types and operations 8 8 M H M H L - - - M L - H - - -
CLO-4 : 3
5 0
 Create graph data structure, evaluate its operations, implement algorithms to identify shortest path 8 7 H H M H L - - - M L - H - - -
CLO-5 : 3
5 5
8 7 L H - H L - - - L L - H - - -
CLO-6 : Construct the different data structures and evaluate their types and operations 3
0 0

Duration 15 15 15 15
15
(hour)
SLO-1 Introduction-Basic Terminology Array Stack ADT General Trees Graph Terminology
S-1 Data Structures Operations on Arrays – Insertion Stack Array Implementation Tree Terminologies Graph Traversal
SLO-2
and Deletion
SLO-1 Data Structure Operations Applications on Arrays Stack Linked List Implementation Tree Representation Topological sorting
S-2 ADT Multidimensional Arrays- Sparse Applications of Stack- Infix to Tree Traversal Minimum spanning tree – Prims
SLO-2 Algorithm
Matrix Postfix Conversion
Algorithms – Searching Linked List Implementation - Applications of Stack- Postfix Binary Tree Representation Minimum Spanning Tree - Kruskal’s
SLO-1 techniques Insertion Evaluation Algorithm
S-3 Complexity – Time , Space Trade Linked List- Deletion and Search Applications of Stack- Balancing Expression Trees Network flow problem
SLO-2 off symbols
SLO-1 Lab 1: Implementation of Lab 4 :Implementation of Array – Lab 7 :Implementation of stack Lab 10: Implementation of Tree Lab 13: Implementation of Graph
S using array using Array
Searching - Linear and Binary Insertion, Deletion. using array and Linked List
4-5 SLO-2
Search Techniques
Algorithms - Sorting Applications of Linked List Applications of Stack- Nested Binary Tree Traversal Shortest Path Algorithm-
SLO-1
Function Calls Introduction
S-6
Complexity – Time , Space Trade Polynomial Arithmetic Recursion concept using stack Threaded Binary Tree Shortest Path Algorithm: Dijkstra’s
SLO-2
off Algorithm
Mathematical notations Cursor Based Implementation – Applications of Recursion:Tower of Binary Search Tree :Construction, Hashing: Hash functions -
SLO-1 Methodology Hanoi Introduction
Searching
S-7
Asymptotic notations-Big O, Cursor Based Implementation Queue ADT Binary Search Tree : Insertion and Hashing: Hash functions
SLO-2 Omega Deletion
SLO-1 Asymptotic notations - Theta Circular Linked List Queue Implementation using array AVLTrees: Rotations Hashing : Collision avoidance
S-8 Mathematical functions Circular Linked List - Queue Implementation using AVL Tree: Insertions Hashing : Separate chaining
SLO-2
Implementation Linked List
S SLO-1 Lab 2: Implementation of sorting Lab 5: Implementation of Linked Lab 8: Implementation of Queue Lab 11:Implementation of BST Lab 14 :Implementation of Shortest
9- Techniques – Insertion sort and List - Cursor Based Implementation using Array and linked list using linked list path Algorithm
SLO-2
10 Bubble Sort Techniques
Data Structures and its Types Applications of Circular List -Joseph Circular Queue B-Trees Constructions Open Addressing
SLO-1
S- Problem
11 Linear and Non-Linear Data Doubly Linked List Implementation of Circular Queue B-Trees Search Linear Probing
SLO-2
Structures
1D, 2D Array Initialization using Doubly Linked List Insertion Applications of Queue B-Trees Deletions Quadratic probing
SLO-1
S- Pointers
12 1D, 2D Array Accessing Doubly Linked List Insertion Double ended queue Splay Trees Double Hashing
SLO-2
usingPointers variations
Declaring Structure and Doubly Linked List Deletion Priority Queue Red Black Trees Rehashing
SLO-1
S- accessing
13 Declaring Arrays of Structures Doubly Linked List Search Priority Queue - Applications Red Black Trees Insertion Extensible Hashing
SLO-2
and accessing
S SLO-1 Lab 3: Implement Structures Lab 6: Implementation of Doubly Lab 9: Applications of Stack, Queue Lab 12:Implementation of B-Trees Lab 15 :Implementation of Minimal
14- using Pointers linked List Spanning Tree
SLO-2
15
 1. Seymour Lipschutz, Data Structures with C, McGraw Hill, 2014
2. R.F.Gilberg, B.A.Forouzan, Data Structures, 2nd ed., Thomson India, 2005
Learning 5. Reema Thareja, Data Structures Using C, 1st ed., Oxford Higher Education, 2011
3. A.V.Aho, J.E Hopcroft , J.D.Ullman, Data structures and Algorithms, Pearson Education,
2003 6. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein, Introduction to
Resources Algorithms 3rd ed., The MIT Press Cambridge, 2014
4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd ed., Pearson
Education, 2015

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr. Nagaveer, CEO, Campus Corporate Connect,nagaveer@campuscorporateconnect.com 1. Dr. Srinivasa Rao Bakshi, IITM, Chennai, sbakshi@iitm.ac.in 1. Mr. K. Venkatesh, SRMIST
2. Dr. Sricharan Srinivasan, Wipro Technologies, sricharanms@gmail.com 2. Dr. Ramesh Babu, N , nrbabu@iitm.ac.in 2. Dr.Subalalitha C.N, SRMIST
3. Dr.Noor Mahammad, IIITDM, Kancheepuram,noor@iiitdm.ac.in 3. Ms. Ferni Ukrit, SRMIST

Course Course Course L T P C

18CSC002J OBJECT ORIENTED DESIGN AND PROGRAMMING C Professional Core
Code Name Category 3 0 2 4

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
1 1 1 1 1 1
CLR-1 : Utilize class and build domain model for real-time programs 1 2 3 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5
CLR-2 : Utilize method overloading and operator overloading for real-time application development programs L E E E P D A M S E I C P L
E
CLR-3 : Utilize inline, friend and virtual functions and create application development programs e x x n r e n o o n n o r i P P P
t
CLR-4 : Utilize exceptional handling and collections for real-time object oriented programming applications v p p g o s a d c v d m o f S S S
h
CLR-5 : Construct UML component diagram and deployment diagram for design of applications e e e i b i l e i i i m j e O O O
i
Create programs using object oriented approach and design methodologies for real-time application l c c n l g y r e r v u e L - - –
CLR-6 : c
development o t t e e n s n t o i n c o 1 2 3
s
f e e e m & i T y n d i t n
 T d d r A D s o & m u c M g
h P A i n e , o C e a a g L
i r t n a v D l u n l t t e
n o t g l e e U l t & i . a
k f a K y l s s t & T o & r
i i i n s o i a u S e n F n
n c n o i p g g r u a i i
g i m w s m n e e s m n n
( e e l e , t W a g
Course Learning Outcomes
At the end of this course, learners will be able to: B n n e n R a o n
(CLO):
l c t d t e i r c
o y ( g s n k e
o ( % e e a
m % ) a b
) ) r i
c l
h i
t
y
8 7
CLO-1 : Identify the class and build domain model 3 H H M - - - - - H H - - M H H
0 0
8 7 M
CLO-2 : Construct programs using method overloading and operator overloading 3 H H H H H - M - H H - - H H
5 5
7 7 M
CLO-3 : Create programs using inline, friend and virtual functions, construct programs using standard templates 3 H H M H H - M - H H - - H H
5 0
8 8 M
CLO-4 : Construct programs using exceptional handling and collections 3 H H H - - - - - H M - - H H
5 0
8 7 M
CLO-5 : Create UML component diagram and deployment diagram 3 H M M M M M M - H H - M H H
5 5
8 7
CLO-6 : Create programs using object oriented approach and design methodologies 3 H H M - - - - - H H - - M H H
0 0

Duration (hour) 15 15 15 15 15
Comparison of Procedural and Types of constructor (Default, Feature Inheritance: Single and
SLO-1 Object Oriented Programming Generic - Templates : Introduction
Parameter) Multiple STL: Containers: Sequence and
S-1
Static constructor and copy Associative Container
SLO-2 OOPS and its features Inheritance: Multilevel Function templates
constructor
I/O Operations, Data Types, Feature Polymorphism: Constructor Example programs Function
SLO-1 Inheritance: Hierarchical Sequence Container: Vector, List
Variables, static overloading templates
S-2
Constants, Pointers, Type
SLO-2 Method Overloading Inheritance: Hybrid Class Templates Sequence Container: Deque, Array
Conversions
SLO-1 Features: Class and Objects Example for method overloading Class Templates
Method Overloading: Different
S-3 Inheritance: Example Programs Example programs for Class and STL : Stack
SLO-2 UML Diagrams Introduction parameter with different return
Function templates
values
S SLO-1 Lab 4: Constructor and Method
Lab 1: I/O operations Lab 7: Inheritance and its types Lab 10: Templates Lab 13: STL Containers
4-5 SLO-2 overloading
SLO-1 Feature :Class and Objects Operator Overloading and types Advanced Functions: Inline, Friend Exceptional Handling: try and catch
Associative Containers: Map,
S-6 Advanced Functions: Virtual, Exceptional Handling: Multilevel
SLO-2 Examples of Class and Objects Overloading Assignment Operator Multimap
Overriding exceptional
 UML Class Diagram and its Advanced Function: Pure Virtual Exceptional Handling: throw and
SLO-1 Overloading Unary Operators Iterator and Specialized iterator
components function throws
S-7
Class Diagram relations and Example for Unary Operator Example for Virtual and pure virtual
SLO-2 Exceptional Handling: finally Functions of iterator
Multiplicity overloading function
Feature Abstraction and Exceptional Handling: User defined
SLO-1 Overloading Binary Operators Abstract class and Interface Algorithms: find(), count(), sort()
Encapsulation exceptional
S-8
Application of Abstraction and Example for Binary Operator
SLO-2 Example Program Example Programs using C++ Algorithms: search(), merge()
Encapsulation overloading
S SLO-1 Lab 2: Classes and Objects, Lab 5: Polymorphism : Operators Lab 8: Virtual Function and Abstract Lab 15: STL Associative containers
Lab 11: Exceptional Handling
9-10 SLO-2 Class Diagram Overloading class and algorithms
Access specifiers – public, Dynamic Modeling: Package Function Object : for_each(),
SLO-1 UML Interaction Diagrams UML State Chart Diagram
private Diagram transform()
S-11
Access specifiers - protected,
SLO-2 Sequence Diagram UML State Chart Diagram UML Component Diagram Example for Algorithms
friend, inline
UML use case Diagram, use
SLO-1 Collaboration Diagram Example State Chart Diagram UML Component Diagram Streams and Files: Introduction
case, Scenario
S-12
Use case Diagram objects and
SLO-2 Example Diagram UML Activity Diagram UML Deployment Diagram Classes and Errors
relations
Method, Constructor and
SLO-1 Feature: Inheritance UML Activity Diagram UML Deployment Diagram
Destructor Disk File Handling Reading Data
S-13
Example program for Example Package, Deployment, and Writing Data
SLO-2 Inheritance and its types Example Activity Diagram
constructor Package
S SLO-1
Lab 3: Methods and Lab 9: State Chart and Activity Lab12 : UML Component,
14- Lab 6: UML Interaction Diagram Lab15: Streams and File Handling
SLO-2 Constructor, Usecase Diagram Deployment, Package diagram
15

1. Grady Booch, Robert A. Maksimchuk, Michael W. Engle, Object-Oriented Analysis and Design with 4. Robert Lafore, Object-Oriented Programming in C++, 4th ed., SAMS Publishing,
Learning Applications, 3rd ed., Addison-Wesley, May 2007 2008
Resources 2. Reema Thareja, Object Oriented Programming with C++, 1st ed., Oxford University Press, 2015 5. Ali Bahrami, Object Oriented Systems Development”, McGraw Hill, 2004
3. Sourav Sahay, Object Oriented Programming with C++, 2nd ed., Oxford University Press, 2017 6. Craig Larmen, Applying UML and Patterns, 3rd ed., Prentice Hall, 2004

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc
# For the laboratory component the students are advised to take an application and apply the concepts

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Mr. Girish Raghavan, Senior DMTS Member, Wipro Ltd. 1. Dr. Srinivasa Rao Bakshi, IITM Chennai, sbakshi@iitm.ac.in 1. Ms. C.G.Anupama, SRMIST
Ms. Thamilchelvi, Solutions Architect, Wipro Ltd 2. Dr. Ramesh Babu, N, IITM Chennai, nrbabu@iitm.ac.in 2. Mr. C.Arun, SRMIST
3. Mr. Geogen George, SRMIST
4. Mr. Muthukumaran, SRMIST

Course Course Course L T P C

18CSE003J COMPUTER ORGANIZATION AND ARCHITECTURE C Professional Core
Code Name Category 2 0 2 3

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
1 1 1 1 1 1
CLR-1 : Utilize the functional units of a computer 1 2 3 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5
CLR-2 : Analyze the functions of arithmetic Units like adders, multipliers etc. E
CLR-3 : Understand the concepts of Pipelining and basic processing units A n
CLR-4 : Study about parallel processing and performance considerations. L E n v
E
CLR-5 : Have a detailed study on Input-Output organization and Memory Systems. e x E a i
x I P
CLR-6 : Simulate simple fundamental units like half adder, full adder etc v p n D l r
p n r
e e g e y o L
e P M S d o
l c i s s n i
c r o o i C j
o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
Course Learning Outcomes n c n l n t s a
At the end of this course, learners will be able to: n l U l e t F
(CLO): g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
8 7
CLO-1 : Identify the computer hardware and how software interacts with computer hardware 2 H H - - - - - - M L - M - - -
0 0
Apply Boolean algebra as related to designing computer logic, through simple combinational and 8 7
CLO-2 : 3 H H H - H - - - M L - M - - -
sequential logic circuits 5 5
CLO-3 : Analyze the detailed operation of Basic Processing units and the performance of Pipelining 2 7 7 H H H H - - - - M L - M - - -
 5 0
8 8
CLO-4 : Analyze concepts of parallelism and multi-core processors. 3 H - - H - - - - M L - M - - -
5 0
Identify the memory technologies, input-output systems and evaluate the performance of memory 8 7
CLO-5 : 3 H - H H - - - - M L - M - - -
system 5 5
8 7
CLO-6 : Identify the computer hardware, software and its interactions 3 H H H H H - - - M L - M - - -
5 5

Duration 12 12 12 12
12
(hour)
Addition and subtraction of Signed Fundamental concepts of basic Parallelism , Need, types of Memory systems -Basic Concepts
SLO-1 Functional Units of a computer
numbers, processing unit, ALU operation Parallelism Memory hierarchy
S-1
Execution of complete instruction,
SLO-2 Operational concepts Problem solving applications of Parallelism Memory technologies
Branch instruction
Design of fast adders, Ripple carry
SLO-1 Bus structures Multiple bus organization Parallelism in Software RAM, Semiconductor RAM
adder
S-2
Memory locations and Carry look ahead adder , Hardwired control , Generation of Instruction level parallelism , Data
SLO-2 ROM, Types , Speed, size cost
addresses , Memory operations Multiplication of positive numbers control signals level parallelism
SLO-1 Lab 1: To recognize various
Lab-13: Study of Carry Save
S components of PC-Input Output Lab4:Study of TASM Addition and Lab-7: Design of Half Adder Design Lab-10: Study of Array Multiplier
Multiplication Program to carry out
3-4 SLO-2 systems Processing and Subtraction of 8-bit number of Full Adder Design of Array Multiplier
Carry Save Multiplication
Memory units
Instructions, Instruction
SLO-1 Signed operand multiplication Micro-programmed control- Challenges in parallel processing Cache memory , Mapping Functions
sequencing
S-5
Fast multiplication- Bit pair Microinstruction , Micro-program Architectures of Parallel Systems -
SLO-2 Addressing modes Replacement Algorithms
recoding of Multipliers Sequencing, Next address field Flynn’s classification
Introduction to Microprocessor
SLO-1 Carry Save Addition of summands Basic concepts of pipelining SISD,SIMD, MIMD, MISD Virtual Memory
, Assembly language
S-6 Hardware multithreading , Coarse
Writing of assembly language Performance considerations of
SLO-2 Problem Solving Pipeline Performance Grain parallelism, Fine Grain
programming various memories
parallelism
SLO-1 Lab-2:To understand how
different components of PC are Lab-14: Understanding Processing
S Lab 5: Addition of 16-bit number Lab-8: Study of Ripple Carry Adder
connected to work properly Lab-11: Study of Booth Algorithm unit Design of primitive processing
7-8 SLO-2 Subtraction of 16-bit number Design of Ripple Carry Adder
Assembling of System unit
Components
ARM Processor: The thumb Input Output Organization , Need
SLO-1 Integer division – Restoring Division Pipeline Hazards-Data hazards Uni-processor and Multiprocessors
instruction set for Input output devices
S-9
Processor and CPU cores ,
SLO-2 Non Restoring Division Methods to overcome Data hazards Multi-core processors Memory mapped IO
Instruction Encoding format
Instruction Hazards , Hazards on
Memory load and Store Floating point numbers and
SLO-1 conditional and Unconditional Memory in Multiprocessor Systems Program controlled IO
instruction in ARM operations
S-10 Branching
Control hazards , Influence of Cache Coherency and MESI protocol Interrupts-Hardware, Enabling and
SLO-2 Basics of IO operations. Solving Problems
hazards on instruction sets in Multiprocessor Systems Disabling Interrupts
SLO-1 Lab -3To understand how
S different components of PC are Lab-9: Study of Carry Look-ahead
Lab-6: Multiplication of 8-bit Lab-12: Program to carry out Booth Lab-15: Understanding Pipeline
11- connected to work properly Adder Design of Carry Look-ahead
SLO-2 number Factorial of a given number Algorithm concepts Design of basic pipeline.
12 Disassembling of System Adder
Components
 1. Carl Hamacher, ZvonkoVranesic, SafwatZaky, Computer Organization, 5th ed., McGraw-Hill,
2015 5. William Stallings, Computer Organization and Architecture – Designing for Performance,
Learning 2. Kai Hwang, Faye A. Briggs, Computer Architecture and Parallel Processing”, 3rd ed., 10th ed., Pearson Education, 2015
Resources McGraw Hill, 2016 6. David A. Patterson and John L. Hennessy Computer Organization and Design - A Hardware
3. Ghosh T. K., Computer Organization and Architecture, 3rd ed., Tata McGraw-Hill, 2011 software interface, 5th ed., Morgan Kaufmann,2014
4. P. Hayes, Computer Architecture and Organization, 3rd ed., McGraw Hill, 2015.

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. T. V. Sankar, HCL Technologies Ltd, Chennai, sankar_t@hcl.com 1. Prof. A.P. Shanthi, ANNA University Chennai, a.p.shanthi@cs.annauniv.edu 1.Dr. V. Ganapathy, SRMIST
2. Dr. C. Malathy, SRMIST
3. Mrs M.S.Abirami, SRMIST

Course Course Course L T P C

18CSE001J OPERATING SYSTEMS E Professional Elective
Code Name Category 2 0 2 3

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
1 1 1 1 1 1
CLR-1 : Introduce the key role of an Operating system 1 2 3 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5
CLR-2 : Insist the Process Management functions of an Operating system L E E E P D A M S E E I C P L P P P
CLR-3 : Emphasize the importance of Memory Management concepts of an Operating system e x x n r e n o o n t n o r i S S S
CLR-4 : Realize the significance of Device Management part of an Operating system v p p g o s a d c v h d m o f O O O
CLR-5 : Comprehend the need of File Management functions of an Operating system e e e i b i l e i i i i m j e - - –
CLR-6 : Explore the services offered by the Operating system practically l c c n l g y r e r c v u e L 1 2 3
o t t e e n s n t o s i n c o
f e e e m & i T y n d i t n
T d d r A D s o & m u c M g
h P A i n e , o C e a a g L
i r t n a v D l u n l t t e
n o t g l e e U l t & i . a
k f a K y l s s t & T o & r
i i i n s o i a u S e n F n
n c n o i p g g r u a i i
g i m w s m n e e s m n n
Course Learning Outcomes ( e e l e , t W a g
At the end of this course, learners will be able to: B n n e n R a o n
(CLO):
l c t d t e i r c
o y ( g s n k e
o ( % e e a
m % ) a b
) ) r i
c l
h i
t
y
8 7
CLO-1 : Identify the need of an Operating system 1 H H H H H M L M H M M H H H M
0 0
8 7
CLO-2 : Know the Process management functions of an Operating system 1 H H H H H M L M H M M H H H M
5 5
7 7 M L M M M M
CLO-3 : Understand the need of Memory Management functions of an Operating system 1 H H H H H H H H H
5 0
8 8 M L M M M M
CLO-4 : Find the significance of Device management role of an Operating system 2 H H H H H H H H H
5 0
8 7 M L M M M M
CLO-5 : Recognize the essentials of File Management part of an Operating system 2 H H H H H H H H H
5 5
8 7 M L M M M M
CLO-6 : Gain an insight of Importance of an Operating system through practical 3 H H H H H H H H H
0 0

Duration 12 12 12 12
12
(hour)
STORAGE MANAGEMENT : Mass
Operating System Objectives PROCESS SYNCHRONIZATION : MEMORY MANAGEMENT: Memory
SLO- VIRTUAL MEMORY– Background - storage structure – Overview of
and functions, role of Peterson’s solution, Management: Logical Vs Physical
1 Operating systems need of demand paging Mass storage structure – Magnetic
Synchronization Hardware address space, Swapping
S-1 Disks
The evolution of operating
SLO- Understanding the two-process
system, Major achievements, Contiguous Memory allocation – VIRTUAL MEMORY – Basic Disk Scheduling , scheduling with
solution and the benefits of the
2 from batch processing systems Fixed and Dynamic partition concepts – page fault handling respect to the disk
synchronization hardware ,
to modern complex systems
SLO- Semaphores, usage, Partition memory management FILE SYSTEM INTERFACE: File
OS Design considerations for Handling the page faults ,
S-2 implementation ,usage of the and issues: Internal fragmentation
1 Multiprocessor and Multicore Performance of Demand paging concept, File access methods
semaphores for the Mutual and external fragmentation
 exclusion mechanisms problems

Understanding the key design

SLO- issues of Multiprocessor Classical Problems of Strategies for selecting free holes Understanding the relationship of
synchronization – Readers writers in Dynamic partition , allocation effective access time and the page Understanding the file basics
2 Operating systems and
problem, Bounded Buffer problem strategies with examples fault rate
Multicore Operating systems
SLO-
1 LAB 1 : Understanding the LAB4 : System admin commands –
S3-4 LAB7: Shell Programs – Basic level LAB10 : Overlay concept LAB13:Process synchronization
SLO- booting process of Linux Basics
2
SLO- Classical Problems of File sharing and Protection , need
PROCESS CONCEPT– Processes, Paged memory management , PMT Copy-on write , need for Copy-on
synchronization – Dining for the file sharing and its
1 PCB hardware mechanism write
S-5 Philosophers problem (Monitor ) , protection
SLO- Threads – Overview and its handling among multiple Page replacement Mechanisms: FILE SYSTEM IMPLEMENTATION :
Structure of Page Map Table
2 Benefits processes FIFO, Optimal, File system structure
SLO- Process Scheduling : Scheduling
Example : Intel 32 bit and 64 –bit LRU and LRU approximation
Queues, Schedulers, Context CPU SCHEDULING : FCFS,SJF,Priority Directory Implementation
1 Architectures Techniques
switch
S-6 Round robin, Multilevel queue
SLO- Understanding basics of Understanding the Paging in the Counting based page replacement Understanding the various levels of
Scheduling, Multilevel feedback
2 Process scheduling Intel architectures and Page Buffering Algorithms directory structure
Scheduling
SLO-
1 LAB2 : Understanding the Linux LAB5: System admin commands –
S7-8 LAB 8:Process Creation LAB11: IPC using Pipes LAB14 : Study of OS161
SLO- file system Simple task automations
2
SLO- Operations on Process – Process ARM Architectures : FILE SYSTEM
Real Time scheduling: Rate Allocation of Frames - Global Vs
creation, Process termination - Monotonic Scheduling Understanding the Paging with Local Allocation IMPLEMENTATION :Allocation
1 system calls – fork(),wait(),exit() respect to ARM methods ,
S-9 Inter Process communication :
SLO- Understanding the root cause of pros and Cons of various disk
Shared Memory, Message Deadline Scheduling Segmented memory management
2 the Thrashing , Causes of Thrashing allocation methods
Passing ,Pipe()
SLO- PROCESS SYNCHRONIZATION:
DEADLOCKS: Necessary conditions, Free space Management , Swap
Background, Critical section Paged segmentation Technique Working set Model
1 Resource allocation graph, space Management
Problem
S-10 Understanding the race Deadlock prevention methods, Understanding the working set
SLO- Understanding the combined Understanding the Low-level task
conditions and the need for the Deadlock Avoidance, Detection and model for controlling the Working
2 scheme for efficient management of the OS
Process synchronization Recovery set Model
SLO-
S 1 LAB3: Understanding the LAB15 : Understanding the OS161
LAB12: IPC using shared memory
various Phases of Compilation LAB6 : Linux commands LAB9: Overlay concept filesystem and working with test
11-12 SLO- and Message queues
of a ‘C’ Program programs
2

1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating systems, 9th ed., John Wiley & Sons, 3. Andrew S.Tanenbaum, Herbert Bos, Modern Operating systems, 4th ed., Pearson,
Learning
2013 2015
Resources
2. William Stallings, Operating Systems-Internals and Design Principles, 7th ed., Prentice Hall, 2012 4. Bryant O’Hallaxn, Computer systems- A Programmer’s Perspective,Pearson, 2015

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
 Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1.Mr. Balamurugan, Infosys,
1. Dr.Latha Parthiban, Pondicherry University, lathaparthiban@yahoo.com 1. Dr.G.Maragatham, SRMIST 3. Ms. Aruna S, SRMIST
balams@gmail.com
2. Mr. Eliazer M, SRMIST
Course Course Course L T P C
18CSE002T SOFTWARE ENGINEERING AND PROJECT MANAGEMENT E Professional Elective
Code Name Category 2 1 0 3

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
CLR-1 1 1 1 1 1 1
Familiarize the software life cycle models and software development process 1 2 3 1 2 3 4 5 6 7 8 9
: 0 1 2 3 4 5
CLR-2 E
Understand the various techniques for requirements, planning and managing a technology project
: A n
CLR-3 L E n v
Examine basic methodologies for software design, development, testing, closure and implementation E
: e x E a i
x I P
CLR-4 v p n D l r
Understand manage users expectations and the software development team p n r
: e e g e y o L
e P M S d o
CLR-5 Acquire the latest industry knowledge, tools and comply to the latest global standards for project l c i s s n i
c r o o i C j
: management o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
n l U l e t F
g i o o , a r
Course Learning Outcomes m y s t a i i
At the end of this course, learners will be able to: ( e w p R i n
(CLO): e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO- 8 8
Identify the process of project life cycle model and process 1 H H L - - - L - H H M M - - -
1: 5 0
CLO- Analyze and specify software requirements through a productive working Relationship with project 8 7 H
2 H H H H H - M - H H M - - -
2: stakeholders 0 5 -
CLO- 8 8
Design the system based on Functional Oriented and Object Oriented Approach for Software Design. 3 H H M H H M M L H H M - - - -
3: 5 5
CLO- 8 8
Develop the correct and robust code for the software products 3 H H H - H - - M H M H - - - -
4: 5 5
CLO- 8 7
Perform by applying the test plan and various testing techniques 2 H M M M M M M - H H - M - - -
5: 5 5
 Duration
9 9 9 9 9
(hour)
SLO- Introduction to Software Software Design - Software Design
Engineering Software Construction Introduction to testing Product Release
S- 1 Fundamentals
1 SLO- Software Project Management - life
Design Standards - Design Type Coding Standards Verification Product Release
2 cycle activities
SLO- Design model – Architectural
Traditional – Waterfall, V Model Coding Framework Validation Product Release Management
S- 1 design, Software architecture
2 SLO- Reviews - Desk checks (Peer
Prototype, Spiral, RAD Software Design Methods Test Strategy Product Release Management
2 Reviews)
SLO-
Conventional – Agile, Top Down , Bottom Up Walkthroughs Planning Implementation
S- 1
3 SLO- Example: Test Strategy and
XP, Scrum Module Division (Refactoring) Code Reviews, Inspections Implementation
2 Planning
SLO- Introduction to Requirement
Module Coupling Coding Methods Test Project Monitoring and Control User Training
S- 1 Engineering
4 SLO-
Requirements Elicitation Component level design Structured Programming Test Project Monitoring and Control Maintenance Introduction
2
SLO- Software Project Effort and cost Object-Oriented
User Interface Design Test Project Monitoring and Control Maintenance Types - Corrective
S- 1 estimation Programming
5 SLO-
Cost estimation Pattern oriented design Automatic Code Generation Test Project Monitoring and Control Adaptive
2
SLO-
Cocomo 1 and 2 Web application design Automatic Code Generation Test Project Monitoring and Control Perfective
S- 1
6 SLO-
Cocomo 1 and 2 Web application design Automatic Code Generation Test Project Monitoring and Control Preventive
2
SLO-
Risk Management Design Reuse Software Code Reuse Design –Master test plan, types Maintenance Cost
S- 1
7 SLO-
Risk Management Design Reuse Software Code Reuse Design –Master test plan, types Maintenance Process
2
SLO- Concurrent Engineering in Software
Configuration management Pair Programming Test Case Management life cycle
S- 1 Design
8 SLO- Concurrent Engineering in Software
Configuration management Test-Driven Development Test Case Management Software Release
2 Design
SLO-
Project Planning – WBC, planning, Design Life-Cycle Management Configuration Management Test Case Reporting Software Maintenance
S- 1
9 SLO- Software Release, Software
scope, risk Design Life-Cycle Management Software Construction Artifacts Test Case Reporting
2 Maintenance

1. Roger S. Pressman, Software Engineering – A Practitioner Approach, 6th ed., McGraw

Hill, 2005 5. Ashfaque Ahmed, Software Project Management: a process-driven approach, Boca Raton,
Learning 2. Ian Sommerville, Software Engineering, 8th ed., Pearson Education, 2010 Fla: CRC Press, 2012
Resources 3. Rajib Mall, Fundamentals of Software Engineering, 4th ed., PHI Learning Private Limited, 6. Walker Royce, Software Project Management, Pearson Education, 1999
2014 7. Jim Smith Agile Project Management: Creating Innovative Products,Pearson 2008
4. Ramesh, Gopalaswamy, Managing Global Projects, Tata McGraw Hill, 2005

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
 Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40% - 30% - 30% - 30% - 30% -
Understand
Apply
Level 2 40% - 40% - 40% - 40% - 40% -
Analyze
Evaluate
Level 3 20% - 30% - 30% - 30% - 30% -
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mr. Girish Raghavan, Wipro Technologies 1. Dr. LathaParthiban, Pondicherry University, lathaparthiban@yahoo.com 1. Mrs. Sasi Rekha Sankar, SRMIST
2. Dr.Mariappan Vaithilingam, Amazon, Bangalore 2. V. Masilamani. IIITDM, masila@iiitdm.ac.in 2. Dr. T.S.Shiny Angel, SRMIST
3. Mr.N.Arivazhagan, SRMIST
4. Mrs K.R.Jansi, SRMIST

Course Course Course L T P C

18CSE003J PYTHON PROGRAMMING E Professional Elective
Code Name Category 2 0 2 3

Pre-
Co-requisite Progressiv
requisite Nil Nil Nil
Courses e Courses
Courses
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
Create an environment for programming in Python with basic structures and syntax 1 1 1 1 1 1
CLR-1 : 1 2 3 1 2 3 4 5 6 7 8 9
0 1 2 3 4 5
CLR-2 : To learn and apply the concepts of Lists, Modules and Packages in Python E
CLR-3 : To learn and apply the concepts of Tuples, Dictionaries, Sets and Files in Python A n
CLR-4 : To learn and use Exception handling and Object Oriented concepts in Python L E n v
E
CLR-5 : To learn and apply the advanced concepts like Iterator, Generator, Regular expressions in Python e x E a i
x I P
CLR-6 : To learn and apply the Graphical User Interface modules in Python v p n D l r
p n r
e e g e y o L
e P M S d o
l c i s s n i
c r o o i C j
o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
Course Learning Outcomes n c n l n t s a
At the end of this course, learners will be able to: n l U l e t F
(CLO): g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
Create Programs using basic structures and syntax in Python 8 8 H H H H H - - L M M L M - M -
CLO-1 : 3
5 0
Create Programs using the concepts of Lists, Modules and Packages in Python 8 8 H H H H H - - L M M L M - - -
CLO-2 : 3
5 0
Create Programs using the concepts of Tuples, Dictionaries, Sets and Files in Python 8 8 H H H H H - - L M M L M - - -
CLO-3 : 3
5 0
Create Programs using Exception handling and Object Oriented concepts in Python 8 8 H H H H H - - L M M L M - - -
CLO-4 : 3
5 0
Create Programs using the advanced concepts like Iterator, Generator, Regular expressions in Python 8 8 H H H H H - - L M M L M - - -
CLO-5 : 3
5 0
Create Programs using the Graphical User Interface modules in Python 8 8 H H H H H - - L M M L M - - -
CLO-6 : 3
5 0

Duration 12 12 12 12
12
(hour)
 Using the Python Interpreter Introduction to ListsAnd List
SLO-1 Introduction to Tuples Errors - Syntax Errors Iterator
Invoking the Interpreter, Operations
S-1
Argument Passing Interactive
SLO-2 list slices, list methods, list loop Tuple Operations Exceptions - Handling Exceptions Generator
Mode
Introduction to Python Using
Python as a Calculator , mutability, aliasing, cloning lists, tuple assignment , tuple as return Raising Exceptions User-defined
SLO-1 Closure
Numbers, Strings , Lists list parameters value Exceptions
Keywords and Identifiers
S-2
Statements & Comments
Variables , Datatypes, Type Defining Clean-up Actions -
SLO-2 Arbitrary Argument Lists Examples in Tuples Decorators
Conversion, I/O and import Predefined Clean-up Actions
Operators , Namespace
SLO-1 Lab-1 : Using the Python
Lab-10: Problems in Exception Lab-13: Problems using Iterator,
S 3-4 Interpreter- Simple problems in Lab-4: Problems in Lists Lab-7: Problems on Tuples
SLO-2 handling Generator
Input output
SLO-1 Flow Control - if...else Using Lists as Stacks Introduction to Dictionaries Classes Definition Context Managers
S-5 Names and Objects - Method
SLO-2 for Loop while Loop Using Lists as Queues Examples on Dictionaries Objects RegEx

break and continue pass

SLO-1 List Comprehensions Introduction to Set Class and Instance Variables String manipulation
S-6 Statements
SLO-2 The range() Function Nested List Comprehensions Examples on Set Python Scopes and Namespaces Unicode
SLO-1 Lab-2 : Simple problems in flow Lab-5: Problems sing List as Stacks Lab-8: Problems in Dictionaries and Lab-11: Problems using Classes Lab-14: Problems using Regular
S 7-8
SLO-2 control and Queue Set and Objects Expressions
Defining Functions Default Introduction to Files – types –
Making your own module,
SLO-1 Argument Values Keyword formatting- command line Inheritance Introduction to GUI
namespaces
Arguments arguments
S-9 Special parameters Positional-
Executing modules as scripts The Operations on Files – opening and
or-Keyword Arguments
SLO-2 Module Search PathStandard closing, reading and writing , file Multiple Inheritance Tkinter Module
Positional-Only Parameters
library modules position
Keyword-Only Arguments
Packages in python Importing * Creating records and manipulating
SLO-1 Recursion Operator Overloading Basic Widgets
From a Package them using files
S-10 Formatted String Literals The
Anonymous FunctionGlobal, Intra-package References
SLO-2 String format() Method Manual Examples using Overloading managing images - Plotting
Local and Nonlocal Packages in Multiple Directories
String Formatting
S- SLO-1 Lab-3: problems using functions Lab-6: Problems using Modules Lab-9: Problems on File and its Lab-12: Problems using Inheritance Lab-15: Problems using Tkinter
11-
SLO-2 and recursion concept and Packages operations and Overloading module
12

1. Reema Thareja, “Python Programming “ , Oxford University Press, 2017

5. Amit Saha, Doing Math with Python: Use Programming to Explore Algebra,
2. S.A. Kulkarni , “Problem Solving and Python Programming”, Yes Dee Publishing, 2017
Statistics, Calculus and More, Kindle Edition, 2015
Learning 3. Daniel Liang , “Introduction to Programming using Python” , Pearson India Education Services
6. Alan D Moore, Python GUI Programming with Tkinter: Develop responsive
Resources Pvt. Ltd., 2017.
and powerful GUI applications with Tkinter, Kindle Edition, 2018
4. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in Python: An
Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016
 Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Dr. S.S.Sridhar, SRMIST

Course 18CSE004 Course Course L T P C

FORMAL LANGUAGE AND AUTOMATA E Professional Elective
Code T Name Category 3 0 0 3

Pre-requisite Co-requisite Progressiv

Nil Nil Nil
Courses Courses e Courses

Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
CLR-1 1 1 1 1 1 1
Utilize the mathematics and engineering principles for the basics of Formal Language 1 2 3 1 2 3 4 5 6 7 8 9
: 0 1 2 3 4 5
CLR-2 L E E A E
Acquire knowledge of Automata and minimize with Regular language's E
: e x x n n I P
n D
v p p a v n r
CLR-3 g e L
Acquire knowledge of Context free Grammar and simplify using normal forms e e e
i
P
s
l M S i d o
i
: l c c r y o o r i C j
CLR-4 n i f
o t t o s d c o v o e
Gain knowledge to push down automata and apply it with CFL e g e
: f e e b i e i n i m c
e n L
CLR-5 T d d l s r e m d m t
Analyze the methods of turning machine r & E o
: h P A e , n t e u u M P P P
i D t n
i r t m D T y n a n g S S S
CLR-6 n o t
n
A
e
e o & t
h
l i t
g
O O O
Analyze and Design the methods of computational complexity g v i L
: k f a n s o C & & c . - - –
K e c e
i i i a i l u S T a & 1 2 3
n l s a
n c n l g U l u e t F
o o r
g i m y n s t s a i i
w p n
( e e s , a u t m o n
l m i
Course Learning Outcomes B n n i R g r a W n a
At the end of this course, learners will be able to: l c t
e
s
e
e e e i o n
n
(CLO): d n g
o y ( s n r c
g t
o ( % e a k e
e
m % ) a b
 ) ) r i
c l
h i
t
y
CLO- 8 7
Acquire the knowledge of mathematics and engineering principles for the basics of Formal Language 3 M H - H L - - - L L - H - - -
1: 0 0
CLO- 8 7
Acquire the ability to identify specification of a Regular language's with Automata 3 M H L M L - - - M L - H - - -
2: 5 5
CLO- 7 7
Acquire knowledge of Context free Grammar and simplify using normal forms 3 M H M H L - - - M L - H - - -
3: 5 0
CLO- 8 8
Understand the concepts of push down automata and CFL . 3 M H M H L - - - M L - H - - -
4: 5 0
CLO- 8 7
Apply the knowledge to turning machine and its methods 3 H H M H L - - - M L - H - - -
5: 5 5
CLO- 8 7
Design the computational and acceptor machines using FA, PDA and Turing machines 3 L H - H L - - - L L - H - - -
6: 0 0

Duration
9 9 9 9 9
(hour)
SLO- Grammars: Introduction: Types of Pushdown Automata: Definitions
Introduction to Automaton Turing Machines: Introduction Undecidability :Basic definitions
1 Grammar Moves
S-
Formal definition of Turing
1 SLO- Context Free Grammars and
Mathematical concepts Instantaneous descriptions machines, Instantaneous Decidable problems,
2 Languages
descriptions
SLO- Formal Languages: Strings, Examples of undecidable problems
Derivations Deterministic pushdown automata Turing Machine as Acceptors
S- 1 Languages, Properties and Problems
2 SLO- Finite Representation : Regular Problems related to turning
Ambiguity Problems related to DPDA Rice’s Theorem
2 Expressions machine as Acceptors
Undecidable problems about Turing
SLO- Problems related to regular Relationship between derivation Non - Deterministic pushdown
Machine- Post’s Correspondence
S- 1 expressions and derivation trees automata Problems related to turning
Problem
3 machine as Acceptors
SLO- Finite Automata :Deterministic Problems related to Context free Problems related to Post’s
Problems related to NDPDA
2 Finite Automata Grammar Correspondence Problem
SLO- Turing Machine as a Computing
Nondeterministic Finite Automata
S- 1 Simplification of CFG : Elimination Problems related to DPDA and Device Properties of Recursive and
4 SLO- of Useless Symbols NDPDA Problems related to turning Turing Recursively enumerable languages
Finite Automaton with €- moves
2 Machine as a Computing Device
Problems related to Deterministic
SLO- Simplification of CFG : Unit Pushdown automata to CFL Introduction to Computational
and Nondeterministic Finite
S- 1 productions Equivalence Problems related to turning Turing Complexity: Definitions
Automata
5 Machine as a Computing Device
SLO- Problems related to Finite Simplification of CFG : Null Problems related to Equivalence of
Time and Space complexity of TMs
2 Automaton with €- moves productions PDA to CFG
SLO- Problems related to Equivalence of
Equivalence of NFA and DFA Complexity classes: Class P, Class
S- 1 Problems related to Simplification PDA to CFG Techniques for Turing Machine
NP
6 SLO- of CFG Construction
Heuristics to Convert NFA to DFA
2
Considering the state as a tuple
SLO- Equivalence of NDFA’s with and CFL to Pushdown automata
S- Chomsky normal form Considering the tape symbol as a
1 without €-moves Equivalence Complexity classes: Introduction to
7 tuple
NP-Hardness
SLO- Problems related Equivalence of Problems related to CNF Problems related to Equivalence of Checking off symbols
 2 NDFA’s with and without €-moves CFG to PDA
SLO-
Minimization of DFA Modifications of Turing Machine
S- 1
Greiback Normal form Pumping lemma for CFL
8 SLO- Problems related to Minimization NP Completeness
Multi-tape Turing Machine
2 of DFA
Regular Languages : Equivalence of
SLO-
Finite Automata and Regular Non-Deterministic Turing Machine
S- 1 Problems based on pumping
Languages Problems related to GNF
9 Lemma Problem discussion
SLO- Equivalence of Finite Automata and
Semi-Infinite Tape Turing Machine
2 Regular Grammars

4..John.C.Martin, “Introduction to Languages and the Theory of Computation” McGraw-Hill

1.Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory, Languages Education, 01- May-2010.
Learning
and Computations”, Second Edition, Pearson Education, 2008. 5. Kamala Krithivasan, Rama.R,” Introduction to Formal Languages, Automata Theory and
Resources
2. Michael Sipser, “Introduction to the Theory of Computation” Cengage Learning, 2012. Computation”, Pearson Education India, 01-Sep-2009.
6. Peter Linz , “An introduction to formal languages and automata”, Jones & Bartlett Learning, 2001.

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40 % - 30 % - 30 % - 30 % - 30% -
Understand
Apply
Level 2 40 % - 40 % - 40 % - 40 % - 40% -
Analyze
Evaluate
Level 3 20 % - 30 % - 30 % - 30 % - 30% -
Create
Total 100 % 100 % 100 % 100 % 100 %
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Dr.R.AnnieUthra
Dr.Jeyasudha
 Cour L T P C
Course 18CSE005 Course se Professional
COMPUTER NETWORKS E
Code J Name Cate Elective 2 0 2 3
gory

Pre-
Co-requisite Progressive
requisite Nil Nil Nil
Courses Courses
Courses
Computer Science and
Course Offering Department Data Book / Codes/Standards Nil
Engineering

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
CLR-1 1 1 1 1 1 1
Understand the evolution of computer networks using the layered network architecture 1 2 3 1 2 3 4 5 6 7 8 9
: 0 1 2 3 4 5
CLR-2 E
Understand the addressing concepts and learn networks devices A n
:
L E n v
CLR-3 E
Design computer networks using subnetting and routing concepts e x
x
E a i
I P
: v p n D l r
CLR-4 p n r
e e g e y o L
Understand the error types , framing, flow control e P M S d o
: l c i s s n i
c r o o i C j
CLR-5 Understand the various Medium Access Control techniques and also the characteristics of physical layer o t n i i m f
t o d c v o e
: functionalities f e e g s e e
e b e i i m c
T d e n , n L
CLR-6 h P
d
r
l
& D
r e
t E
d m t
o
Understand basic network administration A e n t u u M P P P
: i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
n l U l e t F
g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
Course Learning Outcomes n i g r W n a
At the end of this course, learners will be able to: l c
t
e
s
e s
e e
a
o n
n
(CLO): o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO- 8 7
Acquire the basics of computer network and its architecture 3 L H - H L - - - L L - H - - -
1: 0 0
CLO- 8 7
Acquire the knowledge of various networks devices and addressing methods 3 M H L M L - - - M L - H - - -
2: 5 5
CLO- 7 7
Abilty to design the network routing methods 3 M H M H L - - - M L - H - - -
3: 5 0
CLO- 8 8
Acquire the various error codes and framing concepts 3 M H M H L - - - M L - H - - -
4: 5 0
CLO- 8 7
Ability to understand the physical layer functions and components 3 H H M H L - - - M L - H - - -
5: 5 5
CLO- 8 7
Ability to design a computer network using a switch and router 3 L H - H L - - - L L - H - - -
6: 0 0
 Duration
12 12 12 12 12
(hour)
Evolution of Computer
SLO-1 Addressing types Network layer functionalities Introduction- error types Physical layer overview
S- Networks
1 Physical, logical, port, specific
SLO-2 The Internet today Delivery vs Forwarding Detection vs Correction Functionalities
addresses
Data communications, Unicast routing protocols, domain
SLO-1 IPv4 addresses, Notations Error detection, Parity Analog and digital Data, signals
S- Components routing
2 Transmission Attenuation,
SLO-2 Physical structures Classful addressing, Categories Multicast routing protocols CRC, Checksum
Distortion, Noise
S SLO-1
Lab 13: Implementation of
3 Lab 1: Introduction to Packet Lab 4 :IP Addressing and Lab 7 : Implementation of Static Lab 10: Implementation of
Single-Area OSPF Link Costs
- SLO-2 racer subnetting (VLSM). Routing EIGRP Configuration
and Interface
4
Network models, Categories
SLO-1 Classless addressing, Prefix usage Distance vector routing Error correction Performance metrics
S- of network
5 Bandwidth, delay, throughput,
SLO-2 Protocols and standards Network Address Translation(NAT) Node instability issues RIPv1, RIPv2 Hamming code, Framing
jitter
S- SLO-1 Standards organizations Translation table, Link state routing Flow control, Error control Wireless 802.11
6 SLO-2 Layered tasks, Hierarchy IPv6 addresses, Types, Notation Dijkstra’s Algorithm ARQ types Transmission Media
S SLO-1 Lab 11: Lab 14 :Implementation of Multi-
Lab 2: Implementation of Lab 8: Implementation of Default
7- Lab 5: Configuring Interfaces Implementation of EIGRP Area OSPF with Stub Areas and
SLO-2 various Topology creation Routing
8 Bandwidth and Adjacencies Authentication
OSI model , Layered approach,
SLO-1 VLSM, Masking OSPF, EIGRP Random access IEEE 802.15 , Architecture
Peer-peer
S-9
Layers in the OSI model, Path vector routing, Stabilized
SLO-2 CIDR, Address aggregation ALOHA, IEEE 802.15.4, Architecture
Comparison of layers routing table creation for AS
S- SLO-1 TCP/IP protocol suite Networking devices BGP CSMA/CD, CSMA/CA IEEE 802.16
10 SLO-2 Comparison with OSI moldel Router, Switch, hub, Bridges BGP Sessions Controlled access, Channelization Architecture
SLO-1 Lab 3: Implement the
S Lab 6: Basic Router Lab 12:Implementation of
categories of Lab 15 : Redistribution Between
11- Configuration, Creating Lab 9: Implementation of RIPv1, v2 EIGRP Authentication and
SLO-2 network(LAN,MAN,W EIGRP and OSPF
12 Passwords Timers
AN)

Learning 1. Behrouz A.Forouzan,“Data Communications and Networking”5thedition,July1,2010,ISBN: 9780073376226.

Resources 2. Todd Lammle,“CCNA Study Guide”,Edition7,2011, ISBN:13:9780470901076. William Stallings,“Data and Computer Communications”,Edition9,2010.

Learning Assessment
Continuous Learning Assessment (50%
Bloom Final Examination (50%
weightage)
’s Level of weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember 2 2 1 1 1 1 1 1 1 1
Level 1 0 0 5 5 5 5 5 5 5 5
Understand
% % % % % % % % % %
Apply 2 2 2 2 2 2 2 2 2 2
Level 2 0 0 0 0 0 0 0 0 0 0
Analyze
% % % % % % % % % %
 Evaluate 1 1 1 1 1 1 1 1 1 1
Level 3 0 0 5 5 5 5 5 5 5 5
Create
% % % % % % % % % %
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr.Noor Mahammad, IIITDM, Kancheepuram,
1. . Dr. Sricharan, Wipro Technologies, Chennai 1. Mr. K. Venkatesh, SRMIST
noor@iiitdm.ac.in
2. 2. 2. Ms.D. Anitha, SRMIST
3. 3. Ms. Ferni Ukrit, SRMIST
 Cour L T P C
Course 18CSE00 Course se
DATABASE MANAGEMENT SYSTEMS E Professional Elective
Code 6J Name Categ 2 0 2 3
ory

Co-
Pre- requis Progressiv
requisite Nil ite Nil e Nil
Courses Cours Courses
es
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Learning Program Learning Outcomes (PLO)

1
Course Learning Rationale (CLR): The purpose of learning this course is to: 1 1 1 1 1
1 2 3 1 2 3 4 5 6 7 8 9 0
1 2 3 4 5
CLR-1 0
Understand the fundamentals of Database Management Systems, Architecture and Languages
: E
CLR-2 A n
Conceive the database design process through ER Model and Relational Model L E n v
: E
e x E a i
CLR-3 Design Logical Database Schema and mapping it to implementation level schema through Database x I P
v p n D l r
: Language Features p n r
e e g e y o L
e P M S d o
CLR-4 l c i s s n i
Familiarize queries using Structure Query Language (SQL) and PL/SQL o t
c
n
r
i i
o o
m
i C j
f
: t o d c v o e
CLR-5 f e e g s e e
e b e i i m c
Familiarize the Improvement of the database design using normalization criteria and optimize queries T d e n , n L
: d l r e d m t
h P r & D t E o
CLR-6 Understand the practical problems of concurrency control and gain knowledge about failures and A e n t u u M P P P
i r i D e & t n
: recovery t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
n l U l e t F
g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
Course Learning Outcomes (CLO): At the end of this course, learners will be able to: l c
t
e
s
e s
e e
a
o n
n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO- 8 7
Acquire the knowledge on DBMS Architecture and Languages 3 H M L L - - - - L L L H - - -
1: 0 0
CLO- Apply the fundamentals of data models to model an application’s data requirements using conceptual 8 7
3 H H H H H - - - H H H H - - -
2: modeling tools like ER diagrams 5 5
CLO- Apply the method to convert the ER model to a database schemas based on the conceptual relational 7 7
3 H H H H H - - - H H H H - - -
3: model 5 0
CLO- 8 8
Apply the knowledge to create, store and retrieve data using Structure Query Language (SQL) and PL/SQL 3 H H H H H - - - H H H H - - -
4: 5 0
CLO- Apply the knowledge to improve database design using various normalization criteria and optimize 8 7
3 H H L M L - - - M M M L - - -
5: queries 5 5
CLO- Appreciate the fundamental concepts of transaction processing- concurrency control techniques and 8 7
3 H L L L L - - - H L L L
6: recovery procedures. 5 5

Duration
12 12 12 12 12
(hour)
Relational Algebra –
SL What is Database Basics of SQL-DDL,DML,DCL,TCL , Fundamental Operators and Transaction concepts,
Database Design
O-1 Management System Structure Creation, alternation syntax, relational algebra properties of transactions,
S-1 queries
Defining Constraints-Primary Key,
SL Advantage of DBMS over File
Design process Foreign Key, Unique, not null, Tuple relational calculus Serial izability of transactions,
O-2 Processing System
check, IN operator
SL Introduction and applications Pitfalls in Relational database, testing for serial inability, System
Entity Relation Model Functions-aggregation functions
O-1 of DBMS Decomposing bad schema recovery,
S-2 Built-in Functions-numeric, date, Functional Dependency –
SL Purpose of database system,
ER diagram string functions, string functions, definition, trivial and non-trivial Concurrency Control
O-2 Views of data
Set operations, FD
Lab 1: SQL Data Definition L Lab 7 : Join Queries on sample
SL Language Commands on a Inbuilt functions in SQL on exercise. Lab10: PL/SQL Procedures on Lab 13: PL/SQL Exception Handling*
S O-1 sample exercise* The b sample * Frame and execute the sample exercise.* Frame and Frame and execute the appropriate
3-4 abstract of the project to 4 appropriate execute the appropriate Join PL/SQL Procedures and Functions
SL construct database must DDL,DML,DCL,TCL for the Queries for the project for the project
Exercise.
O-2 be framed project
SL closure of FD set , closure of
O-1 Keys , Attributes and Constraints , Sub Queries, correlated sub attributes Two- Phase Commit protocol,
S-5 Database system Architecture
SL Mapping Cardinality queries ,Nested Queries Recovery and Atomicity
irreducible set of FD
O-2
SL Views and its Types, Transaction
Data Independence Extended ER - Generalization Normalization – 1Nf, 2NF, 3NF, Log-based recovery
O-1 Control Commands
S-6
SL Decomposition using FD- concurrent executions of
The evolution of Data Models Specialization and Aggregation Commit, Rollback, Save point
O-2 dependency transactions
SL Lab 2: SQL Data Manipulation Lab 8: Set Operators & Views.* Lab 14: PL/SQL Trigger* Frame and
Lab 5: Construct a ER Model for Lab 11: PL/SQL Functions* Frame
S O-1 Language Commands * Frame and execute the execute the appropriate PL/SQL
theapplication to be constructed to and execute the appropriate Set
7-8 SL Identification of project appropriate In- Built functions for Cursors and Exceptional Handling
a Database Operators & Views for the project
O-2 Modules and functionality the project for the project
SL
Degrees of Data Abstraction ER Diagram Issues PL/SQL Concepts- Cursors
O-1 Locking mechanism, solution to
S-9 BCNF, examples
SL concurrency related problems
Database Users and DBA Weak Entity Stored Procedure
O-2
SL Functions Triggers and
Relational Model Multi- valued dependency, 4NF Deadlock
O-1 Exceptional Handling
S-10 Database Languages
SL two-phase locking protocol,
Conversion of ER to Relational Table Query Processing Join dependency and 5NF
O-2 Isolation, Intent locking
SL Lab 3: SQL Data Control
O-1 Language Commands Lab 15 : * Frame and execute
Lab9: PL/SQL Conditional and Lab 12: PL/SQL Cursors* Frame
and Transaction control Lab 6: Nested Queries on sample the appropriate PL/SQL
S 11- Iterative Statements* Frame and execute the appropriate
commands to the exercise* Construction of Relational Cursors and Exceptional
12 SL and execute the appropriate PL/SQL Conditional and Iterative
sample exercises* Table from the ER Diagram Handling for the project*
O-2 Nested Queries for the project Statements for the project
Identify the issues that Demo of the project
can arise in a business
 perspective for the
application

1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, Database System Concepts‖,

Sixth Edition, Tata McGraw Hill,2011.
Learn 2. Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems‖, 4. Martin Gruber, Understanding SQL, Sybex,1990
ing Sixth Edition, Pearson Education,2011. 5. Sharad Maheshwari,Introduction to SQLandPL/SQL,2ded.,LaxmiPublications,2016.
Reso 3. CJ Date,A Kannan,S Swamynathan, An Introduction to Database Systems, Eight 6. RaghuramaKrishnan,Johannes Gehrke,Database Management
urces Edition, Pearson Education,2006. Systems,3rdEdition,McGrawHill Education,2003.
4. Rajesh Narang, Database Management Systems, 2nd ed., PHI Learning Private
Limited,2011.

Learning Assessment
Continuous Learning Assessment
Bloom Final Examination (50%
(50%weightage)
’s Level of weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember 2 2 1 1 1 1 1 1 1 1
Level 1 0 0 5 5 5 5 5 5 5 5
Understand
% % % % % % % % % %
Apply 2 2 2 2 2 2 2 2 2 2
Level 2 0 0 0 0 0 0 0 0 0 0
Analyze
% % % % % % % % % %
Evaluate 1 1 1 1 1 1 1 1 1 1
Level 3 0 0 5 5 5 5 5 5 5 5
Create
% % % % % % % % % %
100
Total 100 % 100 % 100 % -
%
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr.Mariappan Vaithilingam, Engineering Leader Amazon, dr.v.m@ieee.org 1. Ms. Sasi Rekha Sankar SRMIST
2. Mr.Elizer, SRMIST
2. Mr. Badinath, SDET, Amzon, sbadhrinath@gmail.com
3. Mrs. Hemavathy, SRMIST
 Co L T P C
Co
ur Cours
ur
se e
se 18CSE007J COMPILER DESIGN E Professional Elective
Na Catego 2 0 2 3
Co
m ry
de
e

Co-
Pre- Progressiv
requisit
requisite Nil Nil e
e
Courses Courses
Courses
Data Book /
Course Offering Department Computer Science and Engineering Nil
Codes/Standards

Course Learning Rationale Program Learning Outcomes (PLO)

The purpose of learning this course is to: Learning
(CLR):
CLR- 1 1 1 1 1 1
Utilize the mathematics and engineering principles for the Design of Compilers 1 2 3 1 2 3 4 5 6 7 8 9
1: 0 1 2 3 4 5
CLR-2 E
Acquire knowledge of Lexical Analyzer from a specification of a language's lexical rules A n
:
L E n v
CLR-3 E
Acquire knowledge of Syntax Analyzer for parsing the sentences in a compiler grammar e x
x
E a i
I P
: v p n D l r
CLR-4 p n r
e e g e y o L
Gain knowledge to translate a system into various intermediate codes e P M S d o
: l c i s s n i
c r o o i C j
CLR-5 o t n i i m f
Analyze the methods of implementing a Code Generator for compilers t o d c v o e
: f e e g s e e
e b e i i m c
T d e n , n L
CLR-6 h P
d
r
l
& D
r e
t E
d m t
o
Analyze and Design the methods of developing a Code Optimizer A e n t u u M P P P
: i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
n l U l e t F
g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
Course Learning Outcomes n i g r W n a
At the end of this course, learners will be able to: l c
t
e
s
e s
e e
a
o n
n
(CLO): o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLR- 7
Utilize the mathematics and engineering principles for the Design of Compilers 3 80 H H H H M L L L M M L H H H H
1: 0
CLR-2 7
Acquire knowledge of Lexical Analyzer from a specification of a language's lexical rules 3 85 H H H H M L L L M M L H H H H
: 5
CLR-3 7
Acquire knowledge of Syntax Analyzer for parsing the sentences in a compiler grammar 3 75 H H H H M L L L M M L H H H H
: 0
CLR-4 8
Gain knowledge to translate a system into various intermediate codes 3 85 H H H H M L L L M M L H H H H
: 0
CLR-5 7
Analyze the methods of implementing a Code Generator for compilers 3 85 H H H H M L L L M M L H H H H
: 5
CLR-6 7
Analyze and Design the methods of developing a Code Optimizer 3 80 H H H H M L L L M M L H H H H
: 0

Duration (hour) 12 12 12 12 12
Compilers – Analysis of Syntax Analysis Definition - Role of Code optimization -Principal
SLO-1 Bottom Up Parsing , Reductions Intermediate Code Generation
the source program parser Sources of Optimization
S-1 Intermediate Languages - prefix -
Phases of a compiler – Function Preserving
SLO-2 Lexical versus Syntactic Analysis Handle Pruning postfix -Quadruple - triple -
Cousins of the Compiler Transformation
indirect triples Representation
Grouping of Phases – Syntax tree- Evaluation of
Shift Reduce Parsing, problems and
SLO-1 Compiler construction Representative Grammars, expression - three-address Loop Optimization
conflicts
tools code
S-2
Lexical Analysis – Role of Synthesized attributes –
Elimination of Ambiguity, Left Optimization of basic Blocks-
SLO-2 Lexical Analyzer, Input Inherited attributes,
Recursion ,Left Factoring Building Expression of DAG
Buffering Declarations
S SLO-1 Lab 4Elimation of Ambiguity,
Lab 1 - Implementation of Lab 10-Intermediate code
3- Left Recursion and Left Lab 7 - Shift Reduce Parsing Lab 13 Implementation of DAG
SLO-2 Lexical Analyzer generation – Postfix, Prefix
4 Factoring
Finite automation -
Assignment Statements , Case Peephole Optimization , Basic
SLO-1 deterministic ,non Top down parsing LR Parsers- Why LR Parsers
Statements Blocks,
deterministic
S-5
Items and LR(0) Automaton,
Recursive Descent Parsing, back Boolean Expressions, Back Flow Graphs , Next -Use
SLO-2 Transition Tables Closure of Item Sets, LR Parsing
tracking patching – Procedure calls Information
Algorithm
Acceptance of Input Strings
by Automata - State Code Generation- Issues in the Introduction to Global Data Flow
SLO-1 Computation of FIRST, FOLLOW Operator Precedence Parser
Diagrams and Regular design of code generator Analysis
S-6 Expressions
Conversion of regular The target machine – Runtime
Problems related to FIRST, Computation of LEADING Computation of gen and kill, in
SLO-2 expression to NFA – Storage
FOLLOW ,TRAILING and out
Thompson’s management
S SLO-1 Lab 11 Intermediate code
Lab 2 conversion from Lab 5 -FIRST AND FOLLOW Lab 8- Computation of LEADING Lab 14 : Implementation of
7- generation – Quadruple, Triple,
SLO-2 Regular Expression to NFA computation AND TRAILING Global Data Flow Analysis
8 Indirect triple
Conversion of NFA to DFA - Construction of a predictive A simple Code generator - Code Parameter Passing - Runtime
SLO-1 SLR Grammars- SLR Parsing Tables
Simulation parsing table Generation Algorithm Environments
S-9
Converting Regular
SLO-2 Predictive Parsers LL(1) Grammars Problems related to SLR Register and Address Descriptors Source Language issues
expression directly to DFA
Construction of Canonical LR(1) Generating Code of Assignment Storage Organization - Activation
SLO-1 Minimization of DFA Predictive Parsing Algorithm
and LALR Statements Records
S-
Error Recovery in Predictive
10 Design of lexical analysis Problems related to Canonical Cross Compiler – T diagrams -
SLO-2 Parsing- Non Recursive Predictive Storage Allocation strategies
(LEX) LR(1) and LALR Parsing Table Issues in Cross compilers
Parser
S SLO-1 Lab 15: Implement any one
Lab 3 Conversion from
11- Lab 6 Predictive Parsing Table Lab9 Computation of LR(0) items Lab 12 : A simple code Generator storage allocation
SLO-2 NFA to DFA
12 strategies(heap, stack, static)

Learnin 1. AlfredVAho,JefferyDUllman,RaviSethi,"Compilers,Principlestechniquesandtools",Pears 4. K.Muneeswaran,,”CompilerDesign”,OxfordHigherEducation,Fourthedition2015

 g on Education2011 5. DavidGalles,“ModernCompilerDesign”,PearsonEducation,Reprint2012.
Resour 2. S.GodfreyWinster,S.ArunaDevi,R.Sujatha,”CompilerDesign”,YesdeePublishingPvt.Ltd,2 6. RaghavanV.,“PrinciplesofCompilerDesign”,TataMcGrawHillEducationPvt.Ltd.,2010
ces 016
3. WilliamM.WaiteandGerhardGoos.CompilerConstruction.Springer-Verlag,New
York,2013.

Learning Assessment
Continuous Learning Assessment
Bloom Final Examination (50%
(50%weightage)
’s Level of weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember 2 2 1 1 1 1 1 1 1 1
Level 1 0 0 5 5 5 5 5 5 5 5
Understand
% % % % % % % % % %
Apply 2 2 2 2 2 2 2 2 2 2
Level 2 0 0 0 0 0 0 0 0 0 0
Analyze
% % % % % % % % % %
Evaluate 1 1 1 1 1 1 1 1 1 1
Level 3 0 0 5 5 5 5 5 5 5 5
Create
% % % % % % % % % %
100
Total 100 % 100 % 100 % -
%
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Ms.R.Jeya
2. Mrs.J. Jeyasudha
 Cour L T P C
Cours
18CSE0 Course se Professional
e ARTIFICIAL INTELLIGENCE C
08J Name Cate Core 2 0 2 3
Code
gory

Progress
Pre-
Co-requisite ive
requisite Nil Nil Nil
Courses Cours
Courses
es
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale Program Learning Outcomes (PLO)

The purpose of learning this course is to: Learning
(CLR):
CLR- Provide a broad understanding of the basic techniques for building intelligent computer 1 1 1 1 1 1
1 2 3 1 2 3 4 5 6 7 8 9
1: systems and an understanding of how AI is applied to problems. 0 1 2 3 4 5
CLR- E
Gain knowledge in problem formulation and building intelligent agents A n
2:
L E n v
CLR- E
Understand the search technique procedures applied to real world problems e x
x
E a i
I P
3: v p n D l r
CLR- p n r
e e g e y o L
Understand the types of logic and knowledge representation schemes e P M S d o
4: l c i s s n i
c r o o i C j
CLR- o t n i i m f
Acquire knowledge in planning and learning algorithms t o d c v o e
5: f e e g s e e
e b e i i m c
T d e n , n L
CLR- h P
d
r
l
& D
r e
t E
d m t
o
Gain knowledge in AI Applications and advances in Artificial Intelligence A e n t u u M P P P
6: i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
n l U l e t F
g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
Course Learning Outcomes n i g r W n a
At the end of this course, learners will be able to: l c
t
e
s
e s
e e
a
o n
n
(CLO): o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO- 8 7
Formulate a problem and build intelligent agents 1 M M M M H - - - M L - H L L L
1: 0 0
CLO- 8 7 M
Apply appropriate searching techniques to solve a real world problem 2 M H H H H - - - M L - H ML
2: 5 5 -
CLO- 7 7
Analyze the problem and infer new knowledge using suitable knowledge representation schemes 2 M H H M H - - - M L - H ML M
3: 5 0
CLO- 8 8
Develop planning and apply learning algorithms on real world problems 2 M H M H H - - - M L - H MM M
4: 5 0
CLO- 8 7
Design an expert system and implement natural language processing techniques 3 M H H H H - - - M L - H H M H
5: 5 5
CLO- 8 7
Implement advance techniques in Artificial Intelligence 3 L H M M H - - - H L - H H M H
6: 0 0
 Duration
12 12 12 12 12
(hour)

Knowledge and reasoning-

SL Searching techniques- Uniformed Planning- Planning problems, Expert system-Architecture , Pros
Introduction to AI-AI techniques Approaches and issues of
S O- search- General search Algorithm Simple planning agent and Cons of expert system
knowledge reasoning
- 1
1 SL Problem solving with AI ; Problem Knowledge base agents-Logic
Uniformed search Methods-
O- solving process, Formulating Basics Logic-Propositional logic- Planning languages , Blocks world Rule based systems,
Breadth first search
2 problems syntax ,semantics and inferences
SL Uniformed search Methods- Reasoning patterns, Predicate
AI Models, Data acquisition and Goal stack planning , Mean Ends
O- Depth first search , Depth logic – Syntax and semantics, Frame based expert system
S learning aspects in AI Analysis
1 limited search instance and is relationship
-
SL Uniformed search Methods-
2 Problem types and characteristics Non-linear Planning ,Conditional
O- Iterative Deepening search , Bi- Unification and Resolution Case study
,Problem space and search planning, Reactive planning
2 directional search
SL
S O-
Lab4: Implementation and Lab 7: Implementation of
3 1 Lab 1: Implementation of toy Lab 10 :Implementation of Natural language processing-
Analysis of DFS and BFS for an unification and resolution for
- SL problems block world problem Levels of NLP
application real world problems.
4 O-
2
SL
Informed search- Generate and Knowledge representation using Learning- Machine learning- Goals
O- Intelligent agent , Types of agents Syntactic and Semantic Analysis
S test, Best First search rules and semantic nets and Challenges
1
-
SL Rationality and Rational
5 Knowledge representation using Information retrieval ,Information
O- agent with performance Informed search-A* Algorithm Learning concepts, models
frames Extraction
2 measures
S SL Inferences, Uncertain Knowledge Artificial neural network based
- O- Flexibility and Intelligent agents, AO* Algorithm and reasoning- learning- Machine translation
6 1 Methods Back propagation
 SL Local search Algorithms-Hill
Task environment and its Bayesian probability and belief Support vector machines ,
O- Climbing, NLP Applications
properties network Reinforcement learning
2 Simulated Annealing
SL
S O- Lab 8: Implementation of
Lab 5: Developing Best first search
7 1 Lab 2: Developing agent programs knowledge Lab 11: Implementation of learning Lab 14:Implementation of NLP
and A* Algorithm for real world
- SL for real world problems representation schemes - use algorithms for an application programs
problems
8 O- cases
2
Adversarial search
SL Advance topics in Artificial
Constraint satisfaction Methods-Game playing-
O- Probabilistic reasoning Adaptive learning Intelligence- Cloud Computing
S problems(CSP) Important concepts
1 and intelligent agent
- ,knowledge structure
9 SL CSP as a search problem- Game as a search problem-Mini
Forward and backward Multi agent based learning, Business intelligence and
O- constrains and representation, max approach - Mini max
reasoning Ensemble learning analytics
2 Backtracking, Role of heuristic Algorithm
SL
CSP-Forward checking and Other uncertain techniques-Data Sentiment Analysis , Planning
S O- Alpha beta pruning Learning for decision making
constraint propagation mining and logic in intelligent agents
- 1
1 SL
CSP-Intelligent backtracking Fuzzy logic ,Dempster -shafer Distributed learning, Speedup
0 O- Game theory problems Deep learning Algorithms
,Crypto arithmetic puzzles theory learning
2
S SL
1 O-
Lab 3: Implementation of Lab 9: Implementation of Lab12: Development of ensemble
1 1 Lab 6: Implementation of mini max Lab 15: Applying deep learning
constraint uncertain model
- SL algorithm for an application methods to solve an application.
satisfaction problems methods for an application for an application
1 O-
2 2

1. Parag Kulkarni, Prachi Joshi, Artificial Intelligence –Building

Intelliegent Systems, 1st ed., PHI learning,2015
2. DeepakKemhani,FirstcourseinArtificilaIntelligence,McGrawHillPvtLtd,201 4. PrateekJoshi,ArtificialIntelligencewithPhython,1sted.,PacktPublishing,2017
Learning Resources
3 5. DenisRothman,ArtificialIntelligencebyExample,Packt,2018
3. Stuart J. Russell, Peter Norwig , Artificial Intelligence –A Modern
approach, 3rd Pearson Education, 2016

Learning Assessment
Continuous Learning Assessment (50%
Final Examination (50%
weightage)
Bloom’s Level weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
of Thinking
Theor Practic Practic
Theory Practice Theory Practice Practice Theory Theory
y e e
Remember 2 1 1 1 1 1 1 1
15
Level 1 20% 0 0 0 5 5 5 5 5
Understand %
% % % % % % % %
Apply 2 2 2 2 2 2 2 2
20
Level 2 20% 0 0 0 0 0 0 0 0
Analyze %
% % % % % % % %
Evaluate 1 2 2 1 1 1 1 1
15
Level 3 10% 0 0 0 5 5 5 5 5
Create %
% % % % % % % %
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mr.Jagatheeswaran, Lead, Auxo labs jagatheeswarans.iot@auxolabs.in 1. Dr. Chitrakala, Anna University, au.chitras@gmail.com 1. Dr.M.Pushpalatha, SRMIST
2. 2. 2. Dr.G..Vadivu, SRMIST
 3. 3. Dr.C.Lakshmi, SRMIST

Course Course Course L T P C

18CSE009T NETWORK SECURITY E Professional Elective
Code Name Category 3 0 0 3

Pre-requisite Co-requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department CSE Data Book / Codes/Standards Nil

Course Learning
The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
Rationale (CLR):
CLR-1 : Understand the basic concepts of networking devices 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Understand the concept of IP security E
CLR-3 : Understand the various methods and protocols to maintain E-mail security A n
CLR-4 : Understand the various methods and protocols to maintain web security L E n v
E
CLR-5 : Understand security measures for wireless and cell phone communications e x E a i
x I P
v p n D l r
p n r
e e g e y o L
e P M S d o
l c i s s n i
c r o o i C j
o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
Course Learning i a l u T a & 1 2 3
At the end of this course, learners will be able to: n c n l n t s a
Outcomes (CLO): n l U l e t F
g i o o , a r
m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO-1 : Acquire the knowledge of network devices used in data communication 2 80 85 H H
CLO-2 : Acquire the knowledge of IP security and ability to identify the IP security attack 2 75 80 H
 CLO-3 : Acquire the knowledge of Email security and ability to detect the attacks in e-mail 2 85 80 H
CLO-4 : Acquire the knowledge of web security attack and prevention mechanism 2 80 75 H H
CLO-5 : Acquire the knowledge of wireless network security and prevention mechanism 2 75 85 H H

Duration (hour) 9 9 9 9 9
Overview of IPSEC- Security
Wireless Security:IEEE 802.11 Wireless
SLO-1 Networking Devices(Layer1,2) Associations, Security Association Security Services for E-mail SSL/TLS Basic Protocol
LAN
S-1 Database
Wireless Security:IEEE 802.11 Wireless
SLO-2 Networking Devices(Layer 3) Security Policy databases , AH and ESP Security Services for E-mail SSL/TLS Basic Protocol
LAN
Different types of network layer
SLO-1 Tunnel and Transport mode Establishing keys computing the keys Authentication
attacks
S-2
Different types of network layer
SLO-2 IP header Protection Establishing Public and secret keys computing the keys Authentication and confidentiality
attacks
SLO-1 Firewall- ACL IP and IPv6 Privacy client authentication Cellphone Security
S-3 End-to end Privacy, Privacy with
SLO-2 Packet Filtering IPV4 and IPV6 header client authentication GSM (2G) Security
distribution List Exploders
SLO-1 DMZ, Alerts Authentication Header Authentication of the source PKI as deployed by SSL Security in UMTS (3G)
S-4 Mutable, Immutable and Mutable but Based on public key technology and Security in UMTS (3G)
SLO-2 Audit Trials PKI as deployed by SSL
predictable secret keys and with distribution list
SLO-1 IDS Encapsulation Security Payload(ESP) Message Integrity SSLAttacks fixed in v3 Wireless LAN Vulnerabilities
S-5 Advantages and Disadvantages of
SLO-2 Internet Key Exchange Non-repudiation SSLAttacks fixed in v3 Phishing
IDS(Need of IPS)
SLO-1 Advantages of IPS ove IDS Phases of IKE Introduction and Overviw of PGP Exportability Buffer Overflow
S-6
SLO-2 IPS Phase I IKE- Modes and key types Efficient Encoding Exportability Buffer Overflow

SLO-1 IPS Types- Signature based Phase I IKE Protocols Certificate and key revocation Encoding Format String Attacks
S-7
SLO-2 Anomaly based, Policy based Phase I IKE Protocols Singature types, Private key, Fing types Encrypted Record Cross-site Scripting (XSS)
SLO-1 IPS Types - Honeypot based Phase II IKE Anomalies Handshake messages SQL Injection
S-8
SLO-2 Applications Phase II IKE Object Format Changecipherspec and Alerts SQL Injection
Case Studies: Secure Inter-branch
SLO-1 Malicious Software ISAKMP/IKE Encoding S/MIME SET
S-9 Payment Transactions
SLO-2 Malicious Software ISAKMP/IKE Encoding S/MIME SET Virtual Elections

1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security, Prentice Hall of India, 3. William Stallings, Cryptography and Network Security - Principles and Practice, 7th edition, Pearson
Learning
2002. Publication, 2017
Resources
2. Bernard Menezes - Network Security and Cryptography- Cengage Learning. 2010. 4. Cryptography and network security , AtulkahateTata McGraw-Hill Education,2003

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage)
Final Examination (50% weightage)
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40 % - 30 % - 30 % - 30 % - 30% -
Understand
Apply
Level 2 40 % - 40 % - 40 % - 40 % - 40% -
Analyze
Evaluate
Level 3 20 % - 30 % - 30 % - 30 % - 30% -
Create
Total 100 % 100 % 100 % 100 % 100 %
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
 Dr. A. Jeyasekar, Associate Professor
Dr. P. Yogesh, Associate Professor, Dept of Information Science and
Mr. M. Sudhakar, M.Tech, (Ph.D)-IIT, IT Infrastructure Service, Tata Consultancy Services. Dr. J. Femilda, Associate Professor
Technology, College of Engineering, Guindy,
Mrs. G. Sujatha, Assistant Professor
 Course Course Course L T P C
18CSE010T DATA MINING AND ANALYTICS E Professional Elective
Code Name Category 3 0 0 3

Pre-requisite Co-requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department CSE Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
(CLR):
CLR-1 : Understand the concepts of Data Mining 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Familiarize with Association rule mining E
CLR-3 : Familiarize with various Classification algortihms A n
L E n v
CLR-4 : Understand the concepts of Cluster Analysis e x
E
E a i
CLR-5 : Familiarize with Outlier analysis techniques x I P
v p n D l r
p n r
CLR-6 : Familiarize with applications of Data mining in different domains e e g e y o L
e P M S d o
l c i s s n i
c r o o i C j
o t n i i m f
t o d c v o e
f e e g s e e
e b e i i m c
T d e n , n L
d l r e d m t
h P r & D t E o
A e n t u u M P P P
i r i D e & t n
t m T y a n g S S S
n o n e s S h g
t A o & l i t O O O
k f g v i u i L
a n o C & c . - - –
i i K e g s c e
i a l u T a & 1 2 3
n c n l n t s a
Course Learning n l U l e t F
At the end of this course, learners will be able to: g i o o , a r
Outcomes (CLO): m y s t a i i
( e w p R i n
e s a u m o n
B n l m e n i
n i g r W n a
l c e e s a n
t s e e o n
o y d n e b g
( r c
o ( g t a i
% k e
m % e r l
)
) ) c i
h t
y
CLO-1 : Gain knowledge about the concepts of Data Mining 2 80 85 H H
CLO-2 : Understand and Apply Association rule mining techniques 2 75 80 H H H
CLO-3 : Understand and Apply various Classification algorithms 2 85 80 H H H
CLO-4 : Gain knowledge on the concepts of Cluster Analysis 2 80 75 H H H
CLO-5 : Gain knowledge on Outlier analysis techniques 2 75 85 H H H
CLO-6 : Understand the importance of applying Data mining concepts in different domains 2 80 85 H H H H

Duration
9 9 9 9 9
(hour)
Why Data mining? What is Data Mining frequent patterns: Basic
SLO-1 Classification: Basic concepts Cluster Analysis: Introduction Outliers: Introduction
mining ? concepts
S-1
Requirements and overview of different
SLO-2 Kinds of data meant for mining Market Basket Analysis General approach to Classification Challenges of outlier detection
categories
SLO-1 Kinds of patterns that can be mined Frequent itemsets, Closed itemsets Decision tree induction Partitioning method: Introduction Outlier detection methods: Introduction
S-2 Applications suitable for data Supervized and Semi-supervized
SLO-2 Association rules-Introduction Algorithm for Decision tree induction k-means
mining methods
Numerical example for Decision tree
SLO-1 Issues in Data mining Apriori algorithm-theoritical approach k-medoids Unsupervized methods
S-3 induction
SLO-2 Data objects and Attribute types Apply Apriori algorithm on dataset-1 Attribute selection measure Hierarchical method: Introduction
SLO-1 Statistical descriptions of data Apply Apriori algorithm on dataset-2 Tree pruning Agglomerative vs. Divisive method Statistical and Proximity based methods
S-4 Generating Association rules from Distance measures in algorithmic
SLO-2 Scalability and Decision tree induction
frequent itemsets methods
Need for data preprocessing and
S-5 SLO-1 Improving efficiency of Apriori Bayes’ Theorem BIRCH technique Statistical approaches
data quality
 SLO-2 Naïve Bayesian Classification
SLO-1 Data cleaning Pattern growth approach IF-THEN rules for classification DBSCAN technique Statistical data mining
S-6
SLO-2 Data integration Rule extraction from a decision tree
Mining frequest itemsets using Vertical Metrics for evaluating classifier
SLO-1 Data reduction STING technique Data mining and recommender systems
S-7 data format performance
SLO-2 Strong rules vs. weak rules Cross validation
Association analysis to Correlation Bootstrap
SLO-1 Data transformation CLIQUE technique Data mining for financial data analysis
S-8 analysis
SLO-2 Ensemble methods-Introduction
Comparison of pattern evaluation Bagging and Boosting
SLO-1 Data cube and its usage Evaluation of clustering techniques Data mining for Intrusion detection
S-9 measures
SLO-2 Random Forests: Introduction

Learning 1. Jiawei Han and Micheline Kamber, “ Data Mining: Concepts and Techniques”, 3rd
Resources Edition, Morgan Kauffman Publishers, 2011.

Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50%
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)# weightage)
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40 % - 30 % - 30 % - 30 % - 30% -
Understand
Apply
Level 2 40 % - 40 % - 40 % - 40 % - 40% -
Analyze
Evaluate
Level 3 20 % - 30 % - 30 % - 30 % - 30% -
Create
Total 100 % 100 % 100 % 100 % 100 %
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr.Latha Parthiba, Pondicherry University,
1. Mr.V.Selvakumar, Hexaware Technologies, selvakumarv@hexaware.com 1. Mr.L.N.B.Srinivas, SRMIST
lathaparthiban@yahoo.com
2. Mr.S.Karthick, SRMIST
3. Dr.V.V.Ramalingam, SRMIST