DEPARTMENT OF COMPUTER SCIENCE

COURSE STRUCTURE & SYLLABI

(For the students admitted from year 2023-2024 onwards)

Programme: Master of Computer Applications (MCA)

(Approved by the 32nd Academic Council in its meeting held on 18-03-2023)

JAMAL MOHAMED COLLEGE (AUTONOMOUS)

Accredited (3rd Cycle) with ‘A’ Grade by NAAC
(Affiliated to Bharathidasan University)
TIRUCHIRAPPALLI – 620 020
 M.C.A
Hrs/ Marks
Sem Subject Code Course Category Subject Title Credit Total
Week CIA ESE
23MCA1CC1 Core - I Programming in Java 4 3 25 75 100
23MCA1CC2 Core - II Computer System Architecture 4 3 25 75 100
23MCA1CC3 Core - III Database Systems 4 3 25 75 100
I 23MCA1CC4 Core - IV Resource Management Techniques 4 3 25 75 100
23MCA1CC5 Core - V Management Information Systems 4 3 25 75 100
23MCA1CC6P Core - VI Java Programming Lab - Practical 4 3 20 80 100
23MCA1CC7P Core - VII RDBMS Lab - Practical 4 3 20 80 100
23MCA1SE1 Skill Enhancement Course - I Communication Skills * 2 2 - 100 100
Total 30 23 800
23MCA2CC8 Core - VIII Data Structures and Algorithms 4 3 25 75 100
23MCA2CC9 Core - IX R Programming with Statistics 4 3 25 75 100
23MCA2CC10 Core - X Operating Systems 4 3 25 75 100
23MCA2DE1A/B/C Discipline Specific Elective - I 4 4 25 75 100
II 23MCA2DE2A/B/C Discipline Specific Elective - II 4 4 25 75 100
23MCA2CC11P Core - XI Data Structures Lab - Practical 4 3 20 80 100
23MCA2CC12P Core - XII R Programming Lab - Practical 4 3 20 80 100
23MCA2SE2 Skill Enhancement Course - II Quantitative Aptitude * 2 2 - 100 100
23MCA2EC1 Extra Credit Course - I Summer Internship # - 2 - - -
Total 30 25 800
23MCA3CC13 Core - XIII Python Programming 4 3 25 75 100
23MCA3CC14 Core - XIV Web Programming 4 3 25 75 100
23MCA3CC15 Core - XV Artificial Intelligence and Machine Learning 4 3 25 75 100
23MCA3DE3A/B/C Discipline Specific Elective - III 4 4 25 75 100
III 23MCA3DE4A/B/C Discipline Specific Elective - IV 4 4 25 75 100
23MCA3CC16P Core - XVI Python Programming Lab - Practical 4 3 20 80 100
23MCA3CC17P Core - XVII Web Programming Lab - Practical 4 3 20 80 100
23MCA3SE3 Skill Enhancement Course - III Innovation and Startup Skills * 2 2 - 100 100
23MCA3EC2 Extra Credit Course - II Online Certificate Course # - 1 - - -
Total 30 25 800
23MCA4CC18 Core - XVIII Distributed Technology 4 3 25 75 100
23MCA4DE5A/B/C Discipline Specific Elective - V 4 4 25 75 100
23MCA4CC19P Core - XIX Distributed Technology Lab - Practical 4 3 20 80 100
IV
23MCA4PW Project Work Industrial Experience and Project Work 18 12 25 75 100
23MCA4EC3 Extra Credit Course - III Online Certificate Course # - 1 - - -
23PCNOC Mandatory Online Course** Online Course - 1 - 100 100
#
Not considered for Grand Total and CGPA
* Paper fully Internal Total 30 23 500
** Any Course in Online with Credits
Grand Total 120 96 2900

* DISCIPLINE SPECIFIC ELECTIVES

Semester Course Category Course Code Course Title

23MCA2DE1A Computer Networks
Discipline Specific Electives - I 23MCA2DE1B Network Security and Cryptography
23MCA2DE1C Mobile Application Development
II
23MCA2DE2A Data Science
Discipline Specific Electives - II 23MCA2DE2B Big Data Analytics
23MCA2DE2C Microprocessors, Interfacing and Applications
23MCA3DE3A Parallel Processing
Discipline Specific Electives - III 23MCA3DE3B Quantum Computing
23MCA3DE3C Cloud Computing
III
23MCA3DE4A Software Testing
Discipline Specific Electives - IV 23MCA3DE4B Internet of Things
23MCA3DE4C Compiler Design
23MCA4DE5A Organizational Dynamics
IV Discipline Specific Electives - V 23MCA4DE5B Accounting and Financial Management
23MCA4DE5C Human Resource Management
 MANDATORY BRIDGE COURSES FOR NON - COMPUTER SCIENCE STREAM STUDENTS - 30 CREDITS

Hrs/ Total
Sem Subject Code Course Subject Title Credit CIA ESE
Week Mark

23MCA1ACC1 ADDL. Core - I Computer Programming & Utilization** - 5 100 - 100

I Computer Programming & Utilization Lab -
23MCA1ACC2P ADDL. Core - II - 5 100 - 100
Practical**
Total - 10 200 200
23MCA2ACC3 ADDL. Core - III Web Design** - 5 100 - 100
II
23MCA2ACC4P ADDL. Core - IV HTML and JavaScript Lab - Practical** - 5 100 - 100
Total - 10 200 - 200
23MCA3ACC5 ADDL. Core - V Computer Graphics** - 5 100 - 100
III
23MCA3ACC6P ADDL. Core - VI Animation Lab - Practical** - 5 100 - 100
** Course Fully Internal and in Self-study Mode Total - 10 200 - 200

Extra Credit Courses Semester Credits

Summer Internship End of II 2
Online Certificate Course III 1
Online Certificate Course IV 1
Total 4
 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC1 CORE – I 4 3 25 75 100

Course Title Programming In Java

SYLLABUS
Unit Contents Hours
Java Buzzwords – Class Fundamentals – Declaring Objects – Introducing Methods
– Constructors – This keyword – Garbage Collection – Overloading Methods –
I Argument Passing – Recursion – Access Control Understanding static – final. 12
Inheritance Basics – Using super – Method overriding – Dynamic Method Dispatch
– Using Abstract Classes – * Final with Inheritance * – Object class.
Defining a Package– Access Protection – Importing Packages – Interfaces.
Exception Handling Fundamentals – Exception Types – Using try and catch–
Multiple catch Clauses – Nested try Statements– throw – throws – finally – Java’s
II 12
Built-in Exceptions – * Creating Own Exception Subclasses *. The Java Thread
Model – Creating a Thread – Creating Multiple Threads-Thread Priorities–
Synchronization – Inter-thread Communication.
String Handling – The lang package: Primitive Type Wrappers. The Collections
Framework: List, Set – ArrayList – LinkedList – Vector – Stack– HashTable –
StringBuilder – Date – Calendar - Random – Scanner. The I/O Classes and
III Interfaces - File – The Byte Streams: InputStream – OutputStream – 12
*FileInputStream – File Output Stream* – Print Stream– DataOutputStream –
DataInputStream –The Character Streams: Reader– Writer – FileReader –
FileWriter – PrintWriter – Serialization.
Networking Basics – InetAddress –TCP/IP Client Sockets – URL –
URLConnection – *TCP/IP Server Sockets* – Datagrams – Java Database
IV 12
Connectivity: Establishing a connection – Creation of Data Tables – Entering Data
into Tables – Table Updating – Use of PreparedStatement – Obtaining Metadata.
Event Handling: Delegation Event Model – Event Classes – Event Listener
Interfaces – Layout Managers - Components and Containers – The Swing Packages
V – Exploring Swing: JLabel and ImageIcon – *JTextField – JButton – Check boxes* 12
- Radio Buttons –- JTabbedPane– JScrollPane – JList – JComboBox – Jtrees -
JTable.
Current Trends (For CIA only) – Contemporary developments related to the course
VI
during the semester concerned.
*……* Self Study

Text Book(s):
1. Herbert Schildt, Java The Complete Reference, Eleventh Edition, McGraw-Hill Education,2019.
2. C. Muthu, Programming with Java, Vijay Nicole imprints private Limited, 2004(for JDBC only).
Reference Book(s):
1. Sachin Malhotra and Saurabh Chaudhary, Programming in Java, Oxford University Press, 2018.
2. Daniel Liang, Introduction to Java Programming,Tenth Edition, Pearson, 2015.
Web Resource(s):
1. https://www.javatpoint.com/java-tutorial
2. https://in.coursera.org/specializations/java-programming
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Remembering the fundamental concept of OOPs in Java language K1
Illustrate the concepts like packages, interfaces, exception handling,
CO2 multithreading, Collection, I/O and Networking classes and database K2
connectivity.
CO3 Apply appropriate problem solving strategies K3
CO4 Design GUI based applications. K5
CO5 Create the Java applications to solve the real time problems. K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 3 2 2 2 3 2 3 2 2.4

CO2 2 0 3 3 0 3 2 0 3 3 1.9

CO3 2 3 3 0 3 2 0 3 2 3 2.1

CO4 3 3 3 3 3 3 2 3 2 2 2.7

CO5 2 0 3 2 2 3 3 3 3 2 2.3

Mean Overall Score 2.28

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. M. Mohamed Surputheen

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC2 CORE – II 4 3 25 75 100

Course Title Computer System Architecture

SYLLABUS
Unit Contents Hours
Number Systems – Decimal, Binary, Octal and Hexadecimal Systems – Addition,
Subtraction, Multiplication and Division (whole numbers) – Conversion from one
I 12
system to another – Binary Codes – BCD codes – Weighted codes, Reflected code,
Self-complementing codes – Alphanumeric Codes – *Error Detection Codes*.
Boolean Algebra – Boolean Laws and Theorems – De Morgan’s Theorems –
Complement of a Function - *Duality* – Logic Gates – Universal Logic – Boolean
II Expressions – Sum of Products – Product of Sums – Simplification of Boolean 12
Expressions – Algebraic Method – Karnaugh Map Method (up to 4 Variables) –
Implementation of Boolean Expressions using Gate Networks.
Combinational Circuits – Multiplexers – Demultiplexers – Decoders – Encoders –
III Arithmetic Building Blocks – Half and Full Adders – Half and Full Subtractors – 12
Parallel adder – 2‘s Complement Adder/Subtractor – *BCD Adder*.
Sequential Circuits – Flip Flops – RS, Clocked RS, D, JK, T and *Master-Slave
IV Flip Flops* – Shift Register – Counters – Asynchronous and Synchronous Counters 12
– Mod n Counter - BCD Counter – Ring Counter – Shift Counter.
Central Processing Unit: General Register Organization – Stack Organization –
Instruction Formats – Addressing Modes – Data Transfer and Manipulation –
V Program Control - Status Bit Conditions, Conditional Branch Instructions, 12
Subroutine Call and Return, Program Interrupt, Types of Interrupts – *Reduced
Instruction Set Computer: CISC and RISC Characteristics*
VI Current Trends (For CIA only): Harvard Architecture, Instruction Set Architecture
*……* Self Study

