THE MAHATMA GANDHI UNIVERSITY

UNDERGRADUATE PROGRAMMES (HONOURS)

SYLLABUS

MGU-UGP (Honours)

(2024 Admission Onwards)

Faculty: Science

BoS: Computer Application (UG)

Programme: Bachelor of Science (Honours) Computer Science

Mahatma Gandhi University

Priyadarshini Hills
Kottayam – 686560, Kerala, India

Page 1 of 222
 Contents

Sl.No Title

1 Preface

2 Board of Studies & External Experts

3 Semester 1 Course 1 Art of Computing and Problem Solving

4 Semester 1 Course 2 Cyber Laws and Online Safety

5 Semester 1 Course 3 Internet and Web Technologies

6 Semester 2 Course 1 Python Programming

7 Semester 2 Course 2 Data Visualization using Python

8 Semester 2 Course 3 Mastering Spreadsheets

9 Semester 3 Course 1 Database Management Systems

10 Semester 3 Course 2 Data Structures using C

Semester 3 Course 3 Introduction to Data Science (Data Science and

11 Analytics Specialization)

Semester 3 Course 4 Introduction to Mobile and Web Technologies (Web

12 and Mobile Technologies Specialization)

Semester 3 Course 5 Introduction to Embedded Systems (Embedded

13 Systems and User Interface Design Specialization)

14 Semester 3 Course 6 Python for Data Analytics (Minor for Others)

15 Semester 3 Course 7 Cloud Computing Essentials

16 Semester 3 Course 8 White Hat Hacking

17 Semester 4 Course 1 OOPs Concepts using JAVA

18 Semester 4 Course 2 Computer Networks

Semester 4 Course 3 Data Mining (Data Science and Analytics

19 Specialization)

Semester 4 Course 4 Mobile App Development (Web and Mobile

20 Technologies Specialization)

Semester 4 Course 5 System Programming (Embedded Systems and User

21 Interface Design Specialization)

Page 2 of 222
 Semester 4 Course 6 Introduction to Database Management Systems
22 (Minor for Others)

23 Semester 4 Course 7 Foundations of Data Science

24 Semester 4 Course 8 Computer Hardware Maintenance

25 Semester 4 Course 9 Visualization Tools for Data Analytics

26 Semester 4 Course 10 Green Computing Techniques

Internship

27 Semester 5 Course 1 Software Engineering

28 Semester 5 Course 2 Operating Systems

29 Semester 5 Course 3 Computer Security

30 Semester 5 Course 4 Resource Optimization Techniques

Semester 5 Course 5 Artificial Intelligence (Data Science and Analytics

31 Specialization)

Semester 5 Course 6 Web Designing using PHP (Web and Mobile

32 Technologies Specialization)

Semester 5 Course 7 Design Principles of User Computer Interaction

33 (Embedded Systems and User Interface Design Specialization)

34 Semester 5 Course 8 Software Development Lab 1

35 Semester 6 Course 1 Cloud Computing

36 Semester 6 Course 2 Software Development Lab 2

Semester 6 Course 3 Big Data Analytics (Data Science and Analytics

37 Specialization)

Semester 6 Course 4 Internet of Things (Web and Mobile Technologies

38 Specialization)

Semester 6 Course 5 Understanding MP and MC Architecture

39 (Embedded Systems and User Interface Design Specialization)

40 Semester 6 Course 6 Machine Learning using Python

41 Semester 6 Course 7 Natural Language Processing

42 Semester 6 Course 8 User Centric Computing and Software Standards

43 Semester 7 Course 1 Advanced Java Programming

44 Semester 7 Course 2 Advanced Database Management Systems

45 Semester 7 Course 3 Advanced Data Structures

Page 3 of 222
46 Semester 7 Course 4 Advanced Operating System Concepts

47 Semester 7 Course 5 Digital Image Computing

48 Semester 7 Course 6 Big Data Management Using R

49 Semester 8 Course 1 Advanced Computer Networks

50 Semester 8 Course 2 Computational Research Methodology

51 Semester 8 Course 3 Neural Networks and Deep Learning

52 Semester 8 Course 4 Pattern Recognition

53 Semester 8 Course 5 Generative AI

54 PROJECT/Dissertation

55 Syllabus Revision Workshop Participants

Page 4 of 222
 Preface
The Outcome-Based Syllabus (OBS) presented herein is designed for the MGU UGP Honours
Programme in Computer Science. This syllabus is a result of comprehensive research, analysis,
and collaboration among educators, industry professionals, and stakeholders to ensure
alignment with the dynamic landscape of Computer Science education and industry demands.
The primary objective of this syllabus is to equip students with the knowledge, skills, and
competencies necessary to excel in the field of computer science and its diverse applications. By
focusing on outcomes, this syllabus aims to foster critical thinking, problem-solving abilities,
creativity, and adaptability among students, preparing them for the challenges and
opportunities of the digital era.
Key features of the Syllabus include:
● Alignment with Industry Needs: The syllabus is designed to reflect current industry
trends, technologies, and best practices, ensuring that graduates are well-prepared for
careers in various sectors including software development, cybersecurity, data science,
artificial intelligence, and more.
● Emphasis on Core Concepts: Core principles and foundational concepts of computer
science form the backbone of the syllabus, providing students with a strong theoretical
understanding that underpins practical applications.
● Integration of Practical Experience: Hands-on experience, laboratory work, projects, and
internships are integral components of the syllabus, enabling students to apply theoretical
knowledge in real-world scenarios and develop practical skills.
● Interdisciplinary Approach: Recognizing the interdisciplinary nature of computer
science, the syllabus incorporates elements from related fields such as mathematics,
engineering, and cognitive science, fostering a holistic understanding of computational
systems and their impact on society.
● Continuous Evaluation and Feedback: The syllabus emphasizes continuous assessment
and feedback mechanisms to track student progress, identify areas for improvement, and
adapt teaching methodologies accordingly, ensuring the effectiveness of the educational
process.
● Flexibility and Adaptability: The syllabus is designed to be flexible and adaptable to
accommodate advancements in technology, changes in industry requirements, and
feedback from stakeholders, thereby ensuring its relevance and currency over time.
We believe that the Outcome-Based Syllabus presented here will serve as a guiding framework
to empower students to become competent, ethical, and innovative professionals in the field of
Computer Science and Computer Applications. It is our hope that this syllabus will inspire a
lifelong passion for learning and exploration in the ever-evolving realm of technology.

Page 5 of 222
Board of Studies & External Experts
Board of Computer Application (UG), Mahatma Gandhi University, Kottayam

External Experts

Prof. (Dr.) Bindu V R, Professor and Head, School of Computer Sciences, Mahatma
1
Gandhi University, Kottayam

Prof. (Dr.) Sabu M K, Professor, Department of Computer Applications, Cochin

2
University of Science and Technology, Kochi

Members of Board of Studies, Computer Application (UG)

Dr. Rajimol A, Associate Professor, Department of Computer Applications, Marian

1
College Kuttikkanam (Autonomous), Kuttikkanam (Chairperson UG Board)

Dr. Ajitha R S, Assistant Professor, Department of Computer Applications, NSS

2
College, Rajakumari

Mr. Bineesh Jose, Assistant Professor, Department of Computer Applications,

3
Pavanatma College, Murickassery

Dr. Reji K Kollinal, Assistant Professor, Department of Computer Applications,

4
BPC College, Piravom

Ms. Simi M, Associate Professor, Department of Computer Applications, SAS

5
SNDP Yogam College, Konni

Ms. Ambili M S, Assistant Professor, Department of Computer Science, Sree

6
Sankara Vidyapeetom College, Valayanchirangara

Ms. Bindhu Prabha, Associate Professor, Department of Computer Applications,

7
SAS SNDP Yogam College, Konni

Dr. Leena C Sekhar, Associate Professor, Department of Computer Applications,

8
MES College, Marampally

Dr. Juby George, Assistant Professor, Department of Computer Applications,

9
Marian College, Kuttikkanam

Dr. Sowmya M R, Assistant Professor, Department of Computer Science, Sree

10
Sankara College, Kalady

Mr. Biju Kumar S P, Assistant Professor, Department of Computer Applications,

11
NSS College Rajakumari, Idukki (Dist)

Page 6 of 222
 Syllabus Index
Name of the Major: Computer Science

Semester: 1

Type of the Hour

Title of the Course Hours/ Distribution
Course Code Credit /week
Course DSC, MDC, week
SEC etc.
L T P O

Art of
Computing and DSC A 4 5 3 0 2 0
MG1DSCCSC100 Problem Solving

Cyber Laws and

MG1MDCCSC100 Online Safety

Internet and MDC 3 4 2 0 2 0

Web
MG1MDCCSC101 Technologies

L — Lecture, T — Tutorial, P — Practical/Practicum , O — Others

Semester: 2

Type of
the Hour Distribution
Title of the Course Hours/ /week
Course Code Credit
Course DSC, week
MDC,
SEC etc. L T P O

Python
DSC A 4 5 3 0 2 0
MG2DSCCSC100 Programming

Data
Visualization
MG2MDCCSC100 using Python MDC 3 4 2 0 2 0
Mastering
MG2MDCCSC101 Spreadsheets

Page 7 of 222
 Semester: 3

Type of
the Hour Distribution
Course Hours/ /week
Course Code Title of the Course Credit
DSC, week
MDC,
SEC etc. L T P O

Database
Management DSC A 4 5 3 0 2 0
MG3DSCCSC200 Systems

Data Structures
DSC A 4 5 3 0 2 0
MG3DSCCSC201 using C

Introduction to
Data Science(Data
Science and
Analytics Specializ
MG3DSECSC200 ation)

Introduction to
Mobile and Web
Technologies (Web
and Mobile
Technologies
DSE 4 4 4 0 0 0
MG3DSECSC201 Specialization)

Introduction to
Embedded
Systems (
Embedded
Systems and User
Interface Design
MG3DSECSC202 Specialization)

Python for Data

Analytics (Minor DSC B 4 5 3 0 2 0
MG3DSCCSC202 for Others)

Cloud Computing
MDC 3 3 3 0 0 0
MG3MDCCSC200 Essentials

White Hat
VAC 3 3 3 0 0 0
MG3VACCSC200 Hacking

Page 8 of 222
 Semester: 4

Type of the Hour

Course Distribution
Title of the Hours/
Course Code DSC, Credit /week
Course week
MDC, SEC
etc. L T P O

OOPs Concepts
DSC A 4 5 3 0 2 0
MG4DSCCSC200 using JAVA

Computer
DSC A 4 4 4 0 0 0
MG4DSCCSC201 Networks

Data Mining
(Data Science
and
Analytics Special
MG4DSECSC200 ization)

Mobile App
Development
(Web and Mobile
Technologies
MG4DSECSC201 Specialization) DSE 4 5 3 0 2 0

System
Programming (
Embedded
Systems and
User Interface
Design
MG4DSECSC202 Specialization)

Introduction to
Database
Management DSC B 4 5 3 0 2 0
Systems(Minor
MG4DSCCSC202 for Others)

Foundations of
MG4SECCSC200 Data Science

Computer SEC 3 3 3 0 0 0
Hardware
MG4SECCSC201 Maintenance

Page 9 of 222
 Visualization
Tools for Data
MG4SECCSC202 Analytics

Green
Computing VAC 3 3 3 0 0 0
MG4VACCSC200 Techniques

Type of the Hour Distribution

Title of the Course Hours/ /week
Course Code Credit
Course DSC, MDC, week
SEC etc.
L T P O
MG4INTCSC200 Internship INT 2

Page 10 of 222
 Semester: 5

Type of Hour
the Distribution
Hours
Course Cred /week
Course Code Title of the Course /
DSC, it
week
MDC,
SEC etc. L T P O

DSC 4 4 4 0 0 0
MG5DSCCSC300 Software Engineering

DSC 4 4 4 0 0 0
MG5DSCCSC301 Operating Systems

4 4 4 0 0 0
MG5DSECSC300 Computer Security
DSE
Resource Optimization
4 4 4 0 0 0
MG5DSECSC301 Techniques

Artificial
Intelligence
(Data Science
and
Analytics Spe
MG5DSECSC302 cialization)

Web
Designing
using PHP
(Web and
Mobile
Technologies Any
Specialization
Two DSE 4 4 4 0 0 0
MG5DSECSC303 )

Design
Principles of
User
Computer
Interaction (
Embedded
Systems and
User Interface
Design
Specialization
MG5DSECSC304 )

Software Development
SEC 3 5 1 0 4 0
MG5SECCSC300 Lab 1

Page 11 of 222
 Semester: 6

Type of Hour
the Distribution
Hours
Course Cred /week
Course Code Title of the Course /
DSC, it
week
MDC,
SEC etc. L T P O

MG6DSCCSC300 Cloud Computing DSC 4 4 4 0 0 0

Software Development
DSC 4 7 1 0 6 0
MG6DSCCSC301 Lab 2

Big Data
Analytics
(Data Science
and
Analytics Sp
MG6DSECSC300 ecialization)

Internet of
Things (Web
and Mobile
Technologies
Specializatio
Any
MG6DSECSC301 n)
Two DSE 4 4 4 0 0 0
Understandi
ng MP and
MC
Architecture
( Embedded
Systems and
User
Interface
Design
Specializatio
MG6DSECSC302 n)

Machine Learning using

MG6SECCSC300 Python
SEC 3 3 3 0 0 0
Natural Language
MG6SECCSC301 Processing

User Centric
Computing and VAC 3 3 3 0 0 0
MG6VACCSC300 Software Standards

Page 12 of 222
 Semester: 7

Type
of the Hour
Course Distribution
Hours/ /week
Course Code Title of the Course DSC, Credit
week
MDC,
SEC
etc. L T P O

Advanced Java
DCC 4 5 3 0 2
MG7DCCCSC400 Programming

Advanced Database
Management DCC 4 4 4 0 0
MG7DCCCSC401 Systems

Advanced Data
DCC 4 4 4 0 0
MG7DCCCSC402 Structures

Advanced
Operating System DCE 4 4 4 0 0
MG7DCECSC400 Concepts

Digital Image
DCE 4 4 4 0 0
MG7DCECSC401 Computing

Big Data
Management Using DCE 4 4 4 0 0
MG7DCECSC402 R

Page 13 of 222
 Semester: 8

Type of Hour
the Distribution
Course Hours /week
Course Code Title of the Course DSC, Credit /
MDC, week
SEC L T P O
etc.

Advanced Computer
DCC 4 5 3 0 2
MG8DCCCSC400 Networks

Computational
Research DCC 4 5 3 0 2
MG8DCCCSC401 Methodology

Neural Networks
DCE 4 5 3 0 2
MG8DCECSC400 and Deep Learning

MG8DCECSC401 Pattern Recognition DCE 4 5 3 0 2

MG8DCECSC402 Generative AI DCE 4 5 3 0 2

PROJECT/Dissertati
PRJ 12
MG8PRJCSC400 on

Page 14 of 222
SEMESTER I

Page 15 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Art of Computing and Problem Solving

Type of Course DSC A
Course Code MG1DSCCSC100
Course Level 100
Course Summary This course covers fundamental concepts in computer programming,
including algorithms, flowcharts, programming languages, control
flow structures, arrays, and functions, emphasizing practical
implementation through a series of hands-on exercises. Students will
gain proficiency in solving problems using the C programming
language.
Semester 1 Credits 4 Total
Hours
Course Details Learning Lecture Tutorial Practical Others
Approach 3 0 1 0 75
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO No. Expected Course Outcome Learning PO No

Domains *
1 Describe the fundamentals of computing and U 1
problem-solving tools and techniques.
2 Illustrate the basics of programming using C U 1
language.
3 Apply C data structures and control structures in A 2
programming.
4 Apply logic in designing solutions to various A 2
problems using C Language.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 16 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction to Computing and problem solving. 15Hrs
1
1.1 Basics of Computing- Bit, Byte, Data, and 3 1
Information-Computer as a Data Processing
machine-Computer Programs and Software-System
and Application Software.

1.2 Problem Solving Life Cycle (Software Development 3 1

Method) – Specify the problem requirements -
Analyze the problem- Design the algorithm -
Implement the algorithm-Test and verify the
completed program-Maintain and update the
program.
1.3 Understanding basic Problem-Solving Tools: 4 1
Algorithms and Flowcharts- Examples.

1.4 Problem solving approaches: Top-down approach, 2 1

Bottom-up approach- Structured programming
concepts.
1.5 Computer Programming-Classification of Computer 3 1
languages- Machine, Assembly and High-level
languages, Language translators, Debugging, Types
of errors- Syntax errors, Logical errors and Runtime
errors.

Introduction to Programming 12Hrs

2
2.1 Introduction to C Programming: Character Set, 8 2
Structure of a ‘C’ Program, Identifiers and keywords,
Data Types, Variables, Constants, Operators,
Expressions.
2.2 Input and Output in C – Formatted functions, 4 2
unformatted functions, commonly used library
functions.

Page 17 of 222
 Control Flow Structures and Data Structures 18Hrs
3
3.1 Decision Statements- If, if-else, nested if-else, if-else-if 6 3
ladder. Multi Branching Statement (Switch), Break
and Continue, Unconditional Branching (Go to
Statement).

3.2 Loop control- for loops, nested for loops, while loops, 6 3
do while loop. Nested Looping statements.

3.3 Arrays: Declaration and Initialization of one and two- 3 3

dimensional arrays, Strings.

3.4 Functions: Definition-Declaration-Prototypes and 3 3

Function call- actual and formal arguments.

Lab Practice 30Hrs

4
4.1 Simple C programs 5 4
4.2 Program to illustrate control statements, Switch 5 4
statement
4.3 Program to illustrate looping statements 10 4

4.4 Program to illustrate arrays 5 4

4.5 Program to illustrate functions and user-defined 5 4

functions

5 (Teacher specific content)

Teaching and Learning Classroom Procedure (Mode of transaction)

Approach ● Use of ICT tools in conjunction with traditional classroom
teaching methods
● Interactive sessions
● Class discussions
● Lab exercises

Page 18 of 222
Assessment Types MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)
ESE for Practical: 35 Marks (1.5 Hrs)

1. Logic - 10 Marks
2. Successful Compilation - 5 Marks
3. Output - 5 Marks
4. Viva - 10 Marks
5. Record - 5 Mark

REFERENCES

1. Balagurusamy, E. (2019), “Programming in ANSI C” (8th ed.), Tata McGraw Hill.

2. Hanly J. R. and Koffman E. B. (2007), “Problem Solving and Program Design in C”
(7th ed.), Pearson Education.

SUGGESTED READINGS

1. Gottfried, B. S. (2018). “Programming with C" (4th ed.). Schaum’s Outline Series,
TMH.
2. Pradeep K. Sinha and Priti Sinha (2004), “Computer Fundamentals -Concepts,
Systems & Applications”, 8th Edition, BPB Publications.

Page 19 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Cyber Laws and Online Safety
Type of Course MDC
Course Code MG1MDCCSC100
Course Level 100
Course Summary This comprehensive course on Cyber Laws, IT Act, and Online Security is
designed to provide participants with a thorough understanding of the
legal and security aspects in cyberspace. By the end of this course,
participants will not only have a comprehensive understanding of cyber
laws, cybercrimes, and online security but will also possess practical skills
to navigate the digital realm safely and responsibly.

Semester 1 Credits 3
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

2 0 1 0 60
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning PO
No. Expected Course Outcome Domains * No
1 Describe cyber laws, IT Act, data protection, cybercrimes,
cyber bullying, and harassment laws effectively. U 1

2 Analyze internet security, passwords, browsing, social media,

An 1
transactions.
3 Apply the acquired knowledge on cyber laws, IT security
measures, and ethical considerations in real-world scenarios to A 2
safeguard digital information.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 20 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)
CO
Module Units Course description Hrs
No.

1 Cyber Laws, IT Act and Cyber Crimes

1.1 Introduction to Cyber laws: Definition and Scope,

Key legal concepts in cyber space. 2 1

1.2 IT Act : Overview of the IT Act 2000, Offenses and

penalties under the IT Act, Amendments and 4 1
evolving landscape.

1.3 Data Protection and Privacy Laws : Principles of

Data Protection, Privacy laws and regulations. 3 1

1.4 Cyber Crimes: Types of Cybercrimes, Hacking and

unauthorized access, Identity theft and cyber fraud.
4 1

1.5 Cyber Bullying and Harassment: Definition and

Forms of Cyber Bullying, Legal Perspective on 4 1
Cyber bullying.

1.6 Harassment Laws and social media, Reporting and

preventing cyber bullying. 3 1

Online Security

2.1 Introduction to Internet Security: Overview of 2 2

2 Internet Security, Importance of Online Safety.

2.2 Passwords and Authentication: Importance of 2 2

Strong Password, Multi Factor Authentication
(MFA).

Page 21 of 222
 2.3 Secure Browsing Practices: Recognizing and 2 2
Avoiding phishing Attacks, Identifying Secure
Websites (HTTPS).

2.4 Social Media Security: Privacy settings on Social 2 2

media platforms, Secure sharing information.

2.5 Online Transaction and Financial Security: Secure 2 2

online shopping, Banking and Financial Security,
Payment Card safety.

3 Practical Applications of Cyber Laws and Online Safety

3.1 Case Analysis: Assign students a cyber law case to 6 3

analyze. They should present a summary of the
case, identify key legal concepts involved, and
discuss the offenses and penalties under the IT Act
that are relevant to the case.

3.2 Legislation Review: Ask students to review recent 6 3

amendments to the IT Act and research how these
changes impact the legal landscape. They should
present their findings and discuss the evolving
nature of cyber laws.

3.3 Cybersecurity Incident Response Plan: Ask students 6 3

to create a basic incident response plan for a
hypothetical organization. This should include
steps to take in case of hacking, unauthorized
access, or a cybersecurity incident.

3.4 Password Security Audit: Students should conduct 6

a password security audit for their personal
accounts. They should evaluate the strength of their 3
passwords, implement multi-factor authentication
where possible, and suggest improvements.

Page 22 of 222
 3.5 Phishing Awareness Campaign: Task students with 6
creating a phishing awareness campaign.
3
Secure Online Transactions: Ask students to
research and compile a guide on best practices for
secure online transactions. This should cover topics
such as secure online shopping, banking, and
payment card safety.

4 Teacher Specific Content

Teaching and Classroom Procedure (Mode of transaction)

Learning Approach
Lectures, Discussions, Case Analysis

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 15 Marks

1. Written test
2. Assignments

CCA for Practical: 15 Marks

1. Assignments
2. Record
3. Viva
B. Semester End Examination

ESE for Theory: 35 Marks (1 Hr)

Written Test(35 Marks)

Part A: Very Short Answer Questions (Answer all) - (10*1=10
Marks)
Part B: Short Answer Questions(3 out of 5 Questions) -
(3*5=15 Marks)
Part C: Essay Questions(1 out of 2 Questions) - (1*10=10
Marks)

Page 23 of 222
 ESE for Practical: 35 Marks

1. Report - 15 Marks

2. Viva - 20 Marks

REFERENCES:

1. Vakul Sharma, “Information Technology Law and Practice”, 3rd ed. 2011,
Universal Law Pub., New Delhi.
2. Adv. Prashant Mali, “Cyber Law & Cyber Crimes”, Snow White Publications
Pvt. Ltd, 2nd ed. 2015.
3. Michael Cross , “Social Media Security: Leveraging Social Networking While
Mitigating Risk”, Elsevier, 2014.
4. William Stallings & Lawrie Brown “ Computer Security – Principles and Prctice”
3rd ed., Pearson Pub., 2017.

SUGGESTED READINGS:
1. “Cyber Law in India” by Pavan Duggal
2. “Cyber Security: APractitioner’s Guide” by Eric Cole
3. “Principles of Intellectual Property” by Stephen M McJohn
4. “The Indian Cyber Law” by Sandeep Agrawal

Page 24 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Internet and Web Technologies

Type of Course
MDC
Course Code MG1MDCCSC101
Course Level 100
Course The course covers the fundamentals of computer networks, including
Summary types, topologies, communication mediums, networking tools,
security, and an introduction to the Internet, HTML, and webpage
design.

Semester 1 Credits 3
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

2 0 1 0 60
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No
No. Domains *
1 Describe the fundamentals of computer networks and U 1
Internet.
2 Illustrate basic HTML tags for webpage designing. U 1

3 Design websites using HTML tags. A 2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C),
Skill (S), Interest (I) and Appreciation (Ap)

Page 25 of 222
COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.
1 Computer networks and Internet

1.1 Computer Networks –Types of Networks: WAN,

2 1
MAN, LAN, PAN, CAN- Benefits of Networks.
1.2 Network Topology –Bus, Ring, Star, Tree, Mesh,
Hybrid- Communication Medium: Wired and 4 1
Wireless.
1.3 Networking Tools- MODEM, Repeater, Hub,
Switches, Routers, Bridge, Gateway- Network 3 1
Security –Firewalls.

