www.rejinpaul.

com
ANNA UNIVERSITY, CHENNAI
NON - AUTONOMOUS COLLEGES AFFILIATED ANNA UNIVERSITY
M.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS – 2021
CHOICE BASED CREDIT SYSTEM

1. PROGRAMME EDUCATIONAL OBJECTIVES (PEOs):

I. Develop proficiency as a computer science engineer with an ability to solve a wide

range of computational problems and have sustainable development in industry or any
other work environment.

Analyze and adapt quickly to new environments and technologies, gather new
II. information, and work on emerging technologies to solve multidisciplinary engineering
problems.

Possess the ability to think analytically and logically to understand technical problems
III. with computational systems for a lifelong learning which leads to pursuing research.

Adopt ethical practices to collaborate with team members and team leaders to build
IV. technology with cutting-edge technical solutions for computing systems

Strongly focus on design thinking and critical analysis to create innovative products and
V. become entrepreneurs.

2. PROGRAM SPECIFIC OUTCOMES (PSOs):

1. Efficiently design, build and develop system application software for distributed and
centralized computing environments in varying domains and platforms.

2. Understand the working of current Industry trends, the new hardware architectures,
the software components and design solutions for real world problems.

3. Model a computer based automation system and design algorithms that explore the
understanding of the tradeoffs involved in digital transformation.

4. Communicate and work effectively with professionals in various engineering fields

and pursue research orientation for a lifelong professional development in computer
and automation arenas.
 www.rejinpaul.com
ANNA UNIVERSITY, CHENNAI
NON - AUTONOMOUS COLLEGES AFFILIATED ANNA UNIVERSITY
M.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS – 2021
CHOICE BASED CREDIT SYSTEM
I TO IV SEMESTERS CURRICULA AND 1st SEMESTER SYLLABI
SEMESTER I

PERIODS PER TOTAL

S. COURSE CATE- WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
Applied Probability and Statistics
1. MA4151 FC 3 1 0 4 4
for Computer Science Engineers
2. RM4151 Research Methodology and IPR RMC 2 0 0 2 2

CP4151 Advanced Data Structures and PCC 3 0 0 3 3

3.
Algorithms
4. CP4152 Database Practices PCC 3 0 2 5 4
5. CP4153 Network Technologies PCC 3 0 0 3 3

CP4154 Principles of Programming PCC 3 0 0 3 3

6.
Languages
7. Audit Course – I* AC 2 0 0 2 0
PRACTICALS
Advanced Data Structures and
8. CP4161 PCC 0 0 4 4 2
Algorithms Laboratory
TOTAL 19 1 6 26 21
*Audit course is optional
SEMESTER II

PERIODS PER TOTAL

S. COURSE CATE- WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CP4251 Internet of Things PCC 3 0 2 5 4
Multicore Architecture and
2. CP4253 PCC 3 0 2 5 4
Programming
3. CP4252 Machine Learning PCC 3 0 2 5 4
4. SE4151 Advanced Software Engineering PCC 3 0 0 3 3
5. Professional Elective I PEC 3 0 0 3 3
6. Professional Elective II PEC 3 0 0 3 3
7. Audit Course – II* AC 2 0 0 2 0
PRACTICALS
8. CP4211 Term Paper and seminar EEC 0 0 2 2 1
9. CP4212 Software Engineering Laboratory PCC 0 0 2 2 1
TOTAL 20 0 10 30 23
*Audit course is optional
 www.rejinpaul.com
SEMESTER III

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CP4351 Security Practices PCC 3 0 0 3 3
2. Professional Elective III PEC 3 0 0 3 3

3. Professional Elective IV PEC 3 0 2 5 4

4. Open Elective OEC 3 0 0 3 3
PRACTICALS
5. CP4311 Project Work I EEC 0 0 12 12 6
TOTAL 12 0 14 26 19

SEMESTER IV

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS

PRACTICALS
1. CP4411 Project Work II EEC 0 0 24 24 12
TOTAL 0 0 24 24 12

TOTAL NO. OF CREDITS: 75

 www.rejinpaul.com
PROFESSIONAL ELECTIVES

SEMESTER II, ELECTIVE I

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. MP4073 Human Computer Interaction PEC 3 0 0 3 3
2. MP4253 Cloud Computing Technologies PEC 3 0 0 3 3
3. BD4151 Foundations of Data Science PEC 3 0 0 3 3
4. MP4152 Wireless Communications PEC 3 0 0 3 3
5. SE4071 Agile Methodologies PEC 3 0 0 3 3
Performance Analysis of
6. CP4078 PEC 3 0 0 3 3
Computer Systems
7. CP4001 Advanced Operating System PEC 3 0 0 3 3
8. MU4251 Digital Image Processing PEC 3 0 0 3 3

SEMESTER II, ELECTIVE II

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
High Performance Computing
1. BD4071 PEC 3 0 0 3 3
for Big Data
Information Retrieval
2. CP4076 PEC 3 0 0 3 3
Techniques
3. CP4079 Software Quality Assurance PEC 3 0 0 3 3
4. CP4071 Autonomous Systems PEC 3 0 0 3 3
5. CP4081 Web Analytics PEC 3 0 0 3 3
6. MP4071 Cognitive Computing PEC 3 0 0 3 3
7. AP4075 Quantum Computing PEC 3 0 0 3 3
8. BD4251 Big Data Mining and Analytics PEC 3 0 0 3 3

