KG College of Arts and Science (Autonomous) 2024 - 2025

Regulations 2024-25 for Postgraduate Programme

Learning Outcomes Based Curriculum Framework (LOCF) model with

Choice Based Credit System (CBCS)

Programme: M.Sc. Computer Science (M.Sc. CS)

Programme Code: MCS

(Applicable for the Students admitted during the academic year 2024-25 onwards)

Eligibility
The student should have passed B.Sc. Computer Science / BCA / B.Sc. Computer Science
related Courses / B.E. / B.Tech. Computer Science related course is eligible for M.Sc. Computer
Science. (As per the eligibility condition given by Bharathiar University Ref. BU/R/B3-B4/
Eligibility Condition /2024/9206 dated 24/5/2024).

Program Learning Outcomes (PLOs)

The successful completion of the M.Sc. Computer Science programme shall enable the students to:

Develop critical analysis with creativity and problem solving skills in Computational
PLO1
Science to become Data Scientist and Data Analyst.
Exhibit research skills, design and critical thinking to embellish the career of computer
PLO2
System Analyst, Software Engineer and Scientific Researcher to solve real world problem.
Continue the process of life-long learning through professional activities and adapt
PLO3
themselves persuasively in Full Stack Development, AI and Cloud Computing.
Enhance skills for effective leadership in IT support, Network Architect, Web Development
PLO4
and successful entrepreneur as well.
Apply ethical principles through human computer interaction and contribute effectively to
PLO5
the welfare of the society.

Department of Computer Science (PG) 1

KG College of Arts and Science (Autonomous) 2024 - 2025

M.Sc. Computer Science

Distribution of Credits and Hours for all the Semesters

No. of Total
Part Course Category Hours Credits Semester
Courses Credits

Core Theory (5 hrs./week) 5 5X5 25 4X5 20 2-3

Core Theory (4 hrs./week) 5 5X4 20 4X5 20 1

Core Lab (4 hrs./ week) 6 6X4 24 6X3 18 1-3

III Elective Theory (5 hrs./ week) 1 1X5 5 1X4 4 84 3

Elective Theory (4 hrs./ week) 2 2X4 8 2X4 8 1-2

Skill Enhancement Course
2 2X2 4 2X3 6 2-3
(SEC)
Internship (IT) 1 - - 1X2 2 3
Project Work 1 - - 1X6 6 4
Ability Enhancement 1-2
2 2X2 4 2X2 4
Compulsory Course (AECC)
IV Ability Enhancement 6
Compulsory Course
1 - - 1X2 2 3
(AECC) – Online Course
MOOC
Total 26 90 90 90

Consolidated Semester wise and Component wise

Hours and Credits distribution
Part III Part IV Total
Semester
Hrs. Credits Hrs. Credits Hrs. Credits

1 28 26 2 2 30 28

2 28 25 2 2 30 27

3 30 27 - 2 30 29

4 - 6 - - - 6

Total 86 84 4 6 90 90

Department of Computer Science (PG) 2

KG College of Arts and Science (Autonomous) 2024 - 2025

Curriculum

M.Sc. Computer Science

Semester – 1

Examination
Course Course Hrs. / Max Marks
Part Course Name Credits
Code Category week Duration
in hrs. CIA ESE Total

Analysis and
24MCS11C III Core – I Design of 4 3 25 75 100 4
Algorithms
Python
24MCS12C III Core - II 4 3 25 75 100 4
Programming
Lab : Python
24MCS13P III Core Lab - I 4 3 40 60 100 3
Programming
24MCS14C III Core – III MongoDB 4 3 25 75 100 4
24MCS15P III Core Lab - II Lab : MongoDB 4 3 40 60 100 3
Advanced
24MCS16C III Core - IV Operating 4 3 25 75 100 4
Systems
Exploratory Data
24MCS1AE III
Analysis
Blockchain
24MCS1BE III Elective - I Technology and 4 3 25 75 100 4
Applications
Data Preprocessing
24MCS1CE III
and Visualization
Quantitative
24QUA1AE IV AECC - I 2 2 - 50 50 2
Aptitude

Total 30 750 28

Department of Computer Science (PG) 3

KG College of Arts and Science (Autonomous) 2024 - 2025

Semester – 2

Examination
Course Course Hrs. /
Part Course Name
Code Category week Duration Max Marks Credits
in hrs. CIA ESE Total

Advanced Java
24MCS21C III Core - V 5 3 25 75 100 4
Programming
Lab : Advanced
24MCS22P III Core Lab- III 4 3 40 60 100 3
Java Programming
Artificial
24MCS23C III Core - VI Intelligence and 5 3 25 75 100 4
Machine Learning
Lab : Artificial
24MCS24P III Core Lab- IV Intelligence and 4 3 40 60 100 3
Machine Learning
24MCS25C III Core - VII Data Mining 4 3 25 75 100 4
24MCS2AE III Big Data Analytics
24MCS2BE III Ethical Hacking
Elective - II 4 3 25 75 100 4
Neural Networks
24MCS2CE III and Deep
Learning
Lab : Data
24MCS26P III SEC Lab - I 2 3 40 60 100 3
Mining
24SOF2AE IV AECC - II Soft Skills 2 2 - 50 50 2

Total 30 750 27

Department of Computer Science (PG) 4

KG College of Arts and Science (Autonomous) 2024 - 2025

Semester 1

Department of Computer Science (PG) 5

KG College of Arts and Science (Autonomous) 2024 - 2025

Semester - 1
Course Code Course Name Category Hours / Week Credits

24MCS11C Analysis and Design of Algorithms Core - I 4 4

Course Objectives
This course intends to cover
 Elementary data structures.
 Various techniques such as divide and conquer, dynamic programming, backtracking.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level

CLO1 Recite the elementary data structures. K1

CLO2 Understand the traversal and search techniques. K2

CLO3 Apply the Greedy method in various applications. K3

CLO4 Analyze the dynamic programming techniques. K4

CLO5 Evaluate the concept of backtracking, branch and bound techniques. K5

K1 – Remember; K2 - Understand; K3 - Apply; K4 – Analyze; K5 – Evaluate

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 3 2 3 3

CLO2 2 2 2 3 2

CLO3 2 2 2 2 2

CLO4 3 3 2 2 2

CLO5 3 3 3 3 2

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 6

KG College of Arts and Science (Autonomous) 2024 - 2025

Core I: Analysis and Design of Algorithms

No. of
Unit Content
Hours

Introduction: Algorithm Definition and Specification – Space complexity-

I Time Complexity- Asymptotic Notations - Elementary Data Structure: Stacks 12
and Queues – Binary Tree - Binary Search Tree - Heap – Heap sort- Graph.

Traversal and search techniques: Basics of Traversal and Search Techniques-

II Techniques for Binary Trees-Techniques for Graphs -Divide and Conquer: - 13
General Method – Binary Search – Merge Sort – Quick Sort.

Greedy method: General Method –Knapsack Problem – Minimum Cost

III 11
Spanning Tree – Single Source Shortest Path.

Dynamic Programming: General Method –Multistage Graphs – All Pair

IV Shortest Path–Optimal Binary Search Trees – 0/1 Knapsacks – Traveling 13
Salesman Problem – Flow Shop Scheduling.

Backtracking: General Method–8-QueensProblem–Sum of Subsets – Graph

V Coloring– Hamiltonian Cycles – Branch and Bound: The Method – Traveling 11
Salesperson.

Total Hours 60

Text Books

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman (2013), Data Structures and
1.
Algorithms, Pearson Education Limited.

2. Ellis Horowitz (2008), Computer Algorithms, Galgotia Publications.

Reference Books
1. Goodrich (2022), Data Structures and Algorithms in Java, 6th Edition, Wiley.

2. Skiena (2008), The Algorithm Design Manual, 2nd Edition, Springer.

Anany Levith (2003), Introduction to the Design and Analysis of algorithm, Pearson
3.
Education Asia.

Robert Sedgewick, Phillipe Flajolet (1996), An Introduction to the Analysis of

4.
Algorithms, Addison-Wesley Publishing Company.

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc24_cs23/preview

2. https://onlinecourses.nptel.ac.in/noc24_cs28/preview

3. https://onlinecourses.nptel.ac.in/noc24_cs45/preview

Department of Computer Science (PG) 7

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS12C Python Programming Core - II 4 4

Course Objectives
The course intends to cover
 Elementary data structures of Python programming.
 Modules to perform specific task.
 Python libraries and frameworks for rapid application development.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
CLO1 Recite the basic concepts of Python. K1

CLO2 Understand the Object-Oriented concepts and modules in Python. K2

