PROGRAMME GUIDE

FOR

MASTER OF COMPUTER APPLICATIONS

(MCA)
(2 -Years Programme )
(Programme Code: MCA_NEW)

July-2025

SCHOOL OF COMPUTER AND INFORMATION

SCIENCES
INDIRA GANDHI NATIONAL OPEN UNIVERSITY MAIDAN GARHI,
NEW DELHI - 110 068

[Link]
eProgramme Guide:
July, [Link] is a Programme Guide for new MCA (2 Years) Programme offered by IGNOU
from July, 2025 admission cycle.
© Indira Gandhi National Open University
All rights reserved. No part of this work may be reproduced in any form, by mimeograph or any
other means, without permission in writing from the Indira Gandhi National Open University.
Further information on the Indira Gandhi National Open University courses can be obtained
from the University’s office at Maidan Garhi, New Delhi-110 068 or from its Regional Centres
spread across the length and breadth of the country.

2
 CONTENTS
Page No.
Message from the MCA Programme Coordinator 5
1. Basic Information 6
1.1 MCA Programme Objectives
1.2 Duration of the Programme
1.3 Medium of Instruction
1.4 Credit System
1.5 MCA Programme Structure
1.6 Recognition
1.7 Student Support Services
1.8 How to contact the MCA Programme Coordinator
2. Instructional System 9
2.1 Self-instructional Material
2.2 Audio Video Material and CDs
2.3 Counselling Sessions
2.4 Web Based Support
3. Browsing IGNOU’s Website 19
4. MCA Syllabus 21
5. Evaluation Scheme 66
5.1 Assignments and Term-end Examination
5.2 Instructions for Assignments
5.3 Guidelines Regarding Submission of Assignments
5.4 General Guidelines Regarding Term-end Examination
6. Other Useful Information 76
6.1 Reservation of Seats
6.2 Scholarships and Reimbursement of Fee
6.3 Change / Correction of Address
6.4 Change of Regional Centre and Learner Support Centre
6.5 Procurement of Official Transcript
6.6 Duplicate Grade Card
6.7 Self-instructional material for your Programme of Study
6.8 Disputes on Admission and other University Matters
7. Some Useful Addresses 78
8. Link to Old Question Papers 79

3
9. Useful Forms and Links to Forms and Enclosures 79
• Change of Address (Form No.1)
• Assignments Remittance-Cum-Acknowledgement Card (FormNo.2)
• Link to Latest Assignment(s)
• Link to Online Re-Registration for MCA Programme
• Link to Online Term end Examination form
• Link to form for early declaration of result
• Link to form for obtaining photocopy of the answer script
• Link to form for Re-evaluation of Answer script
• Link to Application form for improvement in Division/Class
• Link to form for obtaining Duplicate Grade Card /Mark-sheet
• Link to form for issue of Official Transcript
• Link to form for issue of Migration Certificate
10. Links to Videos of Various Courses 85

4
 MESSAGE FROM THE PROGRAMME CO-ORDINATOR
Dear student,
Welcome to the family of distance learners and IGNOU’s Master of Computer Applications
Programme. It is a 2-years (4 semesters) programme during which you will study a wide
range of topics in Computer Science and Applications. You will receive support from
IGNOU through your Regional Centre (RC), Learner’s Support Centre (LSC) (was called
Study Centre) and IGNOU’s website. We expect you to be directly in contact with yours
RC, LSC, and your peers through the Internet. You may also write to us at the email address
given below.
This Programme Guide contains instructional system, syllabus of MCA (2 Years)
programme, details of evaluation scheme, links to assignments, important forms and other
important information. The self-instructional course material is available on eGyankosh
Website([Link]) and IGNOU eContent App (available on Google
Playstore). You can download the assignments of the semester in which you have enrolled
from our website. Each course contains one assignment that will be assessed by a counsellor
at your LSC. All these assignments are to be submitted at your LSC within the stipulated
last date of submission mentioned against each assignment.
At your LSC you will be able to avail yourself of the counselling for all the courses. You
need to have a minimum of 75% attendance for practical counselling sessions to be eligible
for appearing for the Term-end Practical Examinations. You must also submit the
assignments of every course before the due date to be eligible to appear for the related Term-
end Examination.
It is to be noted that the payments that are mentioned in various proformas/formats/forms
are as on date and is subject to revision from time to time. You are advised to check these
proformas/formats/forms from IGNOU website/LSC/RC for any revision/modification.
Some useful forms and formats (or the link to useful forms and formats) are also given
at the end of this booklet. The Programme Guide, forms and formats are also available on
the IGNOU website. Please confirm the fees with the RC / LSC / Website before you pay.
As a distance learner, you may have several queries. You will find answers to many of them
in this booklet. This booklet is a very important guide for you. Read it and preserve it
until you successfully complete the MCA programme. However, during your studies, if
you have any feedback, suggestions and comments to make, please write to us immediately.
In case, you have specific query, you can write to us on iGRAM([Link]
Due to the COVID-19 related guidelines, as stipulated by various regulatory bodies, some
of the processes as specified in this Programme guide may change. Therefore, learners are
advised to be in touch with their Regional centre/LSC for advice and day-to-day
information. Alternatively, you may visit the IGNOU website at URL [Link]. [Link].
Some of the links to the videos are given towards the end of the programme guide. Please
watch them for better understanding of the respective courses.
I wish you all the success in pursuing the MCA programme.

MCA Programme coordinator

Email: mca@[Link]

5
1. BASIC INFORMATION

1.1 MCA Programme Objectives

The broad objective of the MCA programme is to prepare graduate students for productive
careers in software industry and academia by providing an outstanding environment for
teaching and research in the core and emerging areas of the discipline. The thrust of programme
is on giving the students a thorough and sound background in theoretical and application
oriented courses relevant to the latest computer software development. The programme
emphasizes the application of software technology to solve mathematical, computing,
communications / networking and commercial problems.
This Master’s Degree Programme has been designed with a semester approach in mind. The
first year courses are aimed at theoretical knowledge and practical skills development in core
computers science subjects. The second year is more focused on advanced courses providing
conceptual framework and the project work.

1.2 Duration of the Programme

(Minimum -2 Years, Maximum - 4 Years)

To fulfil the requirements for acquiring the MCA, a student may successfully complete each
course of the programme and bridge courses, if any, in a minimum of 2 years and a maximum
of 4 years.

1.3 Medium of Instruction

The medium of instruction is English. The course material is in English.

1.4 Credit System

The University follows the ‘Credit System’ for its programmes. Each credit is worth 30 hours
of student learning time comprising all the learning activities. Thus, a four-credit course
involves 120 study hours. This helps the student to understand the academic effort one has to
put for successful completion of a course. Successful completion of the programme requires
successful completion of both assignments and the Term-End Examination of each course
of the programme and bridge courses, if any.

1.5 MCA Programme Structure

The programme has been divided into two semesters per year (July to December and January
to June). Consequently, there will be two examinations every year - one in the month of
December for the July to December semester courses and the other in June for the January to
June semester courses. The students are at liberty to appear for any of the examinations
conducted by the University during the year subject to completing the minimum time
framework and other formalities prescribed for the programme.

6
 Master of Computer Applications Programme Structure

Semester I
Course Course Title Theory/ Credits
Code Practical
MCS-211 Design and Analysis of Algorithms Theory 4
MCS-212 Discrete Mathematics Theory 4
MCS-213 Software Engineering Theory 4
MCS-214 Professional Skills and Ethics Theory 2
MCS-215 Security and Cyber Laws Theory 2
MCSL-216 DAA and Web Design Lab Practical 2
MCSL-217 Software Engineering Lab Practical 2
Semester II
MCS-218 Data Communication and Computer Networks Theory 4
MCS-219 Object Oriented Analysis and Design Theory 4
MCS-220 Web Technologies Theory 4
MCS-221 Data Warehousing and Data Mining Theory 4
MCSL-222 OOAD and Web Technologies Lab Practical 2
MCSL-223 Computer Networks and Data Mining Lab Practical 2
Semester III
MCS-224 Artificial Intelligence and Machine Learning Theory 4
MCS-225 Accountancy and Financial Management Theory 4
MCS-226 Data Science and Big Data Theory 4
MCS-227 Cloud Computing and IoT Theory 4
MCSL-228 AI and Machine Learning Lab Practical 2
MCSL-229 Cloud and Data Science Lab Practical 2
Semester IV
MCS-230 Digital Image Processing and Computer Vision Theory 4
MCS-231 Mobile Computing Theory 4
MCSP-232 Project Project 12

Total Credits: 80 Total No. of Courses: 22

No. of Theory Courses:15 No. of Practical Courses: 6 Project: 1

7
Bridge Courses
Passed BCA/ Bachelor Degree in Computer Science Engineering or equivalent Degree.
OR
Passed [Link]./ [Link]./ B.A. with Mathematics at 10+2 Level or at Graduation Level
(with additional Bridge Courses whose details are given below):

Bridge Courses:

Course Course Title Theory/ Credits

Code Practical
MCS-201 Programming in C and Python Theory 4
MCS-208 Data Structures and Algorithms Theory 4

Students who have already successfully completed any of these Bridge courses, viz.,
MCS-201, MCS-208 of IGNOU, are required to register and successfully complete the
remaining bridge courses only.

The fee for bridge courses is as per the Coursewise Registration and Certification Scheme
(CRCS) of IGNOU.

Note: Students WITHOUT Mathematics at 10+2 level or at Graduation level are not eligible for ODL/Online
MCA programme.

Therefore, the students, who have taken admission as per eligibility clause (b) given above,
are required to register and successfully complete the following bridge courses along with
Master of Computer Applications programme.

1.6 Recognition
IGNOU is a Central University established by an Act of Parliament in 1985 (Act No.50 of
1985) IGNOU Degrees/Diplomas/Certificates are recognized by all member Universities of
Association of Indian Universities (AIU) and are at par with Degrees/Diplomas/Certificates of
all Indian Universities/Deemed Universities/Institutions vide UGC Circular No. F1-52/2000
(CPP-II) dated 5 May, 2004 and AIU Circular No. EV/B (449)/94/177115 dated January 14,
1994, and UGC’s letter no. UGC/DEB/2013 dated 14.10.2013, and UGC notification on UGC
website [Link]. 1-18/2018 (DEB-I) dated 21-02-2019, list Master of Computer Application of
IGNOU as one the programme recognised from 2018-19 to2022-23. You may download all the
recognition related information from the following web links.
[Link]
[Link]

1.7 Student Support Services

To provide individualised support to its learners, the University has created a number of Learner
Support Centres (LSCs) throughout the country for this Programme. These are administratively

8
coordinated by the Regional Centres (RCs). The LSCs are the contact points for the students
on all major aspects of the Programme. These include counselling sessions, practical sessions,
reference library facilities, disseminating information and advice, facilities for audio-visual
training aids and teleconferencing.

The University may not always be able to communicate to all the students individually. All the
important communications are sent to the Regional Directors who in turn will intimate them to
the LSC Coordinators. The Coordinators display such Circulars / Notifications on their notice
boards for the benefit of the students. You are, therefore, advised to be in touch with your LSC
Coordinator on a more regular basis so as to get the latest information about assignments,
submission schedules (assignments and examination forms), declaration of results, etc.

1.8 How to contact the MCA Programme Coordinator?

Students may contact the MCA Programme Coordinator by sending a communication through
post to The MCA Programme Coordinator, SOCIS, Vishveswaraiah Bhavan, C-Block, IGNOU
Academic Complex, IGNOU, Maidan Garhi, New Delhi – 110068, or can send an Email to
mca@[Link]

2. INSTRUCTIONAL SYSTEM

The methodology of instruction in this University is different from that of the conventional
universities. The Open and Distance Learning (ODL) University system is more
learneroriented, and the student has to be an active participant in the teaching-learning process.
Most of the instruction is imparted through distance mode with only a small component of face-
toface communication. The University follows a multi-channel approach for instruction. It
comprises a suitable mix of:
 self-instructional material in pdf or printed form
 audio-video programmes transmitted through GYAN DARSHAN channel
 face-to-face counselling at LSC by academic counselors
 compulsory practical sessions at the LSCs
 reference library eGyankosh
 web based academic support
 assignments
 Gyan Darshan Channel, including teleconferencing,  Gyan Vani.
 SWAYAMPRABHA-DTH (channel-19)

2.1 Self-instructional Material

Self-instructional materials are the primary form of instructional materials. These are supplied
to the learners in the form of several booklets called blocks. Each block consists of several
units. The size of a unit is such that the material given therein may be expected to be studied
by a student in a session of about 4 to 6 hours of study. This self-instructional material is made
in electronic form through IGNOU eContent App and eGyankosh website. However, the fast
pace of computer industry necessitates that students must do some additional readings. Students
are advised to study reference books without fail. Studying the self-instructional material alone

9
may not be sufficient to write assignments and prepare for the Term-end Examinations. Some
reference books are available at your RC/LSC.

2.2 eGyankosh, SWAYAMPRABHA-DTH (Channel-19) and IGNOU

eContent App
eGyankosh ([Link]) is a digital repository consists of the reference links Self
instructional materials, recorded videos, YouTube-video archives etc. Various links for the
eGyankosh related to SOCIS are:
eGyankosh Homepage: [Link]
Self-Learning Material: [Link]
YouTube-Video Archives: [Link]
EMPC YouTube Live/Playlists: [Link]

The SWAYAM PRABHA-DTH Channel-13 (Professional Education) is funded by MoE,

Govt. of India and Coordinated by IGNOU, New Delhi. This is an exclusive channel covering
IGNOUs’ Professional and Vocational Education Programmes. This channel broadcasts
visually high-quality and graphically enriched video content of IGNOUs’
Certificate/Diploma/PG Diploma/PG Certificate/Undergraduate/Postgraduate courses
pertaining to Computer Science/Application, Management Studies, Vocational Education,
Engineering and Technology, Law Extension and Development Studies, Social Work,
Journalism and New Media Studies, Performing Arts and Health Sciences. The scope is very
wide and covers courses from 10 Schools of IGNOU through this channel. These video lectures
are delivered by Faculty of IGNOU and also from renowned institutional in India, covering
basics to advanced courses. Gradually, IGNOU is recording and pooling the videos on
Channel19

SWAYAM PRABHA homepage: [Link]

LIVE sessions of SWAYAMPRABHA: [Link]
Professional Education (Channel-13):
[Link]
Archive Videos: [Link]
IGNOU eContent App
The self-instructional course material of various programmes of IGNOU are made available
through IGNOU eContent APP
[Link]

2.3 Counselling Sessions

The details of the theory and practical counselling sessions are given in the following sections.
Theory Sessions

In distance education, face-to-face contact between the learners and their tutors/counsellors is
relatively less. The purpose of such a contact is to answer some of your questions and clarify
your doubts that may not be possible through any other means of communication. It also
provides you with an opportunity to meet your fellow students.

10
There are academic counsellors at the LSC to provide counselling and guidance to you in the
courses that you have chosen for study. Normally, these sessions will be held at the LSC on
Saturdays and Sundays.
You should note that the counselling sessions would be very different from the classroom
teaching or lectures. Counsellors will not be delivering lectures as in conventional teaching.
They will try to help you to overcome difficulties that you face while studying for the MCA
programme. In these sessions, you must try to resolve your subject-based difficulties and any
other related problems.

Practical Sessions and Compulsory Attendance

The practical sessions will be held in the computer centres / labs of the LSC. In these computer
labs, the participants will have the facility to use the computer and software packages relevant
to the syllabus. The following points regarding the practical attendance must be noted:

i) 75% attendance is compulsory for each lab course. This is a pre-requisite for taking the
term-end practical examination in the respective lab courses.
ii) A student who fails to fulfil the 75% attendance requirements will be allowed to reregister
for that lab course. For fee details and the application form, please contact your Regional
Centre.
iii) Students are required to prepare a separate lab record for each lab course. The practical
counsellor should duly sign this lab record after each session.
iv) Student attendance will be recorded course wise at the Learner Support Centre.
v) Strictly follow the guidelines given in the Lab manuals for the respective lab courses.
vi) Computer to Student ratio in a practical session would be 1:2. (2 students would be sharing
a machine)

Before attending the counselling session for each course, please go

through your course material as per the session schedule and make a plan
of the points to be discussed. Unless you have gone through the Units,
there may not be much to discuss and a counselling session may not be
fruitful.

Counselling Schedule
The following is the counselling schedules for 1st to 4th Semesters of MCA. The respective
Learner support centres will communicate you the exact dates of the Schedule. MCA 1 st
Semester Schedule
Course Theory/Practical Credits No. of Theory Hrs No. of Practical Hrs
Counselling Counselling
Sessions* Sessions**
MCS-211 Theory Sessions 4 6 12 - -

MCS-212 Theory Sessions 4 6 12 - -

MCS-213 Theory Sessions 4 6 12 - -

MCS-214 Theory Sessions 2 3 6 - -

11
 MCS-215 Theory Sessions 2 3 6 - -

MCSL-216 Practical Sessions 2 - - 20 60

MCSL-217 Practical Sessions 2 - - 20 60

Counselling of Bridge Courses (Only for the students who are required to register for these
courses based on eligibility conditions for admission to MCA programme)
Course Theory/Practical Credits No. of Theory Hrs No. of Practical Hrs
Counselling Counselling
Sessions* Sessions**
MCS-201 Theory Sessions 4 6 12 - -

MCS-208 Theory Sessions 4 6 12 - -

MCA 2nd Semester Schedule

Course Theory/Practical Credits No. of Theory Hrs No. of Practical Hrs
Counselling Counselling
Sessions* Sessions**
MCS-218 Theory Sessions 4 6 12 - -

MCS-219 Theory Sessions 4 6 12 - -

MCS-220 Theory Sessions 4 6 12 - -

MCS-221 Theory Sessions 4 6 12 - -

MCSL-222 Practical Sessions 2 - - 20 60

MCSL-223 Practical Sessions 2 - - 20 60

MCA 3rd Semester Schedule

Course Theory/Practical Credits No. of Theory Hrs No. of Practical Hrs
Counselling Counselling
Sessions* Sessions**
MCS-224 Theory Sessions 4 6 12 - -
MCS-225 Theory Sessions 4 6 12 - -

MCS-226 Theory Sessions 4 6 12 - -

MCS-227 Theory Sessions 4 6 12 - -

MCSL-228 Practical Sessions 2 - - 20 60

MCSL-229 Practical Sessions 2 - - 20 60

MCA 4th Semester Schedule

12
 Course Theory/Practical Credits No. of Theory Hrs No. of Practical Hrs
Counselling Counselling
Sessions* Sessions
MCS-230 Theory Sessions 4 6 12 - -

MCS-231 Theory Sessions 4 6 12 - -

MCSP-232 Project 12 4 8 - -

*Theory counselling sessions is of 2 Hr duration.

**Practical counsessling sessions is of 3 Hr duration.

Semester No. of Sessions No. of Hours

Theory Practical Theory Practical
I 24 40 48 120
II 24 40 48 120
III 24 40 48 120
IV 12 + 4 sessions - 24 + 8 -
for discussions on
Project
TOTAL 84 120 176 360
Total Computer time per semester = Practical time
= 120 Sessions =360 Hours per semester Note:
75% attendance is compulsory in Practical Lab Sessions.