SEMESTER III, ELECTIVE III

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Mobile and Pervasive
1. CP4077 PEC 3 0 0 3 3
Computing
2. MP4075 Web Services and API Design PEC 3 0 0 3 3
3. CP4074 Data Visualization Techniques PEC 3 0 0 3 3
Compiler Optimization
4. IF4071 PEC 3 0 0 3 3
Techniques
Formal Models of Software
5. CP4002 PEC 3 0 0 3 3
Systems
 www.rejinpaul.com
6. AP4076 Robotics PEC 3 0 0 3 3
7. ML4251 Natural Language Processing PEC 2 0 2 4 3
8. IF4077 GPU Computing PEC 3 0 0 3 3

SEMESTER III, ELECTIVE IV

PERIODS TOTAL
S. COURSE CATE- PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. IF4075 Devops and Microservices PEC 3 0 2 5 4
2. MP4252 Mobile Application Development PEC 3 0 2 5 4
3. IF4073 Deep Learning PEC 3 0 2 5 4
4. CP4073 Blockchain Technologies PEC 3 0 2 5 4
Embedded Software
5. SE4072 PEC 3 0 2 5 4
Development
Full Stack Web Application
6. IF4251 PEC 3 0 2 5 4
Development
7. CP4072 Bioinformatics PEC 3 0 2 5 4
8. MP4251 Cyber Physical Systems PEC 3 0 2 5 4
9. MU4253 Mixed Reality PEC 3 0 2 5 4

AUDIT COURSES (AC)

Registration for any of these courses is optional to students

PERIODS PER
SL. COURSE WEEK
COURSE TITLE
NO. CODE CREDITS
L T P
1. AX4091 English for Research Paper Writing 2 0 0 0
2. AX4092 Disaster Management 2 0 0 0
3. AX4093 Constitution of India 2 0 0 0
4. AX4094 நற் றமிழ் இலக்கியம் 2 0 0 0
 www.rejinpaul.com
MA4151 APPLIED PROBABILITY AND STATISTICS FOR COMPUTER SCIENCE
ENGINEERS
L T P C
3 1 0 4
COURSE OBJECTIVES:
 To encourage students to develop a working knowledge of the central ideas of Linear
Algebra.
 To enable students to understand the concepts of Probability and Random Variables.
 To understand the basic probability concepts with respect to two dimensional random
variables along with the relationship between the random variables and the significance
of the central limit theorem.
 To apply the small / large sample tests through Tests of hypothesis.
 To enable the students to use the concepts of multivariate normal distribution and
principal components analysis.

UNIT I LINEAR ALGEBRA 12

Vector spaces – norms – Inner Products – Eigenvalues using QR transformations – QR
factorization – generalized eigenvectors – Canonical forms – singular value decomposition and
applications – pseudo inverse – least square approximations.

UNIT II PROBABILITY AND RANDOM VARIABLES 12

Probability – Axioms of probability – Conditional probability – Baye’s theorem – Random variables
– Probability function – Moments – Moment generating functions and their properties – Binomial,
Poisson , Geometric, Uniform, Exponential, Gamma and Normal distributions – Function of a
random variable.

UNIT III TWO DIMENSIONAL RANDOM VARIABLES 12

Joint distributions – Marginal and conditional distributions – Functions of two dimensional random
variables – Regression curve – Correlation.

UNIT IV TESTING OF HYPOTHESIS 12

Sampling distributions – Type I and Type II errors – Small and Large samples – Tests based on
Normal, t, Chi square and F distributions for testing of mean , variance and proportions – Tests for
independence of attributes and goodness of fit.

UNIT V MULTIVARIATE ANALYSIS 12

Random vectors and matrices – Mean vectors and covariance matrices – Multivariate normal
density and its properties – Principal components – Population principal components – Principal
components from standardized variables.

TOTAL : 60 PERIODS
COURSE OUTCOMES:
At the end of the course, students will be able to
1. apply the concepts of Linear Algebra to solve practical problems.
2. use the ideas of probability and random variables in solving engineering problems.
3. be familiar with some of the commonly encountered two dimensional random variables and
be equipped for a possible extension to multivariate analysis.
4. use statistical tests in testing hypotheses on data.
 www.rejinpaul.com
5. develop critical thinking based on empirical evidence and the scientific approach to
knowledge development.

REFERENCES:

1. Dallas E Johnson, “Applied multivariate methods for data Analysis”, Thomson and Duxbury
press, Singapore, 1998.
2. Richard A. Johnson and Dean W. Wichern, “Applied multivariate statistical Analysis”,
Pearson Education, Fifth Edition, 6th Edition, New Delhi, 2013.
3. Bronson, R.,”Matrix Operation” Schaum’s outline series, Tata McGraw Hill,
New York, 2011.
4. Oliver C. Ibe, “Fundamentals of Applied probability and Random Processes”, Academic
Press, Boston, 2014.
5. Johnson R. A. and Gupta C.B., “Miller and Freund’s Probability and Statistics for
Engineers”, Pearson India Education, Asia, 9th Edition, New Delhi, 2017.

RM4151 RESEARCH METHODOLOGY AND IPR L T P C

2 0 0 2