CLO3 Analyze the data storage, databases, web and network applications. K4
CLO4 Build real time applications using Python libraries. K3
CLO5 Create an application through Python frameworks Django and Flask. K6

K1 - Remember; K2 - Understand; K3 - Apply; K4 – Analyze; K6 - Create

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5
CLO1 2 2 3 - 3

CLO2 2 3 3 - 3

CLO3 2 3 3 - 3

CLO4 3 3 3 1 3
CLO5 3 3 3 1 3
3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 8

KG College of Arts and Science (Autonomous) 2024 - 2025

Core – II : Python Programming

No. of
Unit Content
Hours

Introduction: Numbers – Strings – Variables – Lists – Tuples – Dictionaries –

I Sets– Comparison. Code Structures: if, elseif, and else – Repeat with while – 12
Iterate with for – Comprehensions – Functions – Generators – Decorators –
Namespaces and Scope – Handle Errors with try and except – User Exceptions.

Modules and Programs: Standalone Programs – Command-Line Arguments –

Modules and the import Statement – The Python Standard Library. Objects and
II Classes: Define a Class – Inheritance – Override a Method – Add a Method – 10
Get and Set Attribute Values with Properties –- Method Types– Special
Methods.

Storing and Retrieving Data: File Input/Output – Structured Text Files –

Structured Binary Files. Database Programming using Python: Connecting to a
III database (sqlite, mysql) using Python, Sending DML and DDL queries and 12
processing the result from the Python Program. Web: Web Clients – Web
Servers – Web Services and Automation. Networks: Patterns – The Publish-
Subscribe Model – TCP/IP – Sockets – Internet Services.

NumPy: Operations using NumPy - NumPy for Arrays - Data Type Objects
(dtype) – NumPy Mathematical Operations. Pandas: Key Features of Pandas –
IV Pandas data structures – series and DataFrame – Loading a dataset into a 13
dataframe – Selecting columns and rows from dataframe – Adding new data
and deleting data from a dataframe. Matplotlib: Use of Matplotlib – Types of
Plots –Working with multiple Plots.

Python Frameworks: Frameworks - Types of Python Frameworks - Django:

Install Django – Web frameworks – The development server – Model-view-
controller vs Model view template - Initial Setup - First Django project –
V Create an app – URL confs – Pages app. Flask: Introduction to Flask - 13
Installation - Basic Application Structure - Initialization - Routes and views
function - Server startup - A Complete application - The Request-Response
cycle.

Total Hours 60

Department of Computer Science (PG) 9

KG College of Arts and Science (Autonomous) 2024 - 2025

Text Books
1 Jameer Basha A, Lokesh S and Kiruba B (2024), Python Programming, 3rd Impression,
Pearson Publications.
2 Yashvant Kanetkar, Aditya Kanetkar (2023), Let us Python, 6th Edition, BPB Publications.

3 Bill Lubanovic (2014), Introducing Python, 1st Edition-Second Release, O’Reilly Media
Publisher.
4 William S Vincent (2020), Django for beginners Build websites with python & Django,
2020 Edition, WelcomeToCode publisher.
5 Malhar Lathkar (2021), Building Web Apps with Python and Flask, 2021 Edition, BPB
Publications.
Reference Books
1 Alex Martelli, Anna Ravenscroft, Steve Holden (2017), Python in Nutshell, 3rd Edition,
O’Reilly Media Publisher.
2 Sheetal Taneja, Naveen Kumar (2017), Python Programming – A Modular Approach,
Pearson Publications.
3 Antonio Mele (2020), Django by Example Build Powerful and reliable python web
applications from scratch, 3rd Edition, Packt Publications.
4 Shalabh Aggarwal (2019), Flask Framework cookbook, 2nd Edition, Packt Publications.
Web Resources (Swayam / NPTEL)
1 https://onlinecourses.nptel.ac.in/noc24_cs54/preview
2 https://onlinecourses.swayam2.ac.in/aic20_sp33/preview
3 https://onlinecourses.swayam2.ac.in/cec22_cs20/preview
4 https://onlinecourses.swayam2.ac.in/cec24_cs03/preview

Department of Computer Science (PG) 10

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credit

24MCS13P Lab: Python Programming Core Lab – I 4 3

S. No. List of Programs

1 Basic programs using Lists, Dictionaries, Tuples and Sets.

2 Implement conditional structures and loops.
3 Demonstrate Python programs using modules.
4 Programs to implement file operations.
5 Implement database connectivity, execute DDL and DML queries.
6 Programs using NumPy library.
7 Programs using Pandas library.
8 Develop a various charts using Matplotlib library.
9 Design a simple form using Django.
10 Design a multipage website using flask.
Total Hours 60
Text Books
Yashvant Kanetkar, Aditya Kanetkar (2023), Let us Python, 6th Edition, BPB
1.
Publications.
Bill Lubanovic (2014), Introducing Python, 1st Edition-Second Release, O’Reilly Media
2.
Publisher.
Reference Books
Alex Martelli, Anna Ravenscroft, Steve Holden (2017), Python in Nutshell, 3rd Edition,
1.
O’Reilly Media Publisher.
Sheetal Taneja, Naveen Kumar (2017), Python Programming – A Modular Approach,
2.
Pearson Publications.
Antonio Mele (2020), Django by Example Build Powerful and reliable python web
3.
applications from scratch, 3rd Edition, Packt Publications.
4. Shalabh Aggarwal (2019), Flask Framework cookbook, 2nd Edition, Packt Publications.

Web Resources (Swayam / NPTEL)

1 https://onlinecourses.nptel.ac.in/noc24_cs54/preview
2 https://onlinecourses.swayam2.ac.in/aic20_sp33/preview
3 https://onlinecourses.swayam2.ac.in/cec22_cs20/preview
4 https://onlinecourses.swayam2.ac.in/cec24_cs03/preview

Department of Computer Science (PG) 11

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS14C MongoDB Core - III 4 4

Course Objectives
The course intends to cover
 MongoDB fundamentals such as databases, collections and CRUD operations.
 Indexing strategies to improve query performance.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
Understand NoSQL Database and differences with RDBMS and
CLO1 K1, K2
CAP Theorem.
CLO2 Apply data modelling and schema validation. K3
Analyze the requirement and design the MongoDB documents and
CLO3 K4
collections.
CLO4 Understand the aggregation operators in MongoDB. K2

CLO5 Create Shards in MongoDB. K6

K1 - Remember; K2 - Understand; K3 - Apply; K4 – Analyze; K6 - Create

CLO-PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 3 3 2 2

CLO2 3 3 3 2 3

CLO3 3 3 3 3 3

CLO4 2 3 3 2 2

CLO5 3 3 3 3 2

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 12

KG College of Arts and Science (Autonomous) 2024 - 2025

Core - III : MongoDB

No. of
Unit Content
Hours

Introduction to NoSQL: Types of NoSQL Databases – MongoDB –

I Differences between MongoDB and RDBMS – CAP theorem – JSON – 10
BSON – MongoDB document.

MongoDB Installation and Data Modeling: Databases and collections-

Introduction to MongoDB shell-Configuring MongoDB shell-Accessing the
II 12
MongoDB shell-Understanding data types - MongoDB data modeling-Embedded
data model-References data model-Perform schema validations.

CRUD Operations: Introduction to CRUD operations - creating databases and

collections-Insert operation-Ready operation-Update operation- Delete
operation. Additional CRUD Related Methods: Overview of CRUD methods -
III 12
insert() method-update()method-find()method-findOneandDelete()method-
findOneAndReplace() method-findOneAndUpdate() method - findAndModify()
method.

Aggregation: Aggregation operators-Aggregation stage operators-Expression

operators: Expression arithmetic operators- Set expression and array operators-
IV 12
Expression boolean operators - Expression comparison operators- Expression
date operators- Expression string operators.

Indexes and Performance Tuning: Different types of Indexes-Index Creation-

listing the indexes-Default_Id index-Drop an Index-Single Field Index -
Compound Index. Introduction to Storage and Storage Engine: WiredTiger/In-
V Memory Storage Engine. Introduction to MongoDB Sharding: Advantages of 14
sharding- Architecture overview- development, continuous deployment and
staging environments-Planning ahead on sharding – Shard key – Choosing a
Shard key.

Total Hours 60
Text Books

1. Kristina Chodorow (2013), MongoDB: The Definitive Guide.

Amit Phaltankar, Juned Ahsan,Michael Harrison,Liviu Nedov (2020), MongoDB
2. Fundamentals: A hands-on guide to using MongoDB and Atlas in the real world, Packt
Publishing.

Department of Computer Science (PG) 13

KG College of Arts and Science (Autonomous) 2024 - 2025

Reference Books
1. Alex Giamas (2017), Mastering MongoDB 3.x, Packt Publishing Ltd.