1.4 Internet - History, Benefits and Drawbacks,

Internet Protocols: TCP/IP, FTP, HTTP, IP 3 1
Address, Domain Name System (DNS), URL.

1.5 Web Browsers, WWW, Search Engines – Types,

Academic Search Techniques - Applications of 3 1
Internet.

2 HTML and Webpage

2.1 Introduction to HTML – Essentials- Static &
Dynamic Web Pages - Structure of a Web Page. 2 2

2.2 Designing Web Pages- HTML Tags -Text

Formats- Working with Text- Presenting and
Arranging Text-Paragraphs- Animated Effects: 5 2
Marquee – using White Space.
2.3 Tables in HTML Working with Links. 4 2
2.4 Lists, Images, Thumbnails, Audio & Video-Forms
& Frames. 4 2

3 Lab Practice: Webpage designing

Page 26 of 222
 Text Formatting: Create a webpage
3.1 demonstrating various text formatting options
such as bold, italics, underline, strikethrough, and
superscript/subscript using HTML tags. 6 3

Lists: Develop a webpage showcasing different

3.2 types of lists (unordered, ordered, and definition 3
lists). Experiment with nested lists. 6

Tabular Presentation: Build a webpage

3.3 illustrating the use of HTML tables for organizing
data. Explore table attributes for modifying cell
spacing, padding, borders, and alignment.
Incorporate colspan and rowspan attributes for 6 3
complex table layouts.

Form Creation: Construct a webpage containing a

3.4 form with various input elements such as text
fields, checkboxes, radio buttons, select
6 3
dropdowns, and text areas.

Frame Integration: Design a webpage with

3.5 multiple frames using the <frame> and
<frameset> tags. Experiment with different frame
configurations such as rows, columns, and nested 3
6
frames. Showcase the use of the <noframes> tag
for browsers that do not support frames.

4 Teacher Specific Content

Page 27 of 222
Teaching and Classroom Procedure (Mode of transaction)
Learning Approach
Lecture, Practical, Demonstration through ICT tools

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 15 Marks

1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 35 Marks (1 Hr)

Written Test(35 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(3 out of 5 Questions) -
(3*5=15 Marks)
Part C: Essay Questions(1 out of 2 Questions) -
(1*10=10 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Design and Development - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES:

1. Raj Kamal, “Internet & Web Technologies”, Tata McGraw Hill.

SUGGESTED READINGS:

1. Thomas. A. Powell, “HTML & CSS: The Complete Reference”, 5th Edition, Tata
McGraw Hill.
2. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks”, 5th Edition,
Pearson.

Page 28 of 222
SEMESTER II

Page 29 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Python Programming

Type of Course DSC A

Course Code MG2DSCCSC100

Course Level 100
Course This course aims to provide students with a well-rounded
Summary understanding of Python programming, empowering them to tackle a
variety of programming challenges and laying the groundwork for
more advanced programming endeavours.

Semester 2 Credits 4
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

3 0 1 0 75
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No

No. Domains *
1 Describe fundamental concepts of Python U 1
programming language
2 Apply Python control structures in programming A 2

3 Apply Python data structures in programming A 2

4 Develop Python programs demonstrating control A 2
flow structures and data structures
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 30 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1 Introduction to Python Programming 12

1.1 Python features, Identifiers, Keywords, 6 1

Statements and Expressions, Variables,
Operators, Precedence and Associativity

1.2 Data types-Numbers, Boolean, Strings, None- 6 1

Indentation, Comments, Reading Input, Print
Output, Type Conversions

2 Python Control Structures 15

2.1 Decision Control Flow Statements – if, if-else, 7 2

if-elif-else, nested if- Example python scripts

2.2 Iterative statements - while, for, Nested loops, 8 2

break and continue statements- Example
python scripts

3 Python Data Structures 18

Lists: Creating Lists, Basic List Operations.
3.1 list() function, Indexing and Slicing, Built-in- 3 3
functions, List Methods, del statement.
Tuples: Creating Tuples, Basic Tuple
3.2 Operations, tuple() function, Indexing and 3 3
Slicing, Built-in-functions on Tuples, Tuple
methods, zip() Function.
Dictionaries: Creating Dictionary, Accessing,
3.3 and modifying, dict() function, Built-in- 3 3
functions, Dictionary methods, del
statement.
Sets: Creating sets, Set methods
3.4 3 3

Page 31 of 222
 Functions: Built-in-functions, User defined
3.5 functions, Function Calls, The return 3 3
Statement and void Function
Files: Opening a file – Modes for opening a
3.6 file and Attributes of file object, Closing a file, 3 3
Writing to a file, Reading from a file,
Renaming a file, Deleting a file

4 Lab Practice 30 4

1. Basic programs in Python: Display the use

of variables and basic expressions,
demonstrate arithmetic operators and data
type conversions, create a Python script that
involves working with numbers, floats, and
string operations.
2. Programs Using Control structures:
Logical operators and control flow using if-
else statements, while and for loops in
Python.
3. Programs Using Data structures:
Manipulate lists, tuple, dictionary and sets-
Programs demonstrating different data
structure methods.
4. Programs using function: Python script
incorporating basic in-built functions and
demonstrating their usage. Implementation
of user-defined functions, function calls, and
parameterized function calls.
5. Programs using Files: Python scripts to
open, read, and write to files, renaming and
deleting files, illustrating file handling
concepts in Python.

5 (Teacher specific content)

Page 32 of 222
Teaching and Classroom Procedure (Mode of transaction)
Learning Approach
• Use of ICT tools in conjunction with traditional classroom
teaching methods
• Interactive sessions
• Class discussions
• Lab exercises

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) - (2*10=20
Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Logic - 10 Marks
2. Successful Compilation - 5 Marks
3. Output - 5 Marks
4. Viva - 10 Marks
5. Record - 5 Marks

Page 33 of 222
REFERENCES

1. Gowrishankar S, Veena A., “Introduction to Python Programming.”, CRC Press, Taylor

& Francis Group, 2019.

SUGGESTED READINGS

1. David I. Schneider, “An Introduction to Programming Using Python”, Global Edition,

Pearson Education Limited, 2015.
2. Eric Matthes, “Python Crash Course: A Hands-On, Project-Based Introduction to
Programming”, 2nd Edition, No starch Press, 2019.
3. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd
edition, Updated for Python 3, Shroff/O’Reilly Publishers, 2016.

Page 34 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Data Visualization using Python
Type of
MDC
Course
Course Code MG2MDCCSC100
Course Level 100
This course offers a comprehensive introduction to data visualization
principles and practices. Students will learn the importance and
applications of data visualization, develop skills using popular libraries
Course
like Matplotlib, Seaborn, and Plotly, and explore best practices for
Summary
effective visual representation. By the end of the course, students will
apply these techniques to real-world datasets and create compelling data
visualization projects.

Semester 2 Credits 3
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
2 0 1 0 60
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Illustrate the fundamental principles of data U 1

visualization.
2 Use various plotting techniques for data A 2
visualization.
3 Apply data visualization techniques to real-world A 2
datasets using Python libraries.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 35 of 222
COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Data Visualization
1.1 Overview of data visualization concepts, 5 1
Importance and applications of data visualization.
Introduction to Matplotlib: Basic plotting with
1.2 Matplotlib, Customizing plots: labels, colors, 5 1
1
styles.
Plot types: line plots, scatter plots, bar plots,
1.3 Subplots and layouts, Annotations and text, 5 1
Plotting with pandas.
Introduction to Seaborn:
2.1 Seaborn basics and advantages, Statistical plotting 5 2
with Seaborn, Seaborn themes and aesthetics.
2 Advanced Seaborn: Multi-plot grids, Categorical
2.2 5 2
plots.
2.3 Seaborn extensions: Swarm plots, Violin plots. 5 2

Introduction to Plotly, Overview of Plotly library,

Interactive plotting basics, Creating interactive
3.1 charts and dashboards, Customizing interactive 10 3
plots, Plotly Express for rapid visualization, Plotly
Dash for web-based applications.
Data Visualization Best Practices: Principles of
3.2 effective visualization, Choosing the right chart 5 3
3 type, Color theory and accessibility.
Case Studies and Real-world Applications
• Visualizing real-world datasets
• Apply learned techniques to a self-selected
3.3 dataset 15 3
• Create a comprehensive data visualization
project

4 Teacher Specific Content

Classroom Procedure (Mode of transaction)

Teaching and Learning • Lecture
Approach • Demonstration
• Lab Excercises

Page 36 of 222
 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 15 Marks

1. Written test
Assessment Types
2. Assignments

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 35 Marks (1 Hr)

Written Test(35 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(3 out of 5
Questions) - (3*5=15 Marks)
Part C: Essay Questions(1 out of 2 Questions) -
(1*10=10 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Result - 20 Marks
2. Viva - 10 Marks
3. Record - 5 Marks
REFERENCES

1. Kalilur Rahman, “Python Data Visualization Essential Guide” , BPB Publications,

2021

SUGGESTED READINGS
1. Jake VanderPlas, “Python Data Science Handbook Essential Tools for Working with
Data”, O'Reilly Media, 2016.
2. "Interactive Data Visualization for the Web" by Scott Murray
3. "Storytelling with Data: A Data Visualization Guide for Business Professionals" by
Cole Nussbaumer Knaflic
4. Additional Resources: Online documentation and tutorials for Matplotlib, Seaborn,
and Plotly.

5. Kaggle and GitHub repositories for code examples and projects.

Page 37 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Mastering Spreadsheets
Type of Course MDC
Course Code MG2MDCCSC101
Course Level 100
Course This course covers fundamental spreadsheet skills, advanced formula
Summary application, data visualization techniques, pivot table analysis, and
macro automation for effective data processing, analysis, and
visualization.

Semester 2 Credits 4
Total Hours
Course Details Learning Lecture Tutorial Practical Others
Approach
2 0 1 0 60
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning PO No
No. Expected Course Outcome Domains *
1 Demonstrate the fundamental concepts of spreadsheet U 1
packages
2 Apply functions, formulas, charting techniques, and A 2
pivot tables for data representation and analysis

3 Utilize spreadsheet software to perform numerical A 2

computations and analyze data across various datasets
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 38 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.
Spreadsheet as a processing, analysis and
1 1.1 visualisation tool, Layout of a worksheet- Title
5 1
bar, Menu bar, Formula bar.

Cell addressing, Data entry, Data Types, Data

1.2 formatting, Data selection, Named ranges,
Importing Data. 5 1

Fill handle, Autofill, Autosum, Borders, Find and

1.3 Replace, Sort, Filter, Advanced filter, Conditional
formatting. 5 1

Formulas- Absolute addressing and relative

2 2.1 addressing, IF statement, Functions- Categories,
Exploring functions -Mathematical, Statistical,
Text, Financial, and Date functions. 6 2

Data representations and comparison using

2.2 charts and pivot table- Different type of charts,
Creation of charts, Setting Chart parameters,
Customising charts, Creating and Manipulating 6 2
Pivot table.

Advanced features - Macros, Advantages of

2.3 Macro, Creating and editing a macro, running a
macro, Exporting Data, Printing data and result. 3 2

Basic Spreadsheet Skills: Create a simple

3 3.1 spreadsheet including various types of data,
format cells, use basic functions like autosum, and
apply conditional formatting to highlight 8 3
important information.

Formula and Functions: Create a spreadsheet and

3.2 apply formulas and functions for data
computation (Mathematical, Statistical, Text,
6 3
Financial, and Date functions).

Page 39 of 222
 Data Visualization with Charts: Explore different
3.3 types of charts to represent data by adjusting
chart parameters and customizing visual
elements for clarity and impact. 8 3

Pivot Table Analysis: Create a pivot table to

3.4 analyze data, explore different dimensions, and
summarize information using calculated fields.
Macro Automation: Automate repetitive tasks 8 3
using macros.

4 Teacher Specific Content

Teaching and Classroom Procedure (Mode of transaction)

Learning
Approach Lecture, Practical, Demonstration through ICT tools

Assessment MODE OF ASSESSMENT

Types A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 15 Marks

1. Written test
2. Assignments

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 35 Marks (1 Hr)

Written Test(35 Marks)

Part A: MCQ (15*1=15 Marks)
Part B: Short Answer Questions (Answer all) - (10*2=20 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Procedure - 10 Marks
2. Output - 10 Marks

Page 40 of 222
 2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES

1. Documentation Team, LibreOffice. LibreOffice 7.1 Calc Guide. N.p., Jean Hollis
Weber, 2021.

SUGGESTED READINGS
1. Documentation Team, LibreOffice. “Getting Started with LibreOffice 6.0”. Friends of
OpenDocument, INC, 2018.
2. https://documentation.libreoffice.org/assets/Uploads/Documentation/en/GS7.3/GS73-
GettingStarted.pdf

Page 41 of 222
SEMESTER III

Page 42 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Database Management Systems
Type of Course DSC A
Course Code MG3DSCCSC200
Course Level 200
This course provides a comprehensive exploration of fundamental
concepts in database management. The course delves into the
Course
Relational Model, Entity-Relationship Modeling, SQL, normalization.
Summary
The course also covers transaction processing, desirable properties of
transactions

Semester 3 Credits 4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 1 0 75
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
1 Understand the fundamental concepts of database systems. U 1

2 Analyse Relational database model An 1

Apply SQL queries to create and manipulate relational
3 A 1,2
databases.
4 Apply DDL Commands to manage Database operations. A 2
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 43 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Introduction to database, database management

1.1 systems, functions of DBMS, characteristics of database 2 1
approach

Database users- database administrator, database

1.2 designers, end users. Advantages of using DBMS 2 1
approach.

Database system Concepts and Architecture - Data

model, schema, instance, categories of data model, data 2
1.3 1
independence- physical and logical data independence,
three-schema architecture.
1
Database system environment- DBMS component
1.4 2 1
modules
Conceptual data modeling using Entity Relationship
1.5 2 1
model- main phases of database design.

Entity type, entity set, attributes, types of attributes,

1.6 domain of attributes, keys- super key, candidate key, 2 1
primary key

Relationship Types ,Relationship Sets, Roles , and

1.7 Structural Constraints – Weak Entity Types – Notation 3 1
for ER diagrams – Sample ER diagrams.

Relational Data Model- Domains, Attributes, Tuples

and Relations-Characteristics of Relations –Relational
Model Constraints and Relational Database Schemas : 7 2
2 2.1
Domain Constraints, Key Constraints, Relational
Database Schemas, Entity Integrity, Referential
Integrity, and Foreign Keys.

Page 44 of 222
 Normalization: Informal Design Guidelines for
Relational Schemas –Functional Dependencies –
Normal forms : First Normal Form, Second Normal 8
2.2 2
Form, Third Normal Form – General Definitions of
Second and Third Normal Forms –Boyce-Codd Normal
Form.

Structured Query Language-DDL,DML,DCL

3.1 1 3
commands
Basic data types in SQL, Data Definition commands :
3.2 2 3
CREATE, ALTER,DROP - Adding constraints in SQL
Basic SQL Queries : INSERT ,SELECT ,DELETE,
3.3 UPDATE, Substring comparison using LIKE operator, 3 3
BETWEEN operator

3 Ordering of rows – SQL set operations :UNION,

3.4 2 3
EXCEPT, INTERSECT
,Nested queries , EXISTS and UNIQUE functions,
3.5 2 3
Renaming of attributes
Joining of tables, Aggregate functions ,GROUP
3.6 2 3
BY, Managing Views

3.7 Transaction-state, desirable properties of transaction 3 3

• Creating and altering the structure of a table in the

database using DDL commands
• Inserting rows to the table using INSERT
4 4.1 command 30 4
• Modifying data in the table using UPDATE and
DELETE
• Basic querying using SELECT

5 (Teacher specific content)

Page 45 of 222
Teaching and Classroom Procedure (Mode of transaction)
Learning
• Use of ICT tools in conjunction with traditional classroom
Approach
teaching methods
• Interactive sessions
• Class discussions
• Lab exercises

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6 Questions)
- (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

Page 46 of 222
REFERENCES

1. Ramez Elmasri and Shamkant B. Navathe (2010). Database Systems (6th Edition).
Pearson Education.

SUGGESTED READINGS
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts, 7th
Edition, McGraw Hill
2. C.J Date- An Introduction to Database Systems, Eighth edition, Pearson
Education,2003.
3. Reghu Ramakrishnan and Johannes Gehrke- Database Management Systems, Third
edition, Mc Graw Hill International Edition.
4. Dipin Desai, An Introduction to Database Systems, First Edition, Galgotia
Publications.

Page 47 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course
Data Structures using C
Name
Type of
DSC A
Course
Course
MG3DSCCSC201
Code
Course
200
Level
This course provides the concepts of fundamental data structures and their
implementations in C. Starting with an introduction to structured data,
Course
students delve into arrays, stacks, queues, linked lists and trees. The course
Summary
covers memory allocation, operations, applications and emphasizes
practical examples and hands-on programming.

Semester 3 Credits 4
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
3 0 1 0 75
Pre-
Basic knowledge of programming in C and an understanding of
requisites,
fundamental computer science concepts.
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
Describe functions, the fundamental concepts of static
1 and dynamic data structures and Compare and U 1
Contrast different searching and sorting techniques.
2 Apply linear data structures such as stacks and queues. A 2
3 Implement operations on linked lists and trees. An 2
Devise programs for implementing Fundamental Data
4 A 1,2
Structures.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 48 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Function Calls , Parametrized function calls , Function
1.1 returns , Recursive functions,types , Scope concepts - 3 1
local, global
Introduction to Data Structures, Definition,
1.2 classification of data structures, Primitive and Non- 2 1
primitive
1
Operations on data structures, Arrays, Representation
1.3 3 1
of array in memory,
Linear array operations, Search-Searching techniques-
1.4 Linear search, Binary Search, Sort - Sorting 4 1
Techniques,Bubble sort, Merge sort, Recursion.
Stack, Definition, Array representation of stack,
2.1 3 2
Operations on stack
Infix, prefix and postfix notations, Conversion of an
2.2 arithmetic expression from infix to postfix, Postfix 5 2
2 evaluation, Applications of stack
Queue- Definition, Array representation of queue,
2.3 Simple queue operations, Circular queues, Double 5 2
ended queue, Priority queue..
Dynamic memory allocation and pointers, Linked list-
definition, Components of linked list, Representation
3.1 5 3
of linked list, Advantages and disadvantages of linked
lists
Types of linked list, Singly linked list - Operations on
3.2 5 3
singly linked list
3
Trees - Concept of recursion, trees, tree terminology,
3.3 binary trees, representation of binary trees, Types of 5 3
binary tree. creation and operations on binary tree,
binary search trees, Creation of binary search tree,
3.4 5 3
tree traversing methods – examples

4 Practicals
30Hrs

Page 49 of 222
 4.1 Implement array insertion, Deletion 5 4

4.2 Implement Linear Search, Binary Search, Bubble 6 4

Sort, Selection Sort, Merge Sort

4.3 Implement stack and Queue operations using arrays 6 4

4.4 Implement Circular Queue operations. 6 4

4.5 Implement operations on a linked list. 7 4

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

• Use of ICT tools in conjunction with traditional classroom

Teaching and teaching methods
Learning Approach • Interactive sessions
• Class discussions
• Lab exercises

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

1. Written test
Assessment Types 2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)

Page 50 of 222
 Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Logic - 10 Marks
2. Successful Compilation - 5 Marks
3. Output - 5 Marks
4. Viva - 10 Marks
5. Record - 5 Marks

REFERENCES

1. G.S Baluja (2004). Data Structures Through C (A Practical Approach) (2nd

Edition). Danapat Rai & Co.
2. Ellis Horowitz and Sartaj Sahni. Fundamentals of Data Structures (2nd Edition).
Galgotia Publications.

SUGGESTED READINGS

1. Seymour Lipschutz, Theory and Problems of Data Structures, Schaums Outline

Series,2006, McGraw Hill
2. Yedidyah Lanngsam, Moshe Augustein, Aaron M Tenenbaum- Data structures
using C and C++, Second Edition, Prentice Hall

Page 51 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course
Introduction to Data Science
Name
Type of
DSE
Course
Course
MG3DSECSC200
Code
Course
200
Level
This course covers key concepts from data collection to modeling,
Course emphasizing practical skills in preprocessing, exploratory analysis, and
Summary linear regression. With real-world applications and security considerations,
learners gain essential knowledge for success in data science.

Semester 3 Credits 4
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
4 0 0 0 60
Pre-
requisites,
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Understand the need, evolution, roles, life cycle, applications,
1 U 1
prerequisites, tools, and security issues in data science.
Understand data types, sources, collection methods,
2 A 2
statistical descriptions, and pre-processing techniques.
Analyse the importance, types, techniques, steps, and tools
3 An 2
for performing exploratory data analysis
Analyze the steps in data science modeling, including linear
4 regression, model selection, diagnostics, evaluation metrics, U,An 1,2
and cross-validation techniques.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 52 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Data Science - Need of data Science -
1.1 5 1
Evolution of Data Science – Data Science Roles
Data Science Life Cycle - Applications of Data Science
1
1.2 in various fields – Prerequisites & Tools for Data 7 1
Science - Data Security Issues.
Introduction to Data - Types of data - Sources of data –
2.1 Data Collection methods - Basic Statistical Descriptions 7 2
of Data
2
Data Pre-Processing Overview: Data Cleaning, Data
2.2 Integration and Transformation, Data Reduction, Data 5 2
Discretization.
Exploratory Data Analytics – Importance of EDA –
3.1 5 3
Types of EDA
Univariate Analysis, Bivariate Analysis, Multivariate
3 3.2 5 3
Analysis
Specialized EDA Techniques - Steps for performing
3.3 7 3
EDA - Tools for Performing EDA.
Data Science Modelling – Steps in Data Science
4.1 Modelling - Simple Linear Regression - Multiple Linear 6 4
Regression
Linear Model Selection and Diagnostics. - Model
4
Evaluation and Metrics in Data Science - Common
4.2 Evaluation Metrics: Confusion matrix - Mean Absolute 10 4
Error (MAE) - Mean Squared Error (MSE) - Root Mean
Squared Error (RMSE)
4.3 Cross Validation: K-fold cross-validation - stratified 3 4
cross-validation.

5 (Teacher specific content)

Page 53 of 222
 Classroom Procedure (Mode of transaction)
● Use of ICT tools in conjunction with traditional classroom
Teaching and teaching methods
Learning Approach
● Interactive sessions
● Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks
1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Jojo Moolayil, “Smarter Decisions : The Intersection of IoT and Data Science”, PACKT,
2016.
2. Cathy O’Neil and Rachel Schutt , “Doing Data Science”, O'Reilly, 2015.
3. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data Analytics”,
EMC 2013

SUGGESTED READINGS
1. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data
Analytics”, IGI Global
2. Tilman M. Davies “ The Book of R” 2016, No Starch Press
3. T. M. Mitchell, “Machine Learning”, McGraw Hill, 2017

Page 54 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Introduction to Mobile and Web Technologies

Type of Course DSE

Course Code MG3DSECSC201

Course Level 200

Course This course provides a comprehensive overview of mobile and web

Summary technologies, covering their history, core technologies, web and mobile
architecture, responsive design principles, and security practices, while
also exploring emerging trends like Progressive Web Apps (PWAs) and
the role of AI and ML in modern applications.

Semester 3 Credits 4 Total

Hours

Course Details Learning

Approach
Lecture Tutorial Practical Others

4 0 0 0 60

Pre-requisites,
if any

Page 55 of 222
 COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO

No. Domains * No

1 Understand the history and Current Landscape of Mobile U 1

and Web Technologies

2 Understand web architecture basics, core technologies, U 1

popular frameworks, server-side tech, and responsive
design principles for improved cross-device experiences

3 Demonstrate the mobile architecture, explores core U,An 1,2

technologies and emphasizes principles of user experience
design for intuitive mobile interfaces.

4 Apply security measures against common vulnerabilities, U,A 1,2

secure mobile apps through encryption and coding
practices, develop Progressive Web Apps, and explore AI
and ML in mobile and web technologies.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction to Mobile and Web Technologies

1.1 History and Evolution-Early web and mobile 5 1

technologies, Milestones in the development of the
1 internet and mobile devices.

1.2 Current Landscape-Overview of modern mobile and 5 1

web technologies, Key players in the industry (Apple,
Google, Microsoft, etc.)

Web Technologies

Page 56 of 222
2 2.1 Web Architecture-Client-server model, Front-end vs. 5 2
back-end, Web protocols (HTTP/HTTPS).

2.2 Core Web Technologies-HTML, CSS, and JavaScript, 7 2

Web development frameworks (React, Angular,
Vue.js), Server-side technologies (Node.js, Django,
Ruby on Rails).

2.3 Responsive Web Design-Principles of responsive 5 2

design, Media queries and flexible grid layouts.

Mobile Technologies

3 3.1 Mobile Architecture- Mobile operating systems (iOS, 5 3

Android), Mobile app lifecycle

3.2 Core Mobile Technologies- Native vs. hybrid vs. web 5 3

apps, Mobile development frameworks (React Native,
Flutter, Xamarin).

3.3 User Experience in Mobile Apps- Principles of mobile 5 3

UI/UX design, Human Interface Guidelines (HIG) and
Material Design.

Security and Trends in Mobile and Web Applications

Web Application Security- Common vulnerabilities
4 4.1 (XSS, SQL Injection), Security best practices. 5 4
Mobile Application Security - Data encryption, Secure
4.2 coding practices. 5 4

Progressive Web Apps (PWAs)-Features and benefits,

4.3 Development considerations. Artificial Intelligence 8 4
and Machine Learning in Mobile and Web- Current
applications and future possibilities.
Teacher Specific Content
5

Page 57 of 222
Teaching and Learning Classroom Procedure (Mode of transaction)
Approach ● Use of ICT tools in conjunction with traditional classroom
teaching methods
● Interactive sessions
● Class discussions

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES
1. "Mobile Application Development: A Practical Approach" by Jeff McWherter and Scott
Gowell
2. "Web Security for Developers: Real Threats, Practical Defense" by Malcolm McDonald

SUGGESTED READINGS
1. "HTML and CSS: Design and Build Websites" by Jon Duckett
2. "JavaScript and JQuery: Interactive Front-End Web Development" by Jon Duckett
3. "Responsive Web Design with HTML5 and CSS" by Ben Frain

Page 58 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Introduction to Embedded Systems
Type of
DSE
Course
Course Code MG3DSECSC202
Course Level 200
This course covers the basics of computer architecture and embedded
systems, including memory concepts, program execution, and the
Course
differences between microprocessors and microcontrollers, as well as
Summary
their applications in various fields such as automotive electronics,
robotics, and biomedical applications.

Semester 3 Credits 4
Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites,
Basic knowledge in Computer Fundamentals.
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
1 Understand the fundamentals of computer architecture U 1
Understand the embedded systems, their applications,
2 U 1
features, and components.
Analyze embedded systems, focusing on MCUs, especially 8-
bit MCUs, memory, low power design, interfacing
3 An 2
techniques, real-world sensors and control of displays and
relays.
Apply embedded system knowledge to real-world
4 applications like mobile phones, RFID, sensor networks, U,A 1,2
robots, and medical devices.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 59 of 222
COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Computer architecture

Binary System – Memory concept – Memory

1.1 5 1
capacity- Program execution logic.

1 Instruction Pointer – Execution logic of

1.2 programs stored in ROM and RAM – BIOS 7 1
program .

Introduction to embedded systems

Embedded systems- Application areas- features

2.1 and characteristics , model of an embedded 5 2
system.
2
Microprocessor Vs microcontroller, concept of
2.2 interfacing ports, example of a simple embedded 7 2
system, MCUs: 4/8/16/32 bits

Embedded systems

Microcontroller unit(MCU), a popular 8-bit

3.1 5 3
MCU, memory for embedded systems.

Low power design, pull up and pull down

3.2 5 3
3 resistors, Interfacing ADC and DAC

Real world sensors- Temperature Sensor, Light

3.3 Sensor, Proximity/range Sensor; Display and 10 3
Relays control.

Examples of embedded systems

Page 60 of 222
 Mobile phone, automotive electronics, radio
4.1 frequency identification (RFID), wireless sensor 6 4
4 networks(WISENET).
4.2 Robotics, biomedical applications, brain machine 10 4
interface, Concept of embedded programming

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

● ICT enabled Lecture
Teaching and
Learning Approach ● Interactive sessions
● Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks
1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer
all) - (10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Lyla B Das, Embedded systems: An Integrated Approach, 1st Ed., Pearson, 2013

SUGGESTED READINGS
1. Shibu, K.V., Introduction to Embedded Systems, 1st Ed., TMH, 2009
2. Kanta Rao B, Embedded Systems, 1st Ed., PHI
3. Frank Vahid & Tony Givargis, Embedded System Design, 2nd Edition, John Wiley.

Page 61 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Python for Data Analytics
Type of DSC B
Course
Course Code MG3DSCCSC202
Course Level 200
Course This course is designed to teach students how to analyze different types
Summary of data using Python. Students will learn how to prepare data for analysis,
perform simple statistical analysis, create meaningful data visualizations
and predict future trends from data.

Semester 3 Credits 4
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

3 0 1 0 75
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Upon completion of this course, the students will be able to:
1 Describe data, its type and the data analysis process. U 1
2 Illustrate the numerical computation of data using NumPy U 1
library.
3 Analyse data manipulation and visualization using Pandas An 1
and Matplotlib library respectively.
4 Implement various Python libraries to perform data analysis A 2
tasks.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 62 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.
Introduction to Data analysis: 10 hrs
1

1.1 Understanding structured and unstructured

2 1
data

1.2 Data Analysis process -Defining objectives,

Data collection, Data cleaning, Data analysis,
Data interpretation and visualization, Types of 8 1
data analysis

2 Numerical Computation with NumPy Library 15 hrs

2.1 Ndarray, Creating Ndarrays, Data types for

Ndarrays, Arithmetic with NumPy Arrays 5 2

2.2 Basic Indexing and Slicing, Boolean Indexing

5 2
and Fancy indexing.

2.3 Universal functions, Mathematical and

5 2
statistical functions, Sorting.

3 Data Manipulation and Visualization 20 hrs

3.1 Data Manipulation with Pandas Library:

Introduction to Pandas Object, Pandas data 6 3
structures- Series, DataFrame, Index object.

3.2 Functionalities- Reindexing, Indexing,

Selection, Filtering, Sorting, Ranking,
Summarizing and Computing Descriptive 8 3
Statistics, Handling missing data, Hierarchical
indexing.

Page 63 of 222
 3.2 Introduction to Data visualization: Matplotlib
Library, pyplot, Data visualization using
matplotlib - bar plot, line plot, histogram, pie 6 3
chart, box plots, density plots and scatter plot.

4 Lab Practice 30 hrs

4.1 Implementation of Ndarray Basic Operations -

Indexing, Slicing and Iterating, Conditions and
Boolean Arrays, Shape Manipulation, Array 10 4
Manipulation

4.2 Implementation of DataFrames, Reading from

csv files, Python programs to use data cleaning,
loc() function, iloc() function, Descriptive
Statistics – count(), sum(), mean(), median(),
mode(), std(), min(), max() and cumsum().
10 4
Reading from csv files, Data cleaning, Inserting
columns into DataFrames, Deleting columns
from DataFrame, Concatenating DataFrame,
Writing back to csv files.

4.3 Data Visualization using bar plot, line plot,

histogram, pie chart, box plots, density plots,
10 4
and scatter plot.

5 Teacher Specific Content

Page 64 of 222
Teaching and Classroom Procedure (Mode of transaction)
Learning Approach Lecture, Practical

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) - (10*1=10
Marks)
Part B: Short Answer Questions(4 out of 6 Questions) - (4*5=20
Marks)
Part C: Essay Questions(2 out of 3 Questions) - (2*10=20 Marks)
ESE for Practical: 35 Marks (1.5 Hrs)

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES
1. Wes Mckinney, “Python for Data Analysis: Data Wrangling with pandas, NumPy, and
Jupyter” 3rd Edition, O'Reilly, 2022. Free online access:
https://wesmckinney.com/book/

SUGGESTED READINGS
1. Fabio Nelli, "Python Data Analytics Data Analysis and Science Using Pandas,
Matplotlib, and the Python Programming Language", Edition 1, 2015, Apress.
2. William McKinney, "Python for Data Analysis: Data Wrangling with Pandas,
NumPy, and Ipython", Edition 2, 2017, Shroff/O'Reilly.

Page 65 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Cloud Computing Essentials
Type of MDC
Course
Course Code MG3MDCCSC200
Course Level 200
Course This course provides a comprehensive overview of cloud computing,
Summary covering its definition, models, architecture, services, applications,
virtualization technologies, and a comparative analysis of leading cloud
service providers, with a case study on Amazon Web Services.

Semester 3 Credits 3
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

3 0 0 0 45
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO
No. Domains * No
Describe the concept, types, pros and cons of Cloud
1 U 1
Computing.
Demonstrate the Cloud architecture and compare and
2 contrast various Cloud service models. An 1
Analyse Abstraction and Virtualization technologies and
3 Compare the features of leading Cloud Service An 1
Providers.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C),
Skill (S), Interest (I) and Appreciation (Ap)

Page 66 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1 Introduction to Cloud Computing

Defining Cloud Computing, Cloud types- The

1.1 NIST model, The Cloud Cube model, Deployment
models, Service models. 10 1

Desired Features of a Cloud, Benefits and

1.2 Disadvantages of Cloud Computing. 5 1

2 Cloud Architecture, Services and Applications

Exploring the Cloud Computing Stack, connecting

2.1 to the Cloud. 5 2

Infrastructure as a Service (IaaS), Platform as a

2.2 Service (PaaS), Software as a Service (SaaS). 6 2

Identity as a Service (IDaaS), Compliance as a

2.3 Service (CaaS). 4 2

3 Abstraction and Virtualization

Introduction to Virtualization Technologies, Load
3.1 Balancing and Virtualization. 4 3

Understanding Hyper visors, Understanding

3.2 Machine Imaging, Porting Applications. 4 3

Leading Cloud Service Providers – Amazon Web

3.3 Services (AWS), Microsoft Azure, Google Cloud
Platform (GCP)- Comparative analysis of features 4 ,3
and services.

3.4 Case study: Using AWS 3 3

4 Teacher Specific Content

Page 67 of 222
Teaching and Classroom Procedure (Mode of transaction)
Learning
Approach Lecture, Demonstration through ICT tools

Assessment MODE OF ASSESSMENT

Types A. C
ontinuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) - (10*1=10
Marks)
Part B: Short Answer Questions(4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES

1. Buyya R., Broberg J., Goscinski A., “Cloud Computing: Principles and Paradigm”,
First Edition, John Wiley& Sons, 2011.

SUGGESTED READINGS

1. Sosinsky B., “Cloud Computing Bible”, First Edition, Wiley Edition, 2011.
2. Rittinghouse, John W., and James F. Ransome, “Cloud Computing:
Implementation, Management, and Security”, CRC Press, 2017.

Page 68 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name White Hat Hacking
Type of Course VAC
Course Code MG3VACCSC200
Course Level 200
Course
This course delivers the basic idea about ethical hacking
Summary

Semester 3 Credits 3
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 0 0 45
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Describe the concept of Ethical Hacking U 1

Describe the Information Gathering Methodology and

2 U 1
Tools used by Hackers
3 Summarize various methods of System Hacking U 1
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 69 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Understanding the importance of security-Concept of
ethical hacking and essential Terminologies: Threat,
1 1.1 15 1
Attack – Vulnerabilities- Target of Evaluation– Exploit-
Phases involved in hacking.
Footprinting - Introduction to foot printing-
Understanding the information gathering
methodology of the hackers-Tools used for the
2 2.1 15 2
reconnaissance phase -Port Scanning – Introduction-
using port scanning tools- Ping sweeps- Scripting
Enumeration.
Aspect of remote password guessing- Role of
eavesdropping -Various methods of password
cracking- Keystroke Loggers- Understanding Sniffers -
3 3.1 Comprehending Active and Passive Sniffing- ARP 15 3
Spoofing and RedirectionDNS and IP Sniffing- HTTPS
Sniffing.

4 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning
Approach Lecture, Demonstration through ICT tools

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 25 Marks

1. Written test
2. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Page 70 of 222
 Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer
all) - (10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Kimberly Graves (2010). Certified Ethical Hacker. Wiley India Pvt Ltd.
2. Michael T. Simpson (2010). Hands-on Ethical Hacking & Network Defence.
Course Technology.

SUGGESTED READINGS
1. Patrick Engebretson, “The Basics of Hacking and Penetration Testing” Ethical
Hacking and Penetration Testing Made Easy, Syngress Media, Second Revised
Edition, 2013.
2. RajatKhare, "Network Security and Ethical Hacking", Luniver Press, 2006.
3. Ramachandran V, “Wireless Penetration Testing Beginner’s Guide “ 3rd edition
Packt Publishing, 2011.
4. Thomas Mathew, "Ethical Hacking", OSB publishers, 2003.

Page 71 of 222
SEMESTER IV

Page 72 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name OOPs Concepts using JAVA

Type of
DSC A
Course
Course Code MG4DSCCSC200
Course Level 200
Course
Programming concepts of JAVA language
Summary

Semester 4 Credits 4
Total Hours

Course Learning Other

Lecture Tutorial Practical
Details Approach s
3 0 1 0 75
Pre-
requisites, if Knowledge about program logic
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Apply OOP concepts and Java fundamentals to develop A 1,2

robust programs.
2 Analyze class structure, inheritance, method implementation, An 1,3
and array handling in Java.
3 Demonstrate Java packages, exception handling, A 1,2
multithreading, Swing components, and event handling.
4 Demonstrate proficiency in Java programming through A 2
practical implementation and problem- solving.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 73 of 222
COURSE CONTENT
Content for Classroom transaction (Units)
CO
Module Units Course description Hrs
No.
Concepts of Object Oriented Programming, Benefits
1.1 of OOP, 1 1

Features of Java, Java Environment, Java tokens.

1 1.2 Constants, variables, data types, operators. 2 1

Control statements-branching, looping and jump

1.3 statements, labelled loops. 7 1

Defining a class, fields declaration, method

2.1 declaration , creating object, accessing class 4 2
members

Method overloading, constructors, constructor

2.2 overloading, 4 2

Command line arguments, super keyword, static

2.3 members, 4 2
2
Inheritance, overriding methods, dynamic method
despatch, final(variables, methods and classes),
2.4 abstract methods and classes, interfaces, visibility 4 2
control.

Arrays-one dimensional arrays, declaration,

2.5 creation, initialization of arrays, two dimensional 4 2
arrays. String class.

Packages:- Java API packages overview(lang, util,

3.1 io, swing, applet), user defined packages-creating 3 3
packages, using packages.
3
Exception handling techniques, Multithreading-
3.2 creation of multithreaded program-Thread class – 4 3
Runnable interface-thread life cycle.

Page 74 of 222
 Swing components-ImageIcon, JLabel, JTextField,
3.3 JTextArea, JButton, JCheckBox, JRadioButton, JList, 4 3
JComboBox, JTable, JTabbedPane, JScrollPane,

Event handling –Delegation Event Model-event

3.4 classes-sources of events-event listeners. 4 3

• Implement basic OOP concepts through

hands-on exercises.
• Develop Java applications demonstrating
inheritance and polymorphism
• Utilize arrays and strings in practical coding
tasks.
4 • Create and use custom packages
30 4
• Implement exception handling techniques
• Build multithreaded Java programs to handle
concurrent tasks efficiently.
• Design and develop graphical user interfaces
using Swing components.
• Implement event handling mechanisms to
respond to user interactions effectively.
5 (Teacher Specific content)

Page 75 of 222
 Classroom Procedure (Mode of transaction)
Teaching and
• Use of ICT tools in conjunction with traditional classroom
Learning Approach
teaching methods
• Interactive sessions
• Class discussions
• Lab exercises

MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

Assessment Types
1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)

Part A: Very Short Answer Questions (Answer all) - (10*1=10
Marks)
Part B: Short Answer Questions (4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)
ESE for Practical: 35 Marks (1.5 Hrs)

1. Logic - 10 Marks
2. Successful Compilation - 5 Marks
3. Output - 5 Marks
4. Viva - 10 Marks
5. Record - 5 Marks

Page 76 of 222
REFERENCES

1. E. Balagurusamy (2014). Programming with Java (3rd Edition). McGraw Hill

Education. (Module 1, 2 and 3)
2. Patrick Naughton (2002). Java 2 The Complete Reference (7th Edition).
Osborne/McGraw-Hill.(Module 4 and 5)

SUGGESTED READINGS

1. Cay S. Horstmann & Gary Cornell – Core Java Volume 1 – Fundamentals, Eighth
edition.
2. K. Somasundaram – Programming in Java 2 , First edition, Jaico Publishing House.

Page 77 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Computer Networks
Type of
DSC A
Course
Course Code MG4DSCCSC201
Course Level 200
This course provides a concise overview of key networking concepts and
protocols, covering network topologies, layered architecture, circuit-
Course
switched and packet-switched networks, error detection, routing
Summary
algorithms, and transport protocols like UDP and TCP, as well as internet
protocols such as FTP, SMTP, Telnet, HTTP, and DNS.

Semester 4 Credits 4
Total Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites,
Basic Knowledge of Computers
if any

COURSE OUTCOMES (CO):

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Demonstrate a solid understanding of fundamental K 1

networking concepts

2 Illustrate the concepts of circuit-switched and packet-switched U 1,2

networks.

3 Explore techniques for detecting and correcting errors in A 2

transmitted data

4 Describe the functionality of various layers of network model U 1

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 78 of 222
 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Computer Networks , Network
15 hrs
Architecture Models
Network definition; network topologies; types of
1 1.1 network, types of connections, protocols and 7 1
standards.
1.2 Layered architecture approach, OSI Reference 8 1
Model, TCP/IP Reference Model.

Switching 15 hrs

2.1 Circuit Switched Network, Three Phases, Packet 7 2

2
Switching, Datagram Networks

2.2 Virtual Circuit Networks, Three Phases, Connection 8 2

Oriented and Connectionless Services.
Data Link Layer Functions and Protocol, Network Layer
15 hrs
Functions and Protocols

Error detection and error correction techniques error

3.1 5 3
recovery protocols
3 Framing, Flow control and Error control Noisy and
3.2 Noiseless channel protocols-stop and wait ARQ, go- 5 3
back-n ARQ; Point to Point Protocol on Internet.
Routing; routing algorithms network layer protocol
3.3 5 3
of Internet- IPV4, IPV6.
Transport Layer Functions and Protocols,
15 hrs
Overview of Application layer protocol
Elements of Transport Protocols, Internet Transport
4.1 7 4
protocols: UDP, TCP
4
FTP (File Transfer protocol), SMTP (Simple, Mail
Transfer Protocol), Telnet and
4.2 remote login protocol, WWW (World Wide Web), 8 4
HTTP (Hyper Text Transfer protocol), DNS,
Uniform Resource Locator

5 (Teacher specific content)

Page 79 of 222
 Classroom Procedure (Mode of transaction)
• Use of ICT tools in conjunction with traditional class
Teaching and room teaching methods
Learning Approach • Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA) - 30
Marks
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. B. A. Forouzan, Data Communications and Networking (Fourth edition). THM,
2007