Text Book(s):
1. Donald P. Leach, Albert Paul Malvino and GoutamSaha, Digital Principles and Applications, Tata
McGraw Hill, Sixth Edition, 2007
2. Morris Mano M, Computer System Architecture, Prentice Hall of India, Third Edition, 2008
Reference Book(s):
1. Thomas C. Bartee, Digital Computer Fundamentals, Tata McGraw-Hill, Sixth Edition, 2006
2. Morris Mano M, Digital Logic and Computer Design, Prentice Hall of India, 2008
Web Resource(s):
1. https://www.tutorialspoint.com/Computer-System-Architecture
2. https://www.javatpoint.com/computer-organization-and-architecture-tutorial
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
Examine and classify the various number systems, binary codes, Boolean
CO1 K1, K2
laws and theorems and logic gates
CO2 Perform number conversions and simplify Boolean expressions K3
CO3 Design logic circuits K6
CO4 Analyze the architecture and organization of a Central Processing Unit. K4
CO5 Explain the important concepts in a computer system architecture K5

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 0 3 1.5

CO2 3 3 2 3 2 3 2 3 2 0 2.3

CO3 3 2 3 2 3 2 3 2 3 2 2.5

CO4 2 3 2 2 3 3 3 0 2 2 2.2

CO5 3 2 1 3 1 3 2 1 3 3 2.1

Mean Overall Score 2.12

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. T. Abdul Razak

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC3 CORE – III 4 3 25 75 100

Course Title Database Systems

SYLLABUS
Unit Contents Hours
Introduction: Database System Applications – Purpose of Database Systems –
Views of Data – Database Languages – Data Storage and Querying – Database
I Users and Administrator – Structure of Relational Database – Keys – Formal 12
Relational Query Languages – *Relational Algebra* – The Tuple Relational
Calculus – The Domain Relational Calculus.
Introduction to SQL: Overview of SQL – SQL Definition – Basic Structure of SQL
Queries – Additional Basic Operations – Set Operations – Aggregate Functions–
II Nested Sub-queries – Modification of the database – Intermediate SQL: Join 12
Expression – Views. Database Design: Entity-Relationship Model – *Constraints*
– Entity- Relationship Diagram.
Normalization: Purpose of Normalization – How Normalization Supports Database
Design – *Data Redundancy and Update Anomalies* – Functional Dependencies –
III 12
First Normal Form – Second Normal Form – Third Normal Form. Advanced
Normalization: More on Functional Dependencies – BCNF – 4NF – 5NF.
Storage and File Structure: Overview of Physical Storage – RAID – File
Organization – *Data Dictionary Storage* – Indexing and Hashing – Basic
IV 12
Concepts – Ordered Indices – B + -Tree Index Files – Structure of a B+ -Tree –
Static Hashing – Dynamic Hashing
Transaction: Transaction Concept – A simple Transaction Model – Storage
Structure – Transaction Atomicity and Durability – Transaction Isolation –
V Serializability – Concurrency Control: Lock-Based Protocol –Timestamp-Based 12
Protocol – Validation-Based Protocol– Recovery Systems: *Failure Classification*
– Recovery and Atomicity.
Current Trends (For CIA only): Cloud-based DBMS, Parallel and distributed database
VI
systems
*……* Self Study

Text Book(s):
1. Abraham Silberschatz, Hendry F. Korth and S. Sudarshan, Database System Concepts, 6th Edition,
McGraw- Hill International Edition 2011.
2. Thomas M. Connolly, Carolyn E. Begg., Database Systems A Practical Approach to Design,
Implementation and Management, 4th Edition, Pearson Education, Fifth Impression, 2012.
Reference Book(s):
1. C.J. Date, A. Kannan and S. Swaminathan, An Introduction to Database Systems, 8th Edition,
Pearson Education Asia, 2009.
2.Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems, 5th Edition, Pearson
Education Ltd., 2009.
Web Resource(s):
1. https://dl.ebooksworld.ir/motoman/Pearson.Database.Systems.
2. http://dl.booktolearn.com/ebooks2/computer/databases/9781260515046_Database_System_Concepts
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Understand the basic concepts and various data models in the database K1, K2
Apply ER diagrams for real-time applications, populate and query a
CO2 K3
database by SQL
Acquire knowledge of basic database storage structures and access
CO3 K5
techniques
CO4 Design the database effectively by using normalization techniques K4
Illustrate the concepts of transaction, Concurrency, and Recovery
CO5 K6
techniques in database

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 2 1 3 0 2 2 1 1.9

CO2 3 3 2 3 1 3 2 3 3 2 2.5

CO3 3 3 0 2 3 2 3 2 3 1 2.2

CO4 2 3 3 1 3 3 3 3 0 2 2.3

CO5 3 2 3 3 1 3 2 0 3 3 2.3

Mean Overall Score 2.24

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Mr. S. Syed Ibrahim

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC4 CORE – IV 4 3 25 75 100

Course Title Resource Management Techniques

SYLLABUS
Unit Contents Hours
Operations Research – Nature and Features of O.R. – Definitions of O.R. –
Applications of O.R. – Linear Programming Problem – Mathematical Formulation
I of the Problem – Graphical Solution Method – Some Exceptional Cases – Simplex 12
Method – The Computational Procedure – Use of Artificial Variables – *Two-
Phase Method* – Big-M Method.
Transportation Problem – *Linear Programming Formulation of the Transportation
Problem* – Finding an Initial BFS – North-West Corner Rule – Matrix Minima
Method – Vogel’s Approximation Method – Test for Optimality – Assignment
II 12
Problem – Mathematical Formulation of the problem – Hungarian Assignment
Method – Special Cases in Assignment Problems – The Travelling Salesman
Problem.
Network Scheduling by PERT / CPM – Network: Basic Components – Logical
Sequencing – Rules for Network Construction – Concurrent Activities – Critical
III 12
Path Analysis – Probability Considerations in PERT – *Distinction between PERT
and CPM* – Applications of Network Techniques.
Inventory Control – Types of Inventories – Reasons for Carrying Inventories – The
Inventory Decisions – Objectives of Scientific Inventory Control – Costs Associated with
Inventories – *Factors Affecting Inventory Control* – An Inventory Control Problem –
IV 12
The Concept of EOQ – Deterministic Inventory Problems with No Shortages –
Deterministic Inventory Problems with Shortages – ABC Analysis (Always, Better,
Control) Technique.
Queueing Theory – Queueing System – Elements of a Queuing System – Operating
Characteristics of a Queueing System – Classification of Queuing Models – *Definition of
V Transient and Steady States* – Queueing Models – (M/M/1):(∞ /FIFO) –
12
(M/M/1):(N/FIFO) – (M/M/C):(∞/FIFO) – (M/M/C):(N/FIFO). .
VI Current Trends (For CIA only): Recent Trends in Optimization Techniques
*……* Self Study

Text Book:
Kanti Swarup, P.K. Gupta and Man Mohan, Operations Research, Sultan Chand & Sons Educational
Publishers, New Delhi, Sixteenth Edition, Reprint 2013.
Reference Book(s):
1. Hamdy A. Taha, Operations Research : An Introduction, PHI, New Delhi, 8th Edition, 2008.
2. A. Ravindran, Don T. Phillips, James J. Solberg, Operations Research Principles and Practice, John Wiley
& Sons, Second Edition, Third Reprint, 2007.
Web Resource(s):
1. https://www.tutorialsduniya.com/notes/operational-research-notes/
2.https://www.researchgate.net/publication/313880623_Introduction_to_Operations_Research_Theory_and_A
pplications
3. https://archive.nptel.ac.in/courses/111/105/111105039/
4. https://archive.nptel.ac.in/courses/112/106/112106134/
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Recall the fundamental concepts involved in various Optimization Methods K1
Summarize the procedure for solving different Operations Research
CO2 K2
Problems
Apply the concept of selected resource management techniques to solve the
CO3 K3
real-life problems
Analyze and Examine the steps involved in decision-making problems in
CO4 K4
management
Design, Develop and Explain the suitable optimization technique and then
CO5 K5 & K6
solve the real-world scientific and business problems

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 1 1 3 3 2 2 2 3 2.3

CO2 3 3 3 3 2 3 3 3 2 0 2.5

CO3 3 3 3 3 3 2 3 3 2 2 2.7

CO4 2 3 2 2 3 3 3 1 2 2 2.3

CO5 3 3 3 3 2 2 3 3 3 3 2.8

Mean Overall Score 2.52

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. O.A. Mohamed Jafar

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC5 CORE – V 4 3 25 75 100

Course Title Management Information Systems