2. Manu Sharma (2021), MongoDB Complete Guide, BPB Publication.

Web Resources (Swayam / NPTEL)

1. https://nptel.ac.in/courses/106104135

Department of Computer Science (PG) 14

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS15P Lab: MongoDB Core Lab - II 4 3

S. No. List of Programs

1. Build a database in MongoDB.

Create MongoDB Database with Employee Collection, having Employee ID, Employee
2.
Name, Department, Salary, Deductions, Gross and NetSalary.

3. Model collections in different perspective of Employee collection/ Department collection.

Perform Schema Validations -Validate Schema of inserted documents, whether minimum

4.
expected schema is matched.

5. Perform Read operations based on specific conditions.

6. Perform insertion, deletion, updating documents based on conditions to the collection.

7. Perform aggregations using various operators.

8. Add appropriate single field and multiple field index.

9. Perform aggregations on documents based on criteria.

10. Update Document using: a) update() method b) save() method.

11. MongoDB Projection.

12. Perform limit(), skip() and sort() methods in MongoDB.

13. MongoDB string expression and array update operators.

Total Hours 60
Text Books
Amit Phaltankar, Juned Ahsan, Michael Harrison, Liviu Nedov (2020), MongoDB
1. Fundamentals: A hands-on guide to using MongoDB and Atlas in the real world, Packt
Publishing.
2. Kristina Chodoro (2013), MongoDB: The Definitive Guide.
Reference Books
1. Manu Sharma (2021), MongoDB Complete Guide, BPB Publication.
2. Alex Giama (2017), Mastering MongoDB 3.x, Packt Publishing Ltd.
Web Resources (Swayam / NPTEL)
1. https://nptel.ac.in/courses/106104135

Department of Computer Science (PG) 15

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Advanced Operating
24MCS16C Core - IV 4 4
Systems

Course Objectives
The course intends to cover
 Different types of operating systems and their functions.
 Components and management aspects of real time and mobile OS.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level

CLO1 Recite the different kinds of operating systems and process scheduling. K1
Understand the design issues associated with distributed operating
CLO2 K2
system.
CLO3 Interpret the concepts of real time operating system and task scheduling. K2

CLO4 Explore the operating systems for handheld systems. K4

CLO5 Analyze operating systems like LINUX and iOS. K4

K1 – Remember; K2 – Understand; K4 – Analyze

CLO-PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 3 3 1 2

CLO2 3 3 3 2 2

CLO3 3 3 3 3 3

CLO4 3 3 3 3 3

CLO5 2 3 2 2 2

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 16

KG College of Arts and Science (Autonomous) 2024 - 2025

Core - IV : Advanced Operating Systems

No. of
Unit Content
Hours
Basics of Operating Systems: Operating System Overview – Main frame Systems
– Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered
Systems –Real-Time Systems – Handheld Systems – Feature Migration –
I 14
Computing Environments -Process Scheduling – Cooperating Processes – Inter
Process Communication- Deadlocks –Prevention – Avoidance – Detection –
Recovery.
Distributed Operating Systems: Issues – Communication Primitives – Lamport’s
Logical Clocks – Deadlock handling strategies – Issues in deadlock detection and
II 12
resolution-distributed file systems –design issues – Case studies – The Sun
Network File System-Coda.
Real Time Operating System : Introduction – Applications of Real Time Systems
III – Basic Model of Real Time System – Characteristics – Safety and Reliability - 10
Real Time Task Scheduling
Operating Systems for Handheld Systems: Requirements –Technology –
IV Overview– Handheld Operating Systems –Palm OS-Symbian Operating System 12
Android – Architecture of android – Securing Handheld systems.
Case Studies: Linux System: Introduction – Memory Management – Process
Scheduling – Scheduling Policy - Managing I/O devices – Accessing Files- iOS:
V 12
Architecture and SDK Framework - Media Layer - Services Layer - Core OS
Layer - File System.
Total Hours 60
Text Books
Abraham Silberschatz, Peter Baer Galvin, Greg Gagne (2012), Operating System Concepts,
1.
9th Edition, John Wiley & Sons.
Mukesh Singhal and Niranjan G. Shivaratri (2001), Advanced Concepts in Operating
2. Systems –Distributed, Database, and Multiprocessor Operating Systems, 2nd Edition Tata
McGraw-Hill.
Reference Books
1. Rajib Mall (2006), Real-Time Systems: Theory and Practice, Pearson Education India.
Pramod Chandra P. Bhatt (2010), An introduction to operating systems, concept and practice,
2.
3rd Edition, PHI.
3. Daniel.P Bovet and Marco Cesati (2005), Understanding the Linux Kernel,3rd Edition.
Neil Smyth (2011), iPhone iOS 4 Development Essentials–Xcode, 4th Edition, Payload
4.
media.
Web Resources (Swayam / NPTEL)
1. https://onlinecourses.nptel.ac.in/noc20_cs04/preview
2. https://archive.nptel.ac.in/courses/106/105/106105172/

Department of Computer Science (PG) 17

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Exploratory Data
24MCS1AE Elective - I 4 4
Analysis

Course Objectives
The course intends to cover
 Methods for data preparation and data understanding.
 Techniques such as correlation analysis, time series and dimensionality reductions.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
Understand missing data in the real-world data sets by choosing
CLO1 appropriate methods. K1, K2

CLO2 Apply the data transformation techniques. K3

CLO3 Analyze the correlation and time series. K4

CLO4 Explain the importance of clustering algorithms and outlier detection. K5

CLO5 Evaluate dimensionality reduction and model development. K5

K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze; K5 - Evaluate

CLO-PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 3 2 3 3 3
CLO2 3 3 2 - 3
CLO3 3 3 3 - 2
CLO4 2 2 3 2 3
CLO5 3 3 3 3 3
3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 18

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective - I : Exploratory Data Analysis

No. of
Unit Content
Hours
Introduction to Exploratory Data Analysis: Steps in EDA, Data Types,
Numerical Data – Discrete data, continuous data – Categorical data –
I 10
Measurement Scales: Nominal, Ordinal, Interval, Ratio – Comparing EDA with
classical and Bayesian Analysis – Software tools for EDA.

Data Transformation: Transformation Techniques: Performing data

deduplication - replacing values – Discretization and binning. Introduction to
II 10
Missing data, handling missing data: Traditional methods - Maximum Likelihood
Estimation

Correlation Analysis and Time Series Analysis: Types of analysis: Univariate

analysis - bivariate analysis - multivariate analysis. Time Series Analysis (TSA):
III 12
Fundamentals of TSA - characteristics of TSA – Time based indexing -
visualizing time series – grouping time series data - resampling time series data.

Clustering Algorithms: Introduction to Spectral clustering – Document

clustering – Minimum Spanning Tree clustering. Overview of Model-based
IV 12
clustering – Expectation-Maximization algorithm – Hierarchical Agglomerative
model-based clustering. Outlier detection using Clustering.

Dimensionality Reduction: Linear Methods: Principal Component Analysis

(PCA) – Singular Value Decomposition – Factor Analysis -Intrinsic
Dimensionality. Non Linear methods: Multidimensional Scaling – Manifold
Learning – Self-Organizing Maps. Model Development and Evaluation:
V 16
Constructing linear regression model – evaluation – computing accuracy –
understanding accuracy. Understanding reinforcement learning: Difference
between supervised and reinforcement learning – Applications of reinforcement
learning.

Total Hours 60

Text Books

Suresh Kumar Mukhiya, Usman Ahmed, (2020), Hands-On Exploratory Data Analysis with
1.
Python, 1st Edition, Packt Publishing.

Martinez, W, Martinez A & J.L. Solka (2017), Exploratory Data Analysis with MATLAB,
2.
3rd Edition, CRC Press, A Chapman & Hall Book.

Department of Computer Science (PG) 19

KG College of Arts and Science (Autonomous) 2024 - 2025

Reference Books

1. Charu C. Aggarwal (2015), Data Mining the Textbook, Springer.

Craig K. Enders (2010), Applied Missing Data Analysis, 1st Edition, The Guilford
2.
Press.
Michael Jambu (1991), Exploratory and multivariate data analysis, 1st Edition,
3. Academic Press Inc.

Web Resources (Swayam / NPTEL)

1. https://drmcet.digimat.in/nptel/courses/video/103106112/L07.html

2. https://nptel.ac.in/courses/109107190

Department of Computer Science (PG) 20

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Blockchain Technology and
24MCS1BE Elective - I 4 4
Applications

Course objectives
The course intends to cover
 Fundamentals of blockchain and crypto currency.
 Blockchain security features and its significance.
 Problems and challenges in blockchain

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
CLO1 Reminisce blockchain technology and understand crypto currency. K1, K2
CLO2 Understand the mining mechanism in blockchain. K2