SUGGESTED READINGS
1. A. S. Tanenbaum: Computer Networks, Fourth edition, PHI , 2002
2. Stallings, W. (2013). Data and Computer Communications. Pearson Education India.
3. Kurose, J. F., & Ross, K. W. (2017). Computer Networking: A Top-Down Approach.
Pearson Education India.

Page 80 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course
Data Mining
Name
Type of
DSE
Course
Course Code MG4DSECSC200
Course Level 200
This Course provides the concept of Data Mining techniques and its
implementation. Introducing the basic concept of Data Mining and Data
Course warehouse, Association Rule Mining and Supervised and Unsupervised
Summary classification techniques. Implementation of the above Data Mining
techniques using some open databases explores hands-on programming to
analyse different real world problems.

Semester 4 Credits 4
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
3 0 1 0 75
Pre-
Basic knowledge of any programming language like Python, C++,java etc.
requisites, if
and an understanding of Basic database concepts.
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Illustrate understanding of data mining techniques and
1 U 1
methodologies effectively.
Apply concepts of data warehousing, OLAP, and
2 A 2
association rule mining.
3 Analyse Supervised and Unsupervised Classification An 2
Apply Association Rule mining ,Supervised and
4 A 1,2
Unsupervised Classification techniques.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 81 of 222
COURSE CONTENT
Content for Classroom transaction (Units)

Unit CO
Module Course description Hrs
s No.

1.1 Introduction Data Mining, Data Ware House, 3 1

Transactional Databases
Data Mining Functionalities Characterization and
Discrimination, Mining frequent patterns,
1.2 Association and correlation, Classification and 3 1
Prediction, Cluster
1
Analysis, Classification of Data Mining Systems,

Data Mining Task Primitive, Integration of Data

1.3 Mining systems, Major issues in Data Mining, Data 4 1
integration and transformation, Data reduction, Data
discretization. Data Preprocessing.

2.1 Data Warehouse and OLAP technology ,Comparitive 3 2

study of OLTP and OLAP
Data Warehouse, Multidimensional data Model, Data
2.2 warehouse architecture, Data Warehouse 4 2
implementation,
2.3 OLAP, Data Warehouse and data mining. 4 2
2

2.4 Association Rules and Classification Concepts , 3 2

Support and Confidence

2.5 Efficient and Scalable Frequent item set Mining 3 2

methods, Mining various kind of association rules,

2.6 Apriori Algorithm 3 2

From association mining to Co-relation analysis,

3.1 Classification and prediction, Issues, Classificati 4 3

on by Decision tree induction
Bayesian Classification, Rule-based classification,
3.2 Support Vector Machine,K-nearest neighbor (KNN), 4 3
Prediction.
3
3.3 Cluster Analysis Definition, Types of data in 3 3
cluster analysis,
Clustering methods-Partitioning methods, K-means
3.4 and k-medoids, from k-medoids to CLARANS, 4 3
Hierarchical methods

Page 82 of 222
 Practicals 30Hr

4.1 Load and Analyse Database, Identify Noise and 7 4

Missing Values.

4 4.2 Implement Apriori algorithm for identifying frequent 7 4

pattern.

4.3 Implement Supervised classification techniques 8 4

4.4 Implement Unsupervised Classification techniques 8 4

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

● Use of ICT tools in conjunction with traditional
classroom teaching methods
Teaching and Learning
Approach ● Interactive sessions
● Class discussions
● Lab exercises

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

1. Written test
Assessment Types
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all)
- (10*1=10 Marks)

Page 83 of 222
 Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks(1.5 Hrs)

1. Design and Development - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES
1. Jiawei Han and Micheline Kamber(2006), Data Mining :Concepts and Techniques(2nd
ed.).Elsevier

SUGGESTED READINGS
1. Witten and Frank, Data Mining Practical Machine Learning Tools and Techniques,2nd ed.
Elsevier,2005
2. Soman, Divakar and Ajay, Data Mining Theory and Practice, PHI, 2006
3. Margaret H Dunham, Data Mining:Introductory and Advanced Topics, Person

Page 84 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Mobile App Development

Type of Course DSE

Course Code MG4DSECSC201

Course Level 200

Introduction to mobile application development, user interface

Course designing, data management and core functionalities of mobile
Summary applications and web services and Develop mobile applications using
GUI and Layouts.
4
Semester 4
Credits
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 1 0 75

Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Describe the process of developing mobile applications and U 1

explore Android development

2 Apply Android components for UI development, data A 1

persistence, and user interaction.
Apply Android content providers for data sharing, SMS
3 messaging, email sending, and location-based services and A 1,2
Utilize HTTP and JSON for consuming web services.
4 Apply essential Android Programming concepts and Develop A 1,2
various Android applications related to layouts
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 85 of 222
COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Introduction to Mobile apps 10hrs

Mobile Application Development - Mobile

Applications and Device Platforms - Alternatives
for Building Mobile Apps -Comparing Native vs.
1.1 Hybrid Applications -The Mobile Application 5 1
Development Lifecycle-The Mobile Application
1
Front-End-The Mobile Application Back-End

Key Mobile Application Services-What is

Android-Android version history-Obtaining the
1.2 Required Tools- Launching Your First Android 5 1
Application-Exploring the IDE-Debugging Your
Application-Publishing Your Application

Android Activities , User Interface, Basic Views, 20 hrs

Fragments, and Data Persistence
Understanding Activities-Linking Activities
2.1 Using Intents-Fragments-Displaying Notifications 3 2

Understanding the Components of a Screen-

2.2 Adapting to Display Orientation-Managing 2 2
Changes to Screen Orientation

Utilizing the Action Bar-Creating the User

2 2.3 Interface Programmatically Listening for UI 5 2
Notifications

Using Basic Views-Using Picker Views -Using List

2.4 Views to Display Long Lists 3 2

Understanding Specialized Fragments - Using

Image Views to Display Pictures -Using Menus
2.5 with ViewsUsing WebView- Saving and Loading 7 2
User Preferences-Persisting Data to Files-Creating
and Using Databases.