UNIT I RESEARCH DESIGN 6

Overview of research process and design, Use of Secondary and exploratory data to answer the
research question, Qualitative research, Observation studies, Experiments and Surveys.

UNIT II DATA COLLECTION AND SOURCES 6

Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods.
Data - Preparing, Exploring, examining and displaying.

UNIT III DATA ANALYSIS AND REPORTING 6

Overview of Multivariate analysis, Hypotheses testing and Measures of Association.
Presenting Insights and findings using written reports and oral presentation.

UNIT IV INTELLECTUAL PROPERTY RIGHTS 6

Intellectual Property – The concept of IPR, Evolution and development of concept of IPR, IPR
development process, Trade secrets, utility Models, IPR & Biodiversity, Role of WIPO and WTO in
IPR establishments, Right of Property, Common rules of IPR practices, Types and Features of IPR
Agreement, Trademark, Functions of UNESCO in IPR maintenance.

UNIT V PATENTS 6
Patents – objectives and benefits of patent, Concept, features of patent, Inventive step,
Specification, Types of patent application, process E-filing, Examination of patent, Grant of patent,
Revocation, Equitable Assignments, Licences, Licensing of related patents, patent agents,
Registration of patent agents.
TOTAL : 30 PERIODS

REFERENCES
1. Cooper Donald R, Schindler Pamela S and Sharma JK, “Business Research Methods”,
Tata McGraw Hill Education, 11e (2012).
 www.rejinpaul.com
2. Catherine J. Holland, “Intellectual property: Patents, Trademarks, Copyrights, Trade
Secrets”, Entrepreneur Press, 2007.
3. David Hunt, Long Nguyen, Matthew Rodgers, “Patent searching: tools &
techniques”, Wiley, 2007.
4. The Institute of Company Secretaries of India, Statutory body under an Act of parliament,
“Professional Programme Intellectual Property Rights, Law and practice”, September 2013.

CP4151 ADVANCED DATA STRUCTURES AND ALGORITHMS L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand the usage of algorithms in computing
 To learn and use hierarchical data structures and its operations
 To learn the usage of graphs and its applications
 To select and design data structures and algorithms that is appropriate for problems
 To study about NP Completeness of problems.

UNIT I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY 9

ANALYSIS
Algorithms – Algorithms as a Technology -Time and Space complexity of algorithms- Asymptotic
analysis-Average and worst-case analysis-Asymptotic notation-Importance of efficient
algorithms- Program performance measurement - Recurrences: The Substitution Method – The
Recursion-Tree Method- Data structures and algorithms.

UNIT II HIERARCHICAL DATA STRUCTURES 9

Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion- Red
Black trees: Properties of Red-Black Trees – Rotations – Insertion – Deletion -B-Trees:
Definition of B -trees – Basic operations on B-Trees – Deleting a key from a B-Tree- Heap –
Heap Implementation – Disjoint Sets - Fibonacci Heaps: structure – Mergeable-heap operations-
Decreasing a key and deleting a node-Bounding the maximum degree.

UNIT III GRAPHS 9

Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First
Search – Topological Sort – Strongly Connected Components- Minimum Spanning Trees:
Growing a Minimum Spanning Tree – Kruskal and Prim- Single-Source Shortest Paths: The
Bellman-Ford algorithm – Single-Source Shortest paths in Directed Acyclic Graphs – Dijkstra‘s
Algorithm; Dynamic Programming - All-Pairs Shortest Paths: Shortest Paths and Matrix
Multiplication – The Floyd-Warshall Algorithm

UNIT IV ALGORITHM DESIGN TECHNIQUES 9

Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming –
Longest Common Subsequence- Greedy Algorithms: – Elements of the Greedy Strategy- An
Activity-Selection Problem - Huffman Coding.

UNIT V NP COMPLETE AND NP HARD 9

NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness and
Reducibility – NP-Completeness Proofs – NP-Complete Problems.
TOTAL : 45 PERIODS
 www.rejinpaul.com
SUGGESTED ACTIVITIES:
1. Write an algorithm for Towers of Hanoi problem using recursion and analyze the
complexity (No of disc-4)
2. Write any one real time application of hierarchical data structure
3. Write a program to implement Make_Set, Find_Set and Union functions for Disjoint Set
Data Structure for a given undirected graph G(V,E) using the linked list representation
with simple implementation of Union operation
4. Find the minimum cost to reach last cell of the matrix from its first cell
5. Discuss about any NP completeness problem

COURSE OUTCOMES:
CO1: Design data structures and algorithms to solve computing problems.
CO2: Choose and implement efficient data structures and apply them to solve problems.
CO3: Design algorithms using graph structure and various string-matching algorithms to
solve real-life problems.
CO4: Design one’s own algorithm for an unknown problem.
CO5: Apply suitable design strategy for problem solving.

REFERENCES
1. S.Sridhar,” Design and Analysis of Algorithms”, Oxford University Press, 1st Edition,
2014.
2. Adam Drozdex, “Data Structures and algorithms in C++”, Cengage Learning, 4th
Edition, 2013.
3. T.H. Cormen, C.E.Leiserson, R.L. Rivest and C.Stein, "Introduction to Algorithms",
Prentice Hall of India, 3rd Edition, 2012.
4. Mark Allen Weiss, “Data Structures and Algorithms in C++”, Pearson Education,
3rd Edition, 2009.
5. E. Horowitz, S. Sahni and S. Rajasekaran, “Fundamentals of Computer Algorithms”,
University Press, 2nd Edition, 2008.
6. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”,
Pearson Education, Reprint 2006.