MCA 1st Semester Schedule

MCS-211 : Design and Analysis of Algorithms
Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1,Unit-2 and Unit-3
Counselling
2 All topics of Block-1 Unit-4, Block-2 Unit-1
3 All topics of Block-2 Unit-2 and Unit-3
4 All topics of Block-3 Unit-1 and Unit-2
5 All topics of Block-3 Unit-3, Block-4 Unit-1
6 All topics of Block-4 Unit-2 and Unit-3
MCS-212: Discrete Mathematics

Counselling Sessions

13
 Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling
2 All topics of Block-1 Unit-3, Block-2 Unit-1
3 All topics of Block-2 Unit-2 and Unit-3
4 All topics of Block-3 Unit-1,Unit-2 and Unit-3
5 All topics of Block-3 Unit-4, Block-4 Unit-1
6 All topics of Block-4 Unit-2, Unit-3 and Unit-4

MCS-213: Software Engineering

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling
2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9,Unit-10, Unit-11
5 All topics of Block-3 Unit-12, Block-4 Unit-13
6 All topics of Block-4 Unit-14, Unit-15 and Unit-16

MCS-214: Professional Skills and Ethics

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1,Unit-2, Unit-3, Unit-4
Counselling
2 All topics of Block-1 Unit-5 , Block-2 Unit-6, Unit-7
and Unit-8
3 All topics of Block-2 Unit-9, Unit-10, Unit-11
MCS-215: Security and Cyber Laws
Counselling Sessions
Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling 2 All topics of Block-1 Unit-3, Block-2 Unit-1
3 All topics of Block-2 Unit-2 and Unit-3

MCSL-216: DAA and Web Design Lab

14
Counselling Sessions

Sessions Session Topics to be Covered

Number
Practical 1-10 All topics of DAA
Counselling
11-20 All topics of Web Design Lab

MCSL-217: Software Engineering Lab

Counselling Sessions

Sessions Session Topics to be Covered

Number
Practical 1-20 All topics of Software Engineering Lab
Counselling
Counselling Schedule of Bridge Courses (Only for the students who are required to register
for these courses based on eligibility conditions for admission to MCA programme)
MCS-201: Programming in C and Python

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling
2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9,Unit-10, Unit-11
5 All topics of Block-3 Unit-12, Block-4 Unit-13
6 All topics of Block-4 Unit-14, Unit-15 and Unit-16

MCS-208: Data Structures and Algorithms

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, and Unit-2
Counselling
2 All topics of Block-1 Unit-3 Block-2 Unit-4
3 All topics of Block-2 Unit-5 and Unit-6
4 All topics of Block-3 Unit-7 and Unit-8
5 All topics of Block-3 Unit-9, Block-4 Unit-10
6 All topics of Block-4 Unit-11 and Unit-12

MCA 2nd Semester Schedule

15
MCS-218: Data Communication and Computer Networks

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling
2 All topics of Block-1 Unit-3 Block-2 Unit-1
3 All topics of Block-2 Unit-2, Unit-3 and Unit-4
4 All topics of Block-3 Unit-1, Unit-2 and Unit-3
5 All topics of Block-3 Unit-4 Block-4 Unit-1
6 All topics of Block-4 Unit-2, Unit-3 and Unit-4

MCS-219: Object Oriented Analysis and Design

Counselling Sessions
Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1, Unit-2, Unit-3 and
Counselling Unit-4
2 All topics of Block-1 Unit-5 Block-2 Unit-1
3 All topics of Block-2 Unit-2 and Unit-3
4 All topics of Block-3 Unit-1 and Unit-2
5 All topics of Block-3 Unit-3 Block-4 Unit-1
6 All topics of Block-4 Unit-2 and Unit-3
MCS-220: Web Technologies
Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, Unit-2, Unit-3
Counselling
2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9 and Unit-10
5 All topics of Block-3 Unit-11 Block-4 Unit-12
6 All topics of Block-4 Unit-13 and Unit-14
MCS-221: Data Warehousing and Data Mining Counselling
Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling
2 All topics of Block-1 Unit-3 Block-2 Unit-4
3 All topics of Block-2 Unit-5 and Unit-6

16
 4 All topics of Block-3 Unit-7 and Unit-8
5 All topics of Block-3 Unit-9 Block-4 Unit-10
6 All topics of Block-4 Unit-11 and Unit-12
MCSL-222: OOAD and Web Technologies Lab
Counselling Sessions

Sessions Session Topics to be Covered

Number
Practical 1-10 All topics of OOAD
Counselling
11-20 All topics of Web Technologies Lab
MCSL-223: Computer Networks and Data Mining Lab
Counselling Sessions

Sessions Session Topics to be Covered

Number
Practical 1-10 All topics of Computer Networks Lab
Counselling
11-20 All topics of Data Mining Lab

MCA 3rd Semester Schedule

MCS-224: Artificial Intelligence and Machine Learning
Counselling Sessions
Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling 2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9,Unit-10, Unit-11
5 All topics of Block-3 Unit-12, Block-4 Unit-13
6 All topics of Block-4 Unit-14, Unit-15 and Unit-16
MCS-225: Accountancy and Financial Management
Counselling Sessions
Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling 2 All topics of Block-1 Unit-3 Block-2 Unit-1
3 All topics of Block-2 Unit-2, Unit-3 and Unit-4
4 All topics of Block-3 Unit-1,Unit-2, Unit-3 & Unit-4
5 All topics of Block-3 Unit-5 Block-4 Unit-1
6 All topics of Block-4 Unit-2 and Unit-3

MCS-226: Data Science and Big Data

Counselling Sessions

17
 Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling 2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9,Unit-10, Unit-11
5 All topics of Block-3 Unit-12, Block-4 Unit-13
6 All topics of Block-4 Unit-14, Unit-15 and Unit-16
MCS-227: Cloud Computing and IoT
Counselling Sessions
Sessions Session Topics to be Covered
Number
Theory 1 All topics of Block-1 Unit-1 and Unit-2
Counselling 2 All topics of Block-1 Unit-3 Block-2 Unit-4
3 All topics of Block-2 Unit-5, Unit-6 and Unit-7
4 All topics of Block-3 Unit-8
5 All topics of Block-3 Unit-9, Block-4 Unit-10
6 All topics of Block-4 Unit-11 and Unit-12
MCSL-228: AI and Machine Learning Lab
Counselling Sessions

Sessions Session Topics to be Covered

Number
Practical 1-10 All topics of AI
Counselling
11-20 All topics of Machine Learning Lab

MCSL-229: Cloud and Data Science Lab

Counselling Sessions

Sessions Session Number Topics to be Covered

Practical 1-10 All topics of Cloud
Counselling
11-20 All topics of Data Science Lab

MCA 4th Semester Schedule

MCS-230: Digital Image Processing and Computer Vision
Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling
2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6 and Unit-7
4 All topics of Block-3 Unit-9 and Unit-10

18
 5 All topics of Block-3 Unit-11, Block-4 Unit-12
6 All topics of Block-4 Unit-13 and Unit-14

MCS-231: Mobile Computing

Counselling Sessions

Sessions Session Topics to be Covered

Number
Theory 1 All topics of Block-1 Unit-1, Unit-2 and Unit-3
Counselling
2 All topics of Block-1 Unit-4 Block-2 Unit-5
3 All topics of Block-2 Unit-6, Unit-7 and Unit-8
4 All topics of Block-3 Unit-9,Unit-10, Unit-11
5 All topics of Block-3 Unit-12, Block-4 Unit-13
6 All topics of Block-4 Unit-14, Unit-15 and Unit-16
2.4 Web Based Support
The learners can have access to IGNOU’s website at the following address (URL):
[Link] You can download assignments, old question papers, circulars, etc.
from the website. The Programme Guide is also available at the website. The following section
gives you how to browse the IGNOU’s website.

3. BROWSING IGNOU’S WEBSITE

The IGNOU’s website is a dynamic source of latest information and is subject to continuous
updates. Thus, various pages shown here may change in future. IGNOU itself is continuously
changing to bring about improvement in quality of its services. You must visit IGNOU website
for all the latest information, filling up or downloading various form, downloading of
assignments, results etc.

Navigation from Home Page

The learners can have access to IGNOU’s website at the following address (URL) http://
[Link]. As students get connected to this site, the following page displays the Home
Page of IGNOU’s web site (Figure 1). Students need to click on various options to get the
related information.

19
 Figure 1: IGNOU Website

From this Home page Select About IGNOU, which will display an Option List select School
of Studies. It will show you a page of all the schools of studies of IGNOU, Select School of
Computer and Information Sciences (SOCIS) to display page of SOCIS (Figure 2). School
of Computer and Information Sciences (SOCIS) offers PhD in Computer Science, MCA, BCA
and CIT programmes, you can click on Programmes link on SOCIS page to get the list of
programmes on offer as shown in Figure 2.

Figure 2: SOCIS Programmes

20
 One of the most important link for students is Student Zone which can be reached