Sharing Data and Advanced Functionality, Web Services 15 hrs

3
Sharing Data in Android-Creating Your Own
3.1 5 3
Content Providers -Using the Content Provider

Page 86 of 222
 SMS Messaging -Sending Email-Displaying Maps-
3.2 5 3
Getting Location Data- Monitoring a Location.
Consuming Web Services Using HTTP-
3.3 5 3
Consuming JSON Services
Lab Experiments
1 .Develop an application that uses GUI components, Font
and Colours
2. Develop an application that uses Layout Managers and
event listeners.
3. Develop a native calculator application.
4. Writean application that draws basic graphical primitives
on the screen.
4 5. Develop an application that makes use of RSS Feed. 30 Hrs 4
6. Implement an application that implements Multi
threading
7. Develop a native application that uses GPS location
information.
8. Implement an application that writes data to the SD card.
9.Implement an application that creates an alert upon
receiving a message.

(Teacher specific content)

5

Page 87 of 222
 Classroom Procedure (Mode of transaction)
● Use of ICT tools in conjunction with traditional classroom
Teaching and Learning teaching methods
Approach ● Interactive sessions
● Class discussions
● Lab exercises

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

Assessment Types 1. Written test

2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks

Written Test(50 Marks) (1.5 Hrs)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6 Questions)
- (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks(1.5 Hrs)

1. Design and Development - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES

1. Jerome DiMarzio. “Beginning Android Programming with Android Studio”(

4thEdition). -Module 1,2
2. Anubhav Pradhan and Anil V Deshpande, Wiley Publications(2014). Composing
Mobile Apps : Learn, Explore and Apply using Android. ISBN: 978-81-265-4660-2. -
Module 2,3,4
3. Bill Phillips and Chris Stewart, Big Nerd Ranch Guides. Android Programming: The
Big Nerd Ranch Guide - Module 5

Page 88 of 222
SUGGESTED READINGS
1. Dawn Griffiths, David Griffiths, “Head First Android Development: A Brain-
Friendly Guide”, 2017.
2. Neil Smyth , “Android Studio 3.0 Development Essentials: Android”, 8th Edition.
3. Pradeep Kothari, “Android Application Development (With Kitkat Support)”, Black
Book 2014.

WEB REFERENCES:

https://developer.android.com/guide
https://en.wikipedia.org/wiki/Android_10
Develop App for Free
https://flutter.dev/
http://ai2.appinventor.mit.edu
https://en.wikipedia.org/wiki/Android_version_history https://aws.amazon.co
m/mobile/mobile-application-development/
(Unit1) https://en.wikipedia.org/wiki/Mobile_app_development

Page 89 of 222
 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name System Programming

Type of
DSE
Course

Course Code MG4DSECSC202

Course Level 200

This course equips students with a solid foundation in system software,

Course language processors, and the tools used in program development.
Summary Through theoretical learning, students will gain the knowledge and skills
necessary for effective software development in various computing
environments.

Semester 4 Credits 4
Total Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
3 0 1 0 75

Pre-requisites,
if any

COURSE OUTCOMES (CO)

Learning
CO PO
Expected Course Outcome Domains
No. No
*
Describe system software, language processing and Assemblers
1 U 1
fundamentals.
Identify Macro processors, interpreters, compilers, and
2 A 1
software tools for program development.
3 Analyze the functions and concepts of linkers and loaders. An 1
4 Apply language processing techniques using LEX and YACC. A 2
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 90 of 222
COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1.1 Overview of system software and its role 2 1

Language Processing Activities: Fundamentals

1.2 of Language Processing & Language 4 1
Specification.

1.3 Scanning and Parsing, 4 1

1
1.4 Elements of Assembly Language Programming 2 1

1.5 A Simple Assembly Scheme 2 1

1.6 Pass Structure of Assemblers, Design of a Two 3 1

Pass Assembler

Introduction to Macros, Macro Definition and 2

2.1 Call, Macro Expansion 3
Different types of parameters

2. 2 Design of a Macro Preprocessor 3 2

Interpreters: Use and overview of interpreters 5

2
2.3 Compilers: Phases of the Compiler , Aspects of 2
compilation

Compilation of Expressions, Control Structures,

2.4 Code Optimization 7 2
Software Tools: Software Tools for Program
Development ,Editors ,Debug Monitors

Introduction to linkers , Relocation and Linking

3.1 3 3
Concepts

Page 91 of 222
3
3.2 Design of a Linker 2 3

3.3 Loaders and its types, Relocatability of 5 3

Programs , Linking for Overlays and Loaders.

1. Write a program to implement the Lexical

Analyzer.
2. Write a lexical analyzer (using lex utility for
unix).
3. Write a Program to count the number of
characters, words, spaces and lines in a given
input file using LEX.
4. Write a Program to count the numbers of
comment lines in a given C program using
LEX
5. Write a Program to recognize a valid
arithmetic expression and to recognize the
4 4.1 30 4
identifiers and operators present. Print them
separately using LEX
6. Write a Program to recognize and count the
number of identifiers in a given input file
using LEX
7. Write a Program to recognize a valid
arithmetic expression that uses operators +, –
, * and / using YACC.
8. Write a Program to recognize a valid
variable, which starts with a letter, followed
by any number of letters or digits using YACC
9. Use macro features of C language

5 (Teacher Specific Content)

Classroom Procedure (Mode of transaction)

Teaching and ● Use of ICT tools in conjunction with traditional

Learning Approach classroom teaching methods
● Interactive sessions
● Class discussions
● Lab exercises

Page 92 of 222
 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 25 Marks

Assessment Types 1. Written test

2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer
all) - (10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks(1.5 Hrs)

1. Result - 15 Marks
2. Viva - 10 Marks
3. Record - 10 Marks

REFERENCE

1. D M Dhamdhere - System programming and operating Systems , Tata McGraw

Hill

SUGGESTED READING

1. John J Donovan - System Programming, First edition, Tata McGraw Hill 2009.

Page 93 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Introduction to Database Management Systems
Type of Course DSC B

Course Code MG4DSCCSC202

Course Level 200
Course This course provides a comprehensive understanding of database concepts,
Summary relational database design, and practical experiences on MySQL database
systems.
Semester
4 Credits 4
Total Hours
Course Details Learning
Approach Lecture Tutorial Practical Others

3 0 1 0 75
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No
No. Domains *
Upon completion of this course, the students will be able to:
1 Demonstrate the basic concepts of database and database U 1
management systems.
2 Describe the fundamental concepts of Relational Database U 1
Management Systems, Data Normalization and its
application in database design.
3 Design SQL queries for data definition and data A 2
manipulation.
4 Apply MYSQL to implement DDL and DML commands. A 2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 94 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction
1 1.1 Data vs Information, File oriented approach- 3 1
Disadvantages.
Database Concepts: Character- Field-Record-
1.2 File- Types of Databases-examples– DBMS – 6 1
Advantages-Disadvantages, Applications.

DBMS architecture-Database users- Database

1.3 administrator (DBA), Database designers, End 3 1
users, Application programmers- Database
Languages- DDL-DML-DCL.

Relational database management system

2 2.1 (RDBMS) 6 2
Data models, Entity Relationship model-
Features-Concepts-Entity sets, Relationship
sets, Attributes-ER diagram- Conversion of ER-
Diagram to Relational Database.

Relational data model-Domain, Attribute,

2.2 Tuple, Relations. 4 2
RDBMS – Relationships - Types of
Relationships - One to One - One to Many -
Many to Many.
Functional Dependency - Normalization (1NF,
2.3 2NF, 3NF). 5 2

Defining Relationships -Referential Integrity,

2.4 Key: Candidate key, Primary key, and Foreign 3 2
Key.

MYSQL
3 3.1 Introduction- Features- advantages, Datatypes- 5 3
numeric-string-date /time-boolean, Variables,
MYSQL database-table-view.

Page 95 of 222
 MYSQL Commands- DDL-Create-Alter, Drop,
3.2 DML-Insert, Select, Update, Delete DCL-Grant, 10 3
Revoke, Command clauses- where, order by,
group by, having, like, between, MYSQL
functions- aggregate functions.

MYSQL Lab practice

4 4.1 Implementation of Database commands- 15 4
Viewing existing databases, Creating databases,
Accessing databases, Deleting databases,
Viewing tables in databases.

Implementation of DDL and DML commands-

4.2 Creating table, inserting data in to table, 15 4
retrieving data from table-select- selecting all
data, selecting particular rows/ columns,
selecting based on condition/pattern matching,
working with null values, sorting data in table,
modifying data in table, deleting data from
table, implementing aggregate and group
functions, dropping table, altering table such as
adding/ modifying/ deleting columns of
tables.

5 Teacher Specific Content

Teaching and Classroom Procedure (Mode of transaction)

Learning
Approach Lecture, Practical

Page 96 of 222
Assessment MODE OF ASSESSMENT
Types A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) - (10*1=10
Marks)
Part B: Short Answer Questions(4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) - (2*10=20
Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”,
Sixth Edition, Tata McGraw-Hill 2006 (Module 1 & 2).

2. Vikram Vaswani, “MySQL: The Complete Reference”, 1st Edition, McGraw Hill
Education, 2004 (Module 3 & 4).

SUGGESTED READINGS
1. C.J.Date, Introduction to Database Systems, 8th Ed. , Pearson Publications
2. Elvis C. Foster, Shripad Godbole, “Database Systems-A Pragmatic Approach”, Apress,
2014.
3. Elmasri and Navathe, “Fundamentals of Database Systems” 6th Ed., Pearson, 2010

Page 97 of 222
4. Seyed, M. M. et.al, “Learning MySQL: Get a handle on your data”, O'Reilly, 2006.
5. Ian Gilfillan, “Mastering MySQL 4”, Wiley, 2003

Page 98 of 222
 Mahatma Gandhi University
Kottayam
Programme
Course Name Foundations of Data Science
Type of Course SEC
Course Code MG4SECCSC200
Course Level 200
This course covers the fundamentals of data analysis, including the
collection and presentation of data, measures of central tendency, and
Course
measures of dispersion. Students will learn various statistical
Summary
techniques and methods, providing a comprehensive understanding
of statistical concepts and their applications.

Semester 4 Credits
3 Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
3 0 0 0 45
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Demonstrate understanding of data collection methods and
1 U 1
types of data.
Analyze various measures of central tendency and their
2 U 1
applications in statistics.
Apply probability concepts to solve real-world problems
3 A 1,2
and analyze data.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 99 of 222
 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Collection of Data,Classification of Data Frequency 1
Distribution

1.1 Introduction to Collection of Data, Primary and 3 1

Secondary Data,
Methods of Collecting Primary Data, Methods of
1.2 Secondary Data, Statistical Errors, Rounding off Data 3 1
(Approximation).

1 Introduction Classification of Data - Objectives,

1.3 Methods, Ways to Classify Numerical Data or Raw 3 1
Data.
Tabular, Diagrammatic and Graphical Presentation of
1.4 Data: Introduction and Objectives of Tabulation, 3 1
Components of a Statistical Table, General Rules for the
Construction of a Table, Types of Tables
Introduction to Diagrammatic Presentation of Data,
Advantage and Disadvantage of Diagrammatic
1.5 Presentation, Types of Diagrams, Introduction to 3 1
Graphic Presentation of Data, Advantage and
Disadvantage of Graphic Presentation, Types of
Graphs.
Introduction to Central Tendency, Purpose and
Functions of Average, Characteristics of a Good
2.1 Average, Types of Averages, Meaning of Arithmetic 7
Mean, Calculation of Arithmetic Mean, Merit and
Demerits of Arithmetic Mean.
2 2

Meaning of Median, Calculation of Median, Merit and

Demerits of Median, Meaning of Mode, Calculation of
2.2 8
Mode, Merit and Demerits of Mode, Harmonic Mean-
PropertiesMerit and Demerits.

Random experiment, union and intersection of events

3.1 and their meaning. Mutually exclusive, equally likely 5 3
and independent events.
3
Classical, Frequency and Axiomatic approaches to
3.2 probability. Monotone property, Addition theorem(up 5 3
to 3 events).

Page 100 of 222

 Conditional probability. Multiplication theorem(up to
3.3 3 events).Independence of events. Bayers theorem. 5 3

4 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning • ICT enabled Lecture
Approach • Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 25 Marks

1. Written test
2. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. A.Abebe, J. Daniels, J.W.Mckean(2000). Statistics and Data Analysis.(Module 1)
2. David M. Lane. Introduction to Statistics. Rice University (Module 1, Module 2)
3. Gupta S.C and Kapoor V K (2002).Fundamentals of Mathematical Statistics (11th edition).
(Module 3)

SUGGESTED READINGS
1. Banfield J.(1999), Rweb: Web-based Statistical Analysis, Journal of Statistical Software.
2. Bhattacharya,G.K. and Johnson, R.A.(19977), Statistical Concepts and Methods, New
York, John Wiley & Sons.
3. Statistics, Tmt. S. EzhilarasiThiru, 2005, Government of Tamilnadu.
4. Weiss, N.A., Introductory Statistics. Addison Wesley, 1999.

Page 101 of 222

E-Books/ Online learning material
1. http://onlinestatbook.com/Online_Statistics_Education.pdf
2. https://textbookcorp.tn.gov.in/Books/12/Std12-Stat-EM.pdf
3. https://3lihandam69.files.wordpress.com/2015/10/introductorystatistics.pdf

Page 102 of 222

 Mahatma Gandhi University
Kottayam
Programme
Course Name Computer Hardware Maintenance
Type of SEC
Course
Course Code MG4SECCSC201
Course Level 200
Course This course provides a detailed understanding of computer components,
Summary system assembly, troubleshooting methodologies, preventive maintenance,
and security measures, empowering participants with the skills needed for
effective computer hardware management and support.

Semester Total Hours

4 Credits 3

Course Details Learning

Approach Lecture Tutorial Practical Others

3 0 0 0 45
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No
No. Domains *
1 Summarize computer hardware, system assembly, and U 1
maintenance.
2 Demonstrate troubleshooting methodologies, identify An 1
common hardware issues using error codes, diagnostic
tools and software.
3 Illustrate preventive maintenance and security U 1
measures for computer hardware.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 103 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction to Computer Hardware & System
1 1.1 Assembly: 4 1
Overview of Computer Hardware Components,
Understanding the Motherboard, CPU, and
Memory, Input and Output Devices.

Storage Devices: HDDs, SSDs, and External

1.2 Drives, Introduction to Peripheral Devices. 4 1
Tools and Equipment for Hardware
Maintenance.

Building a Computer System: Step-by-Step

1.3 Assembly, Disassembly and Troubleshooting 7 1
Procedures, Cable Management Best Practices,
Basic BIOS/UEFI Configuration.

Hardware Troubleshooting and Diagnostics

2 2.1 Introduction to Troubleshooting Methodologies, 5 2
Common Hardware Issues and Error Codes.

Diagnostic Tools and Software, System Recovery

2.2 and Backup Strategies, Remote Troubleshooting 5 2
Techniques.

Connecting and Configuring External Devices,

2.3 Troubleshooting Common External Device 5 2
Issues.

Preventive Maintenance and Security

3 3.1 Importance of Preventive Maintenance, Cleaning 5 3
and Cooling Systems, Security Measures for
Hardware.

Understanding Anti-virus and Anti-malware

3.2 Software. 2 3

Page 104 of 222

 Overview of External Devices: Peripherals and
3.3 Expansion Cards, Types of External Devices: 8 3
Input (e.g., keyboards, mice), Output (e.g.,
monitors, printers), Storage (e.g., external hard
drives, USB drives).

4 Teacher Specific Content

Classroom Procedure (Mode of transaction)

Teaching and
Learning
Approach Lecture, Demonstration through Animations/Video

Assessment MODE OF ASSESSMENT

Types A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. MCQ
3. Quiz
4. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)
Part A: MCQ (Answer all) - (20*1=20 Marks)
Part B: Short Answer Questions(10 out of 12 Questions) -
(10*3=30 Marks)

REFERENCES
1. David A. Patterson and John L. Hennessy, "Computer Organization and Design",
Elsevier
2. Scott Mueller, "Upgrading and Repairing PCs", 4th Ed.

SUGGESTED READINGS

1. IT Essentials- PC Hardware and Software Companion Guide, 4th Ed., CISCO

Networking Academy.

Page 105 of 222

 Mahatma Gandhi University
Kottayam
Programme
Course Name Visualization Tools for Data Analytics
Type of SEC
Course
Course Code MG4SECCSC202
Course Level 200

Course This course provides a comprehensive introduction to data visualization

Summary tools, covering popular platforms such as Tableau and Power BI, and
enabling students to create interactive dashboards and visualizations.

Semester 4 Credits 3
Total Hours
Course Learning
Details Approach Lecture Tutorial Practical Others

3 0 0 0 45
Pre-
requisites, if
any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No
No. Domains *
1 Summarize the concepts of data visualization, kinds of U 1
data analytics, different tools for visualization, features
of data visualization.
2 Demonstrate how to create interactive data U 1
visualization using Tableau.

3 Demonstrate how to create an interactive dashboard U 1

using Power BI.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 106 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1 Introduction to Data Visualization

1.1 Benefits of Data Visualization Tools-Kinds of
Data Analytics – Descriptive, Diagnostic, 5 1
Predictive and Data Mining.

1.2 Data Visualization Tools - Google Data

Studio, Qlikview, Tableau, Power BI. 5 1

1.3 Features- Common features of Data

Visualization Tool, Salient features of 5 1
popular data visualization tools.

2 Tableau - An Interactive Analytics platform

2.1 Tableau Product Suite. How to connect to a
data source using Tableau interface. Tableau 4 2
interface and basic terminologies.

2.2 Create – Time series chart, Bullet chart, Area

chart, Symbol map, Score cards. 3 2

2.3 Heat Map – Introduction, Uses of Heat Map,

Procedure to create heat map in Tableau. 3

2.4 Building interactive dashboards using

Tableau. 5 2

Power BI - Unleash the power of business analytics

3
3.1 Introduction to Power BI, Preparing data
with Power BI. 4 3
3.2 Data visualization using Power BI- Creating
simple visualization, Map Visualization, 5 3
Combination Charts.
3.3 Dashboard in Power BI - creating, sharing,
Tiles in Dashboard. 6 3

4 Teacher Specific Content

Page 107 of 222

Teaching and Classroom Procedure (Mode of transaction)
Learning
Approach Lecture, Demonstration through ICT tools and video

Assessment MODE OF ASSESSMENT

Types A. C
ontinuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. MCQ
3. Quiz
4. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)
Part A: MCQ (Answer all) - (20*1=20 Marks)
Part B: Short Answer Questions(10 out of 12 Questions) -
(10*3=30 Marks)

REFERENCES

1. Dr. S. Karpagavalli , “Introduction to Data Visualization Tools”, Blue Hill

Publishers, 2020.
2. https://www.tutorialspoint.com/tableau/index.htm
3. https://www.tutorialspoint.com/power_bi/power_bi_visualization_options.ht
m

SUGGESTED READINGS

1. Alexander Loth, “Visual Analytics with Tableau”, Wiley, 2019.

2. Alberto Ferrari and Marco Russo, “Introducing Microsoft Power BI”, Microsoft
Press, 2016.

Page 108 of 222

 Mahatma Gandhi University
Kottayam
Programme
Course Name Green Computing Techniques
Type of
VAC
Course
Course Code MG4VACCSC200
Course Level 200
Course
This course offers basic concepts of soft and Green Computing.
Summary

Semester 4 Credits 3
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
3 0 0 0 45
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
1 Understand the basic ideas of green computing U 1,8, 10
Understand the idea of green architecture and
2 A 1, 2, 9
framework
Analyse the idea of protocols and standards related
3 An 2, 5, 10
with the environment and sustainability
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 109 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Green computing: carbon foot print, scoop
on power - Green IT Strategies: Drivers, Dimensions, and
1.1 8 1
Goals – Environmentally Responsible Business: Policies,
Practices, and Metrics.
Paperless : Paper problems, Environment issues, Cost:
1 Paper and office, Storage, Practicality, Going paperless,
Organizational realities, Changing Over, Paperless billing,
1.2 Handheld Computers vs. the Clipboard, Unified 7 1
Communications, Intranets, What to Include, Building an
Intranet, Electronic Data Interchange (EDI), Value Added
Networks, Advantages & Disadvantages
Green Assets: Buildings, Data Centers, Networks and
2.1 Devices - Green Information Systems: Design and 7 2
Development Models - Green Enterprise Architecture –
Environmental Intelligence – Green Supply Chains
2 Socio cultural aspects of Green IT – Green Enterprise
Transformation Roadmap –Materials recycling – Best
2.2 ways for Green PC – Green Data center – Green Grid 8 2
framework.

Hardware Considerations: – Restriction of Hazardous

Substances (RoHS) in IT, EPEAT, Energy Star, Computers,
3.1 Servers, Consolidation, Products, Hardware 9 3
3 Considerations, Planned Obsolescence, Packaging,
Toxins, Other Factors
Green Compliance: Protocols, Standards, UNFCCC,
3.2 Copenhagen summit, Kyoto Protocol, ISO 14000:2004 6 3
Family of Standards, Government Initiatives.

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning
Approach Lecture, Demonstration through ICT tools

Page 110 of 222

 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

Assessment Types CCA for Theory: 25 Marks

1. Written test
2. MCQ
3. Quiz
4. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)
Part A: MCQ (Answer all) - (20*1=20 Marks)
Part B: Short Answer Questions(10 out of 12
Questions) - (10*3=30 Marks)

REFERENCES

1. Bhuvan Unhelkar, ―Green IT Strategies and Applications-Using Environmental

Intelligence, CRC Press, June 2014.

SUGGESTED READINGS

1. Woody Leonhard, Katherine Murray, ―Green Home computing for dummiesǁ,

August 2012.
2. Alin Gales, Michael Schaefer, Mike Ebbers, ―Green Data Center: steps for the
Journeyǁ, Shroff/IBM rebook, 2011. ason Harris, ―Green Computing and Green IT-
Best Practices on regulations & industryǁ, Lulu.com, 2008
3. John Lamb, ―The Greening of ITǁ, Pearson Education, 2009.
4. Carl speshocky, ―Empowering Green Initiatives with ITǁ, John Wiley & Sons,
2010.
5. Wu Chun Feng (editor), ―Green computing: Large Scale energy efficiencyǁ, CRC
Press.

Page 111 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Internship

Type of Course INT

Course Code MG4INTCSC200

Course Level 200

Course Summary A key aspect of the new MGU UGP programme is induction into actual
work situations. All Students will undergo internships in a firm,
industry, or organization or training in labs with faculty and
researchers in their own or other institutions during the summer
vacation.

Semester Credits 2 Total

Hours

Course Details Learning Lecture Tutorial Practical Others

Approach

Pre-requisites, if Basic knowledge of programming and understanding of computer

any science concepts.

Page 112 of 222

 COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No

No. Domains *

1 Apply technical knowledge effectively to assigned tasks An, A, S 1

and projects

2 Demonstrate critical thinking and problem-solving C, S, E 1

skills in various situations

3 Communicates clearly and effectively, both verbally An, A, Ap 2

and in writing

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1 1.1 All Students will undergo

internships in a firm, industry, or
organization or training in labs with
faculty and researchers in their own
or other institutions during the
summer vacation.

Teaching and Classroom Procedure (Mode of transaction)

Learning
Approach · No class room activity. Done During Vacation

· Discussions

· Self-learning and Development

Page 113 of 222

Assessment MODE OF ASSESSMENT
Types A. Continuous Comprehensive Assessment (CCA)- 15 marks

1. Review 1
2. Review 2

B. Semester End Examination - 35 marks

1. Project Presentation -15
2. Viva - 10
3. Report - 10

Page 114 of 222

SEMESTER V

Page 115 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Software Engineering
Type of
DSC
Course
Course Code MG5DSCCSC300
Course Level 300
This course is designed to equip students with the knowledge and skills
Course
needed to design, build, and maintain high-quality software systems in a
Summary
professional environment.
4
Semester 5 Credits
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
4 0 0 0 60
Pre-
requisites, if Familiarisation with Computer Fundamentals.
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Describe software engineering and the different
1 U 1
software process models used in industry.
Explain software requirement analysis and requirement
2 U 1
elicitation methods.
Analyse and compare various software design and
3 An 2
testing methods.
4 Develop software project management skills. A 2
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 116 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction to Software Engineering -