CLO3 Apply the Cryptocurrency and trust model. K3

CLO4 Interpret the Crypto economics and Cryptocurrency regulations. K2

CLO5 Analyze the challenges and opportunities in blockchain. K4
K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5
CLO1 3 2 3 - -

CLO2 3 3 3 2 2

CLO3 3 2 3 3 3

CLO4 2 3 3 3 2

CLO5 3 3 3 3 3

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 21

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective- I: Blockchain Technology and Applications

No. of
Unit Content
Hours
Introduction to Blockchain: The big picture of the industry – size,
growth, structure, players. Bit coin versus Crypto currencies versus
I Blockchain - Distributed Ledger Technology (DLT). Strategic analysis of 12
the space – Blockchain platforms, regulators, application providers. The
major application: currency, identity, chain of custody
Features of Blockchain: Advantage over conventional distributed
database – Blockchain Network, Mining Mechanism, Distributed
II 12
Consensus, Blockchain 1.0, 2.0 and 3.0 – transition, advancements and
features. Privacy, Security issues in Blockchain.
Cryptocurrency - History, Distributed Ledger, Bitcoin protocols -
Symmetric-key cryptography - Public-key cryptography - Digital
III Signatures -High and Low trust societies - Types of Trust model: Peer-to- 12
Peer, Leviathan, and Intermediary. Application of Cryptography to
Blockchain
Cryptocurrency Regulation - Stakeholders, Roots bit coin, Legal views -
IV exchange of cryptocurrency – Black Market – Global Economy. Cyrpto 12
Economics: assets, supply and demand, inflation & deflation – Regulation

Opportunities and challenges in Blockchain: Application of Blockchain

- Industry 4.0 – machine to machine communication –Data Management
V Industry 4.0 – future chain in Health 4.0 – Blockchain properties - 12
Healthcare Costs - Healthcare Quality - Healthcare Value - Challenges for
using Blockchain for healthcare data
Total Hours 60
Text Books
Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven
1. Goldfeder (2016), Bitcoin and Crypto Currency Technologies: A Comprehensive
Introduction, Princeton University Press.
2. Antonopoulos (2014), Mastering Bitcoin: Unlocking Digital Crypto Currencies,
O'Reilly Media.
Reference Books
1. Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System.
Rodrigoda Rosa Righi, Antonio Marcos Alberti, Madhusudan Singh (2020),
2.
Blockchain Technology for Industry 4.0, Springer.
Web Resources (Swayam / NPTEL)
1. https://onlinecourses.swayam2.ac.in/aic21_ge01/preview
2. https://onlinecourses.nptel.ac.in/noc24_cs15/announcements?force=true
3. https://nptel.ac.in/courses/106105184

Department of Computer Science (PG) 22

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Data Preprocessing and

24MCS1CE Elective - I 4 4
Visualization

Course Objectives
The course intends to cover
 Different types of databases.
 Data cleaning levels for data preprocessing.
 Data visualization using Python with 2D and 3D plotting.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
CLO1 Understand the basic concepts of data and types of databases. K1, K2

CLO2 Apply various levels of data cleaning in data preprocessing. K3

CLO3 Interpolate data integration and data reduction. K3

Explore the data transformation and visualization skills using
CLO4 K4
Python.
Infer advanced plotting techniques using matplotlib library in
CLO5 K3
Python.
K1 - Remember; K2 - Understand; K3 - Apply; K4 – Analyze

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 2 2 1 1

CLO2 2 2 2 - 2

CLO3 3 3 2 1 2

CLO4 3 3 1 - 3

CLO5 3 3 1 - 3

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 23

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective – I: Data Preprocessing and Visualization

No. of
Unit Content
Hours
Introduction: Data, Information, Knowledge and Wisdom (DIKW) pyramid –
DIKW for data analytics – Data Preprocessing for data analytics versus machine
I learning – Data Objects – Data Attributes – types of data values – Information 11
versus Pattern - Databases – Types of Databases – Connecting to, and pulling data
from databases.

The Preprocessing: Purpose of data analytics – Tools for data analytics - Levels
of data cleaning –Mapping the purposes and tools of analytics to the levels of data
II 11
cleaning – Cleaning up the table –Unpacking columns and reformulating the table
– restructuring the table – Missing values – Outliers – Errors.

Data Fusion and Data Integration: Data fusion versus Data integration –
Directions of data integration – Entity identification – Unwise data collection –
Index mismatched formatting – Aggregation mismatch – Duplicate data objects –
III data redundancy. Data Reduction: Objectives of data reduction – distinction 14
between data reduction and data redundancy – Random sampling – Stratified
sampling – Random over/under sampling – Performing dimensionality data
reduction.

Data Transformation and Massaging: Normalization and standardization –

Binary coding, ranking transformation and discretization – Attribute construction
– Feature extraction – Log transformation – Smoothing, aggregation and binning.
IV Data Visualization: Data visualization in Python – Matplotlib for data 12
visualization –Matplotlib figure with two subplots – Saving plots to file –
Customize plot – Changing line and marker styles – Adding annotations and text
– Creating subplots – Adjusting axis limits and tick marks – Using color maps.
Advanced Plotting Techniques 2D: Bar plot – Histogram – Box plot – Violin
plot – Area plot – Stacked area plot –Polar plot – Pie chart – Heatmap – Contour
plot – Hexbin plot – Stream plot. Advanced Plotting Techniques 3D: Surface
V 12
terrain plot – Quiver plot – Tri-surface plot – Wireframe plot – Ribbon plot –
Delaunay Triangulation plot – 3D polar plot – 3D Scatter plot – 3D Vector plot –
Animated plot.
Total Hours 60
Text Books
1. Roy Jafari (2022), Hands-on Data Preprocessing in Python, Packt Publishing Ltd.
2. Dr. Abhinav (2023), Data Visualization using Python Programming, Shashwat Publication.
Reference Books
1. Reis, Joe, Housley, Matt (2022), Fundamentals of Data Engineering, O’Reilly Media.
2. Ihab F. Ilyas, Xu Chu (2019), Data Cleaning, Association for Computing Machinery.

Department of Computer Science (PG) 24

KG College of Arts and Science (Autonomous) 2024 - 2025

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc22_cs32/preview
2. https://onlinecourses.nptel.ac.in/noc21_cs45/preview

Department of Computer Science (PG) 25

KG College of Arts and Science (Autonomous) 2024 - 2025

Components for Internal Assessment and

Distribution of Marks for CIA and ESE (Theory)
Marks
Components for CIA
for
Max
Best of
Marks Active
CIA ESE CIA – I CIA – II CIA-I & Model Attendance
Engagement
Total
CIA-II

Actual Weightage Actual Weightage Weightage Actual Weightage

100 25 75 5 5 25
50 5 50 5 5 75 10 25

Question Paper Pattern

Section A Section B Section C
Duration
Component Total
in Hrs. Type of No. of Type of No. of Type of No. of
question questions
Marks
question questions
Marks
question questions
Marks

CIA – I &II 2 MCQ 8 8x1=8 Either or 3 3x6=18 Either or 3 3x8=24 50

Model
3 MCQ 10 10x1=10 Either or 5 5x5=25 Either or 5 5x8=40 75
Exam /ESE

Components for Internal Assessment and Distribution of Marks

for CIA (Lab)

Marks for Components for CIA

Max Marks

CIA ESE Test – I Test - II Model Observation Total

Actual Weightage Actual Weightage Actual Weightage

100 40 60 5 40
50 10 50 10 60 15

Examination Pattern
Marks
Duration in
Component Total Weightage
Hrs. Practical Record
Marks
Test – I 2 50 - 50 10
Test – II 2 50 - 50 10
Model 3 60 - 60 15
ESE 3 50 10 60 -

Department of Computer Science (PG) 26

KG College of Arts and Science (Autonomous) 2024 - 2025

Part – IV : Ability Enhancement Compulsory Courses

(All the Postgraduate Programmes)

Course Code Course Name Category Hours/Week Credits

24QUA1AE Quantitative Aptitude AECC - I 2 2

Course Objectives
The course intends to cover

 Basic concepts of numbers, time and work, interests, data representation and graphs
 Concepts of permutation, probability, discounts, percentage & profit loss.
Course Learning Outcomes
On the successful completion of the course, students will be able to

CLO Knowledge
CLO Statements
Level

CLO1 Remember and Understand the concepts of numbers and average K1, K2

Understand about percentage and apply profit & loss related

CLO2 processing. K2, K3
To understand the concepts of time and work and interest
CLO3 calculations. K2
To understand about the concepts of permutation, combination and
CLO4 probability. K2