from Home page by selecting Student Zone option on the Student Support Option List
(Link address: [Link] Figure 3 displays the
options of the Student Zone page.

Figure 3: Student Zone page

4. MCA SYLLABUS
SEMESTER - I
MCS-211 Design and Analysis of Algorithms Credit: 4

Algorithms are the central part of computing and Design and Analysis of algorithms course is the core
of the study of Computer Science discipline. The revised course on design and analysis of algorithm
introduces many new topics: Deterministic and Stochastic Algorithms , how to solve recurrence relation
problems through Substitution method, Recurrence tree and Master methods, An overview of local and
global optima ,Fractional Knapsack problem ,Huffman Codes ,a task scheduling algorithm , Topological
Sort ,Strongly Connected Components , Maximum Bipartite Matching Problem, Binomial coefficient
computation , Floyd Warshall algorithm , String Matching Techniques :The naïve String Matching
Algorithm, The Rabin Karp Algorithm, Knuth –Morris Pratt Algorithm, Handling Intractability:
Approximation algorithms for Vertex Cover problem and Minimizing makespan as parallel machines
(Graham’s algorithm) , Parameterized algorithm for Vertex Cover problem and Meta-
heuristic Algorithms
Course Structure*
Block- 1 Introduction to Algorithms

21
 Unit 1: Basics of an Algorithm and its Unit 4: Solving Recurrences
properties - Introduction

- Introduction
- Objective
- Example of an Algorithm
- Basics building blocks of Algorithms
- A survey of common running
time
- Analysis & Complexity of Algorithm
- Types of problems
- Problem Solving Techniques
- Deterministic and Stochastic
Algorithms
- Summary
- Solutions/Answers
- Further Readings

Unit 2: Some pre-requisites and

Asymptotic Bounds
• Introduction
• Objectives
• Some Useful Mathematical Functions &
Notations
Functions & Notations
Modular Arithmetic/Mod
Function
• Mathematical Expectation
• Principle of Mathematical Induction
• Concept of Efficiency of an Algorithm
• Well Known Asymptotic Functions &
Notations
• Summary
• Solutions/Answers

Unit 3: Analysis of Simple Algorithm

• Introduction
• Objectives
• complexity Analysis of Algorithms
Euclid Algorithm for GCD
Polynomial Evaluation Algorithm
Exponent Evaluation
Sorting Algorithm
3.3 Analysis of Non-Recursive Control
Structures Sequencing
For Construct
While and Repeat Constructs
Recursive Constructs
Summary
Solutions/Answers
Further Readings

22
- Objective Unit 2: Dynamic Programming
- Substitution Methods Technique
- Iteration Methods
- Recursive Tree Methods • The Principle of Optimality
- Master Methods • Chained Matrix Multiplication
- Summary • Matrix Multiplication Using
- Solution/Answers Dynamic Programming
- Further Readings • Optimal binary search trees
problems
Block- 2 Design Techniques-I • Binomial coefficient computation
• Floyd Warshall algorithm
Unit 1: Greedy Technique
• Some Examples to understand Greedy Unit 3: String Matching Techniques
Techniques • The naïve String-Matching
• Formalization of Greedy Techniques Algorithm
• An overview of local and global optima • The Rabin Karp Algorithm
• Fractional Knapsack problem • Knuth –Morris Pratt Algorithm
• Huffman Codes •
• A task scheduling algorithm
Block- 4: NP- Completeness and
Unit 2: Divide & Conquer Technique Approximation Algorithm
• General Issues in Divide and Conquer
Technique Unit-1: NP-Completeness
• Binary Search Algorithm • Concepts of Class-P,
• Sorting Algorithm o Merge Sort o NPCompleteness, NP-Hard ,
Quick Sort Unsolvable problems
• Matrix Multiplication Algorithm • Polynomial-time
• Polynomial-time Reductions
Unit 3: Graph Algorithm -I • Class P with Examples
• Basic Definition and terminologies • Knapsack and TSP problems
• Graph Representation o Adjacency Unit 2: NP-Completeness and NP- hard
Matrix o Adjacency List Problems
• Graph Traversal Algorithms o Depth
First Search o Breadth First Search • Polynomial Time verification
• Topological Sort • Techniques to show NP- Hardness
• Strongly Connected Components • NP-Complete problems and P Vs
NP problems?
Unit 3: Handling Intractability
Block- 3 Design Techniques – II
• Approximation algorithms for
Vertex Cover problem and
Unit 1: Graph Algorithms- II minimizing make- span as parallel
• Minimum Cost Spanning Tree problems machines (Graham’s algorithm)
Kruskal’s Algorithm • Parameterized algorithm for
Vertex Cover problem
• Meta-heuristic Algorithms

22
Prim’s Algorithm
• Single Source Shortest Path Problems
Bellman Ford Algorithm
Dijkstra’s Algorithm
• Maximum Bipartite Matching Problem
 MCS-212 Discrete Mathematics Credit 4

Discrete mathematics deal with discrete objects (that is not continuous) like a set of PhD
students in computer science departments. Foundation of Commuter Science is built upon
discrete mathematics. It includes Prepositional calculus, sets, relations, function, graphs,
Boolean algebra and advanced counting principles. Knowledge of discrete structures helps in
analyzing algorithms, and understanding different areas of computer science courses. The
revised course on discrete mathematics course includes Finite State Machines: Introduction
to Finite Automata, Computability and Complexity, Moore and Mealy State Machines and
Deterministic Finite Automata, Regular Expression and Languages: Formal Definition of
Regular expression and language, Building Regular Expressions, Finite Automata and
Regular Expressions, Kleene Closure Definition and Algebra of regular Expressions.
• What is a Proof? o Properties Common to Some Terminology Logic
and Sets o Hypothesis • Relations o Axioms o
Representing relation using o Lemmas matrices
o Corollary o Representing relation using
o Conjunction digraph
• Different Methods of Proof o Cartesian Product o Direct Proof o
Relations and their types

23
Course Structure* • Boolean Functions • Summary
Block-1 Elementary Logic and Proofs • Solutions/Answers

Block- 2 Sets and Languages

Unit 1: Prepositional Calculus
• Introduction • Objectives Unit 1: Sets, Relations and Function
• Propositions
• Logical Connectives o Disjunction o • Introduction
Conjunction o Negation o Conditional • Objectives
Connectives o Precedence Rule • Introducing Sets
• Logical Equivalence • Operations on Sets o Basic
• Logical Quantifiers Operations
• Application of Propositional Logic o o Properties of Relations
Web Page Searching o Logic Circuits • Functions o Types of Functions o
• Summary Composition of Functions o Some
• Solutions/Answers Important function o Operations
on Functions
Unit 2: Methods of Proof • Summary
• Introduction • Solutions /Answers
• Objectives
o Indirect Proofs o Counter Unit 2: Finite State Machines
examples • Introduction to Finite Automata,
• Principle of Mathematical Induction Computability and Complexity
• Summary • Moore and Mealy State Machines
• Solutions/Answers • Deterministic Finite Automata

Unit 3: Boolean Algebra and Circuits Unit 3: Regular Expression and

Languages
• Introduction • Formal Definition of Regular
• Objectives expression and language
• Boolean Algebras • Building Regular Expressions
• Logic Circuits
24
 • Finite Automata and Regular Containers o
Expressions Distinguishable Objects
• Kleene Closure Definition into Indistinguishable
• Algebra of regular Expressions Containers o
Indistinguishable Objects
Block 3: Counting Principles into Distinguishable
Containers o
Unit 1: Combinatorics Indistinguishable Objects
• Introduction into Indistinguishable
• Objectives Containers
• Multiplication and Addition Principles • Summary
• Permutations o Permutations of • Solutions/Answers
Objects not Necessarily Distinct
o Circular Permutations Block-4 Graph Theory
• Combinations
• Binomial Coefficients Unit 1: Basic Properties of Graphs
&Identities
• Summary • Introduction
• Solutions/Answers • Objectives
• Graphs o Graph Models
Unit 2: Advanced Counting Principles

• Introduction
• Objectives
• Pigeonhole Principle
• Inclusion-Exclusion Principle
• Applications of Inclusion –
Exclusion
o Application to Subjective
Functions o Application to
Probability o Application to
Derangements
• Summary
• Solutions/Answers

Unit 3: Recurrence Relations

• Introduction
• Objectives
• Three Recurrent Problems
• Divide and Conquer Technique to solve
Recurrence Relation
• Some Other Methods o Method
of Inspection o Method of
telescoping Sums o Method of
Iteration o Method of Substitution
• Summary
• Solutions/Answers

Unit 4: Partitions and Distributions

• Introduction
• Objectives
• Integer Partitions
• Distributions o Distinguishable Objects
into Distinguishable
 o Social • Trees
Networks o • Summary
Communic • Solutions/Answers
ation Networks o
Web Unit 3: Eulerian and Hamiltonian
Graphs Graphs
• Degree, Regularity and
Isomorphism • Introduction
• Subgraphs • Objectives
• Represent Graphs o Adjacency • Eulerian Graphs
Matrices o Adjacency Lists o • Hamiltonian Graphs o Dirac’s
Incidence Matrix Theorem o Ore’s Theorem
• Summary
• Travelling Salesperson Problem
• Solutions/Answers
• Summary
• Solutions /Answers
Unit 2: Connectedness
• Introduction
Unit 4: Graph Colouring
• Objectives
• Introduction

MCS-213 Software Engineering (Credits:4)

The objective of the Course is to make the learner efficiently work as software engineer.
S/he should be well acquainted with all the phases of Software Development Life Cycle
as well as latest topics in Software Engineering. The learner should be able to apply the
• Connected Graphs o Paths, • Objectives
Circuits and Cycles • Vertex Colouring
o Componen • Edge Colouring
ts o • Planar Graphs
Connectivi • Map Colouring Problem
ty • Summary
• Bipartite Graphs o A • Solutions/Answers
complete bipartite graph
concepts learned for doing research. • Software prototyping and
specification
Course Structure*
Unit 3 Software Design
BLOCK 1: Overview of Software
Engineering • Data design
• Architectural design
Unit1: Software Engineering and its • Interface design
models • HCI design
• Evolution of Software • Modular design
Engineering • User Experience design
• Software development models • Design for Mobility
• Capability maturity models • Pattern based Design
• Software process technology
Unit2: Principles of Software Unit 4 Software Quality and Security
Requirements Analysis
• Engineering the product • Quality Concepts
• Modeling the system • Quality Assurance
architecture • Security Engineering

26
 BLOCK 2: Software Project based projects
Management • Metrics
• Analysis
Unit 5: Software Project Planning • Design
• Different types of project • Testing
metrics Unit10: Mobile Software
• Software project estimation Engineering
• Models for estimation • Transition from design to coding
• Automated tools for estimation of mobile applications
• Software Analytics • Elements of mobile applications
Unit6: Risk management and • Approaches to the development
Project of mobile applications
Scheduling
• Identification of Software risks Unit11: CASE tools
• Monitoring of risks
• Management of risks • Analysis tools
• Formulating a task set for the • Design tools
project • SQA tools
• Choosing the tasks of software • UI design tools
engineering • Software testing tools
• Scheduling methods • Web engineering tools
• The Software project plan Unit12: Advanced Software
Unit 7: Software Testing Engineering

• Component Level Testing • Clean room Software

• Integration Level Testing engineering
• Mobility Testing • Component based Software
Unit 8 Software change engineering
management • Re-engineering
• Reverse engineering
• Baselines Block-4: Advanced Topics in Software
• Version control Engineering
• Change control
• Auditing and reporting • Unit-13: Software Process
Improvement
BLOCK 3: Web, Mobile and CASE • Unit-14: Emerging Trends
tools • Unit-15: Introduction to UML •
Unit9: Web Software Engineering Unit-16: Data Science
• Different layers for
• Issues of management of web- Software Engineers
MCS-214 Professional Skills and Ethics (Credits: 2)

This course is aimed to develop the communicational skills, professional skills and ethics
at the work place. In this course, we concentrate on English at the workplace. You are
probably wondering whether business English (as it is also called) is a separate language
to general English. Certainly not, business English is not a separate language. It is English
used at the workplace using specific vocabulary, and in certain situations having a
different discourse. Every profession uses a certain ‘jargon’ and the business context in
no different. While business English is firmly rooted in general English, nevertheless
there are certain distinguishing features which are evident. In this Course, you will learn
some theoretical inputs into the process of communication, its different types, the
difference between written and oral communication. We then concentrate on the structure
of conversation – its characteristics and conventions, effectively speaking over the
telephone, preparing Curriculum Vitae for jobs and interviews, preparing and
participating in the Group Discussions, Presentation Skills, Copyright and Plagiarism
issues and many more. • Pronunciation: Contracted
Forms
Course Structure*
BLOCK1: Professional Skills Needed Unit3: Job Applications and
at the Work Place - I Interviews
Unit 1: The Process of
Communication • Warmup
• Reading
• Introduction: What is • Vocabulary: Apply for a Job
Communication? • Curriculum Vitae
• The Process of • Language Focus: Some Useful
Communication Words
• Barriers to Communication • • Study Skills: Preparing for an
Different Types of Interview
Communication • Listening
• Written vs. Oral • Speaking
Communication • Writing
• Different Types of Face- • Negotiation Skills
toFace Interactions
• Characteristics and Unit4: Group Discussions
Conventions of Conversation
• Reading
• Conversational Problems of
• Writing Skills
Second/Foreign Language
Users • Listening: How to be
Successful in a Group
• Difference between
Discussion
Conversation and Other
Speech Events • Study Skills
• Language Focus
Unit2: Telephone Techniques • Vocabulary
• Warm Up • Speaking
• Speaking and Listening: • Grammar: Connectives
Commonly Used Phrases in • Pronunciation
Telephone Conversations Unit5: Managing Organisational
• Reading: Conference Calls Structure
• Vocabulary • Warm Up: Ability to Influence and
• Writing and Listening: Lead
Leaving a Message • Reading: The Role of a Manager
• Grammar and Usage: The • Vocabulary: Leadership
Perfect Tenses • Speaking and Listening
27

28
• Language Focus: Degree of 28
Probability Successful Life at the Workplace
• Grammar: Modals
• Writing: Reports • The Changing Scenario in the
• Pronunciation Twentyfirst Century
• What Employers Want
BLOCK 2: Professional Skills Needed at • Qualities of a Star Performer
the Workplace - II • Personal Competence
• Social Competence
Unit6: Meetings
• Neurolinguistic Programming (NLP)
• Reading: A Successful Meeting • Implementing the Change
• Speaking: One to One Meetings • Knowing Who and What Trigger You
• Language Focus: Opening, Middle and Close • Becoming Aware of Our ‘Blind
• Study Skills: Editing Spots’ and Learning to Overcome
• Listening: Criteria for Successful Meetings Them
• Vocabulary • Collaboration and Cooperation
• Grammar: Reporting Verbs
Unit10: Work Ethics and Social Media
• Writing: Memos
Etiquette
• Pronunciation: Stress According to Part of
Speech
• Ethics at the workplace
Unit7: Presentation Skills -I • A Talk on Ethics
• Reading: Presentation Skills • Vocabulary: Positive Qualities
• Grammar: Verbs often Required in • Talking about Ethical and Unethical
Presentations

MCS-215 Course: Security and Cyber Laws (Credits:2)

This course introduces the students to some of the latest topics in the context of computer security and
cyber laws. These topics are very relevant in the present time.
• Language Focus Practices
• Listening: Importance of Body Language in • Improving our Ethics
Presentations
• Speaking: Preparing an Outline of a Unit11: Copyright and Plagiarism
Presentation
• Pronunciation • A Brief History of Copyright
• Evolution of Copyright Law in India •
Unit8: Presentation Skills –II
Who Owns a Copyright?
• Reading: Structure of Presentation
• Study Skills: Visual Aids • Economic, Moral and Other Such Rights
• Ending the Presentation • Plagiarism
• Language Focus: Talking about Increase and • What needs to be acknowledged?
Decrease Course Structure* Block-1: Cyber
• Grammar: Prepositions Security Issues Unit-1: Cyber security
• Listening: Podium Panic issues and challenges (Will be Adapted
• Speaking from MIR-11 Unit-7, PGCCL)
• Pronunciation: Emphasizing the Important • Introduction
Words in Context • Objectives
• Digital Security: Pros & Cons
• Security Issues /breaches in Cyberspace
Unit9: Developing Interpersonal Skills for a
• Technology’s Answers to Cyber
Security
• Cyber Security and the Law
 • United States
Unit-2: Cryptography Mechanisms (Will be • European Union
Adapted from MIR-11 Unit-8, PGCCL) • United Kingdom
• Introduction • Regulation of Cyberspace Content in
• Objectives India
• Introduction to Cryptography • International Initiatives for Regulation
• Functions of Cryptography • of
Steganography Cyberspace
• Encryption and Decryption • Organisation for Economic Cooperation
and Development(OECD)
• Encryption Scheme: Public Key and Private
Key Distribution • UNESCO
• Commonly used Crypto Algorithms • BRICS
• RSA and DES
• Electronic Signature Unit-2: Cyber Crimes
• Authentication and Authorisation • Introduction
• Hash Functions • Objectives
• Access Control Derivatives/Mechanisms • Classification of Cyber Crimes
• Public Key Infrastructure/ Data Encryption • Penalties and compensation (Chapter
Standard IX) under IT Act, 2000
• Offences (chapter XI) under IT Act,
2000
Unit-3: Data Security and Management
• Investigation and procedure ((Chapters
(Will be Adapted from MIR-14 Unit- XII- 77A to 78 and80)
5, PGCCL)
• Basics of Cyber Forensic
• Introduction • Cyber Forensic Investigation Tools
• Objectives
• Security Requirements(CIA)
• Security Threats and Attacks
• Computer, Mobile and Internet
• Security Measures and Solutions
• Security Policy
• Security Management
• Security Audit
• Security & Usability

Block-2: Cyber Laws

Unit-1: Regulation of Cyberspace: An Overview

(Will be Adapted from
MIR-11 Unit-9, PGCCL)
• Introduction
• Objectives
• Desirability of Regulation of Cyberspace
• Need for Regulation of Cyberspace
• How Cyberspace can be regulated
• Legal and Self-Regulatory Framework
• Filtering devices and Rating Systems
• Government Policies and Laws Regarding
Regulation of Internet Content
• UNCITRAL Model Law,1996
• Regulation of Cyberspace Content: Global
Scenario

30
• Patents
Unit-3: IPR issues in Cyber Space • Linking, In-lining and framing
• Introduction • Trademark Issues
• Objectives • Domain Name Disputes – Cyber squatting
• Basic Concept: IPRs • Search Engines and their Abuse o
• Copyright issues in digital- medium, music • Regulatory Framework- National and and
goods International Scenario.

MCSL-216 DAA and Web Design Lab Credits: 2

Main objective of this laboratory course is to provide hands on exercises to the learners
based on DAA and Web Design Course.
Lab Sessions:
• There will be 20 practical sessions (3 hours each) of which 10 sessions will be on
DAA and 10 sessions will be on Web Designing.
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.

MCSL-217 Software Engineering Lab Credits: 2

Main objective of this laboratory course is to provide hands on exercises to the learners based on
Software Engineering Course.
Lab Sessions:
• There will be 20 practical sessions (3 hours each)
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.

Syllabus of Bridge Courses (Only for the students who are required to register for these
courses based on eligibility conditions for admission to MCA programme)
MCS-201 Programming in C and Python
Credits– 4

Objective
The course is aimed to develop problem-solving strategies, techniques and skills that can
be applied to computers and problems in other areas which give students an introduction to
computer and analytical skills to use in their subsequent course work and professional
development. Emphasis of this course is to act as an introduction to the thinking world of
computers, to help students develop the logic, ability to solve the problems by using C &
Python as programming languages. Knowledge in a programming language is prerequisite
to the study of most of computer science courses. This knowledge area consists of those
skills and concepts that are essential to problem solving and programming practice
independent of the underlying paradigm. The student will learn various concepts and
techniques for problem solving and will implement
those ideas using C and Python programs. Using Computer as a
ProblemSolving Tool
Block and Unit Structure
C PROGRAMMING (BLOCK - 1 & 2) Basics of Algorithms o
BLOCK 1: An Introduction to C Definition o Features of
Algorithm
Unit 1: Programming Fundamentals • Flowcharts o Basic
• Symbols used in Flowchart
• Problem - Solving Techniques o Design
Steps for Problem - Solving
31
 • Structured Programming concepts • Loop Control Statements o
• C Language and its features The while Loop o The
• Structure of a C Program do-while Statement o The
• Writing a C Program for Loop o The Nested
• Compiling a C Program o The Loop
C Compiler o Syntax and • The Goto Statement
Semantic Errors • The Break Statement
• Link and Run the C Program o Run • The Continue Statement
the C Program through the Unit 4: Arrays & Strings
Menu o Run from an Executable
File o Linker Errors o Logical and • Array Declaration o
Runtime Errors o Syntax of Array Declaration
o Size Specification
• Array Initialization o
Unit 2: Data Types Operators and Initialization of Array
Elements in the Declaration
Expressions
o Character Array Initialization
• Character Set
• Subscript
• Identifiers and Keywords o
• Processing the Arrays
Rules for Forming Identifiers
• Multi-Dimensional Arrays o
o Keywords
Multi-Dimensional Array
• Data Types and Storage
Declaration o
• Data Type Qualifiers
Initialization of Two-Dimensional
• Variables
Arrays
• Declaring Variables
• Declaration and Initialization of
• Initialising Variables
Strings
• Constants o Integer Constants o
Floating Point Constants o • Display of Strings Using
Character Constants o Different Formatting
String Constants o Symbolic Techniques
Constants • Array of Strings
• Preprocessor directives • String Functions and
• Assignment Statements Applications
• Arithmetic Operators
• Relational Operators BLOCK 2: Functions, Structures,
• Logical Operators Pointers and File Handling in C Unit 5:
• Comma and Conditional Operators Functions
• Type Cast Operator • Definition of a Function
• Size of Operator • Declaration of a Function
• C Shorthand • Function Prototypes
• Priority of Operators • The Return Statement
• Types of Variables and Storage
Classes o Automatic Variables o
Unit 3: Decision and Loop Control External Variables o Static
Statements Variables
• Decision Control Statements o The o Register Variables
if Statement o The switch
Statement • Types of Function Invoking
• Call by Value
32
 • Recursion • Data Structures o Arrays o
Unit 6: Structures and Unions Linked Lists o Stacks o Queues
• Declaration of Structures • Sequence, Selection and
• Accessing the Members of a Structure Iteration constructs
• Initializing Structures • Recursion
• Structures as Function Arguments
Unit-11 Functions and File Handling in
• Structures and Arrays
Python
• Unions
• Function definition and call
• Initializing an Union
• Function Scope
• Accessing the Members of an Union
• Arguments
• Bit fields
• Function Objects
Unit 7: Pointers • Lambda Functions
• Pointers and their Characteristics • Anonymous Functions
• Address and Indirection Operators • File Operations
• Pointer Type Declaration and • Creating. Opening and using
Assignment o Pointer to a Pointer files
o Null Pointer Assignment
Unit-12 Modules and Packages
• Pointer Arithmetic
• Module Creations and Usage
• Passing Pointers to Functions o A
• Module Search Path
Function Returning More than
One Value o Function
Returning a Pointer
• Arrays and Pointers
• Array of Pointers
• Pointers and Strings

Unit 8: File Handling

• File Handling in C Using File Pointers
o Open a file using the function
fopen ( )
o Close a file using the function
fclose( )
• Input and Output using file pointers o
Character Input and Output in
Files
Unit-9 Introduction to Python
• History of Python
• Need of Python
• Packages for Cross platform
application of Python
• Getting started with Python
• Program structure in python
• Running the First program

Unit-10 Data Structures and control statements

in Python
• Data Types

33
 • Module Vs. Script
o String Input / Output Functions • Package Creation and Importing o Formatted
Input / Output • Standard Library Modules
Functions
o Block Input / Output Functions Block-4 Advanced Features in Python
• Sequential Vs Random Access Files Unit-13 Classes in Python
• Positioning the File Pointer • Introduction to Object Oriented
• The Unbuffered I/O - The UNIX like File Paradigms
Routines • Classes and instances
• Classes method calls
• Inheritance and Compositions
PYTHON PROGRAMMING (BLOCK- • Static and Class Methods
3&4) • Operator Overloading
Block-3 Introduction to Python • Polymorphism
Programming
Unit-14 Exception Handling in Python
Programming
• Default Exception Handler
• Catching Exceptions
• Raise an exception
• User defined exception

Unit-15 Advanced Concepts

• Decorators

• Generators
• Iterators
• Co-routines

Unit-16 Data Access using Python

• Database concepts
• Creating database
• Querying Database

34
 • Using SQL to get more out of database

MCS-208 Data Structures and Algorithms 4 Credits

Objectives
The learner should become well versed with Algorithms and various data structures. S/he should
be able to use them appropriately as per need during development of programs. Also, the learner
should know different sorting and searching techniques so that correct techniques can be used in
different programs so that the complexity of the program does not increase due the sorting/search
technique employed. The course also includes Advanced Data Structures which will enable
learner to apply them in solving complex problems.

Block and Unit Structure

BLOCK 1: Introduction to Algorithms and Unit 4: Stacks

Data Structures
• •Abstract Data Type-Stack
Unit 1: Analysis of Algorithms Implementation of Stack
• Mathematical Background o Implementation of Stack using
• Process of Analysis Arrays o Implementation of
• Calculation of Storage Complexity Stack using Linked Lists
• Calculation of Run Time Complexity • Algorithmic Implementation of
Multiple Stacks
Unit 2: Arrays, Pointers and Structures • Applications
• Arrays and Pointers
Unit 5: Queues
• Sparse Matrices • •
• Structures Abstract Data Type-Queue
• Polynomials Implementation of Queue o Array
• Representation of Arrays o Row • Implementation o Linked List
Major Representation o Column • Implementation Implementation of
Major Representation Multiple Queues Implementation of
• Applications Unit 3: Lists Circular Queues o Array
• Abstract Data Type-List Implementation o Linked List
• Array Implementation of Lists Implementation of a circular queue
• Linked Lists-Implementation • Priority Queues
• Doubly Linked Lists-Implementation Implementation of DEQUEUE o
Array Implementation of a
• Circularly Linked Lists-Implementation dequeue o Linked List
• Skip lists Implementation of a dequeue
• Applications Unit 6: Trees
• Abstract Data Type-Tree BLOCK 2: Stacks, Queues and Trees •
Implementation of Tree

35
 • Tree Traversals • Linear Search
• Binary Trees • Binary Search
• Implementation of Binary Tree • Applications
• Binary Tree Traversals o Recursive • Internal Sorting o Insertion Sort
Implementation of o Bubble Sort o Quick Sort o 2-
Binary Tree Traversals o Non way Merge Sot o Heap Sort
Recursive Implementations of Binary • Sorting on Several Keys
Tree Traversals • External Sorting Algorithms
• Applications
BLOCK 4: File Structures and
Advanced Data Structures
BLOCK 3: Graph Algorithms and Searching
Techniques Unit 10: Hashing o Introduction
o Index Mapping o
Unit 7: Advanced Trees
Collision Handling o
• Binary Search Trees o Traversing a Double Hashing o Load
Binary Search Trees o Insertion of Factor and Rehashing
a node into a Binary
Unit 11: Advanced Data Structures
Search Tree o Deletion of a
• Scapegoat Trees
node from a Binary Search Tree
• Tries
• AVL Trees o Insertion of a node
• Binary Tries
into an AVL
• X-Fast Tries
Tree o Deletion of a node from
• Y-Fast Tries
and AVL
Tree o AVL tree rotations Unit 12: File Structures
o Applications of AVL • Terminology
Trees • File Organisation
• B-Trees o Operations on B-Trees o • Sequential Files o
Applications of B-Trees Structure o Operations o
• Splay Trees o Splaying steps o Disadvantages o Areas
Splaying Algorithm of use
• Red-Black trees o Properties • Direct File Organisation
of a Red-Black tree • Indexed Sequential File
• AA-Trees Organisation
Unit 8: Graphs
• Definitions
• Shortest Path Algorithms o Dijkstra’s
Algorithm o Graphs with Negative
Edge costs o Acyclic Graphs o All
Pairs Shortest Paths Algorithm
• Minimum cost Spanning Trees o
Kruskal’s Algorithm o
Prims’s Algorithm o
Applications
• Breadth First Search
• Depth First Search
• Finding Strongly Connected
Components
Unit 9: Searching and Sorting Techniques
36
 SEMESTER - II
MCS-218 Data Communication and Computer Networks Credits: 4

The course introduces the fundamental concepts of data communication and Computer
Networks. In the networking field, significant changes have taken place: (i) evolution of the
Internet and wireless networks (ii) growth of networking services and applications. Network
security has become very important topics because things are becoming digital and networked
with each other. One extra unit has been added to cover the security topics. The objective of
the revised courses is to reflect these changes besides explaining the basic principles of
computer networking. A several new topics have been introduced in the revised course:
Personnel Area network: Bluetooth and Zigbee, Cellular Networks : Architecture, Handoff,
3G,4G and 5G networks, Mobile IP, IPV6, Mobile Adhoc Networks, Wireless Sensor
Networks, Internet of Things (IOT), Network Layer Security: IPSec, VPN, Securing TCP
Connections: SSL, WLAN Security, Cyber Threats and Attacks and Counter Measures,
Taxonomy of various Cyber Attacks, Virus, Worm and Trojan , DoS attack, DDOS attack,
Phishing attacks, Malware, Ransom, vulnerabilities, Buffer Overflow, SQL Injection, Browser
Vulnerabilities, OS vulnerabilities, Basics Computer Forensics, Recent Cyber Attacks and
Firewalls and Intrusion
Detection Systems. Objectives
Data Communication Terminology
Course Structure* Channel
Baud
Block- 1 Introduction to Data Bandwidth
Communication Frequency
Modes of Data Transmission
Unit 1: Introduction to Internet Serial and Parallel Communication
• Introduction Synchronous, Asynchronous and
• Objectives Isochronous Communication
• What is the Internet? Simplex, Half Duplex and Full
ISP and Internet Backbone Duplex Communication
Interconnection of ISPs Analog and Digital Data Transmission
- Taxonomy of Network Transmission Impairments
- Standard Internet Protocols Attenuation
- Public Network & Private Network Delay Distortion
(Intranet) Noise
- Accessing the Internet Signal to Noise ratio
- Telephone Network Concept of Delays
- Cable Network Transmission Media and its
- Wireless Network Characteristics
• Internet Services Guided media
Network Topology Unguided media
Network Models Wireless Transmission
Microwave Transmission
• OSI Model
Radio Transmission
• TCP/IP Model Infrared and Millimeter Waves
• Summary Wireless LAN
• Solutions/Answers Summary
Solutions/Answer
Unit 2: Data Transmission basics &
transmission media Unit 3: Data Encoding &
Introduction multiplexing

37
 Introduction Unit 3: Contention-based Media
Objectives Access Protocols
Encoding
Analog to Analog Modulation Introduction
Analog to Digital Modulation Objectives
Digital to Analog Modulation Advantages of Multiple Access
Digital to Digital Encoding Sharing of Channel Resources Pure
Multiplexing ALOHA
Frequency Division Multiplexing Slotted ALOHA
Time Division Multiplexing Carrier Sense Multiple Access(CSMA)
Summary CSMA with Collision Detection
(CSMA/CD)
Solutions/Answers Ethernet Frame Format (IEEE802.3)
Summary
Solutions/Answers
Block- 2 Media Access Control and Further Readings
Data Link Layer
Unit 4: Polling-based Media Access
Unit 1: Data Link Layer Fundamentals Control Protocols
Introduction • Introduction
Objectives • Objectives
The services provided by the link layer • Characteristics of Wireless
Framing Link and Wireless Network
Error Correction and Detection • Introduction to Wireless LAN
- Type of errors • Wireless LAN Architecture
- Single bit error (IEEE802.11)
- Burst error • Hidden Station and Exposed
- Error Detection and Correction Station Problems •
Techniques Wireless LAN
- Parity Check Protocols:
- Checksum Methods MACA and MACAW
- Cyclic Redundancy check • IEEE 802.11 Protocol Stack
DLC Protocols • The 802.11 Physical Layer
- HDLC (High Level Data Link • The 802.11 MAC Sub-layer
Control) Protocol • Switching at
- PPP Protocol (Point to Point Data Link Layer
Protocol) • Personnel Area network:
Flow Control Bluetooth and Zigbee
Summary • Cellular Networks:
Solutions/Answers Architecture, Handoff
• 3G, 4G and 5G networks
Unit 2: Retransmission Strategies • Summary
Introduction • Solutions/Answers
Objectives • Further Readings
Stop & Wait ARQ
Sliding window Protocols Block- 3 Network Layer
Piggybacking and Pipelining
Concepts
Unit 1: Introduction to Layer
Go-Back-N ARQ (Automatic Repeat Request)
Functionality and Design Issues
Selective Repeat N.
• Introduction o Objectives o
Summary
Connection Oriented vs.
Solutions/Answers
Connection-less Services
Further Readings

38
  Connection-oriented • Multicast Routing
Services • Mobile IP
 Connection-less • Summary
Services o Implementation of • Solution/Answers
the Network • Further Readings
Layer Services Unit 3: Congestion Control
 Packet Switching Algorithms
 Implementation of
Connection-oriented • Introduction
Services • Objectives
 Implementation of • Reasons for Congestion in the
Connection-less Services o network
Comparison between Virtual • Congestion Control vs. Flow
Circuit and Datagram Subnet o Control
Addressing • Congestion Prevention
 Hierarchical Versus Mechanism
Flat Address • General Principles of
 Static vs. Dynamic Congestion Control
Address • Open Loop Control o
 IP Address o Concept Admission Control o Traffic
of Congestion o Routing Policing and its
Concept Implementation o
 Main Issues in Routing Traffic Shaping
 Classification of and its Implementation
Routing - Leaky Bucket Shaper -
Algorithm Token Bucket Shaper
o Summary o Difference between
Leaky Bucket Traffic Shaper
o Solutions/Answers
and token Bucket Traffic
o Further Readings Shaper
• Congestion Control in
Unit 2: Routing Algorithms Packetswitched Networks
Introduction • Summary
Objectives • Solution/Answers
Flooding • Further Readings
Shortest Path Routing Algorithm Unit 4: Emerging Networking
Distance Vector Routing o Technology
Comparison o The Count-to-
Infinity Problem • Mobile Adhoc Networks
• Link State Routing • Wireless Sensor Networks
• Hierarchical Routing • Internet of Things(IOT)
• The Internet Protocol (IP) o IPV4 Block- 4 Transport Layer and
addressing o Datagram Format o IPV6 Application Layer Services
o IP Datagram Fragmentation o Unit 1: Transport Services and
Internet control message protocol Mechanism
o Dynamic host configuration • Introduction
protocol • Objectives
o IP Security • Transport Services o Types of
• Routing with Internet
Services o Quality of Services
Inter Autonomous System
o Data Transfer o Connection
Routing in the Internet: RIP &
Management o Expedited
OSPF
Delivery
Inter Autonomous System
Routing BGP

39
 • Elements of Transport Layer Protocols • RSA Public Key Algorithm •
o Addressing o Multiplexing o Application of Public
Flow Control and Buffering o Key
Connection Establishment o Cryptography (Digital
Crash Recovery Signature)
• Summary • Management of Public Keys
• Solutions/Answers • Kerberos
• Further Readings • Network Layer Security:
IPSec, VPN
Unit 2: TCP/UDP • Securing TCP Connections:
SSL
• Introduction • WLAN Security
• Objectives • Summary
• Services Provided by Internet • Solutions/Answers
Transport Protocols o TCP Services o • Further readings
UDP Services
• Introduction to UDP Unit 4: Network Security-II
• Introduction to TCP
• TCP Segment Header • Introduction
• TCP Connection Establishment • Objectives
• TCP Connection Termination • Cyber Threats and Attacks and
• TCP Flow Control Counter Measures
• TCP Congestion Control • Taxonomy of various Cyber
• Remote Procedure Call Attacks
• TCP in wireless environments • Virus, Worm and Trojan , DoS
• Summary attack, DDOS attack, Phishing
• Solutions/Answers attacks, Malware, Ransom
• Further Readings • vulnerabilities
• Buffer Overflow
• SQL Injection
Unit 3: Network Security I
• Browser Vulnerabilities
• OS vulnerabilities
• Basics Computer Forensics
• Introduction • Recent Cyber Attacks
• Firewalls and Intrusion
• Objectives • What is Internet Detection Systems
Security?
• Summary
• Principles of Cryptography
• Solutions/Answers
• Symmetric Key Cryptography
• Further Readings
• Public Key Cryptography
MCS-219 Object Oriented Analysis and Design 4 Credits

Object oriented analysis and design is a popular paradigm of analysis and design of the systems.
This Course is designed to help in learning object oriented analysis and design concepts. This
Course is having coverage of UML diagrams and will help in developing understanding in the
area of system analysis and design concepts using object-oriented approach. This Course will
cover different aspects of OOAD with explaining object modeling dynamic modeling and
functional modeling. The topics covered in the course include:
Object Oriented Modeling and UML
Introduction to Object Oriented Modelling: OOT Object Oriented Modeling, Characteristics
Object Oriented Modeling (Class and Objects, Links and Association, Generalization and
Inheritance), An Object Model, Benefits of OO Modeling, Introduction to OOAD tools

40
Object Oriented Analysis: Object Oriented Analysis, Problem Statement: an Example,
Differences between Structured Analysis and Object Oriented Analysis, Analysis Techniques
(Object Modeling, Dynamic Modeling, Functional Modeling), Adding Operations, Analysis
Iteration
Using UML: UML: Introduction, Object Model Notations: Basic Concepts, Structural
Diagrams (Class, Object, Composite, Package, Component, Deployment), Behavioural
Diagrams (Use Case, Communication, Sequence, Interaction Overview, Activity, State),
Modelling with Objects
Object Oriented Design
System Design: System Design: An Object-Oriented Approach, Breaking into Subsystems,
Concurrency Identification, Management of data store, Controlling events between Objects,
Handling Boundary Conditions
Object Design: Object Design for Processing, Object Design Steps, designing a Solution,
Choosing Algorithms, Choosing Data Structures, Defining Classes and delegation of
Responsibilities to Methods
Advance Object Design: Control and its Implementation (Control as a State within Program,
Control as State Machine Engine, Control as Concurrent Task), Inheritance Adjustment,
Association: Design, Object Representation, Design Optimization, Design Documentation
Modeling
Object Modeling: Advance Modeling Concepts (Aggregation, Abstract Class), Multiple
Inheritance, Generalization as an Extension, Generalization as a Restriction, Metadata,
Constraints, An Object Model
Dynamic Modeling: Events, State and State Diagram, Elements of State Diagrams, Examples
of State Diagrams, Advance Concepts in Dynamic Modeling, Concurrency, A Dynamic model
Functional Modeling: Functional Models, Data Flow Diagrams, Features of a DFD, Design
flaws in DFD, A Functional model, Relationship between Object, Dynamic, and Functional
Models Implementation
Implementation Strategies: Implementation (Using Programming Languages, Using Database
System), Unidirectional Implementation, Bi-directional Implementation, implementing
associations, Implementing Constraints, Implementing State charts, Persistency
Object Mapping with Databases: Relational Database Schema for Object Modes, Object
Classes to Database Tables, Mapping Associations to Tables, Mapping Generalizations to
Tables, Interfacing to Database, Object Mapping with Databases: an Example.
Course Structure* • Polymorphism
Block 1: Object Oriented Analysis and • Basic Constructs in
UML Object Orientation o
Class and Objects o
Unit 1: Introduction to Object Oriented
Links and
Modeling
Association o
• Introduction to Object Generalization and
Orientation Special
• Basic Philosophy of Object • Identifying Class and
Orientation Object
• Principals of Object Orientation • Benefits of Object
• Abstraction Orientation
• Encapsulation • Introduction to OOA
• Inheritance & Design Tools

41
 • Meta Data and Keys
Unit 2: Structural Modeling using • Integrity Constraints
UML • An Object Model
• Introduction to UML
Unit 2: Dynamic Modeling
• Basic Structural Modeling o
Classes o Relationships, • Events
o Common Mechanisms o • State and State
Class Diagram Diagram
• Advanced Structural Modeling o • Elements of a State
Advance Classes  Advanced Diagram
Relation • Advanced Concepts in
Dynamic Modeling
 Interference Type and Roles • Concurrency
• Packages, • A Dynamic Model
• Instance and Object Diagrams
Unit 3: Functional
Unit 3: Behavioral Modeling using Modeling •
UML Functional
• Basic Behavioral Modeling Models
• Interactions, • Data Flow Diagrams
• Use Cases and Use Case • Features of a DFD o
Diagram Processes o Data
Flows o Actors o Data
• Interaction Diagram
Stores o Constraints o
• Activity Diagram Control Flows
Unit 4: Advanced Behavioral • Design Flaws in DFD
Modeling using UML • A Sample Functional
• Events and Signals Model • Relation
• State Machines of Functional to
• Process and Threads Object and Dynamic
• Time and Space Model
• State Chart Diagram Block 3: Object Oriented
Design
Unit 5: Architectural Modeling
Unit 1: Basics of System
• Components Design
• Deployment
• Collaboration • OOA to OOD
• Component Diagrams • System Design: An
• Deployment Diagrams Object-Oriented
Approach
• Breaking into
Block 2:Modeling
Subsystems
Unit 1: Object Modeling • Concurrency
Identification
• Advanced Modeling Concepts o • Management of a Data
Aggregation Store
Abstract Class • Controlling Events
• Multiple Inheritance • Between Objects
Generalization and • Handling Boundary
Specialisation Conditions

42
 • Bi-directional
Unit 2: Object Design Implementations o
One-to-One and
• Object Design for Processing Optional
• Object Design Steps Associations o
• Choosing Algorithms o One-to-Many
Selecting Data Structure o Associations o
Defining Internal Classes and Immutable
Associations
Operations o Assigning
Responsibility for Operation
• Implementation of Control o State Unit 2: Implementation
Strategies-2
as Location within a Program o
State Machine Engine o Control as
Concurrent Tasks • Creating Methods from
• Adjustment of Inheritance o Collaboration
Diagram
Rearranging Classes and Operations
o Abstracting Out Common • Implementing
Constraints
Behavior
• Implementing State
• Design of Associations o Analyzing Charts
Association Traversal o One-way • Persistency
Associations o Two-way
Associations
Unit 3: Objects Mapping With
Databases
Unit 3: Advance Object Design
• Relational Database
Schema for Object
• Control and its Implementation o Modes o General
Control as a State within Program o
Control as a State Machine Engine DBMS Concepts o
o Control as Concurrent Task Relational DBMS
• Inheritance Adjustment Concepts o RDBMS
• Association: Design Logical Data
• Object Representation Structure
• Design Optimization • Object Classes to
• Design Documentation Database Tables o
Extended Three
Block 4: Implementation Schema
Architecture for Object
Unit 1: Implementations Strategies -1 Models o The use of
Object IDs o Mapping
• Mapping Design to Code Object Classes to Tables
• Mapping Associations
• Creating Class Definition from to Tables o Mapping
Class Binary Associations
Diagram to
• Implementing Associations Tables
• Unidirectional Implementations o
o Mapping Many-to-Many
Optional Associations o One-to-
One Associations o Associations Association to
with Multiplicity Tables o Mapping
‘Many’ Ternary
Associations to Tables

43
MCS-220 Web Technologies 4 Credits

Main objective of the Course is to introduce concepts, tools/technologies and

programming to develop distributed secure, reliable and scalable Web Application using
J2EE Technologies application. This course discusses some commonly used design
patterns, servlet, JSP, Spring Boot & Hibernate (ORM), and Web Security. The topics
covered in the course include:

Introduction to Advance Java (J2EE) J2EE Architecture and Design patterns (MVC,
Repository Design pattern, Singleton, Factory, etc.), Building java Application JAR and
WAR and deployment in tomcat.

Introduction to Servlets, Http Protocol & Http Methods, Web Server & Web Container,
Servlet Architecture, Servlet Life Cycle, Steps to create a Servlet, Servlet
Communication (Servlet- Browser, Web-component, ) , Session Management, Database
Connectivity in Servlet, Java Server Pages(JSP) Overview, JSP Life Cycle, JSP API,
Components of JSP(Directives, Scripting, Action), JSP Implicit Objects, JSP Standard
Tag Library (JSTL), Exception handling using JSP, Database Connectivity in JSP.

Introduction to J2EE Frameworks, discuss about various Frameworks available for J2ee
Development (Struts, Hibernate, Spring)- Maven and Introduction of Annotation. Spring
MVC- Configuration, Create, Read, Update, and Delete (CRUD) Application. Spring
MVC with Bootstrap CSS- Configuration of Bootstrap in Application and Apply custom
CSS in pages.

Spring Boot & Hibernate (ORM) - Introduction to Spring boot, Configuration of

Hibernate (ORM)

CRUD Application using spring boot and Hibernate.

Web Security- Spring Security configuration, Custom login using Security, Role based
login.
• Mapping Generalizations to • Creating a Servlet
Tables • Servlet
• Interfacing to Databases Communication
(Servlet-Browser and
Course Structure* Webcomponent)
Block 1: Web Application Unit 3: Session Management and
Development using J2EE Database Connectivity in
Unit 1: Introduction to J2EE, Servlet
Architecture and Design pattern • Session Management
● Web Server & Web Container, • Database Connectivity
● Introduction to J2ee in Servlet,
● Design Patters • Servlet
1. MVC Communication
2. Repository Design pattern (Servlet-Browser,
3. Singleton Webcomponent)
• Servlet Collaboration
4. Factory
• Session Management
● Building java Application JAR • Database Connectivity
and WAR and deployment in
tomcat
Unit 4: JSP
Unit 2: Basics of Servlet • JSP Overview
• Introduction to Servlets • JSP Life Cycle
• Http Protocol & Http Methods • JSP API
• Servlet Architecture • Components of JSP
(Directives,
• Servlet Life Cycle
Scripting, Action)

44
• JSP Implicit Objects Block 3: Spring Boot and
• An Introduction to JSP Standard Hibernate
Tag Library (JSTL) (ORM)
• Exception handling using JSP
• Database Connectivity Unit 9: Introduction to Spring
boot
Block 2: Frameworks for J2EE • Spring Boot: Overview
• Spring Boot Dev Tools
Unit 5: Introduction to J2EE and Spring Boot
Frameworks Actuator
• Introduction of Struts • Spring boot-
• Introduction of Spring including Application Properties
Boot and MVC • Running Spring Boot
• Introduction of Hibernate with Java Apps from command
Persistence API (JPA) line
• Introduction of Annotation Unit 6:
Discuss about various Unit 10: Configuration of
Frameworks available for J2EE Hibernate
Development (Struts, Hibernate, (ORM)
Spring) • Hibernate Overview
• Struts: Features • Hibernate
• Spring Boot and MVC: features Configuration with
• Hibernate with JPA: Features Annotation
• Compare amount these frameworks • REST (REST stands
• Maven: Introduction., Overview and for
configuration Representational State Transfer)
• Create First Project using Maven JPA Overview
• Creating JPA DAO
implementation for
Unit 7: Spring MVC REST API
• Setting up Development • Hibernate CRUD
Environment for Spring MVC (Create, Read, Update,
• First Hello World Project using and Delete)Features
Spring MVC
Unit 11: CRUD Application
• Inversion of Control (IoC) and
using
Dependency Injection
Spring boot and Hibernate
• Creating Controllers and Views
• Create records using
• Request Params and Request
Spring Boot and
mapping
Hibernate
• Form Tags and Databinding
• Read records using Spring
• Form Validation Boot and Hibernate
• Update records using
Unit 8: Spring MVC with Bootstrap Spring Boot and
CSS Hibernate
• Configuration of Bootstrap in • Delete records using
Spring Application Spring Boot and
• Apply custom CSS in pages Hibernate
• Setting UP Database using
Hibernate Block 4: Web Security
• Create, Read, Update, and Delete
(CRUD) Unit 12: Spring Security
• CRUD examples in Spring MVC configuration
and Hibernate

45
 • Introduction to Web Securities o • Testing Custom Login
Introduction of Java Form
Cryptography Architecture
(JCA) o Introduction of Java • Adding Logout Support
Secure Socket Extension (JSSE)
• Issues and Challenges of Web Security Unit 14: Role based login
• Spring Security Overview • Display User Id and Roles
• Java based configuration Overview
• Create Spring Initializer class • Roles based login
• Create Controller and View Example
• Run Application • Restrict Access based on
Roles
Unit 13: Custom login using Security • Testing the Application
• Custom login form creation • Cross Site Request
• Spring Config for Custom Login Form Forgery
• Create Request mapping and building (CSRF)
Custom Login Form
MCS-221 Data Warehousing and Data Mining 4 Credits
The course objectives are:
• To understand the underlying concepts of Data Warehousing
• To identify the components of the Data Warehouse Architecture
• To know the difference between the Data Warehouse and Data Marts
• To understand the Data Warehouse Development Life Cycle
• To elucidate the dimensional modeling techniques
• To understand the ETL, OLAP concepts and other evolving trends
• To learn data mining concepts and understand association rules mining
• To discuss classification algorithms, learn how data is grouped using clustering
techniques
• To develop the abilities of critical analysis to data mining systems and applications
• To implement practical and theoretical understanding of the technologies for data
mining
• To understand the strengths and limitations of various data mining models The topics
covered in the course include:

Introduction to Data Warehousing, Evolution of Data Warehousing, Features of Data

Warehousing, Benefits of Data Warehousing, Data Granularity, Metadata, Data Warehousing
Architecture, Data Warehouse and Data Marts, Building Data Marts, Issues in building data
marts, Data Warehouse Schema, Dimensional Modeling, The Star Schema, The Snowflake
Schema, Aggregate Tables, Fact Constellation Schema, Dimensional Modeling, Extraction,
Transformation and Loading (ETL) process, OLAP and Data Warehousing, OLTP and Data
Warehousing, Trends in Data Warehousing

46
Introduction to Data Mining Systems, How Data Mining Works, Classification of Data Mining
Systems Issues, Applications of Data Mining, Data Mining Tools, Issues in Data Mining, Data
Preprocessing – Cleaning, Integration, Reduction, Transformation and Discretization, Data
similarity and dissimilarity measures, Mining Frequent Patterns, Associations, Classification
using Frequent Patterns, Decision Tree Induction , Bayesian Classification, Rule Based
Classification, Classification by Back Propagation, Support Vector Machines, K- nearest
Neighbor classification, Clustering, Major Clustering Methods, Partitioning Methods,
Hierarchical Methods, Density Based Methods, Grid Based Methods, Hierarchical Clustering,
Outlier Detection, Text and Web Mining. • DW and Data Marts
• Issues in Building Data Marts
Course Structure* • Co-existence of DW and Data Mart
BLOCK 1: DATA WAREHOUSE • Planning and Requirements o
FUNDAMENTALS AND Planning Data Warehouse and Key
ARCHITECTURE Issues o Planning and
Project Management in constructing
UNIT 1: Fundamentals of Data Data Warehouse
Warehouse o Data Warehouse Development
Life Cycle o Methodologies
• Introduction to Data Warehousing - Top- Down,
• Evolution of Data Warehousing Bottom-Up and Hybrid
• Data Warehousing Concepts Development Methodology
• Online Transaction Processing
Systems Unit 3: Dimensional Modeling
• Differences between OLTP Systems
and Data Warehouse • Introduction to Dimensional Modeling
• Characteristics of Data Warehouse and its Strengths
• Data Granularity • Identifying Facts and Dimensions
• Metadata and Data Warehousing • Star Schema
• Functionality of Data Warehouse • Pros and Cons of Star Schema
• Advantages of Data Warehouse • Snowflake Schema
• Applications of Data Warehouse • Pros and Cons of Snowflake Schema
• Concerns in Data Warehouse • Aggregate Tables o Need for
• Types of Data Warehouses o Building Aggregate Fact Tables o
Enterprise Data Warehouse o Limitations of Aggregate Fact
Operational Data Store Tables
o Data Mart • Fact Constellation Schema o
Aggregate Fact Tables and
Unit 2: Data Warehouse Architecture Derived Dimension Tables
• Pros and Cons of Fact Constellation
• Introduction to Data Warehouse Schema
Architecture BLOCK 2: ETL, OLAP ANDTRENDS
• Characteristics of Data Warehouse
Architecture Unit 4: Extract, Transform and
• DW Architecture Goals Loading
• Components of Data Warehouse o
Load Manager o Warehouse • Overview of ETL
Manager o Query Manager • Data • ETL requirements and steps
Mart • Data Extraction
• Building Data Marts • Extraction Methods - Logical

47
 Extraction Methods and Physical • Data Mining and Data Warehousing
Extraction Methods • Data Mining Tools
• Data Transformation • Major Issues in Data Mining
• Basic Tasks in Transformation Unit 8: Data Preprocessing
• Major Data Transformation Types
• Data loading; Data Loading • Introduction
Techniques • Data Preprocessing Overview
• Data Quality • Data Cleaning o Missing Values o
Noisy Data o Data Cleaning as a
Unit 5: Introduction to Online Process
Analytical Processing • Data Integration and Transformation o
Data Integration o Data
• Need for OLAP Transformation
• Characteristics of OLAP • Data Reduction o Data Cube
• OLAP and Multidimensional Analysis Aggregation o Attribute Subset
o Multidimensional Logical Data Selection o Dimensionality
Model and its Users o Reduction o Numerosity
Multidimensional Structure o Reduction
Multidimensional Operations • Discretization and Binarization •
• OLAP Functions • Data Warehouse Measures of Similarity and
and OLAP: Dissimilarity-Basics
Hypercube & Multi-cubes Unit 9: Mining Frequent Patterns and
• OLAP Applications Associations
• Steps in the OLAP Creation Process • Problem Definition
• Advantages of OLAP • Frequent Item Set Generation
• OLAP Architectures - MOLAP, • The APRIORI Principle
ROLAP, HOLAP,DOLAP • Support and Confidence Measures
• Association Rule Generation
Unit 6: Trends in Data Warehouse • APRIORI Algorithm: Finding
• Data Lakes Frequent Itemset Using Candidate
Complex Data Marts Generation
• Cloud Data Warehousing • Generating Association Rules from
• Real Time Data Warehousing Frequent Item set
• Data Warehousing and Hadoop • Improving the efficiency of Apriori
• Data Warehouse Automation • Correlation Analysis
• From Association Analysis to
BLOCK 3: DATA MINING Correlation Analysis
FUNDAMENTALS AND
FREQUENT PATTERN MINING BLOCK 4: CLASSIFICATION,
CLUSTERING AND WEB MINING
Unit 7: Data Mining – An Introduction
• Introduction Unit 10: Classification
• Data Mining – From What Kind of • Introduction
Data o Relational Databases o Data
• Classification: Problem Definition
Warehouses o Transactional Databases
• General Approaches to solving a
o Advanced Data and Informational classification problem
Systems
• Evaluation of Classifiers
• How does Data Mining Works?
• Classification techniques
• Classification of Data Mining Systems
• Decision Trees-Decision tree
• Applications of Data Mining Construction

48
• Methods for Expressing attribute test • Partitioning Method o K-Means
conditions Algorithm
• Measures for Selecting the Best Split o K-Medoids
• Algorithm for Decision tree Induction • Hierarchical Clustering o
• Bayesian Classification o Bayes’ Agglomerative Method o Divisive
Theorem o Naive-Bayesian Method
Classification o Bayesian Belief • Key Issues in Hierarchical Clustering
Networks • Strengths and Weakness
• Support Vector Machines o The • Outlier Analysis – Outlier Detection
Case when the data are linearly methods
separable
o The Case when the data are Unit 12: TEXT AND WEB MINING
linearly inseparable • Text and Web Mining: Introduction
• Text Data Analysis and Information
Unit 11: Clustering Retrieval
• Clustering: Problem Definition • Dimensionality Reduction for Text
• Clustering Overview • Text Mining Approaches
• Categorization of Major Clustering • Web mining
Methods o Partitioning Method • Web content mining
o Hierarchical Method • Web structure mining
• Mining Multimedia Data on the Web
oDensity-based Method o • Automatic Classification of Web
Grid-Based Method o Documents
Model-Based Method o • Web usage mining
Constraint-based Method
MCSL-222 OOAD and Web Technologies Lab 2 Credits

Main objective of this laboratory course is to provide hands on exercises to the learners based
on Object Oriented Analysis and Design & Web Technologies Courses.

Lab Sessions:

• There will be 20 practical sessions (3 hours each) of which 10 sessions will be on OOAD
and 10 sessions will be on Web Technologies.
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.

MCSL-223 Computer Networks and Data Mining Lab 2 Credits

Main objective of this laboratory course is to provide hands on exercises to the learners based
on Computer Networks and Data Mining Courses.

Lab Sessions:
• There will be 20 practical sessions (3 hours each) of which 10 sessions will be on
Computer Networks and 10 sessions will be on Data Mining.
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.

SEMESTER - III

49
MCS-224 Artificial Intelligence and Machine Learning (CREDITS-4)

The course relates to the conceptual understanding of the Artificial Intelligence and Machine
Learning. Generally, Artificial Intelligence (AI) is considered as the discipline, to deal with the
solution of the hard and insolvable problems using reasonable amount of time, by exploiting
the knowledge of the problem domain. In view of the significance of knowledge in AI, in this
course, a number of knowledge representation formalisms are introduced. The formalisms
discussed include Propositional Logic, First Order Predicate Logic, Rule-based systems,
Semantic Networks and Frames. Further, the course introduces the various concepts of Machine
learning, Viz. Supervised learning, Unsupervised Learning and their respective application
areas. Currently these two fields i.e. Artificial Intelligence and Machine Learning are in high
demand, the course will help the learners to build the understanding of these fields.
Course Structure* Propositional logic, syntax, semantics,
semantic rules, terminology - validity,
Block-1 Artificial Intelligence satisfiability. interpretation, entailment,
- Introduction: proof systems. Propositional Logic inference
rules, natural deduction, propositional
Unit-1 Introduction to resolution.
Artificial
Intelligence - Block-2 Artificial Intelligence -
What is AI? Examples of AI systems, Knowledge Representation:
Approaches to AI, Brief history of AI,
Comparison Between Artificial Unit-5 First Order Logic - First Order
intelligence, Machine Learning, and Deep Logic: Motivation, Syntax, Interpretations,
Learning, Intelligent Agent: semantics of quantifiers, Entailment in FOL,
stimulusresponse agents. components of Interpretation, Inference in FOL: First Order
intelligence. resolution. Conversion to clausal form.
Unification. Most general unifier. Resolution
Unit-2 Problem Solving using Search – with variables Proving validity.
Single agent search: Introduction to State
Space Search, Statement of Search Unit-6 Rule based Systems and other
problems: state space graphs, Searching formalism -
explicit state spaces. Feature based state
spaces. Problem types, examples (puzzle Rule Based Systems: Forward chaining.
problem, n-queen, the road map) Two agent Backward chaining. Conflict resolution.
search: Adversarial search: Two agent Semantic nets, Frames, Scripts.
games (alpha-beta pruning). MinMax Unit-7 Probabilistic Reasoning
Search. Reasoning with uncertain information
Review of Probability Theory,
Introduction to Bayesian Theory, Bayes’
Unit-3 Uninformed and Informed Search Networks, Probabilistic Inference, Basic
idea of inferencing with Bayes networks.
– Other paradigms of uncertain reasoning.
Uninformed Search: Formulating the state Dempster-Scheffer Theory
space, iterative deepening, bidirectional
search. Informed Search Strategies: Using
evaluation functions. A* & AO* , Unit-8 Fuzzy and Rough Set Fuzzy
admissibility of A* , Iterative deepening A*, Reasoning Introduction to Fuzzy sets,
recursive best first search. Fuzzy set representation, Fuzzy
inferences, Rough Set Theory
Unit-4 Predicate and Propositional Logic
– Block-3 Machine Learning - I:

50
 Unit-9 Introduction to Machine Learning
Methods – Introduction to Machine Block-4 Machine Learning - II:
Learning, Techniques of Machine Learning,
Reinforcement Learning and algorithms,
Deep Learning and its Algorithms, Ensemble Unit-13 Feature selection and Extraction:
Methods. Introduction to Feature Selection and
Extraction, Dimensionality Reduction,
Principal Component Analysis, Linear
Unit-10 Classification – Discriminant Analysis, Singular Value
Understanding of Supervised Learning, Decomposition.
Introduction to Classification,
Classification Algorithms: Naïve Bayes, K- Unit-14 Association Rules –
NN, Decision Trees, Logistic
Introduction to Pattern search and its
Regression, Support Vector Machines. algorithms: Apriori Algorithms. and its
variants, FP Tree Growth, Pincer Search.
Unit-11 Regression –
Introduction to Regression, Regression Unit-15 Clustering –
algorithm Linear Regression and Introduction to Clustering, Types of
Polynomial Regression, Support Vector Clustering, Partition Based, Hierarchical
Regression Based, Density Based Clustering
Techniques, Clustering algorithms: KMeans,
Unit-12 Neural Networks and Deep Agglomerative and Divisive, DBSCAN,
Learning: Introduction to Fuzzy
Overview of Artificial Neural Networks, Clustering.
Multilayer Feedforward Neural networks with
Sigmoid activation functions; Back propagation Unit – 16 Machine Learning
Algorithm; Representational abilities of feed Programming using Python
forward networks, Feed forward networks for
Classification and Implementations of various algorithms
Regression, Deep Learning learned in different units of this course
MCS-225 Accountancy and Financial Management (Credits:4)

Financial Management and Accountancy course is aimed at making students aware of the basic
accounting procedures and financial management processes. The central purpose of accounting
is to make possible the periodic matching of costs (efforts) and revenues (accomplishments).
The course describes four major topics: Accounting System, Understanding and Analysis of
Financial Statements, Financial Management and Decisions and Working Capital
Management. Accounting System deals with the framework of accounting. The focus is on
scope and function of accounting in modern business. Understanding and Analysis of Financial
Statements deals with preparation of final accounting statements, which includes preparation
and analysis of Profit and Loss A/c. In this topic we also discuss ratio analysis. Ratio analysis
is one of the most widely used analytic tool for financial analysis. Financial Management and
Decisions deals with various aspects of financial management. Working Capital Management
topic deals with the various sub components of working capital, which includes cash and
treasury management.
The main objective of cash management is to maintain an optimum level of cash balance.
The objectives of this course are:
• Understand how debit and credit are determined for business transactions.
• Understanding the basics of business entries.

51
• Understanding Trial Balance and the techniques to prepare it.
• Understanding the preparation process of final accounts.
• Understanding and analysing the information contents of final accounts.
• Understand what gives money its time value.
• Understand how the various factors influence working capital requirements.
• Understand the various methods of computing working capital.
• Preparation of cash budget.
• Understand the role and function of treasury management.
• Understand the need for establishing sound credit policy along with NPA management.
• Understand the process for managing inventory.
Course Structure* • International Financial Reporting
Standard(IFRS)
Block 1: Accounting System • Summary
• Keywords
Unit 1: Accounting and its Functions • Self-Assessment Questions/Exercises
• Further Readings
• Introduction
• Objectives Unit 3: Basic Accounting Process:
• The Scope of Accounting Preparation of Journal, Ledger,
• The Emerging Role of Accounting Trial Balance and Bank
• Accounting as an Information System Reconciliation Statement
• The Role and Activities of an
Accountant • Introduction
• Accounting Personnel • Objectives
• The Nature of the Accounting Function • Accounting Equation
• The Organisation for Accounting and • Classification of Accounts
Finance • Definitions of Journal and Ledger o
• Summary The Journalising Process o Ledger
• Keywords Posting o Balancing an Account
• Self-Assessment Questions/Exercises • Trial Balance
• Further Readings • Objectives of Preparing Trial
Balance o The Total Method
Unit 2: Accounting Concepts and of Preparing the Trial Balance
Standards o The Balance Method of
Preparing the Trial Balance
• Introduction o The Limitations of Trial
Balance
• Objectives
• The Accounting Cycle
• The Accounting Framework
• Bank Reconciliation Statement o
• Accounting Concepts
Causes of differences in bank
• Accounting Standards balance as per cash book and
• The Changing Nature of Generally passbook
Accepted Accounting Principles o Utility of bank reconciliation
• Attempts towards Standardisation statement
• Accounting Standards in India

52
 • Preparation of bank reconciliation • Preparation of Fund Flow Statement
statement • Cash Flow Statement
• Keywords • Sources and Uses of Cash •
• Summary Preparation of Cash Flow
• Solutions /Answers Statement and analysis
• Further Readings • Summary
• Keywords
Block 2: Understanding and • Self-Assessment Questions
Analysis of Financial • Further Readings
Statements

Unit 1: Preparation and Analysis of Unit 3: Ratio Analysis

Final Accounts
• Introduction • Introduction
• Objectives • Objectives
• Trading Account o • Categories of Ratios o Long-term
Opening/Closing Stock o Net Solvency Ratios o Liquidity Ratios
Purchases o Direct Expenses (Short-term
o Net Sales Solvency Ratios) o Activity or
• Profit and Loss Account Turnover Ratios o Profitability
• Difference between Trading Ratios o Market Test Ratios
and Profit & Loss Account • Utility of Ratio Analysis
• Balance Sheet • Diagnostic Role of Ratios
• Constructing a Balance Sheet • Application of Formulas
• Classification of Balance • Summary
Sheet’s Items • Self-Assessment
• Adjustment Entries o Closing Questions/Exercises
Stock • Solutions/Answers
o Depreciation o Bad
Debts o Provision for Unit 4: Reading and Interpretation
Bad and Doubtful Debts o of Financial Statements
Outstanding Expenses
(Assets) o Prepaid Expenses • Introduction
(Assets) o Accrued Income o • Objectives
Income Received in • Annual Report
Advance (Liability) • Financial statements and
• Forensic Accounting information gap
• Summary • Analysis of Profit and Loss A/c
• Keywords • Analysis of Cash Flow Statement
• Solutions/Answers • Analysis of Balance Sheet
• Further Readings • Techniques of financial statement
analysis
Unit 2: Cash Flow Statement • Summary
• Introduction • Self-Assessment
• Objectives Questions/Exercises
• Statements of Changes in • Solutions/Answers
Financial Positions (SCFP)
• Analysing Changes in Working Block 3: Financial Management and
Capital Decisions
• Fund Flow Statement
• Sources of Funds Unit 1: Introduction to Financial
• Uses (Applications) of Funds Management

53
 • Introduction o Cost of debt o Cost of
• Objectives preference capital o Cost of
• Evolution of Financial Management equity capital
• Significance of Financial • Weighted average cost of capital
Management • Summary
• Principles of Financial Management • Self-Assessment Questions
o Investment Decision o Financing
Decision o Dividend Decision o Unit 4: Investment Decision Methods
Liquidity Decision
• Objectives of Financial • Introduction
Management • Objectives
• Economic Profit vs. Accounting • The Investment Problem
Profit • Capital Investment and Firm’s
• Agency Relationship o Problems Value o Stages in Capital
Related with Agency
Budgeting Process o
Relationship o Importance of Capital
Costs of the Agency Investment Decisions o
Relationship Types of Investment
• The Changing Financial Landscape Decisions
• Organisation of Financial • Investment Evaluation Criteria o
Management
Non-Discounts Cash Flow
• Tasks and Responsibilities of
techniques o
Modern Financial Manager
Discounted Cash Flow
• Summary
techniques
• Self-Assessment
• Summary
Questions/Exercises
• Self-Assessment
• Solutions/Answers
Questions/Exercises
• Solutions/Answers
Unit 2: Time Value of Money
Unit 5: Working Capital Decisions
• Introduction
• Objectives
• Introduction
• Determining the Future Value o
• Objectives
Shorter Compounding
• Characteristics of Current Assets
Period o Effective vs.
• Operating Cycle Concepts
Nominal Rates o Continuous
• Factors Influencing Working
Compounding Capital Requirements
• Annuity • Sources of Working Capital
• Summary • Strategies of Working Capital
• Self-Assessment Management
Questions/Exercises • Estimating Working Capital
• Solutions/Answers Requirement
• Summary
Unit 3: Cost of Capital • Self-Assessment
Questions/Exercises
• Introduction • Solutions/Answers
• Objectives
• Significance of the cost of capital Block 4: Working Capital
• Opportunity cost of capital Management
• Determining component cost of
capital Unit 1: Cash and Treasury
Management

54
 • Introduction interpretation
• Objectives Exploratory – No guarantee if
• Facets of Cash Management o discoveries will hold in a new
Motives for Holding Cash o Cash sample Inferential, Causal
Planning o Determining Optimum Predictive
Cash Balance Common Mistakes – Correlation
• Methods of Cash Flow Budgeting is not causation, Simpson’s
• Investing Surplus Cash paradox, Data
• Cash Collection and Disbursements Dredging
• Treasury Management o Treasury Applications of Data Science
Risk Management o Functions of Data Science Life cycle
the Treasury Department
• Summary Unit 2: Portability and Statistics for
• Self-Assessment Data Science
Questions/Exercises Statistics: Correlation
• Solutions/Answers Probability: Dependence and
Independence, Conditional
Unit 2: Receivables Management Probability, Bayes Theorem,
Random Variables, Some basic
Distributions, the Normal
• Introduction
Distribution, The Central Limit
• Objectives
Theorem
• Terms of Payment
Hypothesis: Statistical
• Credit Policy Variables Hypothesis
• Credit Evaluation Testing, Confidence Intervals,
• Monitoring Receivables
• Factoring
• Non-Performing Assets
Unit 3: Data Preparation for
• Summary
Analysis Data Preprocessing
• Self-Assessment Questions
Selection and Data Extraction
• Solutions/Answers
Data cleaning
Data Curation
Unit 3: Inventory Management Data Integration
• Introduction Knowledge Discovery
• Objectives
• Reasons for Holding Inventory
Unit 4: Data Visualization and
• Objectives of Inventory Interpretation Different types of
Management plots
• Techniques of Inventory Control o Histograms
Traditional Techniques o Modern Boxplots
Techniques Scatter plots
• Summary Plots related to regression
• Self-Assessment Data Interpretation using
Questions/Exercises Examples
• Solutions/Answers

MCS-226 Data Science and Big Data Credit :4

This course introduces the students to the concepts of data science and big data, its
architecture and a programming technique R that can be used to analyse big data.
Block 1: Basics of Data Science Analysis:
Types of Data
Unit 1: Introduction to Data Science Definition Sampling
of Data Science Data Descriptive – Summaries without

55
 Block 2: Big Data and its Unsupervised Learning
Management Unit 5: Big
Architecture Big Data and Unit 10: Mining Data Streams
Characteristics and Applications (Big
Data and its importance, Four Vs) Big Model for Data Stream Processing
data Application Structured vs semi-
Data Stream Management Example
structured and unstructured data Big
Data vs data warehouse Queries of Data stream
Issues and challenges
Distributed file system
Data sampling in data streams
Map Reduce and HDFS
Apache Hadoop 1 and 2 Example of representation
sample
(YARN)
Hadoop Ecosystem – Name Filtering of data streams
Bloom filter
node, data node, Job tracker
Algorithm to count different elements
in stream
Unit 6: Programming using MapReduce
Map Reduce Operations
Loading data into HDFS Unit 11: Link Analysis
Executing the Map phase
Shuffling and sorting Purpose of Link analysis
Reduce phase execution. Page Ranking Different
Algorithms using map reduce – mechanisms of finding
Word counting, Matrix-Vector page Rank and their
Multiplication problem
Web structure and
associated issues
Unit 7: Other Big data Architecture and
Use of page rank in
Tools
search engines Page
Apache SPARK framework HIVE
Rank computation using
HBASE
Mapreduce
Other tools
Topic sensitive Page Rank
Link Spam
Unit 8: No SQL database
Hubs and Authorities
Column based
Graph based
Key-value pair based Unit 12: Web and Social Network
Document based Analysis

Block 3: Big Data Analysis Introduction to Web Analytics

Advertising on the Web
Issues in On-Line Advertising
Unit 9: Mining Big Data
Advertising Opportunities on
Web
Finding Similar Items Direct Placement of Ads and its
Jaccard Similarity of Sets issues
Similarity of Documents On-Line and Off-Line
Collaborative Filtering as a Algorithms
Similar-Sets Problem Documents Recommendation Systems
and Shingles Recommendation Systems Model
Distance Measures and its Applications, The Utility
Euclidean Distances Matrix
Jaccard Distance The Long Tail
Cosine Distance Edit Distance Content-Based
Hamming Distance Recommendations
Introduction to Other Techniques Mining Social-Network
Supervised Learning

56
 Social Networks as Graphs Database
Varieties of Social Networks Web Data
Distance measure of social network Data cleaning, Processing
Graphs Bar Charts
Use of Clustering for social media Box Plots Histograms Line
Charts Scatter plots etc.
Block 4: Programming for Data Analysis
Unit 15: Data Analysis and R
Unit 13: Basic of R Programming Chi-square test
Environment of R Linear Regression
Data types, Variables, Operators, Factors Multiple Regression
Decision Making, Loops, Functions Logistic Regression
Data Structures in R Time Series Analysis
Strings, Vector
Lists, Frames Unit 16: Advance Analysis using R
Matrices, Arrays Decision Trees
Random Forest
Unit 14: Data Interfacing and Classification
Visualisation in R Clustering
CSV, Excel files Association rules
Binary files
XML files JSON interface
MCS-227 Cloud Computing and IoT (4 Credits)

After completing this course, the student will be able to:

• Understand the differences between the traditional computing and cloud computing
• Compare and contrast various deployment models and service delivery models of a cloud
computing architecture.
• Understand the ways of virtualization
• Interpret the resource pooling, sharing and provisioning
• Understand the concept of scaling and load balancing in cloud
• Elaborate the need of security in cloud computing
• Define IoT and related terminology, technology and its applications
• Interpret the impact and challenges posed by IoT networks leading to new architectural
models.
• Compare and contrast the deployment of smart objects and the technologies to connect
them to network.
• Appraise the role of IoT protocols for efficient network communication.
• Elaborate the need Security in IoT.
• Illustrate different Case Studies from various sectors.
The topics includes in the course are:

57
Introduction to Cloud Computing, Traditional Computing Approaches, Comparison of Cluster,
grid and Cloud Computing, Evolution of Cloud Computing, Benefits and Challenges, Cloud
Deployment Models (Public, Private, Community and Hybrid), Service Delivery Models (IaaS,
PaaS, SaaS etc..), Cloud Architecture, Resource Virtualization, Resource Pooling, Sharing and
Provisioning, Scaling in the Cloud, Load Balancing, Security Issues in Cloud Computing.

IoT-An Introduction, Characteristics, IoT categories, Baseline Technologies of IoT, M2M and
IoT, Multihoming, IoT Identification and Data protocols (IPv4, IPv6, MQTT, CoAP, SMPP,
AMQP), Connectivity Technologies (IEEE, 802.15.4, Zigbee, 6LoWPAN, RFID, NFC,
Bluetooth, Z-wave), IoT Application Development, Framework for IoT Applications,
Implementation of Device Integration, Data Acquisition and Integration, Device Data Storage,
Fog Computing, Edge Computing, Comparison of Cloud, Fog and Edge, IoT Case Studies
(Smart Homes, Smart Grids, Smart Cities, Connected Vehicles, Industrial IoT.
Course Structure* • Network Connectivity in Cloud
Computing Unit 3: Resource
BLOCK 1:CLOUD COMPUTING
Virtualization
FUNDAMENTALS
ANDVIRTUALIZATION • Virtualization and Underlying
Abstraction o Virtualizing
Physical Computing Resources
Unit 1: Cloud Computing: An
Introduction
• Advantages of Virtualization
• Traditional Computing Approaches • Machine or Server Level
Virtualization
• Evolution of Cloud Computing o Hosted
• Comparison between Cluster, Grid and Approach o Bare
Cloud Computing
Metal Approach
• Utility Computing Exploring Hypervisor or V3irtual
• Characteristics of Cloud Computing Machine Monitor o
• Benefits of Cloud Computing Hypervisor Based
• Applications of Cloud Computing Virtualization
• Challenges of Cloud Computing Approaches
(Full Virtualization, Para
Unit 2: Cloud Deployment Models, Virtualization, Hardware Assisted
Service Models and Cloud Architecture Virtualization)
• Cloud Deployment Models o Public • Operating System Level
Virtualization
Cloud o Private Cloud o
• Other Virtualizations (Network,
Community Cloud o Hybrid Cloud
Storage, Desktop)
• Choosing Appropriate Deployment • Xen Server Vs VM ware
Model (comparison
• Service Delivery Models o w.r.t features like Guest O/S
Infrastructure As a Service (IaaS) o support, Open Source, Live VM
Platform As a Service (PaaS) o Snapshots for
Software As a Service (SaaS) o Other Backups, Thin Provisioning, Asset
Services (Security Management and Configuration
Management, Identity mapping, Dynamic Resource
Management, Storage, Database, Allocation and Failover, Bare
Back-up, Compliance etc.) Metal
• Cloud architecture Hypervisor, Graphics Support and
• Layers and Anatomy of the Cloud Pricing, Licensing, Host Sever
Management, Storage
Specifications

58
 etc.) AND CONNECTIVITY
TECHNOLOGIES
BLOCK 2: RESOURCE Unit 8: Internet of Things: An
PROVISIONING, LOAD BALANCING Introduction
AND SECURITY • Introduction to IoT
• Characteristics of IoT
Unit 4: Resource Pooling, Sharing and • IoT Categories
Provisioning • IoT Enablers and Connectivity Layers
• Resource Pooling • Baseline Technologies of IoT
• Resource Pooling Architecture o • Sensors
Computer Vs Server Pool o Storage Pool o Characteristics of a
o Network Pool Sensor o Classification
• Resource Sharing o Multi Tenancy of Sensors
o Types of Tenancy o Tenancy at • Actuators o Types of Actuators
Different Level of Cloud Services • Computing Components (Arduino,
• Resource Provisioning and Approaches o Raspberry Pi),
Static Approach o Dynamic • IoT Architecture
Approach o Hybrid Approach • Applications of IoT
• VM Sizing • Challenges of IoT

Unit 5: Scaling Unit 9: IoT Networking and

• Scaling primitives Connectivity Technologies
• Scaling Strategies o Proactive Scaling o • M2M and IoT Technology
Reactive Scaling o Combinational Scaling • Components of Networking
• Auto Scaling in Cloud • Gateway Prefix Allotment
• Types of Scaling o Vertical • Impact of Mobility on Addressing
Scaling or Scaling Up • Multihoming
o Horizontal Scaling or Scaling Out • IoT Identification and Data Protocols
o (IPV4, IPv6, MQTT, CoAP,
XMPP, AMQP)
Unit 6: Load Balancing
• Importance of Load Balancing • Connectivity Technologies o
(IEEE 802.15.4, ZigBee,
• Goals of Load Balancing 6LoWPAN, RFID, NFC,
• What are to Load Balance and how it is Bluetooth, Z-wave etc.)
done
BLOCK 4: Application Development,
• Levels of Load Balancing o VM Fog Computing and Case Studies
Provisioning o Resource Provisioning
• Categories of Load Balancing o Static Unit 10: IoT Application Development
Approach o Dynamic Approach
• Framework for IoT Applications
• Dynamic Load Balancing
• Implementation of Device Integration
Unit 7: Security Issues in Cloud • Data Acquisition and Integration
Computing • Device Data Storage
• Threats to Cloud Security • Unstructured Data Storage on
• Infrastructure Security Cloud/Local Server
• Information Security • Authentication, Authorization of
Devices
• Identity Management and Access Control
• Security Aspects in IoT
• Cloud Security Design Principles •
Security as a Service
BLOCK 3: IoT FUNDAMENTALS Unit 11: Fog Computing and Edge
Computing

59
• Introduction to Fog Computing
• Cloud Computing Vs Fog Computing
• Fog Architecture
• Working of Fog
• Advantages of Fog
• Applications of Fog
• Challenges in Fog
• Edge Computing
• Working of Edge Computing
• Cloud Vs Fog Vs Edge Computing
(w.r.t location of data processing,
processing power and storage
capabilities, purpose)
• Applications of Edge Computing

Unit 12: IoT Case Studies

• Smart Homes
• Smart Grids
• Smart Cities
• Connected Vehicles
• Industrial IoT

60
MCSL-228 AI and Machine Learning Lab (Credits 2)

Main objective of this laboratory course is to provide hands on exercises to the learners based
on Artificial Intelligence and Machine Learning Course.
Lab Sessions:
• There will be 20 practical sessions (3 hours each) of which 10 sessions will be on AI and
10 sessions will be on machine learning.
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.
MCSL-229 Cloud and Data Science Lab (Credits 2)
Main objective of this laboratory course is to provide hands on exercises to the learners based
on Cloud Computing and Data Science Courses.

Lab Sessions:

• There will be 20 practical sessions (3 hours each) of which 10 sessions will be on cloud
computing and 10 sessions will be on Data Science.
• The practice problems for all 20 sessions will be listed session-wise in the lab manual.

SEMESTER – IV

MCS-230 Digital Image Processing and Computer Vision (CREDITS - 4)

The course relates to the formation of fundamental understanding of the various concepts of
Digital Image processing and Computer Vision. The content coverage will help the learners to
get the insight of the subject both theoretically and practically.
Course Structure* extraction.
Block-1 Digital images Processing -I
Unit-4 Image Filtering Operations in
Unit-1 Introduction to digital image – Digital spatial domain - Spatial averaging, Spatial
image, Image acquisition, Digitization low pass filtering, Spatial high pass filtering,
of images (Sampling and Quantization), Types of Median filtering, Min, Max filtering,
images, Image Characteristics (Brightness, Histogram modeling: Histogram
luminance, contrast, intensity), Image equalization, Histogram specification.
resolution
Block-2 Digital images Processing –II

Unit-2 Image Transformation - Definition of Unit-5 Transformation Techniques -

1-D and 2-D signals, Orthogonal and Unitary Transformations in the Frequency domain
transforms of 2-D (DFT, DCT, DWT, Haar), Discrete Fourier
signals, Transform, Discrete Cosine Transform,
Properties of Unitary Transforms Discrete Wavelet Transform, Haar
Transform
Unit-3 Image enhancement in spatial
domain - Point operations, Contrast Unit-6 Image enhancement and Filtering
stretching, Clipping and thresholding,
Digital Negative, Intensity levels slicing, Bit

- Basics of filtering in frequency domain, Unit-11Multiple Cameras: Stereo Vision,

Image smoothing, Image sharpening, Image Point correspondence, Epipolar geometry,
degradation model, Noise models (additive, Motion, Optical flow.
Gaussian, Rayleigh, uniform, gamma,
impulse), Inverse filtering, Wiener filtering. Block-4 Computer Vision-II

Unit-7 Color image processing - Human Unit-12 Object detection- Line detection,
Vision system, Color models (RGB, HIS, Region detection, Boundary detection,
CMY) feature extraction techniques, image
segmentation techniques
Block-3 Computer Vision-I
Unit-9 Introduction to computer Vision,
Unit-13 Object Recognition using
camera models, Transformations:
Supervised Learning Approaches -
Orthogonal, Euclidean, Affine and
Supervised learning, Discriminant function
Projective
(linear and nonlinear), Bayesian
classification, Minimum distance classifiers.
Unit-10: Single Camera: Camera Models,
Perspective projection, Homography,
Camera Calibration, Affine motion models Unit-14 Object Classification using
Unsupervised Learning Approaches
- Unsupervised learning, Hierarchical
Clustering, Partition based clustering, K-NN
clustering.

62
MCS-231 Mobile Computing (4 Credits)

The following are the objectives of this course:

• Introduce Mobile Communications

• Introduce Mobile Computing Architecture
• Overview of Pervasive Computing
• Introduce GSM and GPRS
• Introduce 4G and 5G Networks
• Discuss Database Management Issues in Mobile Computing
• Introduce Mobile Adhoc Networks
• Introduce WLAN and PAN protocols
• Introduce Virtual and Cloud Networks
• Introduce Mobile Internet Applications
• Introduce Mobile Application Languages
• Introduce Mobile Operating Systems
• Introduce Mobile Software Development Environments
Course Structure* Mobile Computing Operating
Block-1: Introduction to Mobile System
Computing Client Server Computing using
Mobile
Unit-1: Introduction to Mobile Mobile Computing Architecture
Communications Design considerations for Mobile
Computing
Introduction Mobile Computing and the Apps
Objectives Summary
Mobile Communication Further Readings
Multiplexing (TDMA, CDMA,
FDMA) Unit-3: Mobile Client Devices and
GSM Pervasive Computing
GPRS and2.5G
3G Introduction
4G –LTE Objectives
Summary Smart Sensors, Actuators and
Further Readings Mobile Robotic Systems
Smart Home and Appliances
Unit-2: Introduction to Mobile Automotive Systems
Computing Architecture Limitations and Devices Design
Considerations
Introduction Summary
Objectives Further Readings
Mobile IP, Cellular and WLAN
IEEE 802.11X Networks
AdHoc Networks Unit-4: GSM and GPRS
 Unit-7:Mobile Transport Layer
Introduction
Objectives Introduction
GSM Architecture Objectives
Public Land Mobile Network
UDP and TCP
(PLMN) Interface
Call Handling Indirect TCP
Handover Snooping TCP
61
SMS Mobile TCP
GPRS Summary
High Speed Circuit Switched Further Readings
Data
WLL Application
Summary Unit-8: Database Management Issues
Further Readings in Mobile Computing

Introduction
Mobile Device Database
Block-2: Mobile IP and Issues in
Management
Mobile Computing
Mobile Device Data Store
Methods
Unit-5: 4G and 5G Networks Client Server Computing with
Adaptation for Mobile Computing
Introduction Adaptation Software for Mobile
Objectives Computing
High Speed Packet Access Summary
MIMO in HSPA Further Readings
LTE and WIMAX16E
Ultra-Wide Band and Broadband
Wireless Access Block-3: Introduction to various
4G Networks: HS-OFDM, LTE Network Technologies
Advanced and WiMax 16M
Features of 5G Networks Unit-9: Mobile Adhoc Networks
Summary
Further Readings Introduction
Unit-6: Mobile IP Network Layer Objectives
Introduction to MANETs
Introduction
Routing and Classifications of
Objectives Routing Algorithms
Mobile IP QoS in MANETs
IP Header: Encapsulation and Security in MANETs
Routes Optimization Summary
Mobility Binding Further Readings
Cellular IP
Unit-10: WLAN and PAN protocols
Mobile IP with IPv6
Introduction
Voice over IP Objectives
IP Security Introduction to WLANs
Summary Introduction to WAP
Further Readings Introduction to WML
Bluetooth

64
 WiMax Handheld Device Markup
ZigBee and WiFi Language and WML
Summary HTML 5
Further Readings Summary
Further Readings
Unit-11: Virtual and Cloud
Networks
Introduction Unit-15: Mobile Application
Objectives Languages
Wireless Enterprise Networks
Virtual Networks Introduction
Mobile Cloud Networks Objectives
Summary Introduction to J2EE
Further Readings

Unit-12: Mobility, Portability,

Replication and Clustering

Introduction
Objectives
Mobile Data Management
Data Replication Schemes
Adaptive Clustering
Summary
Further Readings

Block-4: Introduction to Mobile

Software Environments

Unit-13: Smart Client and

Enterprise Server based
Architecture

Introduction
Objectives
Introduction to Smart Client
Architecture
Data Synchronization Formats
Data Synchronization at Clients
and Servers
Mobile Devices Support
Infrastructure and Management
Summary
Further Readings

Unit-14: Mobile Internet

Applications
Introduction
Objectives
Introduction to Mobile
Applications Development
Introduction to XML
 Introduction to J2ME Introduction to Mobile Operating
Introduction to Python Systems
Summary Application Programming
Further Readings Linux for Mobile Devices
Development Process
Development Tools and Emulators
Unit-16: Mobile Operating Systems and Apple IOS
Development Environments Android
Summary
Introduction Further Readings
Objectives

* The course structure may be subject to changes.

MCSP-232 PROJECT (CREDITS-12)

The objective of the MCA project work is to develop quality software solution by following the
software engineering principles and practices. It is only possible when a learner goes about with
the task independently. During the development of the project the students should involve in all
the stages of the software development life cycle like requirements engineering, systems
analysis, systems design, software development, testing strategies and documentation with an
overall emphasis on the development of reliable software systems. The primary emphasis of the
project work is to understand and gain the knowledge of the principles of software engineering
practices, so as to participate and manage a large software engineering projects in future.

Students are encouraged to spend efforts equavilant to 12 credits working on a project preferably
in a software industry or any research organization. Topics selected should be complex and large
enough to justify as a MCA project. The courses studied by the students during the MCA
programme provide them the comprehensive background to work on diverse application
domains. Students should strictly follow and adhere to the project guidelines. Project Guidelines
will be prepared and uploaded on to the IGNOU website/printed.

5. EVALUATION SCHEME

Completion of the programme requires successful completion of both assignment

component and the Term-end Examination component for each course in the programme.
The total numbers of courses in this MCA programme are 22 (including a Project course)
and the total number of credits is 80. In addition, two bridge courses, MCS-201 and
MCS208 are required to be successfully completed by those students who are required to
register for these courses based on eligibility conditions for admission to Master of Computer
Applications programme.
Evaluation for each course of MCA programme (except project course) and bridge courses covers
two aspects:

a) Continuous evaluation through Assignment with a weightage of 30% (please refer

to the table below). Viva- voce is compulsory for all the Assignments for which 20
marks are allocated.
b) Term-end examination with a weightage of 70% (please refer to the table below).

66
 Note: A learner should not apply for appearing at the term-end examination
of any course without getting registered for the same and that if s/he does so,
her/his result would not be declared and the onus shall be on her/him.

Award of Final Division:

The final score of a student is computed as follows:
• The marks obtained in a 4-credit course are computed out of maximum of 100
• The marks obtained in a 2-credit course are computed out of maximum of 50 • The marks
obtained in the Project course are computed out of maximum of 200 • Bridge course marks are
NOT used for computation of percentage.
• The marks of all the semesters are added. These marks are out of maximum of 1900 marks.
The final division of a student is awarded as follows:
Marks Range Division
75% and above First Division with
Distinction
60% or more but less than First Division
75%
50% or more but less than Second Division
60%
40% or more but less than Third Division
50%
5.1 Assignments and Term – End Examination
The main purpose of assignments is to test student’s comprehension of learning the materials
they receive from the University and also to help them get through the courses by providing
feedback to them. The information given in the course materials should be sufficient for
answering the assignments. However, as Computer Science is an ever-enhancing area, the
students should make an attempt and work with extra reading material, which is easily available
at the Learner Support Centre / Regional Centre libraries or through websites, for working on
the assignments. This will enhance your learning capabilities. Mostly the assignments are
designed in such a way as to help you concentrate mainly on the course material, exploit their
personal experiences and apply the knowledge gained from various sources.

Assignments
There will be at least one assignment for each course worth 100 marks (weightage of 30%).
The set of all the assignments for each semester is uploaded on the IGNOU’s website. The table
shown below provides the detailed marking scheme for the MCA courses.
Seme- Course Course Title Continuous Term End Examination
ster Code Evaluation
Cr
Theory OR Practical* ( for Lab courses only)
edi
ts Assignment (Weightage – 70%)
(Weightage –
30%)
Max Min. Duration Max. Marks Min.
Marks Marks Mark s

I MCS-211 Design and Analysis of 4 100 40 3 100 40

Algorithms

67
 MCS-212 Discrete Mathematics 4 100 40 3 100 40

MCS-213 Softwrae Engineering 4 100 40 3 100 40

MCS-214 Professional Skills 2 100 40 2 50 20

and Ethics
MCS-215 Sycurity and Cyber Laws 2 100 40 2 50 20

MCSL-216 DAA and Web 2 100 40 2 50 20

Design Lab
MCSL-217 Software Engineering 2 100 40 2 50 20
Lab

Bridge Courses (Only for the students who are required to register for these courses based on eligibility conditions for admission
to Master of Computer Applications programme)

MCS-201 Programming in C and 4 100 40 3 100 40

Python
MCS-208 Data Structures and 4 100 40 3 100 40
Algorithms

II MCS-218 Data Communication and 4 100 40 3 100 40

Computer Networks
MCS-219 Object Oriented Analysis 4 100 40 3 100 40
and Design
MCS-220 Web Technologies 4 100 40 3 100 40

MCS-221 Data Warehousing and 4 100 40 3 100 40

Data Mining
MCSL-222 OOAD and Web 2 100 40 2 50 20
Technologies Lab
MCSL-223 Computer Networks 2 100 40 3 50 20
and Data Mining Lab
III MCS-224 Design and Analysis of 4 100 40 3 100 40
Algorithms
MCS-225 Accountancy and 4 100 40 3 100 40
Financial Management
MCS-226 Data Science and Big Data 4 100 40 3 100 40

MCS-227 Cloud Computing and IoT 4 100 40 3 100 40

MCSL-228 AI and Machine Learning 2 100 40 2 50 20
Lab
MCSL-229 Cloud and Data Science 2 100 40 2 50 20
Lab
IV MCS-230 Digital Image Processing 4 100 40 3 100 40
and Computer Vision
MCS-231 Mobile Computing 4 100 40 3 100 40

MCSP-232 Project** 12 Report – 150 (Min. 60) and Viva 50 (Min. 20)

* Practical examination will be conducted for the lab courses only. The letter ‘L’ in the course code represents the lab course. Pass in
each and every part in the practical course of Term-End Practical Examination is compulsory in order to get it declared successful
in the respective course.
** The Project consist of 2 components namely project report evaluation and viva. Viva-voce is compulsory and forms part of evaluation.
A student in order to be declared successful in the project must secure 40% marks in each component (i) Project Evaluation and
(ii)Viva-voce.

All the assignments and term-end exams will be scored on a numerical marking scheme. Any
component that has not been attempted would be treated as having a score of zero marks. The
requirement for passing would be at least 40% in continuous evaluation (assignment) and
40% in the term-end examinations, with an overall average of 40% for a pass in the course.

68
The viva voce is compulsory for the assignment evaluation. For any course, in case, if a
student submitted the assignment but did not attend the viva-voce, then the assignment is treated
as not successfully completed and would be marked as ZERO.

In order to be able to appear for the Term-end examination, it is a requirement that the
student submit all the assignments according to the prescribed schedule. All students will
be required to give an undertaking to this effect, and should it be later found that they had
in fact not submitted the assignments as prescribed; the results for the Term-end
examination will be treated as cancelled.

Viva-voce is compulsory for all the Assignments for which 20 marks are allocated.

Unfair means in attempting the assignments

If the learners copy the assignments, which is an important component of the ODL system, such
assignments will be awarded “zero” and such students will be directed to re-attempt the fresh
assignments pertaining to the next year which will indirectly delay the award of degree by a
semester/ year.

Additional guidelines for Lab Course assignments and TEE

A student MUST maintain lab records of all the practical sessions attended by him/her. This lab
record has weightage in continuous evaluation of lab courses. The following are the evaluation
guidelines for the lab courses.

(i) Evaluation of the assignments of lab courses

Evaluation of the assignments of lab courses consist of three parts:

• Continuous assessment of practical sessions (lab records) (total 40 marks),
• Assignment questions (total 40 marks)
• A combined comprehensive viva-voce (total 20 marks)

The marks allotment details for various lab courses are shown in the following table:

Continuous Assignment Combined Total marks

Course code assessment of problems (40) Viva (20) (100)
practical
sessions lab
records (40)
MCSL-216 Part–1(20) Part–1(20) 20 100
Part–2(20) Part–2(20)
MCSL-217 Part–1(40) Part–1(40) 20 100
MCSL-222 Part–1(20) Part–1(20) 20 100
Part–2(20) Part–2(20)
MCSL-223 Part–1(20) Part–1(20) 20 100
Part–2(20) Part–2(20)

69
 MCSL-228 Part–1(40) Part–1(40) 20 100
MCSL-229 Part–1(20) Part–1(20) 20 100
Part–2(20) Part–2(20)

It is to be noted that minimum passing marks in assignments are overall (lab records +
problems + viva) 40% in each assignment.
(ii) Evaluation of term-end practical exam for Lab Courses
The term-end examination of the practical courses consists of several sections. Each
section will be evaluated separately. The viva-voce for each section will also be separate.
The following table shows the details:
(Practical questions –80 % and Viva-voce – 20 %)

Course Duration of Term-end practical examination and viva-voce

Code term-end Marks Section-1 Marks Section-2
practical
exam.
(Each
section gets
Equal time)
MCSL-216 2 hours 20 (P) +5(V) 20(P) + 5(V)
(2 credits) = 25 marks = 25 marks
MCSL-217 2 hours 40(P) + 10 (V) #
(2 credits) = 50 marks
MCSL-222 2 hours 20(P) + 5(V) 20(P) + 5(V)
(2 credits) = 25 marks = 25 marks

MCSL-223 2 hours 20(P) + 5(V) 20(P) + 5(V) = 25

(2 credits) = 25 marks marks
MCSL-228 2 hours 40(P) + 10 (V) #
(2 credits) = 50 marks
MCSL-229 2 hours 20(P) + 5(V) 20(P) + 5(V) = 25
(2 credits) = 25 marks marks
P- problems given in the exam paper, V –viva-voce for that section.

A student needs to obtain a minimum of 40% in each section of the term-end practical
examination for successful completion of that particular section. In case a student does not
secure the minimum passing marks in a section, s/he needs to appear for the term-end
practical examination again for that section only.

5.2 Instructions for Assignments

While answering Assignments, the following guidelines are required to be followed:
The word limits for answering most of the questions are mentioned with them. If no word limit
is prescribed, then assume it to be about 300 words. You will find it useful to keep the following
points in mind:
i) Planning: Read the assignment carefully. Go through the units on which they are based.
Make some points regarding each question and rearrange these in logical order.
ii) Organisation: Be a little more selective and analytical before drawing up a rough outline
of your answer. In an essay-type question give adequate attention to your introduction and
conclusion. The introduction must offer brief interpretation of the question and how you