Definition, Program Vs Software. Software
Characteristics, brief introduction to product and
1.1 3 1
process. Software Development Life Cycle
(SDLC). Role of a Software Engineer, Ethics in
1 Software Engineering.
Overview of different life cycle models -Waterfall
model, Increment process models- Iterative, RAD,
1.2 9 1
and Evolutionary process models-Prototyping,
Spiral, and Agile. Selection of a life cycle model.
Requirements Engineering - Software
Requirement Analysis and Specification
2.1 6 2
Requirements Engineering, Type of requirements,
Feasibility Studies,
2 Requirement Elicitation – Use Case, DFD, Data
2.2 Dictionaries , Various steps for requirement 6 2
analysis,
Requirement documentation, SRS, Requirement
2.3 6 2
validation.
Software Design & Testing - Definition, Various
types, Objectives and importance of Design
3.1 8 3
phase, Modularity, IEEE recommended practice
3 for software design descriptions.SDD.

3.2 Software Testing - Development testing, Test- 10 3

driven development, Release testing, User testing.

Managing Software Projects

4.1 Introduction, Risk Management- Risk 3 4
identification, Risk analysis, Risk planning, Risk
4 monitoring.
Project planning- Software pricing, Plan-driven
4.2 development, Project scheduling, Agile planning, 3 4
Estimation Techniques-COCOMO.

Page 117 of 222

 Quality Management - Software Reliability
4.3 Definition, McCall software quality model, 3 4
Capability Maturity Model.
Configuration Management- Change
4.4 3 4
Management, Version Management.

(Teacher specific content)

5

Classroom Procedure (Mode of transaction)

Teaching and Learning
Approach Lecture, Classroom Discussions, Case study

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 hrs)

Written Test(70 Marks)

Part A: Very short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions(6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions(2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES:
1. K K Aggarwal, Yogesh Singh - Software Engineering, Third Edition, New Age
International Publications.
2. Ian Somerville - Software Engineering, Ninth Edition, Pearson Education.

SUGGESTED READINGS
1. Roger S Pressman - Software Engineering: A Practitioner's Approach, Sixth Edition,
McGraw-Hill Higher Education.
2. Pankaj Jalote - An Integrated Approach to Software Engineering, Second Edition,
Narosa Publishing Company.

Page 118 of 222

 Mahatma Gandhi University
Kottayam
BSc (Honours) Computer Science
Programme
Course
Operating Systems
Name
Type of
DSC
Course
Course Code MG5DSCCSC301
Course Level 300
Operating Systems (OS) courses cover the essential concepts and
Course functionalities of computer operating systems. Key topics include process
Summary management, memory management and file systems. Students learn about
synchronization and communication between processes.

Semester 5 Credits 4
Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach
4 0 0 0 60
Pre-
requisites, if Basic understanding of Computer Fundamentals
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
1 Describe essential aspects of operating systems U 1,2
2 Compare various process scheduling algorithms U, A, An 1,2
Describe the techniques for detecting, preventing
3 U, A, An 1
deadlocks and deadlock management techniques.

4 Illustrate memory and storage management U, A, An 1,2

techniques.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 119 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

1.1 2 1
Introduction: OS Definition, Functions, Types of OS
1 1.2 3 1
User Operating System Interface
1.3 5 1
System Calls, Types of System Calls.
2.1 2 2
Process: Basic Concepts.
2.2 2 2
2 Types of schedulers, Operations on Processes
2.3 Inter process communication 4 2
2.4 Scheduling Criteria, Scheduling Algorithms. 7 2

Process Coordination: Synchronization, The

Critical Section problem,. Deadlocks: Deadlock
3.1 definition, Deadlock Characterization, Methods of 2 3
handling Deadlocks- Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection,
Recovery from Deadlock.
3 3.2 5 3
Semaphores, Classic Problems of Synchronization

3.3 Deadlocks: Deadlock definition, Deadlock 2 3

Characterization

Methods of handling Deadlocks- Deadlock

3.4 9 3
Prevention, Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock.

Memory Management: Memory Management

4.1 7 4
Strategies - Swapping, Contiguous memory
allocation, Paging, Segmentation.
4.2 2 4
Virtual Memory Management- Demand paging,
4
4.3 Page Replacement algorithms 3 4

Page 120 of 222

 4.4 Storage Management: File System: - File Concept, 2 4
Access Methods, Directory Structure

4.5 File System Structure, Allocation Methods, Free 3 4

Space Management.

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning Lecture, Presentations
Approach Classroom Discussions
Assignments

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)
REFERENCES
1. Abraham Silberschatz, Peter B. Galvin, and Greg Gagne (2006). Operating
System Principles (7th Edition). John Wiley & Sons.
SUGGESTED READINGS
1. William Stallings - Operating Systems, Sixth Edition, Prentice Hall of India,
Pearson
2. Milan Kovic – Operating Systems, 2ndEdition, (TMH )

Page 121 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Computer Security

Type of DSE
Course

Course Code MG5DSECSC300

Course 300
Level

Course This course provides a comprehensive introduction to computer

Summary security, covering fundamental concepts, cryptographic techniques,
system security measures, user authentication mechanisms, and basics
of network security. Students will develop analytical and practical skills
necessary for critical thinking in security, fostering problem-solving
abilities crucial for scientific reasoning in cybersecurity.

Semester 5 Credits 4 Total Hours

Course Learning Lecture Tutorial Practical Others

Details Approach

4 0 0 0 60

Pre A basic understanding of computer systems, networks, and introductory

requisites, programming concepts is recommended as a prerequisite for this course.
if any

COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning D PO No
No. omains *

1 Explain security basics, approaches, principles, and U 1

types of attacks.

Page 122 of 222

 2 Apply cryptographic techniques and algorithms A 2
effectively.

3 Demonstrate proficiency in system security U 1

practices

4 Develop understanding of user authentication and U,A 1, 2

network security mechanisms

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create
(C), Skill (S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)
Module Units Course description Hrs CO No.

1 1.1 Concepts of security, 15 1

Need for Security, Security Approaches, Security
services and Mechanisms, Principles of Security, Types
of Attacks,Sniffing and spoofing, Phishing, Pharming.

2 2.1 15 2
Cryptography Techniques: Cipher Methods: Caesar
cipher, One time pad. Mono alphabetic Cipher, Play
fair cipher. Poly alphabetic cipher, Vigenère Cipher,
Transposition ciphers, Cryptographic Algorithms:
Symmetric & Asymmetric- Basic idea of
Cryptographic tools: PKI- Digital Signatures.

3 3.1 System Security: Intrusion Detection and Prevention 15 3

Systems, Need of IDPS. Types of IDPS, Password
Management, Counter measures, Access Controls
and Authentication, Malware and Antivirus
Techniques, Security Patching and Update.

Page 123 of 222

 4 4.1 User Authentication Mechanisms 15 4
User Authentication Mechanisms -Authentication
Basics, Passwords, Authentication tokens,
Authentication token types, Biometric
Authentication, Kerberos, Key distribution Center.
Basics of Network Security: Introduction to
TCP/IP, Firewalls, Types, IP Security, Virtual
Private Network, VPN architecture.

5 (Teacher specific content)

Teaching and Learning Classroom Procedure (Mode of transaction)

Approach
ICT enabled classroom lectures
Discussions

Assessment Types
MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions)
- (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

Page 124 of 222

REFERENCES

1.Michael E. Whitman, Herbert J. Mattord, “Principles of Information Security”, Course

Technology
2.William Stallings, “Cryptography and Network Security – Principles and
Practices”, ,Pearson Education.

SUGGESTED READINGS
1.Behrouz A. Forouzan, Dedeep Mukhopadhyay “Cryptography & Network Security”,
,Tata McGraw Hill, New Delhi, 2010.
2. Atul Kahate, “Cryptography and Network Security”, Second Edition, Tata McGraw Hill

Page 125 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Resource Optimization Techniques
Type of Course DSE
Course Code MG5DSECSC301
Course Level 300
This course covers fundamental concepts in decision-making and
optimization techniques. This enables the students to explore models,
Course methods, and applications, understanding their advantages, limitations,
Summary and the interplay between operations research techniques and decision-
making processes across industries.

Semester 5 Credits 4 Total Hours

Learning Lecture Tutorial Practical Others 60

Course Details
Approach
4 0 0 0
Pre-requisites,
if any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
1 Solve linear programming problems effectively U 1
2 Utilize simplex and dual methods proficiently A 1

3 Implement transportation and assignment problem- An 2

solving methods.
4 Solve sequencing and network routing problems S 2,3
effectively
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 126 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
OR:Introduction,origin and development,nature and
features, scientific methods, modeling, Advantages and
1.1 8 1
limitations of models,methodology, OR and decision
making, applications, opportunities and shortcomings
1
Linear Programming Problem:Mathematical formulation
1.2 of LPP, Graphical solution method and exceptional cases, 7 1
General LPP, Canonical and standard form of LPP

2.1 Simplex method-Introduction,properties,computational 6 2

procedure of simplex method,Artificial variables
2 Duality in Linear Programming:Introduction,general
2.2
Primal-Dual pair, Formulation of dual problem,Dual 9 2
Simplex Method.

Transportation Problem:Introduction,North West Corner

3.1 method, Least Cost Method and Vogel’s Approximation 5 3
Method.
3

Assignment Problems:Introduction,Solution using

3.2 10 3
Hungarian Method, Prohibited Assignment Problems

Sequencing Problems:Introduction,Basic Terms, Processing

n job through 2 machines, Processing n job through k
4.1 5 4
machines, Processing 2 job through k machines and
Maintenance Crew Scheduling
4
Network Routing Problem:Introduction,Basic components,
Logical sequencing, Rules, concurrent activities, Critical
4.2 10 4
Path Analysis-CPM,PERT method, Distinction between
PERT and CPM,Advantages and Limitations

(Teacher specific content)

5

Page 127 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning
Approach Lecture, Presentations, Demonstrations

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all)
- (10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Kanthi Swarup,P.K Gupta,Man Mohan,Operations Research,16th edition, Sultan Chand
& sons.

SUGGESTED READINGS
1. Hamdy A Taha,Operations Research:An Introduction,9th edition,Pearson
2. Prem Kumar Gupta and D.S Hira,Problems in OPerations Research,Sultan Chand &
Sons
3. K.V Mital and C.Mohan,Optimization methods in Operations Research and system
Analysis,Third Edition,New Age International.

Page 128 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Artificial Intelligence

Type of Course DSE

Course Code MG5DSECSC302

Course Level 300

Course The course introduces the concept of artificial intelligence. The

Summary various knowledge representation and Knowledge Inference
methods are introduced. The course introduces the application of AI
in various fields.

Semester 5 Credits 4
Total
Hours
Course Details Learning Lecture Tutorial Practical Others
Approach
4 0 0 0 60

Pre- requisites, if Awareness of algorithmic approaches in Computer Science.

any

COURSE OUTCOMES (CO)

Learning
CO
Expected Course Outcome Domains* PO
No.
No

1 Describe the fundamental concepts, applications and U 1,2

informed searching techniques in AI.

Page 129 of 222

 Analyze informed and uninformed search techniques for A 1,2,3
2 problem-solving.

3 Illustrate the knowledge representation in AI. An 1,2

Appraise the application of the fuzzy logic and statistical An 1,2

4
machine learning in AI systems.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.

Introduction: Basics of Artificial Intelligence- 1

1.1 What is AI, Definition of AI through Problems, 2
History of AI

AI problems and techniques, Problem solving

1 1.2 methods in AI- State space search, Production 4 1
system, Problem Characteristics, Control
Strategies

Search Strategies- Uninformed Search Category-

1.3 Depth First Search, Breadth First Search. 4 1

Applications of AI in daily life including Health

1.4 care, Education, Agriculture, Banking, 2 1

1.5 Expert Systems- Examples of Expert systems. 3 1

Problem Solving Examples-Expert system in
Agriculture, Expert system in Environmental
Management.

Page 130 of 222

 Uninformed Search Strategies- Generate and 2
2.1 Test, Depth First Search, Breadth First Search 5

Informed Searches:Hill Climbing, Best First

Search and A* Search, Problem Reduction,
2.2 5
2 2

2.3 Constraint Satisfaction with Inference. 5 2

Ontologies, Objects, Events, Representations and

3 3.1 Mappings. Approaches to Knowledge 7 3
Representation, Forward and Backward
Chaining,

3.2 Logic in Artificial Intelligence- Propositional 3

Logic, First Order Predicate Logic. 7

Basics of Fuzzy Logic and Applications-

4.1 5 4
Introduction, Set Theory, Fuzzy set theory-
Fuzzy sets and Crisp set

4 Membership Functions, Linguistic Variable, 4

4.2 Fuzzification and Defuzzification 6

4.3 Statistical Machine Learning -Statistical 5 4

Reasoning, Probability Axioms, Bayes
Rules, Bayesian Network.

5 Teacher specific content

Page 131 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning Lecturing
Approach
Problem Solving
Presentations

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer
all) - (10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

References
1. Artificial Intelligence A Modern Approach, Third Edition, Stuart Russell and
Peter Norvig, Pearson Education
2. S.N.SivanandamS.N.Deepa ,”Principles of soft computing “ second edition,
Wiley India Pvt. Ltd

SUGGESTED READINGS

1. Artificial Intelligence, Shivani Goel, Pearson Education. Ryan, D.

Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education

Page 132 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Web Designing using PHP

Type of Course DSE

Course Code MG5DSECSC303

Course Level 300

This course introduces students to the principles and practices of

web development using PHP. The focus is on building dynamic and
Course Summary interactive web applications with database. Students will gain the
skills and knowledge to install and use an integrated PHP/MySQL
environment.

4
Semester 5 Credits
Total
g Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60

Pre-requisites, if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Describe the fundamental concepts and components of
1 U 1
web development.
2 Apply intermediate-level web development techniques A 1,2

3 Design interactive web forms with data exchange A 1,2

between pages

Integrate database to web application using PHP-MYSQL

4 An 1,2
database connection
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 133 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

1.1 Introduction to web, WWW architecture, 1 1

Fundamentals of HTML, text formatting tags- text

1.2 4 1
formatting tag, FONT tag, header tags.
1
1.3 Inserting images, links, lists, marquee, 3 1

1.4 Creating tables, working with form elements. 4 1

CSS introduction, <link> and <style> elements, CSS

2.1 properties, Controlling Fonts, Text formatting, Text- 7 2
2 pseudo classes, Selectors, Links, Backgrounds, lists.

Introduction to PHP, server-side scripting, XAmPP, role

2.2 of web server software, php comments,variables, echo 5 2
and print, PHP operators, data types.

3.1 PHP branching statements and looping statements, 5 3

arrays in PHP-numeric array, associative array,

3.2 5 3
multidimensional array,
3 array functions in PHP- push, pop, shift, unshift,
3.3 array_search, in_array, sort(), rsort, asort, arsort, ksort, 5 3
krsort
PHP form:$_GET,$_POST,$_SERVER, $_REQUEST,
3.4 4 3
$_GLOBALS, include and require function

4.1 Basic MYSQL commands CRUD 5 4

4 PHP- MYSQL database connectivity using procedure-

4.2 6 4
oriented methods-mysqli_connect, mysqli_close.
mysqli_query, mysqli_fetch_row,
4.3 6 4
mysqli_fetch_assoc, mysqli_fetch_array

5 (Teacher specific content)

Page 134 of 222

Teaching and Learning Classroom Procedure (Mode of transaction)
Approach
Lecture, Demonstration through ICT tools

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES

1. Ivan Bayross - “HTML, DHTML, JavaScript, Pearl & CGI ”, BPB Publication. (Module
1,2)
2. Dave W Mercer, Allan Kent, Steven D Nowicki, David Mercer, Dan Squier, Wankyu
Choi- “Beginning PHP5”, Wiley Publishing, Inc (Module 3)
3. Adrian W. West, Steve Prettyman, Practical PHP 7, MySQL 8, and MariaDB Website
Databases, A Simplified Approach to Developing Database-Driven Websites, Second
Edition, Apress (Module 4)

SUGGESTED READINGS

1. Thomas A. Powell- “HTML & CSS: The Complete Reference”, 5th Edition, McGraw Hill
2. Mike O'Kane, Essential Algorithms, Syntax, and Control Structures Using PHP, HTML,
and MariaDB/MySQL, Carolina Academic Press, Fourth Edition.
3. Julie C. Meloni, Teach Yourself PHP, MySQL® and Apache All in One, Fifth Edition.

Page 135 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Design Principles of User Computer Interaction
Type of Course DSE
Course Code MG5DSECSC304
Course Level 300
This course provides comprehensive coverage of Human-Computer
Interaction (HCI) fundamentals, design principles, and evaluation
Course methods, integrating psychological insights, interaction models,
Summary usability testing, and advanced topics such as augmented reality and
security considerations to create user-centric applications across various
domains.

Semester 5 Credits 4 Total

Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites, if
any

COURSE OUTCOMES (CO):

After the completion of course student should be able to
CO Learning PO
Expected Course Outcome
No. Domains * No
Describe the basic concepts of human, computer interactions
1 and create the processes of human computer interaction life K 1
cycle

2 Analyze and design the various interaction design models An 2

3 Apply the interface design standards/guidelines for evaluating A 2

the developed interactions
4 Apply product usability evaluations and testing methods and A 2
demonstrate the principles of human computer interactions
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 136 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

HCI Foundations, Designing Interaction 15hrs

Input–output channels, Human memory and cognition,

1.1 Emotional aspects in design, Individual differences in 5 1
user behaviour
1 Psychological principles in interactive system design,
1.2 Various input devices: keyboards, touchscreens, etc., 5 1
Display technologies and interfaces
Applications: Designing mobile interfaces for elderly
1.3 users. Use Case: Developing a navigation app for 5 1
visually impaired individuals

Interaction Design Models and Evaluation Methods 10hrs

Model Human Processor and GOMS models, State

2.1 transition networks and Fitts' Law, Heuristic evaluation 5 2
2 and usability testing, Contextual evaluation techniques.
Applications: Designing a social media platform
2.2 interface. Use Case: Usability testing of a task 5 2
management application.

Guidelines in HCI and Communication 15hrs

3.1 Shneideman's eight golden rules, Norman's model of 5 3

interaction, Nielsen's ten heuristics,
3 3.2 Dialog design notations and semantics, Face-to-face 5 3
and Text-based Communication in HCI.
Applications: Designing an e-commerce website
3.3 interface. Use Case: Analyzing user feedback for a video 5 3
conferencing tool.
Human Factors and Security, Validation and Advanced 20 hrs
Concepts
Human Factors in Interaction Design, Security
4.1 Considerations in HCI, Groupware and Collaboration, 10 4
4 Frameworks for groupware Implementation,
Augmented and Virtual Reality. Application: Designing
a Health Monitoring Wearable Device. Use Case:
4.2 10 4
Evaluating User Privacy Concerns in a Social
Networking Site

5 (Teacher specific content)

Page 137 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning • ICT enabled Class room Lectures
Approach • Interactive sessions
• Discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES

1. DA Dix, Janet Finlay, G D Abowd, R Beale.(2008). Human-Computer Interaction(3rd

Edition).Pearson Publishers.

SUGGESTED READINGS
1. Shneiderman, Plaisant, Cohen and Jacobs, Designing the User Interface: Strategies for
Effective Human Computer Interaction, 5th Edition, Pearson Publishers, 2010.
2. Hans-Jorg Bullinger, ”Human-Computer Interaction”, Lawrence Erlbaum Associates,
Publishers
3. Jakob Nielsen,”Advances in Human-computer Interaction”,Ablex Publishing
Corporation
4. Thomas S. Huang,” Real-Time Vision for Human-Computer Interaction”, Springer
5. Preece et al, Human-Computer Interaction, Addison-Wesley, 1994

Page 138 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Software Development Lab 1

Type of Course SEC

Course Code MG5SECCSC300

Course Level 300

This course has been introduced to make students capable of developing

Course software applying the concepts and techniques learned. This course
Summary provides a platform for developing their communication and presentation
skills.

Semester 5 Credits 3
Total
Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
1 0 2 0 75

Pre-requisites, Must have learnt any one of Python, Java, PHP or C, Require knowledge
if any in Software Engineering Techniques

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

Upon completion of this course, the students will be able to:

Apply Software Engineering concepts in project

1 A 1, 2
development.

2 Plan, analyse, design a project using any selected technique. C, Ap 3, 2,8

Page 139 of 222

 Demonstrate independent and group learning through
3 A, S 4
project implementation.

4 Demonstrate and document software product. A, S 5,9

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Discussion on Software Development life cycle,

1 1.1 15 1,2,3,4
Design principles and techniques, Documentation

Develop a complete Software using Python/

Java/PHP/C. Apply software engineering concepts in
the development. Projects can be individual or group
wise. Maximum number of students allowed in a
group is two. The internal and external evaluation
include project demonstration and viva. A project
2 2.1 report should be submitted at the end of the semester. 60 1,2,3,4
Project must be done in the college lab under the
guidance of a faculty from the department.
• Students opting for the 'Web and Mobile
Technologies' track are required to utilize PHP
programming language for software
development purposes.

Classroom Procedure (Mode of transaction)

Teaching
Discussions
and Learning
Presentations
Approach
Project Development

Assessment MODE OF ASSESSMENT

Types A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 15 Marks

Page 140 of 222

 1. Viva
2. Review
CCA for Practical: 15 Marks
1. Review
2. Demonstration
3. Report
4. Viva

B. Semester End examination

ESE for Theory: 35 Marks

1. Viva - 25 Marks
2. Report - 10 Marks

ESE for Practical: 35 Marks

1. Project demonstration and Presentation - 25 marks

2. Report - 10 marks

Page 141 of 222

SEMESTER VI

Page 142 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer science

Course Name Cloud Computing

Type of Course DSC

Course Code MG6DSCCSC300

Course Level 300

Analyse the fundamentals of Cloud Computing and Virtualization

Technologies, exploring their evolution, characteristics, and
implementation levels. Investigate Cloud Architecture, Services, and
Course
Deployment Models, including Software as a Service (SaaS), Platform as
Summary
a Service (PaaS), and Infrastructure as a Service (IaaS). Examine leading
Cloud Service Providers and their applications in various industries, such
as Amazon Web Services, Google AppEngine, and Microsoft Azure.

Semester 6 Credits
4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
4 0 0 0 60

Pre-requisites, if Understanding of computer science fundamentals, networking

any principles.

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Describe Cloud Computing fundamentals, including U 1

characteristics and on-demand provisioning.
Analyze Virtualization: Types, Implementation Levels,
2 An 2
Structures, Tools, and Mechanisms.
Describe Cloud Architecture, NIST reference, and various
3 U 1
service models.

Page 143 of 222

 Analyze different cloud service providers and cloud
4 An 2
applications
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Cloud Computing –Definition of Cloud –
1.1 7 1
Evolution of Cloud Computing
1
1.2 Cloud Characteristics –Advantages and Challenges 8 1

2 Basics of Virtualization – Types of Virtualization –

2.1 7 2
Implementation Levels of Virtualization
Virtualization Structures – Tools and Mechanisms –
2.2 8 2
Virtualization of CPU – Memory – I/O Devices
Layered Cloud Architecture Design – cloud services- 3
3.1 8
Software as a Service Platform as a Service.
3
Infrastructure as a Service. Cloud deployment models-
3.2 public private, community, hybrid 7
3
Cloud Platforms in Industry: Amazon Web Services,
4 4.1 8 4
Google AppEngine, Microsoft Azure

Cloud Applications: Scientific Applications, Business and

4.2 Consumer Applications 7 4

5 Teacher specific content

Teaching and Learning Classroom Procedure (Mode of transaction)

Approach
Lecturing and Discussion

MODE OF ASSESSMENT
Assessment Types A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 30 Marks

1. Written tests

Page 144 of 222

 2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions)