CP4152 DATABASE PRACTICES LT P C

3 0 2 4
COURSE OBJECTIVES
 Describe the fundamental elements of relational database management systems
 Explain the basic concepts of relational data model, entity-relationship model, relational
database design, relational algebra and SQL.
 Understand query processing in a distributed database system
 Understand the basics of XML and create well-formed and valid XML documents.
 Distinguish the different types of NoSQL databases
 To understand the different models involved in database security and their applications in
real time world to protect the database and information associated with them.

UNIT I RELATIONAL DATA MODEL 12

Entity Relationship Model – Relational Data Model – Mapping Entity Relationship Model to
Relational Model – Relational Algebra – Structured Query Language – Database Normalization.
 www.rejinpaul.com
Suggested Activities:
Data Definition Language
 Create, Alter and Drop
 Enforce Primary Key, Foreign Key, Check, Unique and Not Null Constraints
 Creating Views
Data Manipulation Language
 Insert, Delete, Update
 Cartesian Product, Equi Join, Left Outer Join, Right Outer Join and Full Outer Join
 Aggregate Functions
 Set Operations
 Nested Queries
Transaction Control Language
 Commit, Rollback and Save Points

UNIT II DISTRIBUTED DATABASES, ACTIVE DATABASES AND OPEN DATABASE

CONNECTIVITY 12
Distributed Database Architecture – Distributed Data Storage – Distributed Transactions –
Distributed Query Processing – Distributed Transaction Management – Event Condition Action
Model – Design and Implementation Issues for Active Databases – Open Database Connectivity.

Suggested Activities:
 Distributed Database Design and Implementation
 Row Level and Statement Level Triggers
 Accessing a Relational Database using PHP, Python and R

UNIT III XML DATABASES 12

Structured, Semi structured, and Unstructured Data – XML Hierarchical Data Model – XML
Documents – Document Type Definition – XML Schema – XML Documents and Databases –
XML Querying – XPath – XQuery
Suggested Activities:
 Creating XML Documents, Document Type Definition and XML Schema
 Using a Relational Database to store the XML documents as text
 Using a Relational Database to store the XML documents as data elements
 Creating or publishing customized XML documents from pre-existing relational databases
 Extracting XML Documents from Relational Databases
 XML Querying

UNIT IV NOSQL DATABASES AND BIG DATA STORAGE SYSTEMS 12

NoSQL – Categories of NoSQL Systems – CAP Theorem – Document-Based NoSQL Systems
and MongoDB – MongoDB Data Model – MongoDB Distributed Systems Characteristics – NoSQL
Key-Value Stores – DynamoDB Overview – Voldemort Key-Value Distributed Data Store – Wide
Column NoSQL Systems – Hbase Data Model – Hbase Crud Operations – Hbase Storage and
Distributed System Concepts – NoSQL Graph Databases and Neo4j – Cypher Query Language of
Neo4j – Big Data – MapReduce – Hadoop – YARN.

Suggested Activities:
 Creating Databases using MongoDB, DynamoDB, Voldemort Key-Value Distributed Data
Store Hbase and Neo4j.
 www.rejinpaul.com
 Writing simple queries to access databases created using MongoDB, DynamoDB,
Voldemort Key-Value Distributed Data Store Hbase and Neo4j.

UNIT V DATABASE SECURITY 12

Database Security Issues – Discretionary Access Control Based on Granting and Revoking
Privileges – Mandatory Access Control and Role-Based Access Control for Multilevel Security –
SQL Injection – Statistical Database Security – Flow Control – Encryption and Public Key
Infrastructures – Preserving Data Privacy – Challenges to Maintaining Database Security –
Database Survivability – Oracle Label-Based Security.
Suggested Activities:
Implementing Access Control in Relational Databases
TOTAL : 75 PERIODS
COURSE OUTCOMES
At the end of the course, the students will be able to
 Convert the ER-model to relational tables, populate relational databases and formulate
SQL queries on data.
 Understand and write well-formed XML documents
 Be able to apply methods and techniques for distributed query processing.
 Design and Implement secure database systems.
 Use the data control, definition, and manipulation languages of the NoSQL databases

REFERENCES:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Seventh Edition, Pearson
Education 2016.
2. Henry F. Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”,
Seventh Edition, McGraw Hill, 2019.
3. C.J.Date, A.Kannan, S.Swamynathan, ―An Introduction to Database Systems, Eighth
Edition, Pearson Education, 2006
4. Raghu Ramakrishnan , Johannes Gehrke “Database Management Systems”, Fourth
Edition, McGraw Hill Education, 2015.
5. Harrison, Guy, “Next Generation Databases, NoSQL and Big Data” , First Edition, Apress
publishers, 2015
6. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design,
Implementation and Management”, Sixth Edition, Pearson Education, 2015

CP4153 NETWORK TECHNOLOGIES L T P C