SYLLABUS
Unit Contents Hours
Foundation Concepts: Information Systems in Business–Fundamental Roles of IS in
Business – Trends in IS – Roles of e-Business in Business – Managerial Challenges of
Information Technology – Components of Information Systems-Information Systems
I resources – IS Activities. Fundamentals of Strategic Advantages: Competitive 12
Strategy Concepts- Competitive Forces and Strategies– Strategic uses of IT – Building
a Customer Focused Business –Value Chain and Strategic IS –Re-engineering Business
Processes *Virtual Company – Building a Knowledge Creating Company*.
e-Business Systems: Cross Functional Enterprise Applications – Enterprise
Applications Architecture- Enterprise Application Integration – Transaction Processing
Systems - TP cycle – Enterprise Collaboration Systems. Functional Business Systems:
IT in Business- Marketing Systems – Manufacturing Systems – Human Resources
II 12
Systems –Accounting Systems– Financial Management Systems. Enterprise Business
Systems: CRM – Phases of CRM – Benefits, Challenges and Failure. Enterprise
Resource Planning: ERP – Benefits, Challenges and Trends. *Supply Chain
Management: SCM –Roles, Benefits and Trends*
e-Commerce Fundamentals: Introduction to e-Commerce –Scope of e-Commerce –e-
Com Technologies – Essential of e-Commerce Processes –Electronic payment processes
– e-Commerce Applications and Issues – e- Com Success Factors – Web Store
III requirements- Business–to–Business e-Commerce – e – Commerce market Places – 12
Clicks and Bricks in e-Commerce. Security and Ethical Challenges: Ethical
Responsibility of Business Professionals –Challenges of Working in IT– *Computer
Crimes- Privacy Issues– Current State of Cyber Law*
Decision Support Systems: Decision Support in Business– Information, Decision and
Management– Information Quality – Decision Structure – Decision Support trends –
DSS Components – MIS – Online Analytical Processing – Uses of DSS – EIS –
IV Enterprise Portals and Decision Support. Artificial Intelligence Technologies in 12
Business: Overview of A.I – Domains of AI – Expert Systems – Developing Expert
Systems – Neural Networks – Fuzzy Logic Systems – *Genetic Algorithms – Virtual
Reality – Intelligent Agents *.
Enterprise and Global Management of Information Technology: Managing
Information Technology: Business and IT- Managing Information Technology-
Business/IT Planning – Information Technology Architecture – Managing the IT
V 12
functions - Organizing IT – Outsourcing and Offshoring – Failures in IT Management.
*Security Management of IT: Introduction - Tools of Security Management – Inter
Networked Security Defenses – Other Security Measures – System Control and Audits*
Current Trends (For CIA only) Latest Trends in Marketing, e-Commerce, Business
VI
Intelligence and Security Systems.
*……* Self Study
Text Book(s):
James A. O ‘Brien and George M. Marakas, Ramesh Behl,Management Information Systems, Tata
McGraw Hill PublishingCompany Limited, Eleventh Edition, 2019
Reference Book(s):
1. Kenneth C. Laudon and Jane P. Laudon, Management Information Systems: Managing
the Digital Firm,Pearson, Sixteenth Edition, 2020.
2. W.S. Jawadekar, Management Information Systems, Tata McGraw Hill Publishing
Company Limited,1998.
 Web Resource(s):
1. https://www.academia.edu
2. https://www.tutorialspoint.com/management_information_system/mis_tutorial.pdf

Relationship Matrix:

Course Outcomes
Upon successful completion of this course, the student will be able to:
CO Statement Cognitive Level
CO No.
(K-Level)
CO1 Compare and classify various Information systems and their uses. K1, K2
Construct and Build Functional Business systems such as TPS, ERP,
CO2 CRM and SCM. K3

Compare and Contrast E-Commerce and DSS Systems and their

CO3 Implementation. K5

CO4 Analyse the significance of Security Systems for Information Systems. K4

Design of Enterprise and Global Management of Information Technology
CO5 for Information Systems K6

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 2 3 1.7

CO2 3 3 2 3 2 3 2 2 2 0 2.2

CO3 3 2 3 2 3 2 3 3 3 3 2.7

CO4 2 3 2 2 3 3 3 2 2 2 2.4

CO5 3 2 1 3 3 3 2 1 3 3 2.4

Mean Overall Score 2.28

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. A.R. Mohamed Shanavas

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC6P CORE – VI 4 3 20 80 100

Course Title Java Programming Lab - Practical

1. Write Java Applications for the following:

(a) Find the even and odd numbers for 1 to 1000 and count them using else…if statements.
(b) Find the sum of sum of digits of a given number.

2. Class and Object

(a) Program for library information system using suitable fields. (Read and Display book
details)
(b) Program to find the area of rectangle, triangle, square and circle using method
overloading.

3. Inheritance
(a) Program to calculate salary of an employee using single inheritance.
(b)Program to demonstrate method overriding.

4. Packages and Interfaces

(a) Prepare a banking application using the package concept
(b) Program to demonstrate interface

5. Exception Handling
(a) Program to demonstrate using multiple catch clauses
(b) Program to create Threads using extends Thread class and implement Runnable interface

6. String Handling - Program to perform following operations:

(a) Program to count the number of upper case letters, lower case letters, white spaces and
digits of a given sentence
(b) Program to reverse each word using a given sentence

7. Utility Classes
(a) Program to prepare the students’ progress report using vector class
(b) Program to print the system date and time. (hours, minutes and seconds & day, month
and year separately)
8. I/O Streams and Networking
(a) Program for displaying contents of a given file and find the size, length and create date
of a file
(b) Program to create a directory at server and get a message “Successfully Created’. If the
given directory is already created in server, send message to client “Already Exist”.
(Server Socket and Socket classes
9. Database Application
(a) Menu driven program for Employee details. (insert, delete, update and search operations)
(b) Create an Inventory table with suitable fields and insert records through swing
components
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Apply the control statements to solve the simple problems K3
Develop the day to day applications using Inheritance, Packages, and
CO2 K3
Interface
Illustrate the exception handling and string class methods for simple
CO3 K2
applications
Solve the errors in the computer laboratory using I/O and networking
CO4 K3
concepts.
CO5 Create an application for automation of real time problems using database K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 2 2 3 2 3 0 2 3 2.2

CO2 3 3 0 2 3 0 2 3 2 3 2.1

CO3 3 2 3 2 3 3 0 2 3 3 2.4

CO4 2 2 3 0 2 3 2 3 3 3 2.3

CO5 2 2 2 2 3 2 3 0 2 3 2.1

Mean Overall Score 2.22

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. M. Mohamed Surputheen

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1CC7P CORE – VII 4 3 20 80 100

Course Title RDBMS Lab - Practical

I. Data Definition Languages

1. Create the following relations
Customer (customer-Id (Primary key), customer-name, address)
Account (account-number (Primary key), branch-name, and balance)
Loan (loan-number (Primary key), branch-name, and amount)
Branch (branch-name, branch-city, assets)
Depositor (customer-name, account-number)
Borrower (customer-name, loan-number)
Supplier (supplier-number, part-number, color, quantity) use candidate key
2. Unique and Check constraints
3. Write DDL query to perform foreign key with on delete cascade - A foreign key with
cascade delete means that if a record in the parent table is deleted, then the corresponding
records in the child table will automatically be deleted.
4. Alter with three options
Add – add columns in the existing table
Add – constraints
Modify – modify the data type and size in the existing table
Drop – delete column from existing table

II. Data Manipulation Language

1. Insertion
2. Arithmetic, Logical, Comparison operations
3. String Operations
(a) Finds any values that start with "a"
(b) Finds any values that end with "a"
(c) Finds any values that have “ar" in any position
(d) Finds any values that have "r" in the second position
(e) Finds any values that start with "a" and are at least 2 characters in length
(f) Finds any values that start with "a" and are at least 3 characters in length
(g) Finds any values that start with “J" and ends with “y"
4. Tuple Variables
Using branch relation, Find the names of all branches that have assets greater than
at least one branch located in a city (any city)
5. Ordering of Tuples
(a) To list in alphabetic order all customers who have loan at a branch
(b) To list customer names in descending order.
6. Set Operation – (union, Intersect, minus)
(a) Find all customers having a loan, an account or both at the bank.
(b) Find all customers who have both a loan and account at the bank.
(c) Find all customers who have an account but no loan at the bank.
(d) Find all customers who have a loan but not an account at the bank.
7. Aggregate functions – (average, minimum, maximum, total, and count)
(a) Find average account balance at a branch.
(b) Find the minimum balance at a branch. Find the maximum balance at a branch.
(c) Find the total balance at a branch Find the number of accounts in a branch.
(d) Find the 3rd highest balance of account number’s
8. Aggregate functions with group by and having clause)
(a) Find the average account balance at each branch.
(b) Find branch names those branches where the total balance is more than Rs.100000
(c) Find the branches those branches where the total accounts are more than 3.
9. Nested sub-queries. Membership (in and notin)
(a) Find all customers who have both a loan and account at the bank.
(b) Find all customers who have an account but no loan at the bank.
Set Comparison (some, all)
(c) Using branch relation, Find the names of all branches that have asset value greater
than at least one branch located in a city (any city)
(d) Find the names of all branches that have asset value greater than that of each
branch located in a city (any city)
10. Views
Create the view consisting of customer-names and branch-names who have either loan
or an account at the branch.
11. Deletion
(a) Delete the tuples of all accounts with balances below the average at the bank
(b) Delete all accounts tuples at every branch located in a city (any city)
12. Updates
(a) All balances are to be increased by 5 percent.
(b) Update with case statements All accounts with balances over 10000 receives 10
percent interest where as others receive 5 percent
13. Join Operations
(a) Inner join – Find the customer-names who have loan from a branch (KK nagar)
(b) Left outer join – Show the relation, which loan not buy a single customer.
(c) Right outer join – Show the relation, which customers bought loan, that loan details
not in the loan relation
(d) Full outer join

III. PL/SQL Procedure

1. Reverse the string.
2. Student Mark Sheet Preparation
3. Pay Roll preparation
4. Find factorial number using recursive function.
5. Find Fibonacci series using recursive function.
6. Exception Handling
IV. SQL Forms
1. Student Mark System
2. Pay Roll Preparation
3. Income Tax Calculation
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Demonstrate the various operations performed using DDL statements K2
CO2 Construct the programs using Data Manipulation Languages statements K3
CO3 Analyze the programs using the Views and Join Operations K4
CO4 Evaluate and Interpret the PL/SQL procedure’s K5
CO5 Create and Develop programs using SQL forms and real-world problems K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 2 2 3 2 3 0 2 3 2.2

CO2 3 3 0 2 3 0 2 3 2 3 2.1

CO3 3 2 3 2 3 3 0 2 3 3 2.4

CO4 2 2 3 0 2 3 2 3 3 3 2.3

CO5 2 2 2 2 3 2 3 0 2 3 2.1

Mean Overall Score 2.22

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Co-ordinator: S. Syed Ibrahim

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Skill Enhancement Course
I 23MCA1SE1 2 2 - 100 100
–1

Course Title Communication Skills