- (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Toby Velte, Anthony Velte, Robert Elsenpeter(2009). "Cloud Computing -A Practical
Approach”.Tata Mcgraw Hill.

SUGGESTED READINGS

1. George Reese, "Cloud Application Architectures: Building Applications and

Infrastructure in the Cloud: Transactional Systems for EC2 and Beyond (Theory in
Practice)”, O'Reilly, 2009
2. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud Computing,
From Parallel Processing to the Internet of Things", Morgan Kaufmann Publishers, 2012
3. .Rittinghouse, JohnW., and James F. Ransome, “Cloud Computing: Implementation,
Management and Security”, CRC Press, 2017.
4. .Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, “Mastering Cloud
Computing”, Tata Mcgraw Hill, 2013.

Page 145 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Software Development Lab 2

Type of Course DSC

Course Code MG6DSCCSC301

Course Level 300

This course has been introduced to make students capable of developing

Course a software applying the concepts and techniques learned. This course
Summary provide a platform for developing their communication and
presentation skills.

Semester 6 Credits 4
Total
Hours
Lecture
Learning Tutorial Practical Others
Course Details
Approach
1 0 3 0 105

Pre-requisites, if Must have learnt programming, Require knowledge in Software

any Engineering Techniques.

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

Upon completion of this course, the students will be able to:

Conduct research to acquire a thorough understanding of

1 A 1, 2
current industry requirements.

Page 146 of 222

 Build a software product by applying Software Engineering
2 C, Ap 3, 2,8
methods.

Demonstrate the skills to communicate effectively and to

3 present ideas clearly and coherently to in both the written A, S 4
and oral forms

4 Demonstrate independent learning skills. A, S 5,9

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Discussion on Software Development life cycle,

1 1.1 15 1,2,3,4
Design principles and techniques, Documentation

Develop a complete Software choosing any areas of

current industry requirement, using latest packages
/ languages running on appropriate platforms
(Except the tools used in Software Development Lab
1), so that the student becomes industry ready. A
2 2.1 90 1,2,3,4
hard bound project report should be submitted that
is complete in all aspects. For internal evaluation,
the progress of the student shall be systematically
assessed through various stages of evaluation at
periodic intervals. Projects should be individual.

Classroom Procedure (Mode of transaction)

Teaching and Discussions
Learning Approach Presentations
Project Development

Page 147 of 222

 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
CCA for Theory: 15 Marks

1. Viva
Assessment Types
2. Review
CCA for Practical: 25 Marks
1. Review
2. Demonstration
3. Report
4. Viva

B. Semester End examination

ESE for Theory: 35 Marks

1. Viva - 25 Marks
2. Report - 10 Marks

ESE for Practical: 50 Marks

1. Project Presentation and Demonstration - 30 Marks

2. Viva Voce - 10
3. Report - 10 marks

Page 148 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Big Data Analytics
Type of Course DSE
Course Code MG6DSECSC300
Course Level 300
This course introduces Big Data concepts and the Hadoop ecosystem,
covering data classification, Hadoop features, HDFS, MapReduce,
Course Summary and frameworks like Pig and Hive for Big Data applications. Students
will gain practical experience with Hadoop tools and techniques for
processing and analyzing large datasets.
Semester 6
Credits 4 Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites, if
Basic knowledge in DataBaseManagementSystems.
any

COURSE OUTCOMES (CO):

After the completion of course student should be able to
CO Learning PO
Expected Course Outcome
No. Domains * No
Understand the fundamental characteristics of big data,and
1 differentiate between structured, semi-structured, and U 1
unstructured data.

2 Explain the advantages and features of Hadoop technology. A 1,2

Understand and implement MapReduce programming,

3 including job execution, handling failures, and optimizing U,A 1,2
performance.
4 Compare and contrast Pig and Hive for big data processing A 2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)
COURSE CONTENT

Page 149 of 222

 Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Introduction to Big Data

Classification of digital data - structured, semistructures,

1.1 unstructured data-Characteristics of data- Definition of big 8 1
1 data-evolution, challenges with big data
Three Vs of big data- Other characteristics.-Business
1.2 Intelligence versus Big Data-Hadoop Environment-why 7 1
big data.

Introduction to Hadoop

Features of Hadoop-Key Advantages of Hadoop-Versions

2.1 of Hadoop-Overview of Hadoop Ecosystems-Hadoop 7 2
Distributions-Hadoop versus SQL-RDBMS versus-
2 Hadoop
Hadoop Overview-Hadoop Use case-Managing Resources
2.2 with YARN. Hadoop Distributed File System(HDFS)- 8 2
HDFS Daemons- Anatomy of File Read and Write-Working
with HDFS Commands-Special Features of HDFS

Processing Data with Hadoop

3.1 MapReduce, Daemons-Working-Example.MapReduce 8 3

Programming-Mapper,Reducer, Combiner, Partitioner
3
Anatomy of a Map Reduce Job runFailures-Job Scheduling-
3.2 Shuffle and Sort – Task execution - Map Reduce Input- 7 3
Output Types and Formats- Map Reduce Features.

Frameworks

Applications on Big Data Using Pig- Pig Latin Overview-

3.1 Operators-Data Types- Pig Latin Running Modes- 8 4
Relational Operators-AVG, MAX, COUNT- Complex Data
3 Types-Word Count example using Pig.
Introduction to Hive-Architecture- Data Types- File
3.2 Formats- HiveQL. Difference between RDBMS and 7 4
Hadoop, MapReduce versus Pig, Pig versus Hive
(Teacher specific content)
5

Page 150 of 222

 Classroom Procedure (Mode of transaction)
• ICT enabled Lecture
Teaching and Learning • Interactive sessions
Approach • Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks
1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Seema Acharya, Subhasini Chellappan(2015). "Big Data Analytics". Wiley. (Module
I,2,3,4).
2. Tom White(2012). “ Hadoop: The Definitive Guide”(Third Edition). O’reilly Media.
(Module 3)

SUGGESTED READINGS:
1. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”,
Cambridge University Press, 2012.
2. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, John Wiley & sons, 2012.
3. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007.
4. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.

Page 151 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Internet of Things
Type of Course DSE
Course Code MG6DSECSC301
Course Level 300
This course provides a comprehensive understanding of the
Course fundamentals of the Internet of Things (IoT), covering key concepts,
Summary technologies, and applications. The syllabus is organized into four units,
each addressing crucial aspects of IoT.

Semester 6 Credits 4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
4 0 0 0 60
Pre-requisites, if
Basic knowledge of Computer Networks.
any

COURSE OUTCOMES (CO):

After the completion of course student should be able to
CO Learning PO
Expected Course Outcome
No. Domains * No
1 Demonstrate Knowledge of IoT Fundamentals U 1
Understand and implement sensor networks and IoT
2 development boards, including Arduino, Raspberry Pi, U,A 1,2
and RFID systems.
Understand and apply wireless sensor networks and IoT
3 U,A 1,2
wireless technologies
Analyze and evaluate IP-based IoT protocols , edge
4 An,E 2,3
connectivity, IoT applications
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 152 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

1.1 Fundamentals of IoT: Introduction, Definitions & 3 1

Characteristics of IoT

1.2 IoT Architectures, Physical & Logical Design of IoT 4 1

1
1.3 Enabling Technologies in IoT, History of IoT, The 4 1
Identifiers in IoT
About the Internet in IoT, IoT frameworks, IoT and
1.4 M2M. 4 1

2 .1 Sensors Networks : Definition, Types of Sensors, Types 8 2

of Actuators, Examples and Working
2
IoT Development Boards: Arduino IDE and Board
2.2 Types, RaspberriPi Development Kit,RFIDPrinciples 7 2
and components,
Wireless Sensor Networks: History and Context, The
3.1 node, Connecting nodes, Networking Nodes, WSN and 7 3
IoT.
3 Wireless Technologies for IoT: WPAN Technologies for
3.2 IoT: IEEE 802.15.4, Zigbee, HART,NFC, Z-Wave, BLE, 8 3
Bacnet, Modbus.
4.1 IP Based Protocols for IoT IPv6, 6LowPAN, RPL, REST, 3 4
AMPQ, CoAP, MQTT.

4.2 Edge connectivity and protocols 2 4

4 Applications of IoT: Home Automation, Smart Cities,

Energy
4.3 Logistics, Agriculture, Health and Lifestyle, Industrial 10 4
IoT
Retail Management, Legal challenges
IoT design Ethics, IoT in Environmental Protection

5 Teacher Specific Content

Page 153 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning • ICT enabled Lectures
Approach • Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES
1. Vijay Madisetti and Arshdeep Bahga (2014). “Internet of Things (A Hands-on-
Approach)”(1st Edition). VPT.

SUGGESTED READINGS

1. Daniel Minoli, ― “Building the Internet of Things with IPv6 and MIPv6: The Evolving
World of M2M Communications”, ISBN: 978-1-118-47347-4, Willy Publications
2. Pethuru Raj and Anupama C. Raman, "The Internet of Things: Enabling
Technologies,Platforms, and Use Cases", CRC Press
3. Hakima Chaouchi, ― “The Internet of Things Connecting Objects to the Web” ISBN :
978-1-84821-140-7, Wiley Publications
4. Olivier Hersent, David Boswarthick, and Omar Elloumi, ― “The Internet of Things: Key
Applications and Protocols”, WileyPublications
5. J. Biron and J. Follett, "Foundational Elements of an IoT Solution", O'Reilly Media,
2016.Keysight Technologies, “The Internet of Things: Enabling Technologies and Solutions
for Design and Test”, Application Note, 2016.

Web links:
1. https://onlinecourses.nptel.ac.in/noc17_cs22/course
2. http://www.cse.wustl.edu/~jain/cse570-15/ftp/iot_prot/index.html

Page 154 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science

Course Name Understanding MP and MC Architecture

Type of Course DSE

Course Code MG6DSECSC302

Course Level 300

Understanding the operating concepts and programming of 8086

Course Summary
microprocessor

Semester
6 Credits 4 Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60

Pre-requisites, if
Knowledge about digital fundamentals.
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Describe the fundamental concepts of
1 U 1
microprocessor architecture
Develop assembly language programs for the 8086
2 A 1,2
microprocessor.
Demonstrate proficiency in assembly language
3 programming, integrating strings, procedures, and U 1
macros for efficient optimization and recursion.
Demonstrate proficiency in programming and
4 understanding microcontrollers, including 8031 and U 1
PIC.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C),
Skill (S), Interest (I) and Appreciation (Ap)

Page 155 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Microprocessor architecture and its operations – concept
1.1 of clock pulse-basic operations of microprocessor – read 5 1
,write operations. Opcode and operands - accumulator
and flags- . 8086 Internal architecture.
1 Basic 8086 microcomputer system - 8086 bus, Read
1.2 machine cycle,Write machine cycle. .Operating modes- 5 1
Register organization ,.
1.3 Memory segmentation, Instruction sequencing. 8086 5 1
interrupts
Assembly language programming – program
2.1 development steps, 8086 instructions – data transfer 8 2
instructions, arithmetic instructions, bit manipulation
2
instructions, string instructions,
2.2 Program development steps- program execution, Sample 7 2
programs

3.1 Strings , Procedures and Macros – 8086 string 5 3

instructions,
writing and using procedures,CALL and RET
3 3.2 instructions, stack, using PUSH and POP to save register 5 3
contents, passing parameters, reentrant and recursive
procedures,
3.3 writing and using macros. 4 3

Microcontrollers - – 8031 –Basic architecture and

3.1 components of a typical microcontroller -CPU, memory, 8 4
input/output ports, timers, and serial communication
modules
4

Programming basics -Writing assembly and C-language

3.2 programs for the microcontroller -Architecture diagram- 8 4
pins- instructions. Comparison with microprocessors.
New micro controllers.- PIC - other examples.

5 Teacher specific content

Page 156 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning
Approach • ICT enabled Lectures
• Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments

B. Semester End Examination

ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer
all) - (10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES

1. A.Nagoor Kani - Microprocessor 8086 programming and interfacing,Second edition,

Tata McGraw Hill Education.

SUGGESTED READING

1. Microprocessors and Interfacing , Programming and Hardware, Douglas V- Hall. Tata

McGraw-Hill,1990.

Page 157 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Machine Learning using Python
Type of Course SEC
Course Code MG6SECCSC300
Course Level 300
This course deals with various algorithms to enable computers to learn
Course data without being explicitly programmed. An insight into various
Summary types of machine learning algorithms, strategies for model generation
and evaluation are given in this course.

Semester 6 Credits 3
Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
3 0 0 0 45
Pre-requisites, if
Basic knowledge of Python Programming
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Describe the basics, applications, types, and techniques of U

1, 2
machine learning..
2 Describe and evaluate regression and classification U,E
1, 2
techniques in machine learning.
Illustrating an understanding of neural networks, U,An
3 classifier metrics, overfitting, and ensemble learning is the 1, 2
aim.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 158 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

Module Units Course description Hrs CO No.

Introduction to Machine Learning, Examples of Machine

Learning applications, Types of learning: supervised,
1.1 8
unsupervised, semi-supervised learning, learning
1 associations 1
Regression, Classification, Training versus testing.
1.2 Model Selection and Generalization, Data Preprocessing, 7
Feature Selection, Feature Extraction
Regression: Simple Linear Regression, Multiple Linear
Regression, Ridge Regression, Lasso Regression,
2.1 8
Metrics for evaluating regression problems – MAE, MSE,
RMSE, MAPE, R2
2 2
Classification- Logistic Regression, KNN, Decision
2.2 Trees- Entropy, Information Gain, Tree construction, 7
Issues in Decision Tree learning
Neural Networks- The Perceptron, Activation Functions,
3.1 Feed Forward Networks, Multi layer neural networks, 7
Back Propagation.
Measuring classifier performance- Accuracy, Precision,
3 recall, F1 score, ROC curves 3
Problem of Overfitting, Regularization, Cross validation
3.2 8
hyperparameter tuning.
Introduction to Ensemble Learning, Introduction to
Deep Learning.

4 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning • ICT enabled Lectures
Approach • Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 25 Marks

1. Written test

Page 159 of 222

 2. Assignments

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6 Questions)
- (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES

1. Ethem Alpaydın(2004). Introduction to Machine Learning (Adaptive Computation

and Machine Learning). MIT Press.
2. Jake VanderPlas(2016).Python Data Science Handbook.O'Reilly Media.

SUGGESTED READINGS

1. Han, Jiawei, Jian Pei, and Micheline Kamber, “Data mining: concepts and techniques”,
3 rd Edition, Elsevier, 2011.

Page 160 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Natural Language Processing

Type of Course SEC

Course Code MG6SECCSC301

Course Level 300

This course provides a comprehensive foundation for understanding

and applying natural language processing techniques. It covers
Course language fundamentals, linguistics resources, and advanced NLP
Summary topics, including part-of-speech tagging, parsing, semantics, word sense
disambiguation, information retrieval, and practical applications like
machine translation and automatic speech recognition.

Semester 6 Credits 3
Total
Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 0 0 45

Pre-requisites, if
any

Page 161 of 222

 COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Describe the various levels of linguistic analysis. U 2

Distinguish between various NLP techniques for

2 U 1
managing and analyzing linguistic data.

Compare and contrast various aspects of natural language

3 An 2
structure and analysis.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.

1.1 Introduction- Human languages, models, ambiguity, 5 1

processing paradigms. Levels of language analysis-
Syntax, Semantics, Pragmatics.

1.2 Phonetics- Speech Sounds and Phonetic, Articulatory 4 1

Phonetics, Prosody. Text representation in computers,
1 encoding schemes.

1.3 Linguistics resources- Introduction to corpus, elements in 5 2

balanced corpus, TreeBank, PropBank, WordNet,
VerbNet etc. Resource management with XML

2.1 Management of linguistic data with the help of GATE, 5 2

NLTK. Regular expressions, Finite State Automata, word
recognition, lexicon.

Page 162 of 222

 2.2 Morphology, acquisition models, Finite State Transducer. 6 2
2 N-grams, smoothing, entropy, HMM, ME, SVM, CRF.

2.3 Part of Speech tagging- Stochastic POS tagging, HMM, 6 3

Transformation based tagging (TBL), Handling of
unknown words, named entities, multi word
expressions.

3.1 A survey on natural language grammars, lexeme, 7 3

phonemes, phrases and idioms, word order, agreement,
tense, aspect and mood and agreement, Context Free
Grammar, spoken language syntax

3.2 Parsing-Unification, probabilistic parsing, TreeBank. 5 3

Semantics- Meaning representation, semantic analysis,
lexical semantics, WordNet.

3.3 Word Sense Disambiguation- Selectional restriction, 10 4

machine learning approaches, dictionary-based h
3
approaches. Discourse- Reference resolution, constraints h
on co-reference, algorithm for pronoun resolution, text
coherence, discourse structure

3.4 7
Applications of NLP-Machine Translation, Information 4
Retrieval and Extraction, Text Categorization and
Summarization, Automatic Speech Recognition, Text to
Speech.

Classroom Procedure (Mode of transaction)

Teaching and Learning • ICT enabled Lectures
Approach • Interactive sessions
• Class discussions

Assessment Types MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

Page 163 of 222

 CCA for Theory: 25 Marks

1. Written test
2. Assignments

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)
Part A: Very Short Answer Questions
(Answer all) - (10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions)
- (2*10=20 Marks)

REFERENCES

1. Daniel Jurafsky and James H Martin. Speech and Language Processing, 2e, Pearson
Education, 2009

SUGGESTED READINGS
1. James Allen, Natural Language Understanding, 2e, The Benjamin/Cummings
Publishing Company Inc., Redwood City, CA.
2. U. S. Tiwary and Tanveer Siddiqui. Natural language processing and Information
retrieval, OUP, 2008

Page 164 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name User Centric Computing and Software Standards
Type of Course VAC
Course Code MG6VACCSC300
Course Level 300
Course This course is designed for user centric tools and software standards in
Summary computer industry

Semester 6 Credits 3
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 0 0 45
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
Describe the historical evolution, challenges, and
1 U 1,8, 10
evaluation techniques of user-centric design.
Apply knowledge of assistive technologies and ICT to
2 A 1, 2, 9
address various disabilities and enhance accessibility.
Illustrate software quality concepts and quality
3 An, S 2, 5, 10
management frameworks,
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 165 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to user centric design: historical evolution,
1.1 issues and challenges and current trend – User centric 5 1
computing
User centric design evaluation: overview of evaluation
1
1.2 techniques, expert evaluation, user evaluation, model- 6 1
based evaluation with case studies
Introduction to alternative augmentative
1.3 4 1
communication(AAC) – Team based approach
Introduction to Assistive technologies - Assistive Devices
2.1 - Information and Communication technology (ICT) - 5 2
History of assistive technologies
Benefits of ICT - ICT Used at institution level: Online
2.2 education, Teleconferencing, Mobilephone based 3 2
2 education, E-resources
ICT for different disabilities: Intellectual disability,
locomotor impairment and cerebral palsy, hearing
2.3 impairment, Visual impairment, and autism - Comparison 7 2
of present and future of ICT

3.1 Software Quality Concepts: Quality, Quality Control, 5 3

Quality Assurance; Cost of Quality
Software Reliability and Quality Management: ISO 9000,
3 3.2 ISO 9001 Certification - SEI Capability Maturity Model - 7 3
ISO 9000 certification vs SEI/CMM
3.3 Applicability of SEI CMM to organization - Personal 3 3
software process - Levels of PSP.

4 (Teacher specific content)

Page 166 of 222

 Classroom Procedure (Mode of transaction)

Teaching and Learning ICT enabled Lecture,

Approach
Discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 25 Marks