70
 propose to develop it. The conclusion must summarize your response to the question. Make
sure that your answer:
a) is logical and coherent;
b) has clear connection between sentences and paragraphs;
c) is written correctly giving adequate consideration to your expression, style and
presentation;
d) does not exceed the number of words indicated (if any) in your questions. iii)
Presentation: Once you are satisfied with your answers, you can write down the final
version for submission, writing each answer neatly and underlining the points you want
to emphasize.
2. The following format is to be followed for submission of the assignment:

The top of the first page of your response sheet for each assignment should look like this:

PROGRAMME TITLE:............................. ENROLMENT No. :................................

COURSE CODE:....................................... NAME :...................................................
COURSE TITLE:....................................... ADDRESS:................................................
ASSIGNMENT CODE :............................. SIGNATURE :........................................
LEARNER SUPPORT CENTRE:.................... DATE : ...................................................

3. Read instructions for submission of assignments given here. The assignments response
sheets should be handwritten. However, the software coding, snapshots, test cases, etc. can
be in the printed form. Students should not reproduce their answers from the units sent to
them by the University. If they reproduce from the units, they will get poor marks for the
respective question.

4. The students should write each assignment separately. All the assignments should not be
written in continuity.

5. The students should write the question number with each answer. Photocopy of the
submitted assignment is to be retained by the student for his or her own record and
future reference, if any.