SYLLABUS
Unit Contents Hours
Listening Comprehension:
Global as well as local comprehension based on the listening to audio cassettes; A
communicative interaction is to be set up in the class room. Testing accuracy of
comprehension by asking ‘yes’ or ‘no’ questions. Meaning of words the students
find difficult, is to be given. Pronunciation and intonation of words and sentences
I 6
Materials used:
1. Sweet and Salty – A Folk Tale 2.The Magic Vessels – A Folk Tale
3. The Crows and Serpent – A Karadi Tale 4. The Monkey and Crocodile – A
Karadi Tale 5) Keep up your English – Cassette 3 6. Tiger‘s Eye – Cassette 1
7. Tiger‘s Eye– Cassette 2 8. Tiger‘s Eye– Cassette 3
Video Viewing:
Introducing students to foreign accent Interaction based on certain important
aspects of the clipping used Discussion of the theme and moral aspects in an
II interactive way 6
Materials used:
1. The King and I 2. Beethovan‘s 2nd 3. Titanic 4. The Sound of Music
5. Mrs. Doubtfire
Grammar and Reading Comprehension:
i. Rules on usage are to be explained clearly
ii. Examples apart from the ones in the text are to be given
III iii. Students are made to answer the exercise following the rules on usage 6
iv. The Comprehension questions following the reading passage are to be answered
v. To improve the usage of rules pertaining to the topic, a guided composition
exercise is to be done.
Speech Practice and Presentation Skills:
 Speech Preparation: Writing out the speech / Presentation materials with
coherence and cohesion
 Delivery and speech presentation
IV 6
Installing confidence and getting ride of stage fear by asking students speak in front
of the class
 Adhering to the policy of – Fluency first and accuracy gradually
 Building up learner confidence through encouragement and appreciation
Interview Skills – Preparation, Presentation and Post Presentation
V 6
Group Dynamics / Discussion
 Reference Book(s):
1. Larry L. Barker, Communication, Prentice Hall, London,3rd Edition, 1984.
2. Mohan, Krishna and Meera Banerji, Developing Communication Skills, Macmillan, Delhi, 1990.
3. Stanton, Nicky, Mastering Communication, Hampshire: Pal grave, 1982.
4. H.M. Prasad, Group Discussion and Interview, Tata McGraw Hill Publishing Company Limited,
New Delhi, 2001.
5. Edgar Thorpe and Showick Thorpe, Winning at Interviews, Pearson Education, New Delhi, 2004.
6. Hemant Goswami, How to be successful in Interviews and get a job, Chandika Press Ltd,
Chandigarh, 2001.
7. G. Ravindran, S.P. Benjamin Ilango and L. Arockiam, Success Through Soft Skills, IFCOT
Publications, 2008.

Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Compare & Classify the various listening comprehension and its activities K1, K2
CO2 Perform according to the videos in an interactive way K3
CO3 Design using grammar and reading comprehension K6
CO4 Analyse the given topic using speech practice and presentation skills K4
CO5 Determine the interview and group discussion skills K5

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 0 3 1.5

CO2 3 3 2 3 2 3 2 3 2 0 2.3

CO3 3 2 3 2 3 2 3 2 3 2 2.5

CO4 2 3 3 2 2 3 3 0 2 2 2.2

CO5 3 2 2 3 2 3 2 1 3 3 2.4

Mean Overall Score 2.18

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low
≥ 1.5 and < 2.5 Medium

≥ 2.5 High
Course Coordinator: Mr. S. Akbar Ali
 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1ACC1 ADDL. CORE - I -- 5 100 -- 100

Course Title Computer Programming and Utilization

SYLLABUS
Unit Contents
Overview of C – Importance of C – Basic Structure of C Programs – Constants – Variables –
Data Types in C – Operators in C – Expressions – Managing Input and Output Operations –
I
Decision Making and Branching –* Various Forms of IF Statements* – The Switch Statement
– The ?: Operator – The GO TO Statement.
Decision Making and Looping – The WHILE Statement– The DO Statement – The FOR Statement –
II Arrays – Types of Arrays – Need for User-Defined Functions – The Form of C Functions – Category
of Functions – *Call by Value – Call by Reference*.
Basic concepts of OOP – Structure of C++ Program – Operators and Data Types in C++ –
Manipulators – Inline Functions – Default Arguments – Recursion – Function Overloading – Classes
III and Objects – Arrays of Objects – Objects as Function Arguments – *Friendly Functions – Returning
Objects*.
Constructors and Destructors – Constructors - Parameterized Constructors – Multiple
Constructors in a Class – Copy Constructors – Destructors – Operator Overloading – Defining
Operator Overloading – Overloading Unary Operators – Overloading Binary Operators –
IV
Overloading Binary Operators using Friends – Rules for Overloading Operators – Inheritance:
Extending Classes – Defining Derived Classes – Single Inheritance – *Multilevel Inheritance
– Multiple Inheritance*.
Pointers, Virtual Functions and Polymorphism – Pointers – Pointers to Objects – *this Pointer* –
Pointers to Derived Classes – Virtual Functions – Pure Virtual Functions – Managing Console I/O
V Operations – C++ Streams – C++ Stream Classes – Unformatted I/O Operations – Formatted Console
I/O Operations – Working with Files.
Current Trends (For CIA only): Developing C / C++ coding for simple real world
VI
application problems
*……* Self Study

Text Book(s):
1. E. Balagurusamy, Programming in ANSI C, Tata McGraw Hill Education Private Ltd., New Delhi,
Fifth Edition, 2011.
2. E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw Hill Education Private
Ltd., New Delhi, Fifth Edition, 2011.
Reference Book(s):
1. Yashavant Kanetkar, Let Us C, BPB Publications, New Delhi, Thirteenth Edition, 2013.
2. Bjarne Stroustrup, The C++ Programming Language, Addison-Wesley, New York, Third Edition,
Eighth Impression, 2012.
Web Resource(s):
1. https://www.programiz.com/c-programming
2. https://www.geeksforgeeks.org/object-oriented-programming-in-cpp/
3. https://onlinecourses.nptel.ac.in/noc22_cs40/preview
4. https://archive.nptel.ac.in/courses/106/105/106105151/
5. https://nptel.ac.in/courses/106105151
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Recall the basic concept of procedure and object-oriented programming K1
Illustrate the fundamental definitions and concepts of C and C++
CO2 K2
Programming
Apply the concept of decision-making, looping, arrays, functions and OOP
CO3 K3
concepts
CO4 Analyze various programming constructs of C and C++ K4
Evaluate and Discuss the suitable logic and principles of C and C++
CO5 K5, K6
Programming for solving real-time application problems

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 1 3 1 3 2 2 2 2 2.1

CO2 3 3 2 2 1 3 2 2 2 2 2.2

CO3 3 3 1 3 2 3 3 3 3 3 2.7

CO4 3 3 3 3 3 3 3 3 3 2 2.9

CO5 3 3 3 3 2 3 3 3 3 2 2.8

Mean Overall Score 2.54

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. O.A. Mohamed Jafar

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
I 23MCA1ACC2P ADDL. CORE - II -- 5 100 -- 100

Course Title Computer Programming and Utilization Lab - Practical

Develop a C and C++Program to illustrate the use of

1. Arithmetic Statements
2. Different forms of if statements (if, if-else and nested if-elses)
3. Various Loop Control Structures (while, do-while and for loop)
4. Case Control Structure (switch)
5. Arrays
6. Call by Value and Call by Reference
7. Class and Object
8. a) Inline Function
b) Friend Function
9. Function Overloading
10. Arrays of Objects
11. Constructors
12. Operator Overloading
13. Inheritance
14. Pointers
15. File
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
Demonstrate the evaluation of expressions and compare the various
CO1 K2
decision-making and looping statements
CO2 Construct Object-Oriented Programs using class, objects and functions K3
Analyze and Examine the result of the function overloading, operator
CO3 K4
overloading and constructors
CO4 Compare the result of different Inheritance Programs K5
CO5 Develop Object-Oriented Programs to solve real-life application problems K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 1 3 1 3 2 2 2 2 2.1

CO2 3 3 2 2 1 3 2 2 2 2 2.2

CO3 3 3 1 3 2 3 3 3 3 3 2.7

CO4 3 3 3 3 3 3 3 3 3 2 2.9

CO5 3 3 3 3 2 3 3 3 3 2 2.8

Mean Overall Score 2.54

Correlation High

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. O.A. Mohamed Jafar

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2CC8 CORE – VIII 4 3 25 75 100

Course Title Data Structures and Algorithms

SYLLABUS
Unit Contents Hours
Introduction – Definitions, Structures and Properties of Algorithms – Analysis of
Algorithms – Arrays – Array Operations – Representation of Arrays in Memory –
I Stacks – Stack Operations – Queues – Operations on Queues – *Circular Queues* 12
– Linked List – Singly Linked Lists – Circularly Linked Lists – Doubly Linked
Lists – Applications.
Trees: Definition and Basic Terminologies – Representation of Trees – Binary
Trees and Representation – Binary Tree Traversals – Binary Search Trees and AVL
II 12
Trees – B-Trees and Tries – Hash Tables – Hash Table Structure – Hash Functions
– *Linear Open Addressing*.
Graphs Algorithms – Definition and Basic Terminologies – Representation of
Graphs – Graph Traversals – Applications: Single-source Shortest Path Problem –
III 12
Minimum Cost Spanning Trees – Prim’s Algorithm – Searching – Internal Sorting:
Bubble Sort – Insertion Sort – Selection Sort – *Heap Sort*.
Divide and Conquer: The General method – Binary Search – Finding the
Maximum and Minimum – Merge Sort – Quick Sort – Strassen’s Matrix
IV 12
Multiplication – The Greedy Method: The General Method – Knapsack Problem
– *Job Sequencing with Deadlines*.
Dynamic Programming: The General Method – Multistage Graphs – 0/1
V Knapsack – The Travelling Salesperson Problem – Backtracking: The General 12
Method – The 8-Queen’s Problem – *Sum of Subsets* – Graph Coloring.
Current Trends (For CIA only): Complexity Analysis and Latest Trends of some
VI
algorithms
*……* Self Study