Understand , Apply and analyze the concept of problem solving

CLO5 involved in graphs and age. K2,,K3,K4

K1 - Remember; K2 - Understand; K3 - Apply; K4 -Analyze

Department of Computer Science (PG) 27

KG College of Arts and Science (Autonomous) 2024 - 2025

Ability Enhancement Compulsory Course(AECC) - I: Quantitative Aptitude

No. of
Unit Content
Hours
Numbers - Simplification - BODMAS rule - Algebraic formulas - Decimal
fractions - Square root and cube roots - Surds and indices - Divisibility rules -
I 6
HCF and LCM - same remainder - different remainder - application problems –
average – equation - mistaken value – replacement - including/excluding.

Percentage - increase/decrease – netchange – salary – election – marks –

consumption - population / machine - profit and loss - profit and loss % - finding
II 6
cp and sp - profit=loss - same product cp and sp with percentage – discount -
ratio and proportion - divided into parts - based on numbers - increase/decrease/
income / expenditure – coins – partnership.

Time-and-work - individual/combined - alternative days - remaining work -

efficiency based - amount split - chain rule - group of male and female or boys -
pipes and cistern - finding time - efficiency based – alternative - remaining part -
III 6
capacity of the tank - simple interest - finding principal - rate of interest – amount
- time period - doubles or triples - compound interest - finding rate - finding
time, principal - doubles or triples - difference between SI and CI.

Permutation - finding value - vowels come together - vowel never comes together
- some letters come together - no two vowels come together - vowels in odd/even
IV 6
places - based on repetition - circular permutation – application – combination -
finding value and application – probability – coins - dice-cards - balls and
miscellaneous problems - odd man out and number series.

Clock - finding angle - reflex angle - gain or loss – calendars - finding

particular day - data interpretation - bar chart - line chart - pie chart – table –
V 6
combined –ages ratio-twice or thrice - addition /subtraction - family based -
problems on numbers - equations.
Total Hours 30

Text Book
1. R.S. Aggarwal , Quantitative Aptitude, S.Chand & Company Ltd.,
Reference Book
1. Ashish Arora, Quantitative Aptitude.
Web Resources
1. https://www.javatpoint.com/aptitude/quantitative
2. https://www.indiabix.com/aptitude/questions-and-answers/

Department of Computer Science (PG) 28

KG College of Arts and Science (Autonomous) 2024 - 2025

Components for and Distribution of Marks for ESE (Theory)

Ability Enhancement Compulsory Course(AECC)

Duration in Hrs. Mode of exam Type of questions No. of questions Marks

2 Online MCQ 50 50x1=50

Department of Computer Science (PG) 29

KG College of Arts and Science (Autonomous) 2024 - 2025

Semester 2

Department of Computer Science (PG) 30

KG College of Arts and Science (Autonomous) 2024 - 2025

Semester - 2
Course Code Course Name Category Hours / Week Credits

24MCS21C Advanced Java Programming Core - V 5 4

Course Objectives
The course intends to cover
 Advanced concepts of Java programming.
 JDBC, Servlet packages, Java Server Pages and JAR file formats.
 GUI based program using swing concepts.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level

CLO1 Recite the basic and networking concepts of Java Programming. K1

CLO2 Understand the remote method invocation. K2

CLO3 Infer Java with databases and Hibernate. K3

Analyze Servlet and evaluate JSP for client and server web
CLO4 K4, K5
application.

CLO5 Create interactive applications using advanced techniques. K6

K1 - Remember; K2 - Understand; K3 - Apply; K4 – Analyze; K5 – Evaluate; K6 - Create

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 1 3 2 2

CLO2 3 2 1 3 3

CLO3 1 3 2 2 3

CLO4 2 3 3 1 2
CLO5 3 2 3 3 3
3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 31

KG College of Arts and Science (Autonomous) 2024 - 2025

Core V - Advanced Java Programming

No. of
Unit Content
Hours

Introduction: Java Basics Review: Components and event handling –

Threading concepts. Java Networking: Network Basics and Socket overview -
I 12
TCP/IP client sockets - TCP/IP server sockets – Datagrams - java.net package
Socket- Server Socket- Inet Address- URL- URL Connection

Remote Method Invocation: Distributed Application Architecture- Creating

II stubs and skeletons - Defining Remote objects- Remote Object Activation- 15
Object Serialization-Java Spaces

Database: Java in Databases- JDBC principles - database access- Interacting-

database search - Creating multimedia databases - Database support in web
III applications. Hibernate 4.0:Overview of Hibernate, Hibernate Architecture, 16
Hibernate Mapping Types, Hibernate O/R Mapping, Hibernate Annotation,
Hibernate Query Language

Java Servlets: Java Servlet and CGI programming- A simple java Servlet-
Anatomy of a java Servlet-Reading data from a client-Reading http request
header-sending data to a client and writing the http response header-working
IV 16
with cookies Java Server Pages: JSP Overview-Installation-JSP tags-
Components of JSP page-Expressions – Scriptlets - Directives-Declarations-A
complete example.

Advanced Techniques: JAR file format creation - Internationalization - Swing

V Programming - Advanced Java techniques. Java Server Faces2.0-Introduction to 16
JSF, JSF request processing Life cycle, JSF Components.

Total Hours 75

Text Books

1. Jamie Jaworski (1999), Java Unleashed, SAMST Tech Media Publications.

2. Campione, Walrath and Huml (1999), The Java Tutorial, Addison Wesley.
Reference Books
1. Cay S.Horstmann (2024), Core Java Advanced Features, Pearson education.

JimKeogh (2010), The Complete Reference J2EE, Tata McGraw Hill Publishing Company
2.
Ltd.

David Swayer McFarland (2011), Java Script and JQuery – The Missing Manual, 3rd Edition,
3.
Oreilly Publication.

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc22_cs47/preview

2. https://onlinecourses.swayam2.ac.in/nou24_cs09/preview

Department of Computer Science (PG) 32

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS22P Lab: Advanced Java Programming Core Lab - III 4 3

S. No. List of Programs

1. Basic Java program using OOPs concept.
2. Display a welcome message using Servlet.
3. Write a program to build a simple Client Server application using RMI.
Write a program using JDBC for creating a table, Inserting, deleting records and list out
4.
the records.
5. Prepare an Employee pay slip using JSP.
6. Creating a Database Application using Hibernate.
7. Program using Java Servlet to handle form data.
Develop a simple Servlet program to create a table of all the headers it receives along
8.
with their associated values.
9. Program in JSP by using session object.
10. Design a Purchase Order form using Html form and JSP.
11. Create a web application that utilizes UI components using Java Server Faces.
Create UI widgets and other components including windows, menus and buttons using
12.
AWT and Swing.
Program to send a text message to another system and receive the text message from the
13.
system (use socket programming).
Total Hours 60
Text Books
1. Jamie Jaworski (1999), Java Unleashed, SAMST Tech Media Publications.
2. Campione, Walrath and Huml (1999), The Java Tutorial, Addison Wesley.
Reference Books
1. Cay S.Horstmann (2024), Core Java Advanced Features, Pearson education.
JimKeogh (2010), The Complete Reference J2EE, Tata McGraw Hill Publishing
2.
Company Ltd.
David Swayer McFarland (2011), Java Script and JQuery – The Missing Manual, 3rd
3.
Edition, Oreilly Publication.
Web Resources (Swayam / NPTEL)
1. https://onlinecourses.nptel.ac.in/noc22_cs47/preview
2. https://onlinecourses.swayam2.ac.in/nou24_cs09/preview
3. https://onlinecourses.nptel.ac.in/noc19_cs84/preview
4. https://onlinecourses.nptel.ac.in/noc21_cs03/preview

Department of Computer Science (PG) 33

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Artificial Intelligence and Machine
24MCS23C Core - VI 5 4
Learning

Course Objectives
The course intends to cover
 Functions of AI, General Search Techniques.
 Concepts of representations, mappings and predicate logic.
 Machine Learning with Data Mining, Big Data and Cloud.
 Applications and impact of Machine Learning.
Course Learning Outcomes
On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
CLO1 Demonstrate AI problems and design the techniques. K1, K2
Understand knowledge designing techniques and use algorithms for
CLO2 K2, K3
ML training.
Apply basic principles of AI in solutions that require problem
CLO3 solving, inference, perception, knowledge representation, and K3, K4
learning.
Explore the impact of machine learning on applications for real time
CLO4 K4
implementation.
Analyze real-world problems for implementation and understand
CLO5 K4
the dynamic behaviour of a system.
K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5
CLO1 1 2 3 3 3

CLO2 1 2 3 3 3

CLO3 3 2 3 3 3