6. The students should use only A4 size paper for their response and tag all the pages carefully.
Avoid using very thin paper. They should allow a 4-cm. margin on the left and at least 4
lines in between each answer. This may facilitate the evaluator to write useful comments
on the margins at appropriate places.

7. The students should not copy the assignments from others. If copying is noticed, the
assignments of such students will be rejected, and disciplinary action will be taken
against the students as per rules of the University.

8. The completed assignment response should be sent to the Coordinator of the Learner
Support Centre. Under no circumstances should they be sent to the SED Division or
the School at Headquarters, for evaluation. After submitting the assignment at the Learner
Support Centre in person, the students should get the acknowledgement from the

71
 Coordinator on the prescribed assignment-cum-acknowledgement card (Form No. 1);
otherwise, the assignment response should be sent under certificate of posting through post.
The students should get back evaluated assignments from their Learner Support Centres
within one month of its submission for the feedback and for their future guidance.

9. In case the student has requested for a change of LSC, s/he should submit her/his
assignments only to the original LSC until the University effects the change of LSC.
5.3 Guidelines Regarding the Submission of Assignments
1. It is compulsory for the students to submit all the prescribed assignments. They will not be
allowed to appear for the term-end examination of a course if they do not submit the
specified number of assignments in time for that course.

2. Students should download the latest assignment from the IGNOU website.