Text Book(s):
1. G.A. Vijayalakshmi Pai, Data Structures and Algorithms, Concepts, Techniques and Applications,
Tata McGraw-Hill Education Private Limited, New Delhi, Third Reprint 2009.
2. Ellis Horowitz, Sartag Sahni and Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms,
Universities Press (India) Private Limited, Second Edition, Reprint 2011.
Reference Book(s):
1. J.P. Tremblay and P.G. Sorenson, An Introduction to Data Structures with Applications, Tata McGraw-
Hill Publishing Company Limited, New Delhi, Second Edition, 26th Reprint, 2004.
2. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Pearson Education, 1983.
Web Resource(s):
1. https://www.cs.bham.ac.uk/~jxb/DSA/dsa.pdf
2. https://www.programiz.com/dsa
3. https://nptel.ac.in/courses/106102064
4. https://archive.nptel.ac.in/courses/106/106/106106127/
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Recall and Summarize the concept of data structures and algorithms K1, K2
Identify and Apply the linear, non-linear data structures and the algorithm
CO2 K3
for performing various operations
Analyze the data structures, algorithmic strategies, searching and sorting
CO3 K4
techniques for different application problems
CO4 Evaluate and Explain the operations in data structures and design techniques K5
Create and Discuss the suitable data structure and algorithm for solving
CO5 K6
mathematical and real-world problems

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 1 2 1 3 2 2 2 2 2.0
CO2 3 2 1 2 1 3 2 2 3 2 2.1
CO3 3 3 2 3 3 3 3 3 2 3 2.8
CO4 3 3 3 3 3 3 3 3 3 2 2.9
CO5 3 3 3 3 2 3 3 3 3 3 2.9
Mean Overall Score 2.54

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. O.A. Mohamed Jafar

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week
CIA ESE Total
II 23MCA2CC9 CORE – IX 4 3 25 75 100

Course Title R Programming with Statistics

SYLLABUS
Unit Contents Hours
Introduction to R –Downloading and installing R and R studio –How to Run R – A First
R Session (use of R data set)– Data Types – Variables – Getting Help– R packages –
Control Statements– Basic R Operators – Arithmetic, Relational and Boolean Operators 12
I
– R Data structures– Vectors – Declarations–Recycling– Common Vector Operations –
Using all () and any ()– Vectorized Operations–NA and NULL Values– Filtering– Testing
Vector Equality–*Vector Element Names*.
Matrices and Arrays – Creating Matrices– General Matrix Operations–Applying
Functions to Matrix Rows and Columns– Adding and Deleting Matrix Rows and
Columns– More on the Vector/Matrix Distinction– Naming Matrix Rows and Columns–
II Higher-Dimensional Arrays – Lists – Creating Lists–General List Operations– Accessing 12
List Components and Values– Applying Functions to Lists– Recursive Lists– Data
Frames– Creating Data Frames– Other Matrix– Like Operations – Merging Data
Frames– *Applying Functions to Data Frames*.
Factors and Tables – Factors and Levels – Common Functions Used with Factors –
Working with Tables – Other Factor– and Table-Related Functions– R Programming
III 12
Structures– Introduction to Functions – Variable Scope – Default Arguments – Return
Values– Functions are Objects – No Pointers in R – Recursion –Replacement Functions
– Anonymous Functions – Object-Oriented Programming – S3 Classes – S4 Classes– S3
Versus S4–*Managing Your Objects*.
IV Input/ Output–Accessing the Keyboard and Monitor–Reading and Writing Files –String
Manipulation - String-Manipulation Functions –Regular expressions – Graphics, Creating 12
Graphics – Customizing Graphs– *Saving Graphs to Files*.
Doing Math and Simulations in R – Math Functions – Sorting – Set Operations –
Simulation Programming in R – Generation of Pseudorandom Numbers – Built-in
Random Variate Generators – Performing Statistical Calculations in R –Basic
V Statistical Measures: Mean –Median –Mode – Variance –Standard Deviation – 12
*Correlation*– Regression–Functions for Statistical Distributions– Probability
Distributions in R – Binomial – Poisson – Normal Distributions
VI Current Trends (For CIA only): Importance of R in Data Science Professionals, How R is
used for Data Analysis?
*……* Self Study
Text Book(s):
1. Norman Matloff, The Art of R Programming: A Tour of Statistical Software Design, No Starch
Press, OREILLY & Associates Inc.
2. 2. Kandethody M. Ramachandran and Chris P.Tsokos, Mathematical Statistics with
Applications inR, Academic Press, Second Edition, 2015.
Reference Book(s):
1. Seema Acharya : Data analytics using R, McGraw Hill Education (India) Private Limited,2018.
2. Jared P. Lander, R for Everyone, Pearson.
Web Resource(s):
1.https://www.geeksforgeeks.org/r-statistics/
2.https://www.w3schools.com/r
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 The main objective of the course is to understand the basics in R K1, K2
programming in terms of constructs, control statements and common vector
operations.
CO2 Apply functions into lists and data frames K3

CO3 Implementing the usage of R functions in Analytics Industry K6

CO4 Creation of graphics in R K4
CO5 Performing statistical operations in R K5

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 0 3 1.5

CO2 3 3 2 3 2 3 2 3 2 0 2.3

CO3 3 2 3 2 3 2 3 2 3 2 2.5

CO4 2 3 2 2 3 3 3 0 2 2 2.2

CO5 3 2 1 3 1 3 2 1 3 3 2.1

Mean Overall Score 2.12

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High
Course Coordinator: Dr. M. Mohamed Surputheen
 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2CC10 CORE – X 4 3 25 75 100

Course Title Operating Systems

SYLLABUS
Unit Contents Hours
Operating Systems Objectives and Functions – Operating System and User /
Computer Interface, Operating System as a Resource Manager: Evolution of
I Operating Systems – Serial Processing, Sample Batch Systems, Multi Programmed 12
Batch Systems, Time Sharing Systems – *Virtual Machines* – OS Design
consideration for Multiprocessor and Multicore
Process – Process States - Process Description, Process Control – Processes and
Threads, Concurrency – Principles of Concurrency, Mutual Exclusion – Deadlock
II Prevention, Deadlock Detection, Deadlock Avoidance. Memory Management – 12
*Memory Management Requirements* – Memory Partitioning – Paging System –
Segmentation
Virtual Memory – Paging – Address Translation in a Paging System, Segmentation
– Organization, Address Translation in a Segmentation System – Combined Paging
III 12
and Segmentation – *Virtual Memory* – Operating System Software – Fetch
Policy, Placement Policy and Replacement Policy.
Scheduling – Types of Scheduling, Scheduling Algorithms, Scheduling Criteria,
IV FCFS, Round Robin, Shortest Process Next, Shortest Remaining Time, *Feedback 12
Scheduling*
I/O Management and disk scheduling – Organization of the I/O function – the
Evaluation of the I/O Function, Logical Structure of the I/O Function, I/O
V Buffering, Disk I/O – Disk Scheduling Policies, Disk Cache. File Management – 12
Files, File Management Systems, Secondary Storage Management – *File
Allocation*
VI Current Trends (For CIA only): Importance of Scheduling and I/O management
*……* Self Study

Text Book(s):
William Stallings, Operating Systems – Internals and Design Principles, Seventh Edition, Prentice Hall,
2012
Reference Book(s):
1. Ann McIver McHoes and Ida M. Flynn, Understanding Operating Systems, Sixth Edition, Course
Technology, Cengage Learning, 2011
2. Ann McHoes, Ida M. Flynn, Understanding Operating Systems, Seventh Edition, Cengage Learning, 2013.
3. Deital H.M., An Introduction to Operating Systems, Addison Wesley Publishing, 1998
4. Silberchatz A., Peterson J.L., Galvan P., Operating System Concepts, Third Edition, Addison
Wesley Publishing Co., 1992
Web Resource(s):
https://repository.dinus.ac.id/docs/ajar/Operating_System.pdf
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
Illustrate the services provided by the OS and the design of an operating
CO1 K1 & K2
system
CO2 Make use of the different approaches to memory management K3
CO3 Analyze the process scheduling and synchronization mechanisms K4
CO4 Evaluate the structure and organization of the file system K5
CO5 Discuss an understanding of different I/O techniques K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 1 3 1 3 3 2 1 1 2.1
CO2 3 3 2 3 3 3 3 3 2 2 2.7
CO3 3 3 3 2 2 3 3 2 2 3 2.6
CO4 3 3 1 3 3 3 3 2 3 2 2.6
CO5 3 3 3 3 2 3 3 3 3 2 2.8
Mean Overall Score 2.56

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. D.I. George Amalarethinam

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Discipline Specific
II 23MCA2DE1A 4 4 25 75 100
Elective – I

Course Title Computer Networks

SYLLABUS
Unit Contents Hours
Introduction – Uses of Computer Networks – Network Hardware: Personal Area
Networks – Local Area Networks–Metropolitan Area Networks– Wide Area Networks –
Internetworks. Network Software: Protocol Hierarchies – Design Issues for the Layers –
I Connection-Oriented Versus Connectionless service – Service Primitives. Reference 12
Models: The OSI Reference Model–- The TCP/IP Reference Model. The Physical Layer:
Guided Transmission Media. The Public Switched Telephone Network: Structure of the
Telephone System – *Switching*.

The Data Link Layer: Data Link Layer Design Issues: Services Provided to the Network
Layer – Framing - Error Control – Flow Control. Error Detection and Correction –
Elementary Data Link Protocols – Sliding Window Protocols– The Medium Access
II Control Sub-layer Multiple Access Protocols: Carrier Sense Multiple Access Protocols – 12
Collision-Free Protocols – *BLUETOOTH*– Data Link Layer Switching: Uses of
Bridges-Learning Bridges – Spanning Tree Bridges – Repeaters, Hubs, Bridges,
Switches, Routers, and Gateways.

The Network Layer: Network Layer Design Issues – Routing Algorithms: The Optimality
Principle– Shortest Path Algorithm– Distance Vector Routing– Link State Routing–
III Hierarchical Routing – Broadcast Routing – Congestion Control Algorithms – The 12
Network Layer in the Internet– The IP Version 4 Protocol– *IP Addresses*– IPv6.