CLO4 3 2 3 3 3

CLO5 3 2 3 3 3

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 34

KG College of Arts and Science (Autonomous) 2024 - 2025

Core – VI: Artificial Intelligence and Machine Learning

No. of
Unit Content
Hours
Introduction: AI Problems - Al techniques - Criteria for success. Problems,
I Problem Spaces, Search: State space search - Production Systems - Problem 14
Characteristics - Issues in design of Search.
Heuristic Search techniques: Generate and Test - Hill Climbing- Best-First,
Problem Reduction, Constraint Satisfaction, Means-end analysis. Knowledge
II representation issues: Representations and mappings -Approaches to 15
Knowledge representations -Issues in Knowledge representations - Frame
Problem.
Using Predicate logic: Representing simple facts in logic - Representing
Instance and Isa relationships - Computable functions and predicates -
III Resolution - Natural deduction. Representing knowledge using rules: 16
Procedural Vs Declarative knowledge- Logic programming –Forward Vs
Backward reasoning -Matching-Control knowledge.
Understanding Machine Learning: Introduction to Machine Learning-
defining Big Data –Big Data in Context with Machine Learning-The
IV Importance of the Hybrid Cloud-Leveraging the Power of Machine Learning - 16
The Roles of Statistics and Data Mining with Machine Learning-Putting
Machine Learning in Context-Approaches to Machine Learning.
Looking Inside Machine Learning: The Impact of Machine Learning on
V 14
Applications – Data Preparation-The Machine Learning Cycle.
Total Hours 75
Text Books
Elaine Rich and Kevin Knight (2017), Artificial Intelligence, Tata McGraw Hill
1.
Publishers company Pvt Ltd, 2nd Edition.
Stuart J. Russell and Peter Norvig (2010), Artificial Intelligence A Modern Approach, 3rd
2.
Edition, Pearson Education.
3. Denis Rothmanl (2022), Artificial Intelligence, By Example 2nd Edition, Packt.
4. Vinod Chandra, (2022) Artificial Intelligence and Machine Learning, 1st Edition, kindle.
Reference Books
1. George F Luger (2002), Artificial Intelligence, 4th Edition Pearson Education Publication.
Judith Hurwitz, Daniel Kirsch (2010), Machine Learning For Dummies IBM Limited
2.
Edition.
Web Resources (Swayam / NPTEL)
1. https://nptel.ac.in/courses/106106226
2. https://nptel.ac.in/courses/106106140
3. https://nptel.ac.in/domains/discipline/106?course=106_0
4. https://nptel.ac.in/courses/106106158
5. https://nptel.ac.in/courses/106101360

Department of Computer Science (PG) 35

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

Lab: Artificial Intelligence
24MCS24P Core Lab - IV 4 3
and Machine Learning

S. No. List of Programs

1. Basics of PROLOG Programming language and its Functions.

2. Write simple facts for the statements using PROLOG.

3. Implementation of Depth First Search for Water Jug problem.

4. Implementation of Breadth First Search for Tic-Tac-Toe problem.

5. Solve an 8-puzzle problem using Best First Search.

6. Write a PROLOG program to solve the N-Queens problem.

7. Implementation of Traveling Salesman Problem

8. Implementation of Python Basic Libraries such as Math, NumPy and SciPy

9. Implementation of Python Libraries for ML applications such as Pandas and Matplotlib.

Total Hours 60

Text Books
1. George F Luger (2022), Artificial Intelligence, 4th Edition Pearson Education Publication.

2. Vinod Chandra (2022), Artificial Intelligence and Machine Learning, 1st Edition, kindle.

Reference Books

1. Denis Rothmanl (2022), Artificial Intelligence by Example 2nd Edition, Packt.

Judith Hurwitz, Daniel Kirsch (2010), Machine Learning for Dummies, IBM Limited
2.
Edition.
Web Resources (Swayam / NPTEL)

1. https://nptel.ac.in/courses/106106226
2. https://nptel.ac.in/courses/106106140

Department of Computer Science (PG) 36

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS25C Data Mining Core - VII 4 4

Course Objectives
The course intends to cover
 Various data mining algorithms to solve real-world problems.
 Classification, prediction, clustering and association rule mining of Data mining process.
Course Learning Outcomes
On the successful completion of the course, students will be able to
Knowledge
CLO CLO Statements
Level

CLO1 Understand the basic data mining techniques and algorithms K1, K2

CLO2 Interpret the Association rules, Clustering techniques. K2, K3

Analyze and evaluate different data mining techniques like
CLO3 K4, K5
classification, prediction, Clustering and association rule mining.

CLO4 Explore statistical methods and visualization techniques. K4

Apply appropriate data mining algorithms to solve real world
CLO5 K3
problems.
K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze ; K5-Evaluate

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 3 2 2 - 2

CLO2 3 2 2 - 2

CLO3 3 3 3 2 2

CLO4 3 3 3 3 3

CLO5 3 3 3 3 3

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 37

KG College of Arts and Science (Autonomous) 2024 - 2025

Core – VII : Data Mining

No. of
Unit Content
Hours
Basic data mining tasks – data mining versus knowledge discovery in
databases – data mining issues – data mining metrics – social implications of
I data mining – data mining from a database perspective. Data mining techniques: 12
Introduction – a statistical perspective on data mining – similarity measures –
decision trees – neural networks – genetic algorithms.
Classification: Introduction –Statistical –based algorithms -distance–based
II algorithms-decision tree-based algorithms-neural network–based algorithms – 12
rule – based algorithms – combining techniques.

Clustering: Introduction–Similarity and Distance Measures – Outliers –

Hierarchical Algorithms – Partitional Algorithms. Association rules:
III Introduction - large item sets - basic algorithms – parallel & distributed 12
algorithms – comparing approaches- incremental rules – advanced association
rules techniques – measuring the quality of rules.
Statistical Descriptions and Data Visualization: Basic Statistical Descriptions
of Data - Measuring the Central Tendency: Mean, Median, and Mode -
Measuring the Dispersion of Data: Range, Quartiles, Variance, Standard
Deviation, and Interquartile Range - Graphic Displays of Basic Statistical
IV Descriptions of Data. 14
Data visualization: Pixel-Oriented Visualization Techniques- Geometric
Projection Visualization Techniques - Icon-Based Visualization Techniques -
Hierarchical Visualization Techniques - Visualizing Complex Data and
Relations.

Data Mining Trends And Research Frontiers: Mining Complex Data Types,
V 10
Other Methodologies of Data Mining, Data Mining Applications, Data Mining
and Society, Data Mining trends.
Total Hours 60

Text Books

Margaret H Dunham (2003), Data Mining Introductory and Advanced topics, Pearson
1.
Education/Prentice Hall.
Jiawei Han & Micheline Kamber (2012), Data Mining Concepts & Techniques, 3rd
2.
Edition, Academic press.
Reference Books
1. Arun K Pujari (2003), Data Mining Techniques, 3rd Edition, Universities Press.
Alex Berson, Stephen J. Smith (2001), Data Warehousing, Data Mining and OLAP,
2.
TMCH.

Department of Computer Science (PG) 38

KG College of Arts and Science (Autonomous) 2024 - 2025

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc24_cs22/preview

2. https://onlinecourses.swayam2.ac.in/cec19_cs01/preview

Department of Computer Science (PG) 39

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS2AE Big Data Analytics Elective - II 4 4

Course Objectives
The course intends to cover
1. R Programming, Mapreduce and Hadoop based analytics and HDFS architecture.
2. Big data collection and analysis.
3. Project development under big data.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level
CLO1 Interpret the basic and importance of big data. K1, K2

CLO2 Understand the R language and its application with big data. K2

CLO3 Apply the Hadoop features and HDFS. K3

CLO4 Infer the security controls in big data. K3

Analyze HDFS, MapReduce architecture and Machine learning
CLO5 K4
concepts.
K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 3 2 - 3 3
CLO2 3 2 3 3 2
CLO3 2 3 2 - 3
CLO4 2 2 - 3 2
CLO5 3 - - 2 3
3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 40

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective - II : Big Data Analytics