3. The assignment responses should be complete in all respects. Before submission, the
students should ensure that they have answered all the questions in all assignments.
Incomplete answer sheets bring poor grades.

4. The Coordinator of the LSC has the right to reject the assignments received after the due
date. Therefore, the students are advised to submit their assignments before the due date.

5. Students should enclose a self-addressed stamped assignment remittance-cum-

acknowledgement card (Form No. 2) with each assignment response to ensure the delivery
of assignments before the last dates prescribed for submission of assignments.

6. In case any student fails to submit the assignments or fails to score minimum qualifying
marks, s/he has to wait for fresh assignments meant for the current batch of students.

7. For their own record, students should retain a photocopy of all the assignment responses,
which they submit to the Coordinator of their LSC. If they do not get back their duly
evaluated assignment within a month after submission, they should try to get it from their
LSC personally. This may help them to improve upon future assignments.

8. As per the University norms, once the student’s scores pass marks in an assignment, they
cannot re-submit it for improvement of marks.

9. Assignments are not subject to re-evaluation except for factual errors, if any. The
discrepancy noticed by the students in the evaluated assignments should be brought to the
notice of the Coordinator of the LSC, so that he forwards the correct score to the SED at
the Headquarters.

10 The students should not enclose or express doubts for clarification, if any, along with the
assignments. They should send their doubts in a separate cover to the Registrar, SED, Indira
Gandhi National Open University, Maidan Garhi, New Delhi - 110 068. While doing so
they should give their complete Enrolment number, name, address, programme code.