The Transport Layer: The Transport Service: Services Provided to the Upper layers –
Transport Service Primitives – Berkeley Sockets – Elements of Transport Protocols – The
IV Internet Transport Protocols: UDP – Introduction to UDP –*Remote Procedure Call* – 12
TCP: Introduction to TCP – The TCP Service Model – The TCP Protocol – The TCP
Segment Header.
The Application Layer: DNS: The Domain Name System– The DNS Name Space –
Domain Resource Records Electronic Mail: Architecture and Services – The User Agent –
Network Security: Cryptography – Introduction – Substitution & Transposition Ciphers –
V DES – RSA– Symmetric-Key Signatures – Public- Key Signatures – Communication
12
Security: Firewalls– VPN– Authentication Protocols– Authentication Based on a Shared
Secret Key – Establishing a Shared Key: *The Diffie-Hellman Key Exchange*.
VI Current Trends (For CIA only): Cryptography, Internetworking Device and Internet
*……* Self Study
Text Book(s):
Andrew S. Tanenbaum and David J. Wetherall, Computer Networks, PHI, Fifth Edition, 2019.

Reference Book(s):
1. William Stallings, Data and Computer Communication, PHI, Eighth Edition, 2013.
2. Behrouz A. Forouzan, Data Communication and Networking, Fourth Edition, Tata McGrawHill, 2007
Web Resource(s):
1. https://www.slideshare.net/pawan1809/computer-networks-a-tanenbaum-5th-edition
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Recall the types of computer networks and their characteristics K1
Understand the key design issues, principles and functions of network
CO2 K2
software, hardware, and reference models
Apply the concepts of routing algorithms and congestion control techniques
CO3 K3
and knowledge of the transport layer and its services
Analyze the error detection and correction techniques and multiple access
CO4 K4
protocols
Evaluate the cryptography techniques and the effectiveness of
authentication protocols and firewall techniques. Design and implement a
CO5 K5,K6
basic network and solutions for network congestion control and error
handling

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 0 3 1.5

CO2 3 3 3 3 2 3 3 3 2 0 2.5

CO3 3 2 3 2 3 2 3 3 3 2 2.6

CO4 2 3 2 2 3 3 3 0 2 2 2.2

CO5 3 3 3 3 3 3 2 3 3 3 2.9

Mean Overall Score 2.34

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. G. Ravi

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Discipline Specific
II 23MCA2DE1B 4 4 25 75 100
Elective – I

Course Title Network Security and Cryptography

SYLLABUS
Unit Contents Hours
Introduction: Security Trends –The OSI Security Architecture –Security Attacks–
Security Services – Security Mechanisms–A Model for Network Security–
I Symmetric Ciphers: Classical Encryption Techniques–Symmetric Cipher Model- 12
Substitution Techniques–Transposition Techniques– Rotor Machines–
*Steganography*.
Block Ciphers and the Data Encryption Standard: Block Cipher Principles–The
Data Encryption Standard–The Strength of DES–Differential and Linear
Cryptanalysis–Block Cipher Design Principles– Public-Key Encryption and Hash
II 12
Functions: Introduction to Number Theory–Prime Numbers –*Fermat's and Euler's
Theorems*– Public-Key Cryptography and RSA: Principles of Public-Key
Cryptosystems –The RSA Algorithm.
Digital Signatures and Authentication Protocols: Digital Signatures–Authentication
Protocols– Authentication Protocols. Network Security Applications:
III 12
Authentication Applications–*Kerberos*– X.509 Authentication Service–Public-
Key Infrastructure. Electronic Mail Security: Pretty Good Privacy –S/MIME.
IP Security: IP Security Overview–IP Security Architecture –Authentication
Header–Encapsulating Security Payload –Combining Security Associations–Key
IV 12
Management– Web Security: Web Security Considerations–Secure Socket Layer
and Transport Layer Security–*Secure Electronic Transaction*
System Security: Intruders –Intruders –Intrusion Detection –Password
Management – Malicious Software: Viruses and Related Threats–Virus
V Countermeasures –Distributed Denial of Service Attacks. Firewalls: Firewall 12
Design Principles–*Trusted Systems*–Common Criteria for Information
Technology Security Evaluation
VI Current Trends (For CIA only): Security Management in the CLOUD
*……* Self Study

Text Book(s):
William Stallings, Cryptography and Network Security-Principles and Practices, Prentice-Hall, 4th
edition, 2005
Reference Book(s):
1. Joseph Migga Kizza, Guide to Computer Network Security, Springer 2015.
2. AtulKahate, Cryptography and Network Security, Tata McGraw Hill, 2007.
Web Resource(s):
http://uru.ac.in/uruonlinelibrary/Cyber_Security/Cryptography_and_Network_Security.pdf
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Analyze and design classical encryption techniques and block ciphers K1, K2
CO2 Evaluate the authentication and public-key cryptography K3
CO3 Demonstrate the IP Sec, Firewall, Web Security, and Email Security K6
Comprehend the usage of firewalls and Intrusion Detection Systems for
CO4 K4
securing data
CO5 Analyze and compare different security mechanisms and services K5

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 3 0 3 3 1 2 1 3 2.1

CO2 3 3 0 3 2 3 2 3 2 1 2.2

CO3 3 2 3 1 3 2 3 2 3 2 2.4

CO4 2 3 0 2 3 3 3 3 1 2 2.2

CO5 3 2 1 3 1 3 2 3 3 3 2.1

Mean Overall Score 2.2

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low
≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Mr. S. Syed Ibrahim

 Hours/ Marks for Evaluation
Course Code Course Category Credits
Semester Week CIA ESE Total
Discipline Specific
II 23MCA2DE1C 4 4 25 75 100
Elective – I

Course Title Mobile Application Development

SYLLABUS
Unit Contents Hours
Getting to Know Android: Why Android – Android Execution Environment –
I Components of an Android Application – Android Activity Lifecycle – *Android 12
Service Lifecycle *.
Setting Up Your Development Environment: Creating an Android Development
II Environment – Starting a New Android Application: Hello World – Writing Hell 12
World – *Running Hello World*.
Debugging Android Applications: The Tools – Eclipse Java Editor – Java Errors
III – Debugger – Logcat – Android Debug Bridge – *DDMS* – Traceview. Building 12
a View: Android GUI Architecture – The Model – The View – The Controller.
Building a View: Assembling a Graphical Interface – Writing Up the Controller –
IV Listening to Model – Listening for Touch Events – Listening for Key Events – 12
*Alternative Ways to Handle Events*.
A Widget Bestiary: Android Views – TextView – EditText – Button –
ImageButton – Adapters – AdapterViews – CheckBoxes – RadioButtons –
V 12
Spinners. ViewGroups – Layouts – Frame – Linear – Table – *Absolute –
Relative*.
VI Current Trends (For CIA only): Drawing 2D and 3D Graphics.
*……* Self Study

Text Book(s):
Rick Rogers, John Lombardo, Zigurd Mednieks, and Blake Meike, Android Application
Development, Shroff Publishers & Distributors Pvt. Ltd. (O’Reilly), First Edition, 2014.

Reference Book(s):
Michael Burton and Donn Felker, Android Application Development for Dummies, John Wiley &
Sons, 2nd Edition, 2014.

Web Resource(s):
1. https://www.tutorialspoint.com/android/android_studio.htm
2. https://www.javatpoint.com/android-tutorial
3. https://www.geeksforgeeks.org/android-tutorial/
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Outline the android development and execution environments. K1
CO2 Analyse debugging android applications. K4
CO3 Explain the Android GUI architecture. K2
CO4 Design mobile Apps. K6
CO5 Illustrate various event handlings. K5

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 0 0 4 2 3 0 0 1.7
CO2 2 3 2 0 0 3 2 2 0 0 1.4
CO3 3 3 2 0 0 3 2 2 0 0 1.5
CO4 1 4 4 2 5 1 2 3 4 5 3.1
CO5 1 4 4 3 5 1 4 4 4 5 3.5
Mean Overall Score 2.24
Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. K. Nafees Ahmed

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Discipline Specific
II 23MCA2DE2A 4 4 25 75 100
Elective – II

Course Title Data Science

SYLLABUS
Unit Contents Hours
Data Science in a big data world: Benefits and uses of data science and big data –
Facets of data – The data science process – The big data ecosystem and data
science– *An introductory working example of Hadoop* – The data science
I process: Overview of the data science process – Defining research goals and 12
creating a project character – Retrieving data – Cleansing, integrating and
transforming data–Exploratory data analysis – Build the models – Presenting
findings and building applications on top of them.
Machine Learning: What is machine learning and why should you care about it –
The modeling process – Types of machine learning – Semi-supervised learning –
Handling large data on a single computer: The problems you face when handling
II 12
large data – General techniques for handling large volumes of data – General
programming tips for dealing with large datasets – Case Studies: Predicting
malicious URLs – *Building a recommender system inside a database*.
First step in big data: Distributing data storage and processing with frameworks
III – *Case study: Assessing risk when loaning money* – Join the NoSQL 12
movement: Introduction to NoSQL – Case study: What disease is that?
The rise of graph databases: Introducing connected data and graph databases –
Introducing Neo4j: a graph database – Connected data example: a recipe
IV 12
recommendation engine – Text mining and text analytics: Text mining in the real
world – Text mining techniques – *Case study: Classifying Reddit posts*.
Data visualization to the end user: Data visualization options – Cross filter, the
JavaScript MapReducelibrary – *Creating an interactive dashboard with dc.js* –
Dashboard development tools– Data Ethics: Introduction – Building Bad Data
V 12
Products – Trading Off Accuracy and Fairness – Collaboration – Interpretability –
Recommendations – Biased Data – Data Protection – Go Forth and do Data
Science: IPython – Mathematics – Not from Scratch – Find Data – Do Data Science.
VI Current Trends (For CIA only): Tiny ML, Auto ML
*……* Self Study

Text Book(s):
1. Davy Cielen, Arno D. B. Meysman, Mohamed Ali, Introducing Data Science, Manning
Publications Co., First Edition, 2016.
2. Joel Grus, O’Reilly, Data Science from Scratch, Shroff Publishers & Distributors Pvt. Ltd, New
Delhi, Second Edition, May 2019.
Reference Book(s):
J Valliappa Lakshmanan, O’Reilly, Data Science on the Google Cloud Platform, Shroff Publishers &
Distributors Pvt. Ltd, New Delhi, Second Indian Reprint, June 2018.
Web Resource(s):
1. https://www.javatpoint.com/data-science
2. https://www.kaggle.com/kanncaa1/data-sciencetutorial-for-beginners
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Understand the fundamentals concepts and process of data science K1, K2
Apply suitable machine learning techniques for handling large volume of
CO2 K3
data
Analyse distributing data storage and NoSQL concepts
CO3 K4