3 0 0 3
COURSE OBJECTIVES:
1. To understand the basic concepts of networks
2. To explore various technologies in the wireless domain
3. To study about 4G and 5G cellular networks
4. To learn about Network Function Virtualization
5. To understand the paradigm of Software defined networks
UNIT I NETWORKING CONCEPTS 9
Peer To Peer Vs Client-Server Networks. Network Devices. Network Terminology. Network
Speeds. Network throughput, delay. Osi Model. Packets, Frames, And Headers. Collision And
Broadcast Domains. LAN Vs WAN. Network Adapter. Hub. Switch. Router. Firewall, IP
addressing.
 www.rejinpaul.com
UNIT II WIRELESS NETWORKS 9
Wireless access techniques- IEEE 802.11a, 802.11g, 802.11e, 802.11n/ac/ax/ay/ba/be, QoS –
Bluetooth – Protocol Stack – Security – Profiles – zigbee

UNIT III MOBILE DATA NETWORKS 9

4G Networks and Composite Radio Environment – Protocol Boosters – Hybrid 4G Wireless
Networks Protocols – Green Wireless Networks – Physical Layer and Multiple Access –
Channel Modelling for 4G – Concepts of 5G – channel access –air interface -Cognitive Radio-
spectrum management – C-RAN architecture - Vehicular communications-protocol – Network
slicing – MIMO, mmWave, Introduction to 6G.

UNIT IV SOFTWARE DEFINED NETWORKS 9

SDN Architecture. Characteristics of Software-Defined Networking. SDN- and NFV-Related
Standards. SDN Data Plane. Data Plane Functions. Data Plane Protocols. OpenFlow Logical
Network Device. Flow Table Structure. Flow Table Pipeline. The Use of Multiple Tables. Group
Table. OpenFlow Protocol. SDN Control Plane Architecture. Control Plane Functions.
Southbound Interface. Northbound Interface. Routing. ITU-T Model. OpenDaylight.
OpenDaylight Architecture. OpenDaylight Helium. SDN Application Plane Architecture.
Northbound Interface. Network Services Abstraction Layer. Network Applications. User
Interface.

UNIT V NETWORK FUNCTIONS VIRTUALIZATION 9

Motivation-Virtual Machines –NFV benefits-requirements – architecture- NFV Infrastructure -
Virtualized Network Functions - NFV Management and Orchestration- NFV Use Cases- NFV
and SDN –Network virtualization – VLAN and VPN
TOTAL : 45 PERIODS

SUGGESTED ACTIVITIES:
1. Execute various network utilities such as tracert, pathping, ipconfig
2. Implement the Software Defined Networking using Mininet
3. Implement routing in Mininet
4. Install a virtual machine and study network virtualization
5. Simulate various network topologies in Network Simulator

REFERENCES
1. James Bernstein, “Networking made Easy”, 2018. ( UNIT I )
2. HoudaLabiod, Costantino de Santis, HossamAfifi “Wi-Fi, Bluetooth, Zigbee and WiMax”,
Springer 2007 ( UNIT 2 )
3. Erik Dahlman, Stefan Parkvall, Johan Skold, 4G: LTE/LTE-Advanced for Mobile
Broadband, Academic Press, 2013 ( UNIT 3)
4. Saad Z. Asif – “5G Mobile Communications Concepts and Technologies” CRC press –
2019 (UNIT 3)
5. William Stallings –“Foundations of Modern Networking: SDN, NFV, QoE, IoT, and Cloud”
1st Edition, Pearson Education, 2016.( Unit 4 and 5 )
6. Thomas D.Nadeau and Ken Gray, SDN – Software Defined Networks, O‟Reilly
Publishers, 2013.
7. Guy Pujolle, “Software Networks”, Second Edition, Wiley-ISTE, 2020
 www.rejinpaul.com
CP4154 PRINCIPLES OF PROGRAMMING LANGUAGES LTP C
3 00 3
COURSE OBJECTIVES:
 To understand and describe syntax and semantics of programming languages
 To understand data, data types, and basic statements
 To understand call-return architecture and ways of implementing them
 To understand object-orientation, concurrency, and event handling in
 programming languages
 To develop programs in non-procedural programming paradigms

UNIT I SYNTAX AND SEMANTICS 9

Evolution of programming languages – describing syntax – context – free grammars –attribute
grammars – describing semantics – lexical analysis – parsing – recursive-descent – bottom- up
parsing

UNIT II DATA, DATA TYPES, AND BASIC STATEMENTS 9

Names – variables – binding – type checking – scope – scope rules – lifetime and garbage
collection –primitive data types–strings–array types– associative arrays–record types– union
types – pointers and references – Arithmetic expressions – overloaded operators – type
conversions – relational and boolean expressions – assignment statements – mixed- mode
assignments – control structures – selection – iterations – branching – guarded statements

UNIT III SUBPROGRAMS AND IMPLEMENTATIONS 9

Subprograms – design issues – local referencing – parameter passing – overloaded methods –
generic methods – design issues for functions – semantics of call and return – implementing
simple subprograms – stack and dynamic local variables – nested subprograms – blocks –
dynamic scoping

UNIT IV OBJECT-ORIENTATION, CONCURRENCY, AND EVENT 9

HANDLING
Object-orientation – design issues for OOP languages – implementation of object-oriented
constructs – concurrency – semaphores – monitors – message passing – threads – statement
level concurrency – exception handling – event handling

UNIT V FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES 9