Note: Please submit your Assignments on or before the due

date at your LSC.

72
11. In case of not successfully completed or missed; the assignments should be demanded only if
your registration for that course is valid.

12. Assignments should not be demanded to improve your score if you have secured minimum
qualifying score in a course.

13. Please do not submit your assignment responses twice either at the same LSC or at different
LSC for evaluation.

14. There is no provision for reevaluation of Assignments, practical examination and project
evaluation.

5.4 General Guidelines Regarding the Term-End Examination

1. To be eligible to appear the Term-end Examination in any course, the students are required
to fulfil the following conditions:

a) registration for the courses, in which they wish to appear is valid,

b) they should have opted and pursued the prescribed courses
c) minimum time to pursue these courses is elapsed
d) they have also submitted the required number of assignment(s), if any.
e) they have submitted the online examination form of IGNOU and have paid the requisite
examination fees.

2. The University conducts term-end examination twice a year, in June and December. The
student can take the examination only after the minimum period prescribed for the course
of study has elapsed.

3. Examination schedule indicating the date and time of examination which is available at
IGNOU website [Link] for each session i.e. June/December.

4. The online examination form is to be filled up from IGNOU website about 2-3 months prior
to examination. (You MUST visit IGNOU website for actual cutoff dates. The details of
late fee are also displayed on the website.). You are required to pay examination fee per
course at the time of filling up of the form. For December 2021 term-end examination this
fee was @200/- per course for theory courses and @200/- per course for practical courses.
You can pay online using Credit Card / Debit Card /Net Banking while filling up the form.
It may also be noted that in case, examination fee needs to be returned to student due to
technical reasons, the fee will be refunded to the same account (Credit card/ Debit card/ Net
Banking) from which the payment was made.

The link to online Examination form, in general, is put on the HOME page of IGNOU website.

YOU MUST READ and FOLLOW all the instructions very carefully. You can save these
instructions for any future reference. These instructions relates to:

• Dates for the Submission of Online Term End Examination form

• Prerequisite for the submission of the Term End Examination Form
• Process to submit Term End Examination Form
• Examination fee and Mode of Payment

73
• Un-successful Submission of Exam Form
• Related to Refund excess Examination Fee
• Hall Ticket for Term End Examination
• Contact Details

Important Guidelines and instructions for submission of Term End Examination form and other
forms (Please note that guidelines and fee for forms may change, therefore, you are advised to
read guidelines and fee details as per latest forms available online or on the IGNOU website)