CO4 Choose text mining techniques and make use of graph databases K5
CO5 Design effective data visualizations and learn the basics of data ethics K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 Cos
CO1 3 3 3 0 3 3 2 3 3 3 5.2

CO2 3 3 2 3 3 3 3 3 0 3 5.2

CO3 3 3 2 3 3 3 0 3 2 3 5

CO4 3 3 3 3 2 3 3 0 2 3 5

CO5 3 3 2 3 3 0 3 3 0 3 4.6

Mean Overall Score 2.5

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. S. A. Jameel

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Discipline Specific
II 23MCA2DE2B 4 4 25 75 100
Elective – II

Course Title Big Data Analytics

SYLLABUS
Unit Contents Hours
Fundamentals of Big Data : The Evolution of Data Management – Understanding
the waves of Managing Data – Defining Big Data – Building a Successful Big Data
Management Architecture – Examining Big Data Types : Defining Structured Data
– Defining Unstructured Data – Looking at Real Time and Non Real Time
I 12
Requirements - Digging into Big Data Technology Components : Exploring the Big
Data Stack – Redundant Physical Infrastructure – Security Infrastructure –
Operational Databases – organizing data Services and Tools – *Analytical Data
Warehouses* – Big Data Analytics – Big Data Applications.
Defining Big Data Analytics : Using Big Data to get Results – Modifying Business
Intelligence Products to Handle Big Data – Studying Big Data Analytics Examples
– Big Data Analytics Solutions – Understanding Text Analytics and Big Data :
Exploring Unstructured Data – Analysis and Extraction Techniques – Putting
II Results Together with Structured Data – Putting Big Data to use – Text Analytics 12
Tools for Big Data – Customized Approaches for Analysis of Big Data : Building
New Models and Approaches to Support Big Data - *Understanding Different
Approaches to Big Data Analysis*- Characteristics of a Big Data Analysis
Framework.
Operationalizing Big Data : Making Big Data a Part of Your Operational Process -
Integrating Big Data - Incorporating big data into the diagnosis of diseases -
Understanding Big Data Workflows - Workload in context to the business problem
- Ensuring the Validity, Veracity, and Volatility of Big Data - *Security and
III 12
Governance* for Big Data Environments : Security in Context with Big Data -
Understanding Data Protection Options - The Data Governance Challenge - Putting
the Right Organizational Structure in Place - Developing a Well-Governed and
Secure Big Data Environment.
Appliances and Big Data Warehouses : Integrating Big Data with the Traditional
Data Warehouse - Big Data Analysis and the Data Warehouse - Changing the Role
of the Data Warehouse - Changing Deployment Models in the Big Data Era -
IV Examining the Future of Data Warehouses - Examining the Cloud and Big Data : 12
Defining the Cloud in the Context of Big Data - Understanding Cloud Deployment
and Delivery Models - The Cloud as an Imperative for Big Data - *Making Use of
the Cloud for Big Data* - Providers in the Big Data Cloud Market.
MapReduce Fundamentals : Tracing the Origins of MapReduce - Understanding the map
Function - Adding the reduce Function - Putting map and reduce Together - Optimizing
MapReduce Tasks - Exploring the World of Hadoop : Explaining Hadoop - Understanding
V the Hadoop Distributed File System – Hadoop Map Reduce - The Hadoop Foundation and 12
Ecosystem - Building a Big Data Foundation with the Hadoop Ecosystem - Managing
Resources and Applications with Hadoop YARN - *Storing Big Data with HBase* -
Mining Big Data with Hive - Interacting with the Hadoop Ecosystem.
* …………..* Self Study
 Text Book(s):

1.Judith Hurwitz, Alan Nugent, Dr. Fern Halper and Marcia Kaufman, “Big Data”, Wiley Publications, 2013.

Reference Book(s):
Soumendra Mohanty, Madhu Jagadeesh and Harsha Srivatsa, Big Data Imperatives : Enterprise Big Data
Warehouse, BI Implementations and Analytics” Apress Media, Springer Science+Business Media New York,
2013.
Web Resource(s):

www.it-ebooks.info

Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
Define big data and its technology components and Find the big data types and
CO1 Acquire the knowledge of big data K1,K2

CO2 Classify the big data analytics and Explain the big data Text Analytics K2
Identify the Security and Governance for Big Data Environments and Making use of
CO3 K3
Operationalizing Big Data
CO4 Appliances and Big Data Warehouses and Examining the Cloud and Big Data K4
Explain Hadoop Distributed File System and Develop Managing Resources and
CO5 K6
Applications with Hadoop YARN and Interacting with the Hadoop.

Relationship Matrix:
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean
Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 2 3 3 2 0 2 3 2.3
CO2 3 2 3 3 2 3 2 2 2 3 2.5
CO3 3 2 3 2 3 3 2 2 2 2 2.4
CO4 2 3 2 2 3 3 2 2 0 2 2.1
CO5 2 3 2 1 2 3 2 2 2 3 2.2
Mean Overall Score 2.3
Correlation Medium
Mean Overall Score = Sum of Mean Score of COs / Total Number of COs
Mean Overall Score Correlation
< 1.5 Low
≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator : M. Abdullah

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Discipline Specific
II 23MCA2DE2C 4 4 25 75 100
Elective – II

Course Title Microprocessors, Interfacing and Applications

SYLLABUS
Unit Contents Hours
Overview of Microcomputer Systems – Hardware - Addresses – General Operation
of a Computer - Intel 8086 CPU Architecture – Internal Operation –Machine
I Language Instructions – Addressing Modes – Instruction Formats – *Instruction 12
Execution Timing* – Pin Configuration of 8086: Minimum Mode, Maximum
Mode.
Assembler Language Programming – Assembler Instruction Format – Data
Transfer Instructions – Arithmetic Instructions – Branch Instructions – Loop
II Instructions – Flag Manipulation Instructions – Logical Instructions – Shift and 12
Rotate Instructions – Stack Instructions – Call and Return Instructions – *Macros*
– String Instructions – REP Prefix – IN and OUT Instructions.
Assembly Language Programs – Addition, Subtraction, Multiplication and
Division – Multibyte Addition and Subtraction – Complements – Assembly and
Disassembly of a Word – Sum of a Series – Block Data Transfer – Finding the
III 12
Smallest and the Biggest Number in an Array – *Arranging a Series of Numbers in
Descending and Ascending Order* – Length of a String – Number of Occurrences
of a Character in a String.
I/O Interfaces – Functions – Address Space Partitioning: Memory Mapped I/O
Scheme, I/O Mapped I/O Scheme – Memory and I/O Interfacing – Data Transfer
IV 12
Schemes – I/O Ports – Programmable Peripheral Interface – *Programmable DMA
Controller*.
Microprocessor Applications – Delay Subroutines – Seven Segment Displays –
V *Frequency Measurement* – Temperature Measurement – Water Level Indicator 12
and Controller – Traffic Lights Control.
VI Current Trends (For CIA only): Recent advances in microprocessor technology
*……* Self Study

Text Book(s):
1. Yu-cheng Liu and Glenn A. Gibson, Microcomputer Systems–The 8086/8088 Family –
Architecture, Programming and Design, Prentice Hall of India, Second Edition, 2011.
2. B. Ram, Fundamentals of Microprocessors and Microcontrollers, Dhanpat Rai Publications,
Seventh Edition, 2011.
Reference Book(s):
1. Douglas V. Hall, Microprocessors and Interfacing – Programming and Hardware, Tata McGraw
Hill, Revised Second Edition, 2006.
2. K Bhurchandi, Advanced Microprocessor and Peripherals, McGraw Hill Education, Third Edition,
2017.
Web Resource(s):
1. https://www.javatpoint.com/8086-microprocessor
2. https://www.tutorialspoint.com/microprocessor/microprocessor_io_interfacing_overview.htm
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
Understand the architecture and functionality of a microprocessor and
CO1 K1, K2
peripheral devices
Classify the instruction set of a microprocessor and distinguish the functions
CO2 K3
of different instructions
Identify the different ways of interfacing memory and I/O with
CO3 K4
microprocessors.
Demonstrate programming proficiency by developing assembly language
CO4 K5
programs
CO5 Design microprocessor-based systems for real time applications K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 2 3 3 2 3 3 2 2 2 2 2.4

CO2 3 3 2 3 2 3 2 3 2 2 2.5

CO3 3 3 2 3 3 3 2 2 2 3 2.6

CO4 3 3 2 3 3 3 3 2 1 3 2.6

CO5 3 2 3 2 2 3 2 3 3 2 2.5

Mean Overall Score 2.52

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. T. Abdul Razak

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2CC11P CORE – XI 4 3 20 80 100

Course Title Data Structures Lab - Practical

Develop a C/C++ Program to implement:

1. Insert and Delete Operations in an Array

2. Push and Pop operations on Stack.

3. Convert infix expression into postfix expression using Stack.

4. Evaluate postfix expression by using Stack

6. Insert and Delete operations on Queue

7. Insert and Delete operations on a Linked List

8. Preorder, Inorder and Postorder Traversal of a Binary Tree

9. Dijkstra’s Algorithm to find Shortest Path

10. Prim’s Algorithm to find Minimum-Cost Spanning Tree

11. i) Linear Search

ii) Binary Search

12. i) Bubble Sort

ii) Insertion Sort

13. i) Selection Sort

ii) Quick Sort

14. Merge Sort

 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Demonstrate the various operations performed in linear data structure K2
CO2 Construct the programs to perform some applications of stack K3
Analyze the programs using the data structures, algorithmic strategies,
CO3 K4
searching and sorting techniques for different application problems
Evaluate and Interpret the results of different traversals and shortest path
CO4 K5
algorithms
Create and Develop programs using suitable data structure and algorithmic
CO5 K6
techniques for solving mathematical and real-world problems

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 1 2 1 3 2 2 2 2 2.0
CO2 3 2 1 2 1 3 2 2 3 2 2.1
CO3 3 3 2 3 3 3 3 3 2 3 2.8
CO4 3 3 3 3 3 3 3 3 3 2 2.9
CO5 3 3 3 3 2 3 3 3 3 3 2.9
Mean Overall Score 2.54