No. of
Unit Content
Hours
Importance of Big Data: Introduction to big data analytics - what is big data? -
Challenges in big data - Big data in business perspectives - Big data from
technology perspectives - 5 V’s of big data - Importance of Big Data: A Flood of
I 12
Mythic. Industry Examples of Data: Digital Marketing and the Non - line World –
Database Marketers, Pioneers of Big Data – Big Data and the New School of
Marketing.
Data analytics tools for Big Data: An overview of analytics tools : R & Hadoop
- Installing R - Installing RStudio - Understanding the features of R language -
Using R - packages - Performing data operations - Increasing community support
II 10
- Performing data modeling in R.- Hadoop environment - Core component of
hadoop - Mapreduce working methodology - Case study: Walmart data
processing.
HDFS and Storage of data: Understanding Hadoop features - Understanding
HDFS - Understanding the characteristics of HDFS - Understanding MapReduce -
Learning the HDFS and MapReduce architecture. Big Data Storage - Big Data
III 14
Storage Challenges - Key Insights for Big Data Storage - Data storage methods:
Warehouse Storage - Cloud Storage. Data Storage Technologies: Hadoop -
HBase. Case Study: Health care data storage and challenges.
Security Planning in Big data: Big data security - Important to secure big data -
The architecture of big data security - Big data security works - Types of data
IV 12
security controls - The major big data security challenges - The big data security
best practices. The best security tools for big data storage.
MapReduce Architecture & ML: Understanding the HDFS architecture -
Understanding HDFS components - Understanding the MapReduce architecture -
V 12
Understanding MapReduce components. Machine Learning: Introduction,
Supervised Learning, Unsupervised Learning, Big Data Analytics with R.
Total Hours 60
Text Books

1. Michael Minelli , Michele Chambers , Ambiga Dhiraj (2014), Big Data Big Analytics, Wiley
Publications, Indian Reprint.
2. Wiley, John Wiley and Sons (2015), Data Science in Big Data Analytics.
Reference Books
1. Vignesh Prajapati (2013), Big Data Analytics with R and Hadoop, PACKT Publishing.
Chris Eaton, Dirk Deroos,Tom Deutsch, George Lapis, Paul Zikopoulos (2012),
3. Understanding Big Data, Analytics for Enterprise Class Hadoop and Streaming Data, Tata
Mc Graw Hill.
Web Resources (Swayam / NPTEL)
1. https://onlinecourses.nptel.ac.in/noc20_cs92/preview

Department of Computer Science (PG) 41

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS2BE Ethical Hacking Elective - II 4 4

Course Objectives
The course intends to cover
 Fundamentals of hacking, foot printing and scanning.
 Threats caused by malware, denial of service, sniffers and session hijacking.
 Problems and solutions for web server and database server hacking.
 Attacks of mobile security, wireless technologies, IDS and firewalls.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level

CLO1 Understand the foundations of Ethical hacking. K1, K2

Defend the concepts of foot printing, windows enumeration and system

CLO2 K2
hacking.

CLO3 Explore the various forms of malware threats. K4

CLO4 Analyze on the web server and web application hacking. K4

CLO5 Apply the concept of firewalls, honeypots and physical security. K3

K1 - Remember; K2 - Understand; K3 - Apply; K4 - Analyze

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 2 1 3 2 2

CLO2 3 2 1 3 3

CLO3 1 3 2 2 3

CLO4 2 3 3 1 2

CLO5 3 2 3 3 3

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 42

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective- II: Ethical Hacking

No. of
Unit Content
Hours

An Introduction to ethical Hacking: Security Fundamental - Security testing -

Hacker and Cracker – Descriptions - Test Plans - keeping It legal - Ethical and
I 10
Legality. The Technical Foundations of Hacking: The Attacker’s Process -The
Ethical Hacker’s Process - Security and the Stack.

Foot printing and scanning: Information Gathering, Determining the Network

Range, Identifying Active Machines, Finding Open Ports and Access Points, OS
Fingerprinting Services, Mapping the Network Attack Surface. Enumeration and
II 14
System Hacking : Windows Enumeration - NetBIOS and LDAP Enumeration -
SNMP Enumeration - Nontechnical Password Attacks - Technical Password
Attacks - Privilege Escalation and Exploiting Vulnerabilities

Malware Threats: Viruses and Worms - Trojans - Covert Communication -

Keystroke Logging and Spyware - Malware Counter measures – Sniffers.
III 11
Session Hijacking and Denial of Service : Sniffers - Session Hijacking - Denial of
Service and Distributed Denial of Service

Web Server - Applications and Database Attacks: Web Server Hacking - Web
Application Hacking - Database Hacking - Wireless Technologies - Mobile
IV Security and Attacks : Wireless Technologies - Mobile Device Operation and 13
Security - Wireless LANs - Wireless Hacking Tools - Securing Wireless
Networks

IDS - Firewalls and Honeypots : Intrusion Detection Systems - Firewalls -

V Honeypots - Physical Security and Social Engineering: Physical Security - Social 12
Engineering

Total Hours 60

Text Books

Michael Gregg (2017), Certified Ethical Hacker, Version 9, 2nd Edition, Pearson IT
1.
Certification.

2. Ankit Fadia, The Unofficial Guide to Ethical Hacking, Premier Press.

Reference Books

Gray hat hacking (2011), The Ethical hackers handbook – Allen Harper,Shon Harris,
1.
Jonathan Ness, 3rd Edition, Mc GrawHill.

2. Alana Maurushat (2019), Ethical Hacking University of Ottawa Press.

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc23_cs44/preview

2. https://onlinecourses.nptel.ac.in/noc22_cs13/preview

Department of Computer Science (PG) 43

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS2CE Neural Networks and Deep

Elective - II 4 4
Learning

Course Objectives
The course intends to cover
 Neural networks in engineering, artificial intelligence and cognitive modelling.
 Supervised learning in neural networks.
 Role of machine learning and deep neural networks.

Course Learning Outcomes

On the successful completion of the course, students will be able to

Knowledge
CLO CLO Statements
Level

CLO1 Recite the basics of neural networks. K1

CLO2 Understand the various techniques of single layer perceptron. K2

CLO3 Apply the back propagation techniques. K3

CLO4 Interpolate the basics of machine learning. K2

CLO5 Infer the newer optimization methods for deep neural networks. K3

K1 - Remember; K2 - Understand; K3 - Apply

CLO – PLO Mapping

CLOs/PLOs PLO1 PLO2 PLO3 PLO4 PLO5

CLO1 1 1 1 2 2

CLO2 2 2 2 2 2

CLO3 2 3 2 2 2

CLO4 1 2 2 2 2

CLO5 2 3 2 2 2

3 - Substantial (high) 2 - Moderate (medium) 1 - Slight (low)

Department of Computer Science (PG) 44

KG College of Arts and Science (Autonomous) 2024 - 2025

Elective II : Neural Networks and Deep Learning

No. of
Unit Content
Hours

Introduction: Overview of neural network - Human Brain - Models of a Neuron -

I Neural networks viewed as Directed Graphs-Network Architectures - Knowledge 11
Representation, Artificial Intelligence and Neural Networks

Single Layer Perceptron: Adaptive filtering problem - Unconstrained

Organization Techniques - Linear least square filters - least mean square algorithm
II - learning curves- Learning rate annealing techniques- perception –convergence 13
theorem - Relation between perception and Bayes classifier for a Gaussian
Environment

Back Propagation: Back propagation and differentiation - Hessian matrix -

Generalization - Cross validation - Network pruning Techniques - Virtues and
III 12
limitations of back propagation learning - Accelerated convergence - supervised
learning.

Introduction to Machine Learning: Scalars – Vectors – Matrices – Tensors –

Identity and Inverse Matrices – Linear Dependence and Span– Eigen
IV Decomposition – Probability – Random Variables – Conditional Probability – 13
Expectation –Variance – Covariance –Bayes’ Rule – Supervised Learning
Algorithm – Unsupervised Learning Algorithm.

Deep Neural Networks: Difficulty of training deep neural networks- Greedy layer
wise training. Better Training of Neural Networks: Newer optimization
V 11
methods for neural networks - second order methods for training - Saddle point
problem in neural networks.

Total Hours 60

Text Books

1. Ian Goodfellow, Yoshua Bengio and Aaron Courville (2017), Deep Learning, MIT Press.

2. Charu C. Aggarwal (2018), Neural Networks and Deep Learning.

Reference Books

1. Umberto Michelucci (2018), Applied Deep Learning. A Case-based Approach to

Understanding Deep Neural Networks.

2. Kevin P. Murphy (2012), Machine Learning: A Probabilistic Perspective, The MIT Press.

3. Aaron Courville, Ian Goodfellow, Yoshua Bengio (2016), Deep Learning (Adaptive
Computation and Machine Learning series).

4 Haykin (2016), Neural Networks and Learning Machines.

Department of Computer Science (PG) 45

KG College of Arts and Science (Autonomous) 2024 - 2025

Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc20_cs88/preview

2. https://onlinecourses.nptel.ac.in/noc24_ge17/preview

3. https://onlinecourses.nptel.ac.in/noc24_ee01/preview

Department of Computer Science (PG) 46

KG College of Arts and Science (Autonomous) 2024 - 2025