1. Please ensure that you have already submitted the assignments as applicable for the courses
you are filling in the Examination Form. You are required to pay examination fee for every
course of theory as well as practical.

2. Students are requested to check the result status before filling examination form.

3. Select and enter Programme code and Examination Centre Code from the options available.
If the centre opted by the student is not activated as examination centre or not allotted for
any other reason, alternative examination centre will be allotted.

4. Select courses carefully. Courses for theory as well as practical need to be selected
separately from the list appearing on the screen.

5. Students will be allowed to appear in Term-end Examination for the course(s) for which
registration is valid and not time-barred and assignment(s) is/are submitted. Examination
Fee once submitted will not be refunded.

6. Students should carry their Identity Card and Hall ticket (download hall ticket from
IGNOU website indicating Centre and Date of Examination) to the Examination Centre.

7. In case a student fails to receive the intimation slip/Hall ticket may please contact at SED
(SE-II) [Link] branch.

8. Students must carry IGNOU Identity-Card in the Examination Hall for writing
Examination. In case, students do not have IGNOU Identity card due to various reasons,
they must get it issued (i.e. duplicate copy of IGNOU Identity card) from Regional Centre
concerned well before the start of the Examination. Students are required to contact the RC
in person (by post) and get the duplicate Identity card for attending Examination.
9. The students will be entitled to appear for the examination only at the examination centre
allotted to them and NOT at any other centre without specific permission from the
University. The Examination Centre once opted for in a form shall not be changed.
10. Although all efforts will be made to declare the results in time, there will be no binding on
the University to declare the results of the last examination before the commencement of
next examination. The students may, therefore, fill up the examination form without
necessarily waiting for the result and get it cancelled at a later date, if so desired. In case
the student gets result after filling up the exam form, s/he should not re-appear in the course
qualified by her/ him with a view to improve the qualified score.
11. Students who fail to complete the minimum required number of course(s) prescribed for
the Programme within the allotted period of study shall cease to be on the rolls of this
University for that programme till they re-enroll themselves, if they wish to do so. Such
students are advised to get in touch with the Regional Director concerned.

74
12. Obtaining Photocopy of Answer Scripts: After the declaration of result, if the students
are not satisfied with the marks awarded, they can request the University for Photocopy of
Answer Scripts on payment of 100/- per course. The request for obtaining Photocopy of
Answer Scripts by the student must be made within 30 days from the date of declaration of
result to the Evaluation Centre concerned in the prescribed format along with the fee of
100/- per course in the form of Demand Draft in favour of IGNOU payable at the city
where submitting the request for Photocopy. Format is available on the IGNOU website:
[Link]
13. Early Declaration of Results: In order to facilitate the students who have got offer of
admission and or selected for employment etc. and are required to produce
markssheet/grade card by a specified given date may apply for early process of their
answerscripts and declaration of the results for this purpose. The students are required to
apply in the specified format available on the University website with a fee of 1000/- per
course through Bank Draft drawn in favour of IGNOU along with the attested photocopy
of the offer of admission/employment offer. The students can submit their requests for early
st
declaration before the commencement of the Term-end Examination i.e., before 1 June
st
and 1 December respectively. The University in such cases will make arrangements for
processing the answer-scripts and declare the results as a special case.
14. Re-evaluation of Answer-script(s): The University has replaced the scheme of rechecking
with the re-evaluation whereby the answer-scripts will be re-evaluated by another Evaluator
in case the students are not satisfied with the marks/grades secured by them in Term-end
Examination. Such students can apply for re-evaluation within one month from the date
declaration i.e. the date on which the results are made available on the University Website
on payment of 750/- per course in the prescribed application form available on the
University Website. The better of the two courses or original marks/grades and re-evaluated
marks/grades will be considered and the revised marks/grades shall be incorporated in the
students’ record as applicable and the revised grade card/marks sheet will be sent to the
students within one month from the receipt of application. Re-evaluation is not permissible
for Projects, Practical, Assignments and Seminars etc.
15. Improvement of Division/Class: Keeping the interest of students who have completed
their Bachelor’s Degree and Master’s Degree Programmes, but falling short of 2% marks
st nd
for securing 1 Division/ 2 Division the university has made a provision for allowing
such students to improve their performance. The improvement is permissible only in theory
papers and the students may apply for improvement of their performance on the prescribed
application format along with a fee of 750/- per course through a Bank Draft drawn in
favour of IGNOU payable at Delhi and submit the application and fee to the Registrar, SRE
Division, IGNOU, Maidan Garhi, New Delhi. The improvement is not permitted to those
students who have completed their maximum duration of the programme. The students will
be given only one opportunity to improve the marks/grades and they can apply for
improvement a maximum of 25% of the credits for successful completion of the respective
programme. However, the sealing for the number of courses in which the student can
improve is five courses. The better of the two examinations i.e., marks already awarded and
the marks secured in the improvement examination will be considered.

75
6. OTHER USEFUL INFORMATION

6.1 Reservation of Seats

The University provides reservation of seats for Scheduled Castes, Scheduled Tribes and Physically
Handicapped students as per the Government of India rules.

6.2 Scholarships and Reimbursement of Fee

Reserved Categories, viz., Scheduled Castes, Scheduled Tribes and Physically Handicapped
students etc. have to pay the fee at the time of admission to the University along with other
students. Physically Handicapped students admitted to IGNOU are eligible for Government of
India scholarships. They are advised to collect scholarship forms from the respective State
Government Directorate of Social Welfare or Office of the Social Welfare Officer and submit
the filled-in forms to them through the Regional Director of IGNOU concerned.

Similarly, SC/ST students have to submit their scholarship forms to the respective State
Directorate of Social Welfare or Office of the Social Welfare Officer, through the Regional
Director of IGNOU concerned for suitable reimbursement.
The Application for reimbursement of Programme Fee to SC/ST students can be downloaded from
the link:
[Link]
[Link]

6.3 Change/Correction of Address

There is a proforma (Form No. 1) for change/correction of address available in this programme
guide. This form duly filled in is to be submitted to the Regional Director concerned. Students
are advised not to write letters to any other officer in the University in this regard. Normally, it
takes 4-6 weeks to effect the change. Therefore, the students are advised to make their own
arrangements to redirect the mail to the changed address during this period.

6.4 Change of Regional Centre and Learner Support Centre

Counselling facilities are not available for all the programmes at all the Learner Support Centres.
As such, students are advised to make sure that counselling facilities are available, for the
subject s/he has chosen, at the new centre opted for. Request for change of Learner Support
Centre is acceded subject to availability of seats for the programme at the new centre asked for
only on compelling grounds. Students are required to get a NOC from the Regional center where
they are willing to get themselves transferred in view of the practical sessions involved in MCA.
When a student wants transfer from one region to another, s/he has to write to that effect to the
Regional Centre from where s/he is seeking a transfer, marking copy to the Regional Centre
where s/he would like to be transferred to and also to Registrar, Student Registration Division
(SRD), IGNOU, Maidan Garhi, New Delhi-110068. Further, s/he has to obtain a certificate from
the Coordinator of the Learner Support Centre from where s/he is seeking transfer from,
regarding the number of assignments submitted. The Regional Director from where the student
is seeking the transfer will transfer all records including details of fee payment to the Regional
Centre where the student is going, under intimation to the Registrar, SRD and the student. The
transfer will be permitted only if seats are available at the new Learner Support Centre.

76
6.5 Procurement of Official Transcripts
The University provides the facility of obtaining official transcripts on request, made by the
learners in prescribed application form for official transcript, which provides details of fee,
where to apply etc. Link to this form is given in the Section 9.

6.6 Duplicate Grade Card

The learner can apply for obtaining duplicate Grade Card in case the same has been
lost/misplaced/damaged, by making a request in prescribed application form for Duplicate
Grade card, which provides details of fee, where to apply etc. Link to this form is given in the
Section 9 on print of Rs.200/-

6.7 Self instructional Materials of Your Programme of Study

Self-instructional material will be available through eGyankosh, IGNOU eContent App
and later the self-instructional materials may be dispatched to the student’s registered
address.
You should visit your Regional Centre (RC)/ Learner Support Centre (LSC) concerned with ID
card for schedule of theory and practical counselling sessions.

6.8 Disputes on Admission and other University Matters

In case of any dispute, the place of jurisdiction for filing of a suit/plaint/petition will be only at New
Delhi / Delhi.

7. SOME USEFUL ADDRESSES

For your information, the following officers deal with different educational aspects:

(i) Student Registration Related issues Registrar, SRD, Indira Gandhi National Open
University, Maidan Garhi, New Delhi -110068,
011-29532741 (SRD), 1302/1316 (SRD),
Email: :registrarsrd@[Link]
(ii) Exam Centres, Results, Re-checking of Registrar, SED, Indira Gandhi National Open
answer-scripts, Discrepancies in Result, University, Maidan Garhi, New Delhi -110068,
marks update, etc. Phone No: 011-29535828/2482 (SED),
011-29572204/2205(SED), FAX No.011-
29534429 068

77
 (iii) Admission, Fees, Scholarship, Change Regional Director of the Regional Centre
of Address/ Learner Support Centre/ concerned.
Regional Centre, Change of Course,
Issue of Bonafide Certificate, Migration
Certificate.
(iv) Academic Matters MCA Programme Coordinator
SOCIS, C-Block, New Academic Complex
IGNOU, Maidan Garhi, New Delhi - 110 068
Phone: 011-29572902
Email: mca@[Link]
(v) Administrative and counselling matters Co-coordinator of your Learner Support
missing score of TMAs/Project Centre/Regional Director of the Regional
assignments/Practical assignments, Centre concerned
Assessment Sheets
(vi) Issue of Degree/ Diploma/ Dy. Registrar (Exam-1)
Certificate, Dispatch of returned Examination –1
Degrees, Verification of Degree
Indira Gandhi National Open
University,
Maidan Garhi New Delhi -110068,
Phone No.011-29535438
011-29572224/2213 e-mail:
exam1@[Link]
(vii) Issue of Provisional Certificates and Dy Registrar (Exam-3)
Grade Cards Phone No: 011-29536743; Intercom No. 2201
(ix) Declaration of pending results of Dy. Registrar (Exam-3)
TEE, Incorporation of practical Phone No: 011-29536103/6743
marks, Verification of provisional 011-29572201/2211
certificate and grade card, Issue of
transcripts
(x) Non incorporation of assignment marks Assistant Registrar (Assignment)
Phone No: 011-29532294
Intercom No. 1319/1325
E-mail: assignments@[Link]
(xi) Online students grievances Portal [Link]
(xii) Students’ General Enquiries Student Support Centre
Indira Gandhi National Open
University,
Maidan Garhi New Delhi -110068,
Phone: 011-29535714, 29572512,
29572514,
29533869 and 29533870 e-mail:
ssc@[Link]
Telephone numbers of the Divisions/ Schools are also provided on the website under the
“Contact Us” option. Students are advised to be in touch with their LSCs for
advance/timely/day-to-day information or visit the website with URL [Link]

78
8. LINK TO OLD QUESTION PAPERS

The old question papers of MCA_New are not available. However, you can download the
previous year’s question papers from IGNOU website for earlier 3-years programme. The
following is the process of downloading the question papers from IGNOU website:
Visit the IGNOU website at URL: [Link] and select the Download Button on
IGNOU web site. On this Download Page select Question Papers link. The following page will
be displayed (please note that URL of this page is: [Link]

Figure 4: The Previous Year Question papers of IGNOU

Select the year of Question paper, this will display School wise list of Question papers, as the
list is large you may use find on page option of your browser to find MCA old question papers
(please note that you can search MCA old question papers by searching MCS.)

9. LINKS TO FORMS AND ENCLOSURES

In this section, we are enclosing the IGNOU website links to various forms, which are useful
for you. Whenever you have to correspond with the university, please download the form from
the Website and fill it carefully and send as per instructions therein. The detailed instructions
for all these-forms are provided in form itself. Some of these links may change, in those cases
please use search option to find the desired link.

Note: You must download the Forms from the

Website

Forms and Useful links

• Change of Address (Form No.1)
• Assignments Remittance-Cum-Acknowledgement Card (FormNo.2)

79
• Link to Latest Assignment(s)
• Link to Online Re-Registration for MCA Programme
• Link to Online Term end Examination form
• Link to form for early declaration of result
• Link to form for obtaining photocopy of the answer script
• Link to form for Re-evaluation of Answer script
• Link to Application form for improvement in Division/ Class
• Link to form for obtaining Duplicate Grade Card /Mark-sheet
• Link to form for issue of Official Transcript
• Link to form for issue of Migration Certificate

Change of Address (Form 1) You may also check online form for this.

Assignments related links

Assignment Remittance-cum-Acknowledgement (Form 2)

Link to Latest Assignment(s)

[Link]

Re-registration
Link to Online Re-Registration for MCA Programme
[Link]

Last date of Re-Registration is announced on the IGNOU website. In

general, the re-registration is to be done 2-3 months prior to the start of
session.

Term end Examination and related links

Link to online Term End Examination form
[Link]

Link to form for Early Declaration of Result

[Link]
20DECLARATION%20OF%20RESULT%20OF%20TERM-
END%[Link]

80
Link to Application Form for Obtaining Photocopy of the
Answer Script
[Link]
%20photocopy%20of%20the%20answer%[Link]
Link to form for Re-evaluation of Answer script
[Link]
%20Answer%[Link]

Link to Application form for Improvement of

Division/Class
[Link]

Link to form for Duplicate Grade Card/Mark-sheet

[Link]

Link to form for Issue of Official Transcript

[Link]

Link to form for Issue of Migration Certificate

[Link]

81
 Form No. 1

(For Change of Address, send it duly filled-in to the concerned Regional

Director, who will forward it to the Registrar (SRD), Maidan Garhi, New Delhi after
verification)
Application for Change of Address

Date:

To

The Regional Director

IGNOU Regional Center

THROUGH THE REGIONAL DIRECTOR CONCERNED

EnrolmentNo.

Programme _ _

Name (in caps)

1. DETAILS FOR CHANGE/CORRECTION OF MAILING ADDRESS

New Address Old Address

City Pin City Pin _

State State_

Signature of the Student

Please retain a photocopy of any document that you submit to the

University.

82
 Form No. 2
ASSIGNMENTS REMITTANCE -CUM-
ACKNOWLEDGEMENTCARD

Affix
Stamp
Here

From: To

The Coordinator (ADDRESS OF THESTUDENT) Study Centre concerned

………………………………..
…………………………………..
…………………………………..

QR Code of Some of the Useful Web Links

83
 eGyankosh Online Re-Registration Form
(for Online Course Materials)

iGRAM To Watch Live Telecast/

(IGNOU Grievance portal) To listen live Broadcast

Note: The above QR Codes can be scanned and open through

and QR Code Scanner Application/App.

10. LINKS TO VIDEOS FOR VARIOUS COURSES

MCS-211: Design and Analysis of Algorithms, (as on 25th April, 2024)

84
MCS-221: Data Warehousing and Data Mining (as on 22nd May, 2024)

Gyan Darshan Programme Link

Title
Analysis of Polynomial [Link]
Evaluation
Recurrence Relation [Link]
Solving Recurrence Relation [Link]

Basic Building Blocks of an [Link]

Algorithm
Analysis of Algorithms [Link]
Analysis of Simple Algorithms [Link]

Fractional Knapsack Problem [Link]

Prim’s Algorithm – A Greedy [Link]

Approach of Minimum Cost
Spanning Tree

Kruskal’s Algorithm of Minimum [Link]

Cost Spanning Tree

Dijkstra’s Shortest Path [Link]

Algorithm
Dynamic Programming [Link]
Algorithm for Matrix Chain
Multiplication Problem

Optimal Binary Search Tree [Link]

Huffman Code [Link]

85
Sessio Title of the MCS- Time Stamp for the Start of the Video
n No. Session & 221
Date of the Course
Session Material
Live/Recor Unit
ded
1. Fundamenta Unit -1 [Link]
ls of Data
Warehousin
g
(17th Nov,
2022)
2. Design Unit -1 [Link]
Approaches
and Types
of Data
Warehouses
(25th Jan,
2023)
3. Data Unit -1 [Link]
Warehouse
Application
s and
Popular
Data
Warehouse
Platforms
(17th Feb,
2023)
4. Component Unit-2 [Link]
s of DW
Architectur
e
(22nd
March,
2023)
5. Data Marts Unit-2 [Link]
(17th April,
2023)
6. Dimensiona Unit-3 [Link]
l Modeling

86
 and Star
Schema
(10th May,
2023)
7. Dimensiona Unit-3 [Link]
l Modeling
–
Snowflake
Schema and
Fact
Constellatio
n Schema
(31st July,
2023)
8. Working of Unit-4 [Link]
ETL in a
Data
Warehouse
(29th Aug,
2023)
9. ETL Tools Unit-4 [Link]
and ELT in
Data
Warehousin
g
(4th Sept,
2023)
10. OLAP and Unit-5 [Link]
Data
Warehousin
g
(9th Oct,
2023)
11. Types of Unit-5 [Link]
OLAP
Architectur
es
(7th Nov,
2023)
12. Trends in Unit-6 [Link]
Data

87
 Warehousin
g (6th Dec,
2023)
13. Trends in Unit-6 [Link]
Data 1m43smQ
Warehousin
g (Complex
Data, Cloud
Data
Warehousin
g)(23rd Jan,
2024)
14. Trends in Unit-6 [Link]
Data
Warehousin
g (Real
Time Data
Warehousin
g) (16th
Feb,2024)
15. Trends in Unit-6 [Link]
Data KG40j95rFA15
Warehousin
g (Hadoop
& Data
Warehousin
g, DW-
Automation
) (22nd
Mar,2024)
16. Introduction Unit-7 [Link]
to Data
Mining(9th
April, 2024)
17. Text Mining Unit - 8 [Link]
(22nd May, q_fvbq0
2024
18. Data Unit-7 [Link]
Mining –
An
Introduction

88
 (17th March,
2023)
19. Data Unit-8 [Link]
Preprocessi
ng
(4th May,
2023)
20. Mining Unit-9 [Link]
Frequent
Patterns and
Association
Rule
Mining
(28th June,
2023)
21. Understandi Unit-9 [Link]
ng Apriori
Algorithm
Using an
Example
(26th July,
2023)
22. Classificati Unit-10 [Link]
on and
Prediction
(11th Aug,
2023)
23. Classificati Unit-10 [Link]
on by
Decision
(8th Nov,
2023)
24. Decision Unit-10 [Link]
Tree JOKFJGE
Induction:
Attribute
Selection
Measure(18t
h
Jan, 2024)
25. Clustering Unit-11 [Link]
Techniques

89
 (5th April,
2024)
26. Major Unit-11 [Link]
Clustering yW1BZ3s
Methods
(17th May,
2024)

MCS-227: Cloud Computing and IoT (as on 12th March, 2024)

Sessio Title of the MCS- Time Stamp for the Start of the Video
n No. Session & 221
Date of the Course
Session Material
Live/Recor Unit
ded
1. Fundamenta Unit -1 [Link]
ls of Cloud _yB-_g
Computing
and IoT
2. Cloud Unit -2 [Link]
Deployment 7_d4lxE
Models and
Service
Models

90