Correlation High

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. O.A. Mohamed Jafar

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2CC12P CORE – XII 4 3 20 80 100

Course Title R Programming Lab - Practical

Develop R program to

1. a) Demonstrate some Built-in mathematical and statistical functions.

b) Take input from the keyboard (name and age) and display the values
c) Display the message "Welcome to MCA Course” using
i) print function ii) cat function
2. Demonstrate control statements

3. a) Create a vector using i) c command ii): operator and iii) seq() function.
b) Sort a Vector in ascending and descending order.
c) Find a second-highest value in a given vector

4. a) Merge two given lists into one list.

b) Convert a given matrix to a list.
c) Count the number of objects in a given list.

5. a) Create two 3x3 matrices and perform addition, subtraction, multiplication, division operations
b) Read a matrix and perform various operations like Transpose, inverse, row sum,
column sum andtrace
c) Solve a linear system of equations

6. a) Get the statistical summary and nature of the data of a given data frame.
b) Implement data frames in R. Write a program to add columns and rows in a data frame using
bind () and bind () in R.
c) Find the elements which are present in two given data frames

7, a) Create an ordered factor from data consisting of the names of months.

b) Concatenate two given factors in a single factor.
c) Change the first level of a factor with another level of a given factor.

8. a) Count the odd numbers in a vector of integers using a function named 'odd count ()'.
b) Create a function named 'sum’ to perform the addition of three numbers by passing
i) arguments ii) default arguments
c) Print the multiplication table for any given number.

9. a) Test whether a given string is a palindrome or not using the function

b) Create, read, and display i) CSV file ii) excel file
c) Create a simple bar chart, pie chart, and scatter plots of five subject’s marks
(Use any pre-defined data set)

10. a) Perform the various operations on set.

b) Generate random numbers from the uniform distribution.
c) Compute the various statistical measures like mean, median, mode variance,
standard deviation,and correlation. (use any data set)
d) Calculate probabilities for Binomial, Poisson, and Normal distributions.
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Demonstrate the various built-in mathematical and statistical functions K2
CO2 Construct the programs to create a vector and matrices K3
CO3 Analyze the programs using the statistical summary and data frames K4
CO4 Evaluate the simple charts using pie, scatter plots and random numbers K5
Create and Develop programs using various operations on set, random
CO5 K6
numbers from the uniform distributions, binomial and Poisson distribution

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 2 3 3 2 0 2 3 2.3
CO2 3 2 3 3 2 3 2 2 2 3 2.5
CO3 3 2 3 2 3 3 2 2 2 2 2.4
CO4 2 3 2 2 3 3 2 2 0 2 2.1
CO5 2 3 2 1 2 3 2 2 2 3 2.2
Mean Overall Score 2.3

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of Cos

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. M. Mohamed Surputheen

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
Skill Enhancement
II 23MCA2SE2 2 2 - 100 100
Course – II

Course Title Quantitative Aptitude

SYLLABUS
Unit Contents Hours
Numbers, HCF, LCM, Decimal Fractions, Simplification, Square Roots, Cube
I 6
Roots, *Averages*, Problems in numbers and ages.
Surds, Indices, Percentages, Profit and Loss, Ratio and Proportion, Partnership,
II 6
Chain Rule, *Time and Work*, Pipes and Distances.
Time and distance, Problems on Trains, Boats and Streams, Alligation, Simple
III 6
Interest, Compound Interest, *Logarithms, Area*
Volume and Surface Area, Races and Games of Skill, Calendar, Clocks, Stocks and
IV 6
Shares Permutation and Combination, *Probability*.
True discount, Banker‘s Discount, Height and Distances, Odd man out and Series,
V 6
Tabulation, Bar graphs, *Pie charts, Line Graphs*.
Current Trends (For CIA only): Prepare Computer Programs to solve scientific and the
VI
mathematical problems.
*……* Self Study

Text Book(s):
R.S. Aggarwal, Quantitative Aptitude for Competitive Examinations, S.Chand and Co. Ltd, 2020.
Reference Book(s):
Barron‘s, Guide for GMAT, Galgotia Publications, 2018.
Web Resource(s):
1. https://www.placementpreparation.io/quantitative-aptitude/
2. https://www.indiabix.com/aptitude/questions-and-answers/

Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Compare & Classify The Various Mathematical Theorems & Formulae K1, K2
CO2 Perform Calculations Using Formulae K3
CO3 Design Methods To Solve Problems K6
CO4 Analyse The Given Problems And Select The Method To Solve K4
CO5 Determine The Methods To Solve The Given Problem K5
 Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 0 0 3 3 0 0 0 3 1.5

CO2 3 3 2 3 2 3 2 3 2 0 2.3

CO3 3 2 3 2 3 2 3 2 3 2 2.5

CO4 2 3 3 2 2 3 3 0 2 2 2.2

CO5 3 2 2 3 2 3 2 1 3 3 2.4

Mean Overall Score 2.18

Correlation Medium

Mean Overall Score = Sum of Mean Score of COs / Total Number of COs

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. A. R. Mohamed Shanavas

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2ACC3 ADDL. CORE - III -- 5 100 -- 100

Course Title Web Design

SYLLABUS
Unit Contents Hours
Introduction to the Internet – Computers in Business– Networking– Internet– E-
Mail– Resource Sharing– Gopher– World Wide Web– Usenet–Telnet– Bulletin
I Board Service– Wide Area Information Service – Internet Technologies– Modem– 15
Internet Addressing– Physical Connections– Telephone Lines– *Internet Browsers
– Internet Explorer*– Netscape Navigator.
Introduction to HTML – *History of HTML*– HTML Documents– Anchor Tag– Hyper
II Links – Head and Body Sections – Header Section – Title– Prologue– Links– Colorful 15
Web Page– Comment Lines.
Designing the Body Section – Heading Printing– Aligning the Headings– Horizontal Rule
–Paragraph–Tab Settings– Ordered and Unordered Lists – Lists – Unordered Lists–
III 15
Ordered Lists – Nested Lists – Table Handling – Tables –* Table Creation in HTML* –
Width of the table and cells.
JavaScript: JavaScript in Web Page–The advantage of Java Script–Writing
IV JavaScript into HTML–Basic programming Techniques – Data types and Literal – 15
Type Casting–JavaScript Arrays– *Operators and Expressions*.
Functions–User defined functions–Placing text in a browser–Dialog Boxes–Form object’s
V 15
methods – *Built-in objects–User defined Objects*.
Current Trends (For CIA only): Developing HTML and JavaScript coding for simple real
VI
world problems.

*……* Self Study

Text Book(s):
1. C. Xavier, World Wide Web Design with HTML, Tata McGraw Hill Company Limited, New
Delhi, 2017.
2. Ivan Bayross, HTML, DHTML, JavaScript, Perl, CGI, BPB, Third Revised Edition, 2006.
Reference Book(s):
1. Thomas A. Powell, The Completer reference HTML, Tata McHill, Second Edition, 2000.
2. John Pollock, JavaScript a Beginners Guide, Fifth Edition, Tata McGraw Hill, 2019.
Web Resource(s):
1. https://www.programiz.com/c-programming
2. https://www.geeksforgeeks.org/object-oriented-programming-in-cpp/
 Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Recall the fundamental concepts of Internet and its technologies K1
CO2 Illustrate the knowledge of HTML K2
CO3 Apply the knowledge of JavaScript K3
CO4 Analyze and evaluate the different functions and their uses K4, K5
CO5 Develop and Explain the web pages for real world problems K6

Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 3 2 3 1 3 2 3 2 2 2.4

CO2 3 3 3 3 2 3 2 3 2 2 2.6

CO3 3 3 1 3 1 3 2 3 3 3 2.5

CO4 3 3 3 2 2 3 3 3 3 2 2.7

CO5 3 3 3 3 2 3 3 3 3 2 2.8

Mean Overall Score 2.6

Correlation High

Mean Overall Score Correlation

< 1.5 Low
≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. S.A. Jameel

 Hours/ Marks for Evaluation
Semester Course Code Course Category Credits
Week CIA ESE Total
II 23MCA2ACC4P ADDL. CORE - IV -- 5 100 -- 100

Course Title HTML and JavaScript Lab - Practical

1. Develop a HTML document and perform the basic alignments on the headers and format the
document using suitable tags.
2. Develop a HTML document to display the Chemical equations.
3. Develop a HTML document to display the advantages and disadvantages of Internet using ordered
and unordered list tags facilities.
4. Develop a home page for your company with suitable name, logo, pictures, back ground design and
color text with links.
5. Design a web page of your meals menu for a week using table tag with its attributes.
6. Develop a simple application by using frame controls.
7. Develop a web page to display the Resume registration form with suitable controls.
8. Develop a JavaScript to compute the sum of an array of Integers.
9. Develop a JavaScript to perform multiplication & division of two numbers by getting from user
10. Develop a JavaScript that reads five integers and determines the largest and the smallest integers
in the group.
11. Develop a JavaScript for a recursive function to calculate the Fibonacci value of a given number.
12. Develop a JavaScript function to display current date and time using date object.

Course Outcomes
Upon successful completion of this course, the student will be able to:
Cognitive
CO No. CO Statement Level
(K-Level)
CO1 Demonstrate the basic alignments and chemical equations K2
CO2 Construct a home page for a company K3
Analyze and Examine the result of the sum of array of integers, perform
CO3 K4
multiplication and division of two numbers
CO4 Compare the result of recursive function K5
CO5 Develop a web page to display resume registration with suitable controls K6
 Relationship Matrix:

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs) Mean

Outcomes Score of
(COs) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5 COs
CO1 3 2 1 3 1 3 2 2 2 2 2.1

CO2 3 3 2 2 1 3 2 2 2 2 2.2

CO3 3 3 1 3 2 3 3 3 3 3 2.7

CO4 3 3 3 3 3 3 3 3 3 2 2.9

CO5 3 3 3 3 2 3 3 3 3 2 2.8

Mean Overall Score 2.54

Correlation High

Mean Overall Score Correlation

< 1.5 Low

≥ 1.5 and < 2.5 Medium

≥ 2.5 High

Course Coordinator: Dr. S.A. Jameel