1. Written tests
2. Assignments
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test(50 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions(4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions(2 out of 3 Questions) -
(2*10=20 Marks)

References
1. Dr.Samit Bhattacharya, Human Computer Interaction
2. Narsimhan N, E. Accessibility Policy handbook for persons with disabilities.
Hemkunt Publishers

SUGGESTED READINGS
1. Singh J P, Technology for the blind concept and context, Kanishka Publishers
2. Dr. Hemlata, Technology for inclusion of persons with disabilities, Kanishka
Publishers.
3. Software Engineering: A Practitioner’s Approach, 9th edition – Roger S Pressman,
Bruce R Maxim; McGraw Hill

Page 167 of 222

SEMESTER VII

Page 168 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Advanced Java Programming

Type of Course DCC

Course Code MG7DCCCSC400

Course Level 400

Course Summary Understanding the advanced features of JAVA

Semester 7 Credits 4
Total
Hours
Learning Practica Other
Course Details Lecture Tutorial
Approach l s

3 0 1 0 75

Pre-requisites, if any Knowledge about basic JAVA

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
Apply JDBC architecture, drivers, SQL, and ResultSet
1 interfaces effectively. A 2,3

Develop robust servlets and JavaServer Pages (JSP) for

2 A 2,8
dynamic web applications.
3 Apply networking concepts in application programs A 1.2
Implement database connectivity, networking, RMI and
4 web applications A `1.2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 169 of 222

COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
JDBC – Components of JDBC, JDBC architecture, various kinds
1.1 5 1
of JDBC drivers,
1 The Structured Query Language, The Connection Interface, The
1.2 5 1
Statement Interface, The PreparedStatement Interface,
1.3 Scrollable and Updatable ResultSets, RowSets, Transactions. 5 1

Servlets-The life cycle of a servlet, creation of a simple

2.1 4 2
servlet.

The servlet API-javax.servlet package and javax.servlet.http

2.2 4 2
package,

reading servlet parameters. Handling HTTP GET and HTTP

2 2.3 4 2
POST requests.
Java Server Pages(JSP)-overview, syntax and semantics,
expressions and scriptlets, implicit objects, declarations,
2.4 4 2
directives-include directive, page directive, tag lib
directive.Session and cookies concept

2.5 Java collections,JMS,Java beans, Java server Faces, JDBC 4 2

Networking basics-Networking classes and interfaces,

3.2 InetAddress class-TCP/IP Client Sockets, URL Connection, 5 3
TCP/IP Server Sockets.
3
RMI-basic concepts-A simple client/server application using
3.2 RMI. 5 3

1. Implementing JDBC Connectivity: Develop a Java

application that connects to a relational database using JDBC.
Perform basic CRUD operations (Create, Read, Update,
Delete) on database tables.
2. Creating Servlets: Build a simple web application using
servlets to handle HTTP requests and responses. Implement
servlets for user authentication, data retrieval, and form
submission.
3. JavaServer Pages (JSP) Development: Create dynamic web
4 30 4
pages using JSP to interact with servlets and display data
retrieved from a database. Implement features like user
authentication, session management, and form validation.
4. Networking Basics: Develop a Java application to
demonstrate network programming concepts such as TCP/IP
client-server communication using sockets. Implement a chat
application or a file transfer program.
5. Remote Method Invocation (RMI): Create a distributed
application using RMI to allow communication between Java

Page 170 of 222

 objects running on different JVMs. Implement a simple client-
server application to perform remote method calls.

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and ● ICT enabled Lectures
Learning Approach ● Interactive sessions
● Class discussions
● Lab exercises

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

Assessment Types 1. Written test
2. Assignments
CCA for Practical: 15 Marks
1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination
ESE for Theory: 50 Marks (1.5 Hrs)
Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)
ESE for Practical: 35 Marks (1.5 Hrs)

1. Logic - 10 Marks
2. Successful Compilation - 5 Marks
3. Output - 5 Marks
4. Viva - 10 Marks
5. Record - 5 Marks

Page 171 of 222

REFERENCES
1. Uttam K Roy . ADVANCED JAVA PROGRAMMING. Oxford University Press; UK
edition

SUGGESTED READINGS

1. Herbert Schildt Java 2 The Complete Reference, Tata McGraw Hill (5th Edn.)

2. DT Editorial Services, Java 8 Programming Black Book, Dreamtech Press.

3. James. P. Cohoon, Programming java 5.0, Jack. W. Davison (Tata McGraw Hill)

4. C Thomas Wu, An introduction to Object Oriented Programming with Java, ,

Tata McGraw Hill, (2006)

5. Wigglesworth and McMillan, Java Programming: Advanced Topics, , Cengage

Learning India, 3rd Edn.

6. Bernard Van Haecke, JDBC: Java Database Connectivity, , IDG Books India (2000)

Page 172 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Advanced Database Management Systems
Type of Course DCC
Course Code MG7DCCCSC401
Course Level 400
This course builds upon the foundational concepts of database
management systems and SQL. It covers advanced topics, including
Course Summary Object-Oriented Database Management Systems (OODBMS), NoSQL
databases, and MongoDB. Students will gain a deep understanding of
advanced database concepts and technologies.

Semester 7 Credits 4
Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites, if
Basic understanding of relational database and SQL
any

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *

1 Illustrate transaction processing, Concurrency Control and U 1,2

Object oriented Concepts in database management systems
2 Apply XML in Database Systems. A 1,2,3
3 Analyse distributed and NoSQL databases An 1,2

4 Apply shell operations and querying on MongoDB A 2,3

databases.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 173 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Transaction Processing: Transaction and
1.1 System Concepts, Characterizing Schedules based on 3 1
Recoverability and Seriability,
Two-Phase Locking Technique for Concurrency Control,
1.2 4 1
Recovery Concepts
Overview of Object-Oriented Database Concepts,
1 1.3 Object-Oriented Data Modeling, Object Definition 4 1
Language(ODL), Object Query Language

1.4 Object-Relational Mapping (ORM) 2 1

1.5 Case Studies and Applications of OODBMS 2 1

XML: Extensible
2.1 Markup Language-Structured, Semistructured, and 5 2
Unstructured Data, XML Hierarchical (Tree) Data Model
XML Schema Definition, Storing and Extracting XML
2 2.2 5 2
Documents from Databases

2.3 Querying XML Data (XPath and XQuery) 5 2

Distributed Databases and NoSQL Databases:

3.1 4 3
Distributed Database Concepts, Data Fragmentation
Replication and Allocation Technique for Distributed
3.2 Database Design, Overview of Transaction Management 4 3
in Distributed Databases
3
Introduction to NoSQL databases, Characteristics of
3.3 4 3
NoSQL Systems
Categories of NoSQL Systems, Consistency and CAP
3.4 3 3
Theorem.
Introduction to MongoDB-advantages, features,
4.1 documents, collections, dynamic schemas, naming, 4 4
databases
4
MongoDB Shell, MongoDB client, create, read, update,
4.2 2 4
delete

Page 174 of 222

 4.3 Data types, arrays, embedded documents, objectids 2 4

4.4 insert method, remove, updating documents 3 4

4.5 Basic querying 4 4

5 Teacher Specific Module

Classroom Procedure (Mode of transaction)

• Lecture
Teaching and Learning • Problem Solving
Approach • Presentation
• Discussions
• Case Studies

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination
ESE for Theory: 70 Marks (2 Hrs)

Written Test (70 Marks)

Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCE

1. Ramez Elmasri and Shamkant B. Navathe. DATABASE SYSTEMS(Sixth Edition).

Pearson Education. (Module 1,2,3)
2. Kristina Chodorow. MongoDB: The Definitive Guide( Second Edition). O’Reilly
Media. (Module 4)

Page 175 of 222

SUGGESTED READINGS

1. Reghu Ramakrishnan and Johannes Gehrke- Database Management Systems, Third

edition, Mc Graw Hill International Edition.
2. Andreas Meier, Michael Kaufmann, - SQL & NoSQL Databases-Models, Languages,
Consistency, Options and Architectures for Big Data Management.
3. https://www.mongodb.com/docs/manual/MongoDB-manual.pdf

Page 176 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Advanced Data Structures
Type of Course DCC
Course Code MG7DCCCSC402
Course Level 400
This course offers a thorough understanding of data structures and
algorithms, covering algorithmic analysis, array implementation,
Course Summary
sorting, searching, linked lists, trees, graphs, and hashing for effective
data management and retrieval.
4
Semester 7 Credits
Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites, if
Basic knowledge of Data Structure Concepts
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Demonstrate a comprehensive understanding of advanced U 1

sorting and searching algorithms
2 Analyze and compare AVL trees, Red-Black trees, and B-Trees. A 2

3 Describe and analyze graph representations and traversal An 1,2

algorithms.
4 Describe the implementation and applications of Minimum U 2,3
Spanning Trees and Network Flow Algorithms.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 177 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

1.1 Advanced Sorting Algorithms: Merge sort, quicksort, 5 1

heap sort, radix sort, external sorting techniques.
1 Searching Algorithms: Binary search trees, balanced
1.2 5 1
search trees (such as AVL trees), hash tables, bloom filters.
Advanced Search Techniques: Binary search on sorted
1.3 arrays, interpolation search, exponential search, Fibonacci 5 1
search.
2.1 AVL Trees: Introduction, balancing operations, rotations, 5 2
insertion, and deletion algorithms.

2.2 Red-Black Trees: Properties, insertion, and deletion 8 2

2 algorithms, balancing operations.

2.3 B-Trees and B+ Trees: Structure, insertion, and deletion 9 2

operations, applications in databases and file systems.

3.1 Graph Representation: Adjacency matrix, adjacency list, 3 3

and adjacency set representations.
Graph Traversal: Depth-First Search (DFS), Breadth-First
3 3.2 Search (BFS), applications in graph connectivity and cycle 3 3
detection.
3.3 Shortest Path Algorithms: Dijkstra's algorithm, Bellman- 7 3
Ford algorithm, Floyd-Warshall algorithm.

4.1 Minimum Spanning Trees: Prim's algorithm, Kruskal's 5 4

algorithm, applications in network design and clustering
4 Network Flow Algorithms: Ford-Fulkerson algorithm,
4.2 Edmonds-Karp algorithm, applications in network 5 4
optimization and flow analysis.

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

• ICT enabled Lectures
Teaching and Learning
Approach • Interactive sessions
• Class discussions

Page 178 of 222

 MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination
ESE for Theory: 70 Marks (2 Hrs)
Written Test (70 Marks)
Part A: Very Short Answer Questions (Answer
all) - (10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8
Questions) - (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

References

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein .

"Introduction to Algorithms" (Third Edition). The MIT Press, Cambridge, Massachusetts
London, England.

Suggested Readings

1. "Advanced Data Structures" by Peter Brass, 1st Edition, Cambridge University Press
2. "Algorithm Design" by Jon Kleinberg and Éva Tardos, 1st Edition, Pearson Education
3. "Approximation Algorithms" by Vijay V. Vazirani, 1st Edition, Springer
4. "Algorithms" by Robert Sedgewick and Kevin Wayne, 4th Edition,Addison-Wesley
Professional

Page 179 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Advanced Operating System Concepts
Type of Course DCE
Course Code MG7DCECSC400
Course Level 400
To provide a comprehensive understanding of advanced topics and
Course prepare students for research, development, or advanced system
Summary administration roles and to introduce students to the Mobile application
development ecosystem.

Semester 7 Credits 4
Total Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
4 0 0 0 60
Pre-requisites, if
Basic knowledge in Operating System concepts.
any

COURSE OUTCOMES (CO):

After the completion of course student should be able to
CO Learning
Expected Course Outcome PO No
No. Domains *

1 Analyze distributed, database, and multiprocessor operating An 1,2

systems intricacies

2 Evaluate real-time systems applications and justify design E 1,2,3

choices.

3 Compare and contrast Linux and Windows operating systems U 1

4 Develop proficiency in Android operating system A 1

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 180 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.

Distributed, Database & Multiprocessor operating systems 20 hrs

Distributed Operating Systems: System Architectures

1.1 Design issues – Communication models – clock 6 1
synchronization – mutual exclusion – election algorithms
Distributed Deadlock detection.

Database Operating Systems: Requirements of Databa

1 1.2 se OS – Transaction process model –Synchronization 7 1
primitives Concurrency control algorithms.

Multiprocessor Operating Systems: System Architectur

1.3 es Structures of OS – OS design issues – Process 7 1
synchronization – Process Scheduling and Allocation
memory management.

Real Time & Mobile Operating Systems 15 hrs

Basic Model of Real Time Systems – Characteristic

2.1 sApplications of Real Time Systems – Real Time Task 7 2
2 Scheduling Handling Resource Sharing
Mobile Operating Systems –Microkernel Design Client
2.2 Server Resource Access – Processes and Threads Memory 8 2
Management File system.

Case study on Linux OS and Windows OS 15 hrs

Case Study on Linux: History of Unix and Linux, Linux
3.1 Overview, Processes in Linux, Memory management in 8 3
Linux, I/O in Linux, Linux file system, security in Linux.
3 Case Study on Windows: History of windows through
Windows 10, programming windows, system structure,
3.2 processes and threads in windows, memory management, 7 3
caching in windows, I/O in windows, Windows NT file
system, Windows power management, Security in
windows.
Android OS 10hrs

4 History of Android, Introduction to Android Operating

4.1 Systems, Android Development Tools, Android 5 4
Architecture

Page 181 of 222

 Installing and using Eclipse with ADT plug-in, Installing
Virtual machine for Android sandwich/Jelly bean
4.2 (Emulator), configuring the installed tools, creating a 5 4
android project
– Hello Word, run on emulator, Deploy it on USB-connected
Android device.

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

• ICT enabled Lectures
Teaching and Learning • Interactive sessions
Approach • Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination
ESE for Theory: 70 Marks (2 Hrs)
Written Test (70 Marks)
Part A:Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES
1. Mukesh Singhal, Niranjan G.( 2001). Shivaratri Advanced Concepts In Operating
Systems: Distributed Database And Multiprocessor Operating Systems. Tata
McGrawHill Edition,. (Module 1)
2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne(2018). Operating System
Concepts(10th Edition). John Wiley & Sons. ISBN: 9781118063330.(Module 2)
3. Sheusi, J. C. (2013). Android Application Development for Java Programmers. Cengage
Learning. - Module-4
4. Stevens, W. R., & Rago, S. A. (2013). Advanced Programming in the UNIX® Environment
(3rd ed.). Addison-Wesley. - Module 3

Page 182 of 222

 5. John A.(2020).Understanding Windows Operating Systems". TechPress. - Module 3

SUGGESTED READINGS
1. Dhamdhere, Dhananjay M. Operating systems: a concept-based approach, 2E. Tata
McGraw-Hill Education, 2006.
2. Tanenbaum, Andrew S., and Albert S. Woodhull. Operating systems: design and
implementation. Vol. 68. Englewood Cliffs: Prentice Hall, 1997.
3. W. Stallings, Operating Systems, Internals & Design Principles , 5th Edition, Prentice
Hall of India. 2008.
4. Pradhan, A., & Deshpande, A. V. (2014). Composing Mobile Apps: Learn, Explore and
Apply using Android. Wiley Publications. ISBN: 978-81-265-4660-2. Pradhan, A., &
Deshpande, A. V. (2014). Composing Mobile Apps: Learn, Explore and Apply using Android.
Wiley Publications. ISBN: 978-81-265-4660-2.

Page 183 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Digital Image Computing
Type of Course DCE
Course Code MG7DCECSC401
Course Level 400
Course The course imparts a comprehensive knowledge about the digital image
Summary processing techniques

Semester
7 Credits 4 Total Hours
Learning Lecture Tutorial Practical Others
Course Details\
Approach 4 0 0 0 60
Pre-requisites, if
any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Analyze digital images, processing steps, acquisition,
1 An 1,2
sampling, quantization, color models.
Apply spatial domain techniques for image enhancement
2 effectively A 2

Analyze and utilize frequency domain transformations for

3 image enhancement. An 2

Implement image restoration and segmentation techniques

4 proficiently. A 2

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 184 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Digital Image Processing

1.1 Digital Image and Digital Image Processing 2 1

1.2 Fundamental steps in Digital Image Processing 1 1

1.3 Components of Image Processing system 2 1

1 1.4 Image sensing and acquisition 2 1

1.5 Image sampling and quantization 2 1

1.6 Relationships between pixels 2 1

1.7 Color image fundamentals 2 1

1.8 Color Models-RGB, CMY, HSI 2 1

Image Enhancement in spatial domain

Basic Intensity transformation functions - Image

2.1 Negatives, Log Transformations, Power Law 3 2
Transformations, Piecewise Linear Transformations,

2.2 Histogram processing 3 2

2 Spatial filtering – Spatial correlation and

2.3 3 2
convolution

2.4 Smoothing Spatial Filters 3 2

Sharpening Spatial Filters - Laplacian Filter -

2.5 Unsharp masking - High Boost Filter. Gradient 3 2
operators

Image Enhancement in Frequency domain

Introduction to Fourier transform: 1- DFT, 2 –D DFT

3.1 3 3
and its Inverse Transform,
3
3.2 Properties of 2-D DFT 3 3

Page 185 of 222

 3.3 2-D Convolution theorem 3 3

3.4 Filtering in the frequency domain 3 3

Image Smoothing and Sharpening

3.5 using Frequency Domain Filters- Ideal, Butterworth 3 3
and Gaussian filters

Image Restoration and segmentation

Noise models-Gaussian Noise, Rayleigh Noise,

4.1 2 4
Gamma Noise, Exponential Noise, Impulse Noise
Restoration using Mean Filters, Order Statistics
4.2 2 4
filters, Adaptive filters

4.3 Edge models 2 4

4 Edge Detection - Gradient operator, canny edge
4.4 3 4
detector
Thresholding- Global Thresholding using otsu’s
4.5 3 4
method
Region based segmentation – Region growing,
4.6 Region splitting and merging, watershed 3 4
segmentation

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

Teaching and Learning • Lecturing
Approach • Collaborative learning
• Self-directed learning
• ICT enabled Lectures

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination
ESE for Theory: 70 Marks (2 Hrs)
Written Test (70 Marks)

Page 186 of 222

 Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions) -
(6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)

REFERENCES
1. Rafael C. Gonzalez, Richard E. Woods.(2010). Digital Image Processing(Third
Edition).Pearson.

SUGGESTED READINGS

1. Anil K. Jain, Fundamentals of Digital Image Processing, Pearson, 2002.

2. Kenneth R. Castleman, Digital Image Processing Pearson, 2006.

3. William K. Pratt, Digital Image Processing, John Wiley, Fourth Edition, New York,
2002.
4. Milan Sonka et al, Image processing, analysis and machine vision Brookes/Cole, Vikas
Publishing House, Fourth edition, 2007.
5. AzrielRosenfield, Avinash C. Kak, "Digital Picture Processing", Morgan Kaufmann,
2nd Ed., 1982.
6. Bernd Jahne, “Digital Image Processing”, Springer, 6th Ed., 2005.

Page 187 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Big Data Management using R
Type of Course DCE
Course Code MG7DCECSC402
Course Level 400
The course provides a comprehensive exploration of big data analytics,
covering fundamental concepts, the data analytics lifecycle, advanced
Course tools, and practical skills in R programming for data analysis and
Summary visualization. Students will gain a deep understanding of the analytics
process, from discovery to project operationalization, and develop
proficiency in utilizing key technologies and methodologies in the field.

Semester 7 Credits 4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
4 0 0 0 60
Pre-requisites,
if any
COURSE OUTCOMES (CO)
CO Learning PO
Expected Course Outcome
No. Domains * No

1 Understand big data analytics fundamentals, ecosystems, and U 1

key roles for successful analytics projects.
2 Navigate through the data analytics lifecycle, from discovery to A 1,2
operationalizing projects.
3 Describe the fundamental concepts and functionalities in R U 2
programming
4 Illustrate various data visualization techniques in R U 2
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 188 of 222

 COURSE CONTENT

Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Introduction to Big Data Analytics: Big Data Overview –
1.1 Data Structures - Analyst Perspective on Data 5 1
Repositories - State of the Practice in Analytics
1
BI versus Data Science - Current analytical architecture -
1.2 Emerging big data Ecosystem - Key Roles for the New Big 5 1
Data Ecosystem.
2.1 Data Analytics Lifecycle: Data Analytics Lifecycle 5 2
Overview – Key roles for a successful Analytics project
Background and overview of data analytics life cycle.
2 Phase 1: Discovery, Phase 2: Data Preparation, Phase 3:
2.2 Model Planning, Phase 4: Model Building, Phase 5: 10 2
Communicate Results, Phase 6: Operationalize. (Phases in
detail by including all sub topics.)
3.1 Introduction to R – Basics - RStudio - R Data Types - 5 3
Operators - Basic Read and Write functions

3.2 R Objects: Vector, Matrix, Array, Data Frame, Factor, List 5 3

()– Decision Making Statements – Control Structures
3 Functions - Import and export Data into and from R: CSV,
3.3 5 3
Text file, Excel file

3.4 Exception Handling – Progress and Timing 5 3

4.1 Data Visualization in R: Scatter Plot, Boxplot, Bar Chart, 5 4

Histogram, Box and Whiskers plot
Using plots with Coordinate vector – Graphical
4 4.2 Parameters – Adding Points, Lines and Text to an existing 5 4
plot
4.3 The ggplt2 package - R dplyr package - Data Manipulation 5 4
commands: select, filter, arrange.

5 (Teacher specific content)

Page 189 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning • Lecturing
Approach • Collaborative learning
• Self-directed learning

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 30 Marks

1. Written tests
2. Assignments
B. Semester End Examination
ESE for Theory: 70 Marks(2 Hrs)
Written Test (70 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*2=20 Marks)
Part B: Short Answer Questions (6 out of 8 Questions)
- (6*5=30 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

REFERENCES

1. EMC Education Services. “Data Science and Big Data Analytics”, WILEY
2. Tilman M. Davies.(2016). “ The Book of R”. No Starch Press
3. Seema Acharya.(2018). “Data Analytics Using R”. McGraw Hill Education
4. "R for Data Science" by Hadley Wickham and Garrett Grolemund.

SUGGESTED READINGS

1. "Big Data: A Revolution That Will Transform How We Live, Work, and Think" by
Viktor Mayer-Schönberger and Kenneth Cukier.
2. "Data Science for Business: What You Need to Know about Data Mining and Data-
Analytic Thinking" by Foster Provost and Tom Fawcett.
3. "Predictive Analytics: The Power to Predict Who Will Click, Buy, Lie, or Die" by Eric
Siegel.
4. "Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data" by EMC Education Services.
5. "Hands-On Programming with R: Write Your Own Functions and Simulations" by
Garrett Grolemund

Page 190 of 222

SEMESTER VIII

Page 191 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Advanced Computer Networks
Type of Course DCC
Course Code MG8DCCCSC400
Course Level 400
This advanced course focuses on the theoretical foundations and
practical applications of networking algorithms and real-world network
Course administration strategies. Students will delve into the complexities of
Summary network routing, congestion control, traffic management, and network
security. They will gain hands-on experience in configuring and
managing network devices using CCNA and CompTIA standards.

Semester 8 Credits 4
Total
Hours
Learning Lecture Tutorial Practical Others
Course Details
Approach
3 0 1 75
Pre-requisites,
Preferably completed course on Networking Fundamentals
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Describe the principles and importance of high-performance U 1

switching and routing in network architectures.
Apply Software-Defined Networking (SDN) and Network
2 Function Virtualization (NFV) concepts in practical A 2
scenarios.
Evaluate the effectiveness and challenges of Information-
3 Centric Networking (ICN) architectures in modern E 3
networks..
Create and design simulated network configurations
4 integrating SDN, NFV, and Data Center Networking S 3
concepts.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

Page 192 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
High Performance Switching and Routing ,Introduction to
1.1 High Performance Switching and Routing, Performance 7 1
considerations and IP address lookup.Algorithms and
Optimization
1 Hardware implementation of address lookup and
optimization techniques.
1.2 Packet Classification and QoS , Packet Classification 8 1
Fundamentals , Methods and importance of packet
classification.Quality of Service (QoS), Traffic shaping,
differentiation, and QoS implementations.
Network Softwarization , Introduction to Network
Softwarization, Overview of SDN, NFV, and
2.1 programmable networks. Deep Dive into SDN and NFV, 7 2
Software Defined Networking (SDN), Northbound and
Southbound interfaces, SDN controllers, Mininet lab
2 exercises
Network Function Virtualization (NFV) , Architecture,
concepts, and practical applications. Data Center
2.2 Networking (DCN), Introduction to DCN. Understanding 8 2
DCN and various network topologies. DCN Deep Dive ,
Container Network Interfaces (CNIs) and advanced DCN
concepts.
Information-Centric Networking (ICN), Content
3.1 Distribution and Architectures for ICN 7 3
Principles and architectures of ICN.
3 Advanced ICN Topics. Content Naming, Routing,
3.2 Caching. In-depth study of content naming, routing, 8 3
caching in ICN. Security in ICN
Security aspects and challenges in ICN.
Practical Exercises in Switching, Routing, SDN, NFV,
4 DCN, and ICN 30 4
Hands-on implementation, simulations, and lab exercises
covering the course topics.
5 (Teacher specific content)

Page 193 of 222

 Classroom Procedure (Mode of transaction)
Teaching and Learning
Approach • Collaborative learning
• Self-directed learning
• ICT enabled Lectures

MODE OF ASSESSMENT

A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
Assessment Types
2. Assignments

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)

Part A: Very Short Answer Questions (Answer all)
- (10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks

1.Demonstration - 20 Marks
2.Viva - 10 Marks
3.Record - 5 Mark

Page 194 of 222

REFERENCES

1. H. Jonathan Chao, Bin Liu, (2007). High Performance Switches and Routers.
John Wiley & Sons, Inc. ISBN-10: 0-470-05367-4(Module 1)
2. Gabriel M. de Brito, Pedro B. Velloso, Igor M. Moraes, Wiley-ISTE.(2013).
Information-Centric Networks: A New Paradigm for the Internet (Focus Series in
Networks and Telecommunications).(1st edition).ISBN: 9781848214491(Module 2)
3. B. Wissingh, C. Wood, A. Afanasyev, L. Zhang, D. Oran and C. Tschudin, RFC
8793.(2020). Information-Centric Networking (ICN): Content Centric Networking
(CCNx) and Named Data Networking (NDN) Terminology. (Module 3)

SUGGESTED READINGS

1. Software-Defined Networks: A Systems Approach, Peterson, Cascone, O’Connor,

Vachuska, and Davie, Online Free Reference Book available at
https://sdn.systemsapproach.org/index.html
2. Cloud Networking: Understanding Cloud-based Data Centre Networks, Gary Lee
(Author), Morgan Kaufmann (Publisher), 2014,ISBN-139780128007280

Page 195 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Computational Research Methodology
Type of
DCC
Course
Course Code MG8DCCCSC401
Course Level 400
The course in Research Methodology and Ethics for Computer Science
provides a comprehensive understanding of fundamental research
concepts, data analysis methods, and historical developments in computing
research. Students will acquire analytical skills through hands-on
Course applications of parametric tests and interdisciplinary research approaches.
Summary The curriculum emphasizes ethical considerations in research, addressing
issues such as plagiarism, data misuse, and intellectual property rights. By
the end of the course, students will be equipped with the knowledge and
skills necessary to conduct ethical and rigorous research in the field of
computer science.

Semester 8 Credits 4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 1 0 75
Pre-requisites, Basic understanding of computer science concepts and familiarity with
if any academic writing and research principles.

COURSE OUTCOMES (CO)

CO Learning
Expected Course Outcome PO No
No. Domains *
Describe research methodology, including objectives, types,
1 U,A 1,2
approaches, and significance.
Explain the comprehensive framework of research
2 U 2
methodology and scientific method.
Describe the historical evolution of computing ideas, explore
3 research methods, and analyze the application of computers U,An 3,6
in research.
Apply computer science research methodology to prepare a
4 A 2
research paper

Page 196 of 222

 *Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Meaning, Objectives, Motivation, Types, Approaches and
Significance of Research, Research Methods versus
1.1 5 1
Methodology, Research and Scientific Method, Research
Process,
1 Reading and Reviewing-Research literature, Finding
1.2 Research Papers, Critical Reading, Developing a literature 5 1
Review,
Guidelines for Research Skills and Awareness, Validity of
1.3 5 1
Research,Criteria of Good Research.
Data analysis in Research:Introduction, Need for Data
2.1 2 2
Collection, Methods of Data Collection
Principles for Accessing Research Data, Data Processing,
2.2 2 2
Data Analysis, Presentation of Data,
Error Analysis, Scientific Models. Scientific Methodology -
2.3 3 2
Introduction Rules and Principles of Scientific Method.

2 Hypothesis,Testing of Hypothesis, Basic concepts,

2.4 Procedure,Important parametric tests: z-test ,t-test, χ 2 - 4 2
square test, F test
Ethics in Research, Technical Reports-Bibliography
2.5 4 2
referencing and footnotes.
Research in Practice- Literature Review, Journals,
2.6 Conference Proceedings, journal Impact Factor, citation 4 2
Index, h Index.
History of ideas in computing, Evolution of Computing
3.1 2 3
Research
3 Overview of Research Methods: Measurements based
3.2 3 3
research methods - Deductive Methods - Inductive Methods.
The significance of Interdisciplinary research for Computer
3.3 3 3
Science.

Page 197 of 222

 Application of Computer in Research --MS office and its
3.4 application in Research, Use of Internet in Research – 3 3
Websites, search Engines, E-journal and E-Library.
Prepare a research paper by applying the principles of
literature review, hypothesis formulation, data collection,
4 4.1 30 4
analysis, and ethical considerations in the context of
computer science.

(Teacher specific content)

5

Classroom Procedure (Mode of transaction)

• Lecture
Teaching and • Presentations
Learning Approach • Interactive sessions
• Class discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

Assessment Types 1. Written tests
2. Assignments

CCA for Practical: 15 Marks

1. Literature Review
2. Review Report
3. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)
ESE for Practical: 35 Marks

1. Paper publication - 25 marks

2. Viva - 10 marks

Page 198 of 222

REFERENCES
1.Kothari, C.R.(1990). Research Methodology: Methods and Techniques. New Age
International. Publishers( Second revised edition)

SUGGESTED READINGS
1. Krishnan Nallaperumal, “Engineering Research Methodology : A Computer Science
and Engineering and Information and Communication Technologies Perspective. ” (First
Edition)
2. Justin Zobel,Writing For Computer Science, Springer (Third Edition)
3. K Prathapan,Research Methodology for Scientific Writing ,I.K International
Publishing House Pvt.Ltd
4. S.P Satarkar, S.V., 2000. Intellectual Property Rights and Copy right. Ess Publication

Page 199 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Neural Networks and Deep Learning

Type of Course DCE

Course Code MG8DCECSC400

Course Level 400

Neural Networks and deep learning course covers fundamental concepts

and practical skills in neural networks, CNNs, RNNs, GANs, and
Course reinforcement learning using TensorFlow and PyTorch. Participants will
Summary gain hands-on experience in image processing, NLP, generative models,
and unsupervised learning, fostering the ability to apply deep learning to
real-world problems.

Semester 8 Credits 4
Total
Hours
Lecture Tutorial Practical Others
Course Details Learning Approach
3 0 1 0 75

Pre-requisites, if Programming Knowledge, Basic Understanding of Artificial Intelligence

any and machine Learning

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Understand neural networks, activation functions, and U 2,3

backpropagation.

Design and implement CNN and RNN, apply transfer learning

2 techniques, and utilize reinforcement learning algorithms for A, An 1,2,3
complex tasks.

Page 200 of 222

 3 Understand and apply GANs, including DCGAN and WGAN, U,A 1,2,3
as well as clustering and dimensionality reduction techniques.

Design and implement neural networks, CNNs, GANs,

4 reinforcement learning algorithms, clustering algorithms, and A 2,3
dimensionality reduction techniques.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)
CO
Module Units Course description Hrs
No.

Basics of Neural Networks:-Neurons and their mathematical

1.1 representation. 2 1

Activation functions (e.g., sigmoid, ReLU). Feedforward

1.2 2 1
process and the role of weights and biases.

1 1.3 Backpropagation algorithm for training neural networks. 2 1

Deep Learning Frameworks:-Introduction to TensorFlow and

1.4
PyTorch. 2 1

Setting up the development environment, Overview of basic

1.5 operations and syntax.
2 1

Convolution and Pooling Layers:-Understanding

convolutional and pooling operations. Stride, padding, and
2.1 filter design. CNN Architectures:- In-depth study of popular 7 2
architectures (LeNet, AlexNet, VGG, ResNet). Parameters and
design choices.

2
Transfer Learning:-Leveraging pre-trained models for specific
2.2
tasks. Fine-tuning models for custom datasets.
6 2

Basics of Recurrent Neural Networks:-Concept of sequential

2.3 data processing. Vanishing gradient problem and solutions.

Page 201 of 222

 6 2
LSTM and GRU:- In-depth study of advanced RNN
architectures, Handling long-term dependencies.

Basics of Reinforcement Learning:-Markov Decision Processes

(MDPs), Exploration-exploitation trade-off. Q-Learning and
2.4 DQN:-Core algorithms for reinforcement learning, Deep Q 2
Networks for handling complex state spaces.
6

Introduction to GANs:-Generative models and their

3.1 applications, Understanding adversarial training. GAN. 5 3

3 Architectures:- DCGAN (Deep Convolutional GAN), WGAN

(Wasserstein GAN). Exploring variations and improvements.
3.2 Unsupervised Learning:-Clustering algorithms (e.g., K- 5 3
Means).Dimensionality reduction techniques (e.g., PCA).

Practical:

1. Implementing a basic neural network using TensorFlow

or PyTorch.
2. Image Classification using CNNs, Generating Synthetic
4.1 30 4
Images with GANs, Implementing RL algorithms on
4 simple environments.
3. Implementing k-mean Clustering Algorithm, Apply
PCA for a sample dataset and classify.

5 (Teacher specific content)

Page 202 of 222

 Classroom Procedure (Mode of transaction)
• Lecture
Teaching and Learning • Presentations
Approach • Demonstration
• Discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
Assessment Types 3. Quiz
4. Viva

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6
Questions) - (4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)
ESE for Practical: 35 Marks

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Marks

REFERENCES
1. "Deep Learning" by Ian Goodfellow, Yoshua Bengio, and Aaron
Courville;[Module1]
2. "Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow" by
Aurélien Géron.[Module 1]
3. "Deep Learning for Computer Vision" by Rajalingappaa Shanmugamani;[Module2]
4. "Deep Reinforcement Learning" by Pieter Abbeel and John Schulman.[Module 3]
5. "Generative Deep Learning" by David Foster; [Module4]

Page 203 of 222

 6. "Unsupervised Learning" by Ian Goodfellow, Yoshua Bengio, and Aaron
Courville.[Module 4]

SUGGESTED READINGS
1. “Deep Learning with Python" by François Chollet.
2. "Reinforcement Learning: An Introduction" by Richard S. Sutton and Andrew G.
Barto;

Page 204 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name Pattern Recognition

Type of Course DCE

Course Code MG8DCECSC401

Course Level 400

Pattern recognition course provides a comprehensive exploration of

fundamental concepts, including Bayesian Decision Theory, linear
discriminant functions, and nonparametric techniques. Students will
Course
develop practical skills in applying these principles to real-world
Summary
problems, mastering Bayesian parameter estimation, support vector
machines, and stochastic/nonmetric methods for effective pattern
recognition.

Semester 8 Credits 4
Total
Hours
Lecture Tutorial Practical Others
Course Details Learning Approach
3 0 1 0 75

Pre-requisites, Must know programming, Basic Mathematics, fundamental knowledge

if any of machine learning

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No

1 Understand Pattern Recognition Fundamentals and the U 2,3

principles of Bayesian Decision Theory.

2 Analyse Bayesian Parameter Estimation and Nonparametric An 1,2,3

techniques.

Page 205 of 222

 Implement and analyze linear discriminant functions, support
3 vector machines, multilayer neural networks, and various A,An 1,2,3
stochastic and nonmetric methods for classification and
inference.

4 Implement Pattern Recognition techniques for solving Real C 2,3

World Problem.

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)
CO
Module Units Course description Hrs
No.

Pattern recognition systems: – The design cycle, Learning and

1.1 2 1
Adaptation.

Bayesian Decision theory:- two-category classification

1.2 2 1
,Minimum error rate classification.
1 Classifiers, Discriminant functions and Decision Surfaces , The
1.3 2 1
normal density.

Discriminant Functions for the Normal Density, Error

1.4 probabilities and Integrals, Discrete Features, Missing and
Noisy Features. 3 1

Bayesian Parameter estimation and Nonparametric

2.1 Techniques:- Maximum likelihood estimation, Bayesian 3 2
estimation,

Bayesian Parameter Estimation: Gaussian case and general

2.2 3 2
2 theory.

Nonparametric techniques: – Density estimation, Parzen

2.3 3 2
Windows,

k -Nearest Neighbour Estimation, Nearest-Neighbour Rule,

2.5
n

Fuzzy Classification. 4 2

Linear Discriminant Functions: - Linear discriminant

3.1 2 3
functions and decision surfaces.

Page 206 of 222

 Generalized linear discriminant functions, Two-category
3.2 linearly separable case.Non-separable behaviour, Linear 5 3
programming algorithms, Support vector machines.

Multilayer neural networks :– Feedforward operation and

3 3.3 classification. Backpropagation algorithm, Error surfaces, 7 3
Backpropagation as feature mapping.

3.4 Stochastic methods and Nonmetric methods: – Stochastic 4 3

search, Boltzmann learning.

Nonmetric methods: - Decision trees ,CART, Other tree

3.5 methods(ID3,C4.5) - Grammatical methods, Grammatical 5 3
inference.

Practical
Implement following Pattern Recognition Methods
1. Bayesian Decision Theory
2. Bayesian Parameter Estimation
3. Nearest Neighbour Rule
4. Fuzzy Classification
4 4.1 5. Support Vector Machine 30 4
6. Multilayer Neural Networks
7. Boltzmann Learning
8. Decision Trees
9. CART
10. ID3,C4.5

5 (Teacher specific content)

Classroom Procedure (Mode of transaction)

• Lecture
Teaching and Learning • Demonstration
Approach • Presentation
• discussions

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)
Assessment Types
CCA for Theory: 25 Marks
1. Written test

Page 207 of 222

 2. Assignments
3. Quiz
4. Viva

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva

B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6 Questions)
- (4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) -
(2*10=20 Marks)

ESE for Practical: 35 Marks (1.5 Hrs)

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Mark

REFERENCES
1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, Second edition, John
Wiley, 2006

SUGGESTED READINGS
1. S Thodoridis,K Koutroumbas, Pattern Recognition,Fourth Edition, ELSEVIER
Publication.

2. Gonzalez R.C. & Thomson M.G., Syntactic Pattern Recognition - An Introduction,

Addison Wesley.

3. Fu K.S., Syntactic Pattern Recognition And Applications, Prentice Hall

4. RajanShinghal, Pattern Recognition: Techniques and Applications, Oxford University

Press, 2008.

Page 208 of 222

 Mahatma Gandhi University
Kottayam
Programme BSc (Honours) Computer Science
Course Name Generative AI
Type of Course DCE
Course Code MG8DCECSC402
Course Level 400
This course introduces students to the dynamic field of Generative Artificial
Course Intelligence (Generative AI), covering foundational concepts, model
Summary architectures, and practical applications. The curriculum is structured into
four modules, each addressing key aspects of Generative AI.

Semester 8 Credits 4
Total Hours

Learning Lecture Tutorial Practical Others

Course Details
Approach
3 0 1 75
Pre-requisites,
Basic knowledge of machine learning.
if any

COURSE OUTCOMES (CO)

CO Learning PO
Expected Course Outcome
No. Domains * No
Describe generative models' ethical usage, including bias and
1 U 1
fairness.
Apply GANs and VAEs: Implementing architectures, training
2 A 2
models, and exploring applications.
3 Explore recent advances in generative AI: An 2
Apply generative models (GANs, VAEs) using
5 A 2
Python/TensorFlow.
*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill (S),
Interest (I) and Appreciation (Ap)

Page 209 of 222

 COURSE CONTENT
Content for Classroom transaction (Units)

CO
Module Units Course description Hrs
No.
Overview of Generative Models, Introduction to generative
1.1 models and their role in artificial intelligence. Understanding 4 1
the difference between generative and discriminative models
Types of Generative Models, Probabilistic models: Gaussian
Mixture Models (GMM), Hidden Markov Models
1.2 3 1
(HMM).Variational Autoencoders (VAEs) and their
1 applications.
Introduction to Generative Adversarial Networks (GANs).
Applications, Ethical Considerations and Privacy concerns
1.3 related to generative models. Understanding bias and 3 1
fairness in generative AI. Responsible use of generative
models in various domains.
Introduction to GANs

2.1 Core concepts of GANs: generator, discriminator, 2 2

adversarial training. Historical development and key
milestones in GAN research.
Architectures and Variants of GANs, DCGAN, WGAN, and
2.2 3 2
other variants. Conditional GANs and their applications.
Training and Stability Issues: Techniques for stable GAN
2.3 training. Dealing with mode collapse and other common 3
issues.
2 Applications of GANs:Image-to-image translation using 2
2.4 3 2
GANs. Super-resolution and style transfer.
Introduction to VAEs:Understanding the encoder-decoder
2.5 3 2
architecture. The role of variational inference in VAEs.
Training VAEs:The reparameterization trick and
2.6 backpropagation. Comparing VAEs to traditional 3 2
autoencoders.
Applications of VAEs:Image generation and
2.7 reconstruction.Latent space exploration and 3 2
manipulation.VAEs in semi-supervised learning.

Advanced Topics and Future Directions:Recent Advances in

3 3.1 Generative AI Attention mechanisms in generative models. 4 3
Self-supervised learning and its application in generative
tasks.

Page 210 of 222

 Generative AI in Industry,Use cases and applications in
3.2 4 3
various industries.Challenges and opportunities in
deploying generative models.

Research Trends and Future Directions, Cutting-edge

3.3 4 3
research in generative AI.Potential breakthroughs and
challenges on the horizon.

Final Project and Capstone,Students work on a generative AI

3.4 3 3
project of their choice.Presentation and discussion of project
outcomes.

1: Introduction to Python and TensorFlow: Setting up

TensorFlow environment, Basic operations in TensorFlow.

2: Fundamentals of Generative Models: Implementing basic

probabilistic models (Gaussian Mixture Models, Hidden
Markov Models) using Python. Hands-on exercise on
Variational Auto encoders (VAEs).

3: Introduction to Generative Adversarial Networks (GANs):

Building a simple GAN model for generating synthetic data.
Understanding the generator and discriminator networks.
Training a GAN on a small dataset.
4 30 4
4: Advanced GANs and Applications: Implementing
conditional GANs for specific tasks. Exploring image-to-
image translation using Pix2Pix or CycleGAN. Applying
GANs in medical imaging or other domains.

5: Variational Auto encoders (VAEs) in Depth: Building a

VAE for image generation. Understanding the concept of
latent space. Exploring applications in semi-supervised
learning.

6: Attention Mechanisms and Self-Supervised Learning:

Implementing attention mechanisms in generative models.
Hands-on with self-supervised learning techniques.

5 Teacher specific content

Page 211 of 222

 Classroom Procedure (Mode of transaction)
● ICT Enabled lecture
Teaching and Learning
● Interactive sessions
Approach
● Class discussions
● Lab exercise

MODE OF ASSESSMENT
A. Continuous Comprehensive Assessment (CCA)

CCA for Theory: 25 Marks

1. Written test
2. Assignments
Assessment Types 3. Quiz
4. Viva

CCA for Practical: 15 Marks

1. Practical assignments
2. Lab Record
3. Observation of practical skills
4. Viva
B. Semester End Examination

ESE for Theory: 50 Marks (1.5 Hrs)

Written Test (50 Marks)
Part A: Very Short Answer Questions (Answer all) -
(10*1=10 Marks)
Part B: Short Answer Questions (4 out of 6 Questions) -
(4*5=20 Marks)
Part C: Essay Questions (2 out of 3 Questions) - (2*10=20
Marks)
ESE for Practical: 35 Marks (1.5 Hrs)

1. Coding and Output - 20 Marks

2. Viva - 10 Marks
3. Record - 5 Mark

Page 212 of 222

REFERENCES

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

2. David Foster(2019)."Generative Deep Learning". O'Reilly Media

3. "Hands-On Generative Adversarial Networks with Keras" by Rajalingappaa

Shanmugamani

SUGGESTED READING:

1. Generative Adversial Networks(GANs):"GANs in Action" by Jakub Langr and

Vladimir Bok
2. "Generative Adversarial Networks: Building Intelligent Applications" by Kailash
Ahirwar
Variational Autoencoders(VAEs):
3. "Autoencoder and Variational Autoencoder (VAE) Tutorial" by Ian Goodfellow
(Chapter 14 of the "Deep Learning" textbook mentioned above).
4. "Understanding Variational Autoencoders (VAEs)" by Carl Doersch.
Ethics In AI
5. "Artificial Intelligence: A Guide for Thinking Humans" by Melanie Mitchell
6. "AI and Machine Learning for Everyone" by Jeff Heaton
Advanced Topics:
7. "Attention Is All You Need" by Ashish Vaswani et al. (for attention mechanisms).
8. "Self-Supervised Learning" by Philip Bachman et al.
Generative AI in industry:
9. "AI Superpowers: China, Silicon Valley, and the New World Order" by Kai-Fu Lee
10.Industry reports and case studies from organizations like OpenAI, Google AI, and
Microsoft Research.
Research Trends:
11.Read papers from top conferences like NeurIPS, ICML, and CVPR for the latest
research.

Page 213 of 222

 Mahatma Gandhi University
Kottayam

Programme BSc (Honours) Computer Science

Course Name PROJECT/Dissertation

Type of Course PRJ

Course Code MG8PRJCSC400

Course Level 400

Course Summary Students are required to take up research projects under the guidance
of a faculty member. The students are required to complete the
Research Project in the eighth semester.

Semester Total Hours

Credits 12

Course Details Learning

Approach
Lecture Tutorial Practical Others

Pre-requisites, if
any

Page 214 of 222

 COURSE OUTCOMES (CO)

CO Expected Course Outcome Learning PO No

No. Domains *

1 Design research problem and align research objective A 1,2,3,8

2 Demonstrate skills in literature review, data collection, A 1,2,3

analysis, interpretation, and reporting.

3 Appraise research design, methods and experiments A 1,2,3

used.

4 Interpret the findings in relation to research objective A 1,2,3

5 Communicates clearly and effectively, both verbally, A 1,2,3,4

visually and in writing

*Remember (K), Understand (U), Apply (A), Analyse (An), Evaluate (E), Create (C), Skill
(S), Interest (I) and Appreciation (Ap)

COURSE CONTENT
Content for Classroom transaction (Units)

Module Units Course description Hrs CO

No.

1 1.1 The students who want to graduate as BSc (Honours

with Research) are required to complete the Research
Project in the eighth semester. Research Project must be
done under the guidance of an eligible faculty.

Page 215 of 222

Teaching and Classroom Procedure (Mode of transaction)
Learning
Approach

Assessment MODE OF ASSESSMENT

Types A. Continuous Comprehensive Assessment (CCA) - (60 marks)
i. Review 1: Problem statement (CO1)– (10 marks)
ii. Review 2: Literature Review, Gap Analysis,
Research Objectives (CO2) -(20 marks)
iii. Review 3 (CO3): Methodology and Design- (20 marks)
iv. Review 4 (CO4 & CO5): (20 marks)
a) Experiments and Results
b) Presentation and Viva Voce

B. Semester End examination (140 marks)

i. Problem statement (CO1): 10 marks
ii. Literature Review, Gap Analysis, Research
Objectives – (CO2): 30 marks
iii. Methodology and Design (CO3): 30 marks
iv. Experiments and Results (CO4): 30 marks
v. Thesis Presentation and Viva Voce (CO5): 25 marks
vi. Publication (CO5):15 marks

Page 216 of 222

 MAHATMA GANDHI UNIVERSITY, KOTTAYAM

MGU UGP FIVE DAYS WORKSHOP

BoS: Computer Applications

Date: 13-11-2023 to 17-11-2023

Venue: Nirmala College Muvattupuzha

Sl.N
Name of Participant Designation Address
o

Associate Marian College (Autonomous),

1 Dr. Rajimol A
Professor Kuttikkanam

Associate M E S College, Marampally,

2 Dr. Leena C Sekhar
Professor Aluva

3 Dr. Ajitha R S Assistant Professor N S S College, Rajakumari

4 Mr Bijukumar S P Assistant Professor N S S College, Rajakumari

5 Dr. Sowmya M R Assistant Professor Sree Sankara College, Kalady

6 Dr. Reji K Kollinal Assistant Professor B P C College, Piravom

Pavanatma College,
7 Mr. Bineesh Jose Assistant Professor
Murickassery

Sree Sankara Vidyapeetom

8 Ms. Ambili M S Assistant Professor
College, Valayanchirangara

Marian College (Autonomous),

9 Dr. Juby George Assistant Professor
Kuttikkanam

Associate S A S S N D P Yogam college,

10 Ms Bindhu Prabha
Professor Konni

Associate S A S S N D P Yogam college,

11 Ms Simi M
Professor Konni

12 Phijo J Cherickal Assistant Professor MACFAST, Thiruvalla

Page 217 of 222

13 Mr.Syam S Assistant Professor S N College, Kumarakom

14 Ms. Rasmi K P Assistant Professor S R B S Gujarati College, Kochi

Rajagiri College of Managemant

15 Mr. Jobi Jacob Assistant Professor and Applied Sciences,
Ernakulam

Rajagiri College of Managemant

16 Mr. Sijo Jacob Assistant Professor and Applied Sciences,
Ernakulam

Nitmala College,
17 Ms. Preethy George Assistant Professor
Muvattupuzha

Associate
18 Dr. Jeeva Jose B P C College, Piravom
Professor

Indira Gandhi College of Arts

19 Mr. Malik Dinar Assistant Professor
and Science, Kothamangalam

Mr. Arun Saintgits College of Applied

20 Assistant Professor
Padmanabhan Sciences, Kottayam

M E S College, Marampally,
21 Lt. Ibrahim Salim M Assistant Professor
Aluva

22 Mr. Shanavas K A Assistant Professor M E S College, Nedumkandam

23 Mr. Ajmal E B Assistant Professor M E S College, Nedumkandam

Associate
24 Dr sheba K V B P C College, Piravom
Professor

Associate
25 Dr Nimmol P John B P C College, Piravom
Professor

26 Ms. Leeja Mathews Assistant Professor B P C College, Piravom

27 Ms. Jasmin Joseph Assistant Professor K E College, Mannanam

Yeldo Mar Baselius College,

28 Dr.Raghunath K Assistant Professor
Kothamangalam

Page 218 of 222

29 Dr, Ambili Pramitha Assistant Professor DIST, Angamaly

30 Dr. Bismin V Sherif Assistant Professor MES College, Marampally

31 Dr. Jyothy Joseph Assistant Professor Al-Ameen College, Edathala

32 Ms. Namitha Salim Assistant Professor Al-Ameen College, Edathala

Presentation College of Applied

33 Ms. Sini Francis Assistant Professor
Sciences, Puthenvelikkara

Presentation College of Applied

34 Ms.Seema M A Assistant Professor
Sciences, Puthenvelikkara

M E S College, Marampally,
35 Dr Jaseena K U Assistant Professor
Aluva

Associate M E S College, Marampally,

36 Joseph Deril K S
Professor Aluva

St. Theresa's College,

37 Dr Dhanya R Assistant Professor
Ernakulam

St. Theresa's College,

38 Ms. Veena Antony Assistant Professor
Ernakulam

Associate Bishop Vayalil Memorial Holly

39 Mr. Binu M B
Professor Cross College, Cherpunkal

K M M College, Thrikkakkara,
40 Ms. Archana S Assistant Professor
Vazhakkala, Ernakulam

Associate
41 Ms. Simmi John D B College, Keezhoor
Professor

Cochin Arts and Science

42 Ms. Athiraraj Assistant Professor
College, Kakkanad, Kochi

Associate
43 Dr Anu Paul B P C College, Piravom
Professor

Pavanatma College,
44 Mr. Joyson George Assistant Professor
Murickassery

Page 219 of 222

 Bishop Speechly College for
45 Ms. Renju V R Assistant Professor Advanced Studiies, Pallom,
Kottayam

STAS Chuttippara,
46 Ms. Arya S Assistant Professor
Pathamthitta

M E S College, Marampally,
47 Dr. Julie M David Assistant Professor
Aluva

M E S College, Marampally,
48 Dr. Shereena V B Assistant Professor
Aluva

Nirmala College,
49 Ms. Arya S Nair Assistant Professor
Muvattupuzha

50 Dr. Dhanya Job Assistant Professor B P C College, Piravom

51 Ms. Anitta T Manuel Assistant Professor K E College, Mannanam

52 Dr. Suji Gopinath Assistant Professor N S S College, Rajakumari

53 Sumitha V B Assistant Professor S S College, Poothotta

Chinmaya College of Arts,

54 Nisha Sanjay Assistant Professor Commerce & Science,
thrippunithurs

55 Delsey M J Assistant Professor C M S College, Kottayam

56 Ananthakrishna G Assistant Professor C M S College, Kottayam

St Mary's College,
57 Ms Jisha John Assistant Professor
Thuruthyppady

Associate
58 Ms Maya N N.S.S College, Changanacherry
Professor

Associate
59 Mr Anilkumar A C N.S.S College, Rajakumari
Professor

Ms Athira Sara
60 Assistant Professor STAS Chuttippara,
Mathew Pathamthitta

Page 220 of 222

61 Ms Sahira Salih Assistant Professor M E S golden Jubilee College,
Kottayam

Bishop Vayalil Memorial Holly

62 Mr Rajeev P R Assistant Professor
Cross College, Cherpunkal

Sree Sankara Vidyapeetom

63 Dr. Prathibha P H Assistant Professor
College, Valayanchirangara

64 Mr. Cijin K Paul Assistant Professor Union Christian College, Aluva

College of Applied Science,

65 Ms. Jisha John Assistant Professor
Thodupuzha

Sree Sankara Vidyapeetom

66 Dr. Manusankar C Assistant Professor
College, Valayanchirangara

Associate
67 Ms. Shiny John M A College, Kothamangalam
Professor

Ms. Sumaja Sree Sankara Vidyapeetom

68 Assistant Professor
Sasidharan College, Valayanchirangara

Ms. Anjalee Al Ameen College, Edathala,

69 Assistant Professor
Muraleedharan Aluva

70 Ms. Swapna M Assistant Professor STAS, Edappally

71 Ms.Nancy Jismon Assistant Professor Siena College, Edakochi

Mr. Raju George

72 Assistant Professor Aquinas College, Edakochi
Michael

73 Seena Surendran Assistant Professor STAS, Pathanamthitta

College of Applied Science,

74 Ramia P K Assistant Professor
Puthenvelikkara

75 Dr Anitha S Assistant Professor STAS, Edappally

76 Ms Biny Varghese Assistant Professor STAS, Edappally

77 Ms Bitty Mathew Assistant Professor CAS, Kaduthuruthy

Page 221 of 222

78 Ms Reshma R Nair Assistant Professor STAS, Pathanamthitta

79 Sabitha S Panicker Assistant Professor CAS, Puthenvelikkara

Ansu Mary St Thomas College,

80 Assistant Professor
Varghese Thavalappara, Konni

Page 222 of 222