Introduction to lambda calculus – fundamentals of functional programming languages –
Programming with Scheme – Programming with ML – Introduction to logic and logic
programming – Programming with Prolog – multi-paradigm languages
TOTAL : 45 PERIODS

COURSE OUTCOMES:
CO1: Describe syntax and semantics of programming languages
CO2: Explain data, data types, and basic statements of programming languages
CO3: Design and implement subprogram constructs
CO4: Apply object-oriented, concurrency, and event handling programming
constructs
CO5: Develop programs in Scheme, ML, and Prolog
CO6: Understand and adopt new programming language
 www.rejinpaul.com
REFERENCES:
1. Robert W. Sebesta, “Concepts of Programming Languages”, Eleventh Edition, Addison
Wesley,2012
2. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth
Edition, Springer, 2003
3. Michael L.Scott, “Programming Language Pragmatics”, Fourth Edition, Morgan
Kaufmann,2009.
4. R.KentDybvig,“TheSchemeprogramminglanguage”,FourthEdition,MITPress, 2009
5. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009
6. W.F.ClocksinandC.S.Mellish,“ProgramminginProlog:UsingtheISOStandard”,Fifth Edition,
Springer,2003

CP4161 ADVANCED DATA STRUCTURES AND ALGORITHMS LT PC

LABORATORY 0 04 2
OBJECTIVES:
 To acquire the knowledge of using advanced tree structures
 To learn the usage of heap structures
 To understand the usage of graph structures and spanning trees
 To understand the problems such as matrix chain multiplication, activity selection
and Huffman coding
 To understand the necessary mathematical abstraction to solve problems.