Course Code Course Name Category Hours / Week Credits

24MCS26P Lab: Data Mining SEC Lab - I 2 3

S. No. List of Programs

1. Perform data cleaning techniques for a data set.
Perform Data Normalization using min-max, z-score and normalization by decimal
2.
scaling methods.
3. Find the outliers using various Outlier detection methods.
4. Implement k-means clustering technique.
5. Implement any one Hierarchical Clustering.
6. Implement Classification algorithm.
7. Implement Decision Tree.
8. Linear Regression.
9. Implement Apriori algorithm to extract association rule of data mining.
10. Data Visualization.

Total Hours 30

Text Books
Margaret H Dunham (2003), Data Mining Introductory and Advanced topics, Pearson
1.
Education/Prentice Hall.
Jiawei Han & Micheline Kamber, (2012), Data Mining Concepts & Techniques, 3rd
2.
Edition, Academic press.
Reference Books

1. Arun K Pujari (2003) Data Mining Techniques, 3rd Edition, Universities Press.
Alex Berson, Stephen J. Smith (2001), Data Warehousing, Data Mining and OLAP,
2.
MCH.
Web Resources (Swayam / NPTEL)

1. https://onlinecourses.nptel.ac.in/noc24_cs22/preview

2. https://onlinecourses.swayam2.ac.in/cec19_cs01/preview

Department of Computer Science (PG) 47

KG College of Arts and Science (Autonomous) 2024 - 2025

Components for Internal Assessment and

Distribution of Marks for CIA and ESE (Theory)
Marks
Components for CIA
for
Max
Best of
Marks Active
CIA ESE CIA – I CIA – II CIA-I & Model Attendance
Engagement
Total
CIA-II

Actual Weightage Actual Weightage Weightage Actual Weightage

100 25 75 5 5 25
50 5 50 5 5 75 10 25

Question Paper Pattern

Section A Section B Section C
Duration
Component Total
in Hrs. Type of No. of Type of No. of Type of No. of
question questions
Marks
question questions
Marks
question questions
Marks

CIA – I &II 2 MCQ 8 8x1=8 Either or 3 3x6=18 Either or 3 3x8=24 50

Model
3 MCQ 10 10x1=10 Either or 5 5x5=25 Either or 5 5x8=40 75
Exam /ESE

Components for Internal Assessment and Distribution of Marks

for CIA (Lab)

Marks for Components for CIA

Max Marks

CIA ESE Test – I Test - II Model Observation Total

Actual Weightage Actual Weightage Actual Weightage

100 40 60 5 40
50 10 50 10 60 15

Examination Pattern
Marks
Duration in
Component Total Weightage
Hrs. Practical Record
Marks
Test – I 2 50 - 50 10
Test – II 2 50 - 50 10
Model 3 60 - 60 15
ESE 3 50 10 60 -

Department of Computer Science (PG) 48

KG College of Arts and Science (Autonomous) 2024 - 2025

Part – IV : Ability Enhancement Compulsory Courses

(All the Postgraduate Programmes)

Course Code Course Name Category Hours / Week Credits

24SOF2AE Soft Skills AECC - II 2 2

Course Objectives
The course intends to cover
 The essential soft skills that is crucial for success in today's dynamic and
interconnected workplace.

Course Learning Outcomes

On the successful completion of the course, students will be able to
Knowledge
CLO CLO Statements Level
Understand the comprehensive skills to participate actively in
CLO1 K1, K2, K3
conversation, writing short texts with expression
Infer the cohesive devices to describe and discuss any objects,
CLO2 K2, K3
pictures using compound, complex sentence forms.
Comprehend the logic in the given situation to organize the ideas to
CLO3 K2, K3
write formal and informal letters.
Understand the given material to organize it in a logical sequence to
CLO4 present a paragraph with main and supporting ideas with concluding K3
sentences.
Present valuable ideas in conversation to emulate the main ideas and
CLO5 K3
key points in short essays.

K1 - Remember; K2 - Understand; K3 - Apply;

Department of Computer Science (PG) 49

KG College of Arts and Science (Autonomous) 2024 - 2025

Ability Enhancement Compulsory Course - II : Soft Skills

No. of
Unit Details
Hours
Presentation Skills : Getting to Know You: Grammar: Introduction to Tenses;
Listening: Fill in the blanks; Speaking: Self Introduction, Everyday English, Role-
Play; Reading: Different ways of communication. My Day: Grammar: Present
simple positive & negative / Adverbs of Frequency; Vocabulary & Speaking:
Daily Activities; Listening: Observe and Answer / Telling the time; Reading &
Writing: Describe where you live. Your World: Grammar: Possessive
determiners; Vocabulary & Speaking: Talk about countries, nationalities;
Listening: Positive & negative contractions; Reading & Writing: Personal profile.
I 6
The World Of Work: Grammar: Yes/No & Wh Questions; Vocabulary &
Speaking: Jobs; Listening: Recognize the schwa sound; Reading & Writing:
Opening and closing an email. .Places And Things: Grammar: There is / there are,
articles; Vocabulary & Speaking: Talk about rooms & furniture; Listening:
Directions; Reading & Writing: Imperatives.24 Hours: Grammar: Likes &
Dislikes; Vocabulary & Speaking: Speak about hobbies and interests; Listening:
Observe & answer; Reading: Match the photos with descriptions; Writing: Write
complete sentence using prompts;
Confidence : Clothes and Shopping: Grammar: Modal verbs / Adverbs of
Frequency / Adjectives and Adverbs; Vocabulary & Speaking: Shopping;
Listening: Observe and Answer; Reading & Writing: Product Review. Travel &
Transport: Grammar: Past simple questions; Vocabulary & Speaking: Talk about
holidays; Listening: At the train station; Reading & Writing: Email - A perfect
holiday. Health & Fitness: Grammar: Past simple irregular verbs; Vocabulary &
II Speaking: Talk about a healthy lifestyle; Listening: Listen & Answer; Reading & 6
Writing: Time sequencers. Music: Grammar: Present perfect simple; Vocabulary
& Speaking: Survey about music; Listening: Listen two people talk about music;
Reading: Use adjectives and create sentences. Let’s go shopping: Grammar:
Countable & Uncountable; Vocabulary & Speaking: Town Survey; Listening:
Listen and answer; Reading & Writing: Read and match

Creativity :Cooking & Eating: Grammar: Some & Any, Quantifiers; Vocabulary
& Speaking: Food & Drink; Listening: Kitchen conversation; Reading & Writing:
Article reading & answering. Survival: Grammar: Comparison of adjectives;
Vocabulary & Speaking: Describing people; Listening: Listen & Answer; Reading
& Writing: Read and Answer. Working Together: Grammar: Verb + Noun
phrases; Vocabulary & Speaking: Talk about technology; Listening: Listen &
III 6
Answer; Reading & Writing: Notice. Music: Grammar: Present perfect simple;
Vocabulary & Speaking: Survey about music; Listening: Listen two people talk
about music; Reading: Use adjectives and create sentences. Culture and Arts:
Grammar: Present perfect; Vocabulary & Speaking: Speak on the phone;
Listening: Listen and answer; Reading & Writing: Review

Department of Computer Science (PG) 50

KG College of Arts and Science (Autonomous) 2024 - 2025

Unit Content

Problem-Solving :Do’s and Don’ts: Grammar: Modal verbs; Vocabulary &

Speaking: Role play; Listening: Holidays in January; Reading & Writing: Article
reading & answering. Body: Grammar: First conditional; Vocabulary & Speaking:
Personality & Appearance; Listening: Listen to conversations about personality;
IV Reading & Writing: Read and Answer about your skills. Speed: Grammar: Present 6
simple passive; Vocabulary & Speaking: Talk about relationships; Listening:
Listen & Answer; Reading & Writing: Error spotting. Work: Grammar: Adverbs
of manner; Vocabulary & Speaking: Talk about work advice; Listening: Observe
& Answer; Reading: Read & check your ideas

Critical Thinking : Influence: Grammar: would / past habits; Listening: Sentence

Correction; Speaking & Vocabulary: Your inspiration; Reading: Picture
description; Writing: Rewrite the sentences. Money: Grammar: Second
V conditional; Listening: radio programme; Speaking & Vocabulary: Talk about 6
games; Reading & Writing: Fill in the blanks. Things that changed the world:
Grammar: articles; Speaking & Listening: Talk about chewing gum; Reading &
Writing: Read and write a book review

Total Hours 30

Components for and Distribution of Marks for ESE (Theory)

Ability Enhancement Compulsory Course(AECC)

Duration in Hrs. Mode of Exam Type of Questions No. of Questions Marks

2 Online MCQ 50 50x1=50

Department of Computer Science (PG) 51