LIST OF EXPERIMENTS:
1: Implementation of recursive function for tree traversal and Fibonacci
2: Implementation of iteration function for tree traversal and Fibonacci
3: Implementation of Merge Sort and Quick Sort
4: Implementation of a Binary Search Tree
5: Red-Black Tree Implementation
6: Heap Implementation
7: Fibonacci Heap Implementation
8: Graph Traversals
9: Spanning Tree Implementation
10: Shortest Path Algorithms (Dijkstra's algorithm, Bellman Ford Algorithm)
11: Implementation of Matrix Chain Multiplication
12: Activity Selection and Huffman Coding Implementation

HARDWARE/SOFTWARE REQUIREMENTS
1. 64-bit Open source Linux or its derivative
2. Open Source C++ Programming tool like G++/GCC
TOTAL : 60 PERIODS
COURSE OUTCOMES:
CO1: Design and implement basic and advanced data structures extensively
CO2: Design algorithms using graph structures
CO3: Design and develop efficient algorithms with minimum complexity using design
techniques
CO4: Develop programs using various algorithms.
CO5: Choose appropriate data structures and algorithms, understand the ADT/libraries,
and use it to design algorithms for a specific problem.
 www.rejinpaul.com

REFERENCES:
1. Lipschutz Seymour, “Data Structures Schaum's Outlines Series”, Tata McGraw Hill, 3rd
Edition, 2014.
2. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”,
Pearson Education, Reprint 2006.
3. http://www.coursera.org/specializations/data-structures-algorithms
4. http://www.tutorialspoint.com/data_structures_algorithms
5. http://www.geeksforgeeks.org/data-structures/

AUDIT COURSES

AX4091 ENGLISH FOR RESEARCH PAPER WRITING L T PC

2 0 0 0
COURSE OBJECTIVES:
 Teach how to improve writing skills and level of readability
 Tell about what to write in each section
 Summarize the skills needed when writing a Title
 Infer the skills needed when writing the Conclusion
 Ensure the quality of paper at very first-time submission

UNIT I INTRODUCTION TO RESEARCH PAPER WRITING 6

Planning and Preparation, Word Order, Breaking up long sentences, Structuring Paragraphs and
Sentences, Being Concise and Removing Redundancy, Avoiding Ambiguity and Vagueness

UNIT II PRESENTATION SKILLS 6

Clarifying Who Did What, Highlighting Your Findings, Hedging and Criticizing, Paraphrasing and
Plagiarism, Sections of a Paper, Abstracts, Introduction

UNIT III TITLE WRITING SKILLS 6

Key skills are needed when writing a Title, key skills are needed when writing an Abstract, key
skills are needed when writing an Introduction, skills needed when writing a Review of the
Literature, Methods, Results, Discussion, Conclusions, The Final Check

UNIT IV RESULT WRITING SKILLS 6

Skills are needed when writing the Methods, skills needed when writing the Results, skills are
needed when writing the Discussion, skills are needed when writing the Conclusions

UNIT V VERIFICATION SKILLS 6

Useful phrases, checking Plagiarism, how to ensure paper is as good as it could possibly be the
first- time submission
TOTAL: 30 PERIODS
COURSE OUTCOMES:
CO1 –Understand that how to improve your writing skills and level of readability
CO2 – Learn about what to write in each section
CO3 – Understand the skills needed when writing a Title
CO4 – Understand the skills needed when writing the Conclusion
CO5 – Ensure the good quality of paper at very first-time submission
 www.rejinpaul.com

REFERENCES:
1. Adrian Wallwork , English for Writing Research Papers, Springer New York Dordrecht
Heidelberg London, 2011
2. Day R How to Write and Publish a Scientific Paper, Cambridge University Press 2006
3. Goldbort R Writing for Science, Yale University Press (available on Google Books) 2006
4. Highman N, Handbook of Writing for the Mathematical Sciences, SIAM. Highman’s
5. book 1998.

AX4092 DISASTER MANAGEMENT LT PC

2 00 0
COURSE OBJECTIVES:
 Summarize basics of disaster
 Explain a critical understanding of key concepts in disaster risk reduction and humanitarian
response.
 Illustrate disaster risk reduction and humanitarian response policy and practice from
multiple perspectives.
 Describe an understanding of standards of humanitarian response and practical relevance
in specific types of disasters and conflict situations.
 Develop the strengths and weaknesses of disaster management approaches

UNIT I INTRODUCTION 6
Disaster: Definition, Factors and Significance; Difference between Hazard And Disaster; Natural
and Manmade Disasters: Difference, Nature, Types and Magnitude.

UNIT II REPERCUSSIONS OF DISASTERS AND HAZARDS 6

Economic Damage, Loss of Human and Animal Life, Destruction Of Ecosystem. Natural Disasters:
Earthquakes, Volcanisms, Cyclones, Tsunamis, Floods, Droughts And Famines, Landslides And
Avalanches, Man-made disaster: Nuclear Reactor Meltdown, Industrial Accidents, Oil Slicks And
Spills, Outbreaks Of Disease And Epidemics, War And Conflicts.

UNIT III DISASTER PRONE AREAS IN INDIA 6

Study of Seismic Zones; Areas Prone To Floods and Droughts, Landslides And Avalanches; Areas
Prone To Cyclonic and Coastal Hazards with Special Reference To Tsunami; Post-Disaster
Diseases and Epidemics

UNIT IV DISASTER PREPAREDNESS AND MANAGEMENT 6

Preparedness: Monitoring Of Phenomena Triggering a Disaster or Hazard; Evaluation of Risk:
Application of Remote Sensing, Data from Meteorological And Other Agencies, Media Reports:
Governmental and Community Preparedness.

UNIT V RISK ASSESSMENT 6

Disaster Risk: Concept and Elements, Disaster Risk Reduction, Global and National Disaster Risk
Situation. Techniques of Risk Assessment, Global Co-Operation in Risk Assessment and Warning,
People’s Participation in Risk Assessment. Strategies for Survival
TOTAL : 30 PERIODS
COURSE OUTCOMES:
CO1: Ability to summarize basics of disaster
 www.rejinpaul.com
CO2: Ability to explain a critical understanding of key concepts in disaster risk reduction and
humanitarian response.
CO3: Ability to illustrate disaster risk reduction and humanitarian response policy and practice
from multiple perspectives.
CO4: Ability to describe an understanding of standards of humanitarian response and practical
relevance in specific types of disasters and conflict situations.
CO5: Ability to develop the strengths and weaknesses of disaster management approaches

REFERENCES:
1. Goel S. L., Disaster Administration And Management Text And Case Studies”, Deep & Deep
Publication Pvt. Ltd., New Delhi,2009.
2. NishithaRai, Singh AK, “Disaster Management in India: Perspectives, issues and strategies
“’New Royal book Company,2007.
3. Sahni, Pradeep Et.Al. ,” Disaster Mitigation Experiences And Reflections”, Prentice Hall
OfIndia, New Delhi,2001.

AX4093 CONSTITUTION OF INDIA L T P C

2 0 0 0
COURSE OBJECTIVES:
Students will be able to:
 Understand the premises informing the twin themes of liberty and freedom from a civil
rights perspective.
 To address the growth of Indian opinion regarding modern Indian intellectuals’
constitutional
 Role and entitlement to civil and economic rights as well as the emergence of nationhood
in the early years of Indian nationalism.
 To address the role of socialism in India after the commencement of the Bolshevik
Revolution 1917 And its impact on the initial drafting of the Indian Constitution.

UNIT I HISTORY OF MAKING OF THE INDIAN CONSTITUTION

History, Drafting Committee, (Composition & Working)

UNIT II PHILOSOPHY OF THE INDIAN CONSTITUTION

Preamble, Salient Features

UNIT III CONTOURS OF CONSTITUTIONAL RIGHTS AND DUTIES

Fundamental Rights, Right to Equality, Right to Freedom, Right against Exploitation, Right to
Freedom of Religion, Cultural and Educational Rights, Right to Constitutional Remedies, Directive
Principles of State Policy, Fundamental Duties.

UNIT IV ORGANS OF GOVERNANCE

Parliament, Composition, Qualifications and Disqualifications, Powers and Functions, Executive,
President, Governor, Council of Ministers, Judiciary, Appointment and Transfer of Judges,
Qualifications, Powers and Functions.

UNIT V LOCAL ADMINISTRATION

District’s Administration head: Role and Importance, Municipalities: Introduction, Mayor and role of
 www.rejinpaul.com
Elected Representative, CEO, Municipal Corporation. Pachayati raj: Introduction, PRI: Zila
Panchayat. Elected officials and their roles, CEO Zila Pachayat: Position and role. Block level:
Organizational Hierarchy(Different departments), Village level:Role of Elected and Appointed
officials, Importance of grass root democracy.

UNIT VI ELECTION COMMISSION

Election Commission: Role and Functioning. Chief Election Commissioner and Election
Commissioners - Institute and Bodies for the welfare of SC/ST/OBC and women.

TOTAL: 30 PERIODS
COURSE OUTCOMES:
Students will be able to:
 Discuss the growth of the demand for civil rights in India for the bulk of Indians before the
arrival of Gandhi in Indian politics.
 Discuss the intellectual origins of the framework of argument that informed the
conceptualization
 of social reforms leading to revolution in India.
 Discuss the circumstances surrounding the foundation of the Congress Socialist
Party[CSP] under the leadership of Jawaharlal Nehru and the eventual failure of the
proposal of direct elections through adult suffrage in the Indian Constitution.
 Discuss the passage of the Hindu Code Bill of 1956.

SUGGESTED READING
1. The Constitution of India,1950(Bare Act),Government Publication.
2. Dr.S.N.Busi, Dr.B. R.Ambedkar framing of Indian Constitution,1st Edition, 2015.
3. M.P. Jain, Indian Constitution Law, 7th Edn., LexisNexis,2014.
4. D.D. Basu, Introduction to the Constitution of India, LexisNexis, 2015.

AX4094 நற் றமிழ் இலக்கியம் L T P C

2 0 0 0

UNIT I சங் க இலக்கியம் 6

1. தமிழின் துவக்க நூல் ததொல் கொப் பியம்
– எழுத்து, த ொல் , தபொருள்
2. அகநொனூறு (82)
- இயற் கக இன்னிக அரங் கம்
3. குறிஞ் சிப் பொட்டின் மலர்க்கொட்சி
4. புறநொனூறு (95,195)
- பபொகர நிறுத்திய ஒளகவயொர்

UNIT II அறநநறித் தமிழ் 6

1. அறதநறி வகுத்த திருவள் ளுவர்
- அறம் வலியுறுத்தல் , அன்புகடகம, ஒப் புறவு அறிதல் , ஈகக, புகழ்
2. பிற அறநூல் கள் - இலக்கிய மருந்து
– ஏலொதி, சிறுபஞ் மூலம் , திரிகடுகம் , ஆ ொரக்பகொகவ (தூய் கமகய
 www.rejinpaul.com
வலியுறுத்தும் நூல் )

UNIT III இரட்டடக் காப் பியங் கள் 6

1. கண்ணகியின் புரட்சி
- சிலப் பதிகொர வழக்குகர கொகத
2. மூகப கவ இலக்கியம் மணிபமககல
- சிகறக்பகொட்டம் அறக்பகொட்டமொகிய கொகத

UNIT IV அருள் நநறித் தமிழ் 6

1. சிறுபொணொற் றுப் பகட
- பொரி முல் கலக்குத் பதர் தகொடுத்தது, பபகன் மயிலுக்குப்
பபொர்கவ தகொடுத்தது, அதியமொன் ஒளகவக்கு தநல் லிக்கனி தகொடுத்தது, அர ர்
பண்புகள்
2. நற் றிகண
- அன்கனக்குரிய புன்கன சிறப் பு
3. திருமந்திரம் (617, 618)
- இயமம் நியமம் விதிகள்
4. தர்ம ் ொகலகய நிறுவிய வள் ளலொர்
5. புறநொனூறு
- சிறுவபன வள் ளலொனொன்
6. அகநொனூறு (4) - வண்டு
நற் றிகண (11) - நண்டு
கலித்ததொகக (11) - யொகன, புறொ
ஐந்திகன 50 (27) - மொன்
ஆகியகவ பற் றிய த ய் திகள்

UNIT V நவீன தமிழ் இலக்கியம் 6

1. உகரநகடத் தமிழ் ,
- தமிழின் முதல் புதினம் ,
- தமிழின் முதல் சிறுககத,
- கட்டுகர இலக்கியம் ,
- பயண இலக்கியம் ,
- நொடகம் ,
2. நொட்டு விடுதகல பபொரொட்டமும் தமிழ் இலக்கியமும் ,
3. முதொய விடுதகலயும் தமிழ் இலக்கியமும் ,
தபண் விடுதகலயும் விளிம் பு நிகலயினரின் பமம் பொட்டில் தமிழ்
4.
இலக்கியமும் ,
5. அறிவியல் தமிழ் ,
6. இகணயத்தில் தமிழ் ,
7. சுற் று சூ
் ழல் பமம் பொட்டில் தமிழ் இலக்கியம் .

TOTAL: 30 PERIODS
 www.rejinpaul.com
தமிழ் இலக்கிய நெளியீடுகள் / புத்தகங் கள்
1. தமிழ் இகணய கல் விக்கழகம் (Tamil Virtual University)
- www.tamilvu.org
2. தமிழ் விக்கிப் பீடியொ (Tamil Wikipedia)
-https://ta.wikipedia.org
3. தர்மபுர ஆதின தவளியீடு
4. வொழ் வியல் களஞ் சியம்
- தமிழ் ப் பல் ககலக்கழகம் , தஞ் ொவூர்
5. தமிழ் ககலக் களஞ் சியம்
- தமிழ் வளர் சி
் த் துகற (thamilvalarchithurai.com)
6. அறிவியல் களஞ் சியம்
- தமிழ் ப் பல் ககலக்கழகம் , தஞ் ொவூர்