PROGRAMME GUIDE

FOR

MASTER OF COMPUTER APPLICATIONS

(MCA)

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

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

[Link]
eProgramme Guide:

2019 (Draft) There is no programme related change. Thus, there is no change in Programme
Structure, Syllabus, counselling sessions, evaluation methodology etc.

© 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 4
1. Basic Information 5
1.1 MCA Programme Objectives 5
1.2 Duration of the Programme 5
1.3 Medium of Instruction 5
1.4 Credit System 5
1.5 MCA Programme Structure 6
1.6 Recognition 7
1.7 Completion of BCS-012 7
1.8 Associate Studentship Scheme 7
1.9 Student Support Services 7
1.10 Newsletter 7
1.11 How to contact the MCA Programme Coordinator 8

2. Instructional System 8
2.1 Print Material 8
2.2 AudioVideo Material and CDs 8
2.3 Counselling Sessions 9
2.4 Web Based Support 27

3. Browsing IGNOU’s Website 28

4. MCA Syllabus 30

5. Evaluation Scheme 74
5.1 Assignments and Term-end Examination 74
5.2 Guidelines for Mini Project (MCS-044) 77
5.3 Instructions for Assignments 78
5.4 Guidelines Regarding Submission of Assignments 79
5.5 General Guidelines Regarding Term-end Examination 80

6. Other Useful Information 83

6.1 Reservation of Seats 83
6.2 Scholarships and Reimbursement of Fee 83
6.3 Change / Correction of Address 83
6.4 Change of Regional centre and Study Centre 83
6.5 Procurement of Official Transcript 84
6.6 Duplicate Grade Card 84
6.7 Study material for your Programme of Study 84
6.8 Disputes on Admission and other University Matters 84

7. Some Useful Addresses 84

8. Link to Old Question Papers 85

9. Useful Forms and Links to Forms and Enclosures 86

 Change of Address (Form No. 1)
 Assignments Remittance-Cum-Acknowledgement Card (Form No.2)
 Link to Latest Assignment(s)
 Link to Online Re-Registration for MCA Programme
 Link to Re-admission form for MCA programme
 Link to Online Term end Examination form
 Link to Offline 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

3
 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 3-year programme during which you will study a wide range of topics in
Computer Science and Applications. You will receive support from IGNOU through the regional
centre, study centre to which you will be allotted and also from IGNOU’s website. We expect you
to be directly in contact with us and your peers through the Internet also, at the email address given
below.
This Programme Guide contains instructional system of IGNOU MCA programme, syllabus of
MCA programme, details of evaluation scheme and links to assignments and other important
information and forms. The course material is sent to you, to find the status of course material
dispatch, you may refer to section 6.7. You can download the assignments of the semester in which
you have enrolled from our website. Each course contains only one assignment that will be
assessed by a counsellor at your study centre. All these assignments are to be submitted at your
study centre within the stipulated time mentioned against last date of submission. In case a student
needs the assignments of previous semesters, s/he can obtain a copy of the same from the
IGNOU’s website.
At your study centre you will be able to avail yourself of the counselling for all the courses. You
need to have a minimum of 70% 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 Examinations.

It is to be noted that the payments that are mentioned in various proformas/formats are as on date
and is subject to revision from time to time. You are advised to keep checking with the
website/study centre/regional centre 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. You
may use the photocopies of those. The Programme Guide, forms and formats are also available on
the website. Please confirm the fees with the Regional Centre / Study Centre / 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. This Programme Guide contains the information
and forms related to 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]

Learners are advised to be in touch with their study centres for advice / timely / day-to-day
information or visit the website with URL [Link].

I wish you all the success in pursuing the MCA programme.

MCA Programme Coordinator

Email: mca@[Link]

4
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 programme’s thrust 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 skills development in computers using various technologies, the second
year is more focused on core courses providing conceptual framework and the third year provides
the specialisation and the project work.

1.2 Duration of the Programme

(Minimum - 3 Years, Maximum - 6 Years)

To fulfil the requirements for acquiring the MCA, a student may clear all the courses in a minimum
of three years and a maximum of 6 years. In case the student is unable to pass all the courses of the
MCA programme in 6 years, s/he can continue for another two years by seeking Re-admission to
the courses which s/he is unable to successfully complete. For the re-admission rules and paying
the requisite fee, you may contact the Regional Centre for further information. But, you are advised
to pass all the courses successfully in 3 years.

1.2.1 Minimum and maximum duration for those directly admitted to 2nd year of MCA under
Integrated Programme (for BCA students of IGNOU) is 2 years and 4 years respectively. In case a
student of Integrated programme is unable to complete all the requirements for the award of
degrees of BCA as well as MCA, s/he can get the duration extended by another two years on
remitting the pro-rata fee for all the left-over courses of BCA as well as MCA in lump-sum.
Pro-rata fee of standalone BCA will not be accepted from the students of Integrated BCA-MCA.
(Note: The BCA-MCA Integrated programme was on offer till JULY 2018 admission cycle only.
So the section 1.2.1 is not valid for BCA students who have taken admission after JULY 2018
admission cycle). Re-admission Form and Table of Pro-rata fee can be downloaded from the
website [Link] (link is given in section 9 of this Programme Guide)

1.3 Medium of Instruction

The medium of instruction is only English. The course material is also in English.
1.4 Credit System

The University follows the ‘Credit System’ for its programmes. Each credit is worth 30 hours of
student study 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 into
successfully complete a course. Completion of the programme requires successful completion
of both assignments and the Term-End Examination of each course in the programme.

5
1.5 MCA Programme Structure

The programme has been divided into two semesters per year (January to June and July to
December). Consequently, there will be two examinations every year - one in the month of June
for the January to June semester courses and the other in December for the July to December
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.

MCA Programme Structure

I SEMESTER II SEMESTER
Year Course Course Title Credits Course Course Title Credits
Code Code
I MCS-011 Problem Solving and 3 MCS-021 Data and File Structures 4
Programming
MCS-012 Computer Organization 4 MCS-022 Operating System Concepts and 4
and Assembly Language Networking Management
Programming
MCS-013 Discrete Mathematics 2 MCS-023 Introduction to Database 3
Management Systems
MCS-014 Systems Analysis and 3 MCS-024 Object Oriented Technologies and 3
Design Java Programming
MCS-015 Communication Skills 2 MCSL-025 Lab (based on MCS-021, 022, 023 4
& 024)
MCSL- Internet Concepts and Web 2
016 Design
MCSL- C and Assembly Language 2
017 Programming Lab
III SEMESTER IV SEMESTER
II MCS-031 Design and Analysis of 4 MCS-041 Operating Systems 4
Algorithms
MCS-032 Object Oriented Analysis 3 MCS-042 Data Communication and 4
and Design Computer Networks
MCS-033 Advanced Discrete 2 MCS-043 Advanced Database Management 4
Mathematics Systems
MCS-034 Software Engineering 3 MCS-044 Mini Project 4
MCS-035 Accountancy and Financial 3 MCSL-045 Lab (UNIX & Oracle) 2
Management
MCSL- Lab (based on MCS-032, 3
036 034 and 035)
V SEMESTER VI SEMESTER
III MCS-051 Advanced Internet 3 MCSP-060 Project 16
Technologies
MCS-052 Principles of Management 2
and Information Systems
MCS-053 Computer Graphics and 4
Multimedia
MCSL- Lab (based on MCS-051 &
054 053) 2
Elective Courses*

MCSE- Artificial Intelligence and

003 Knowledge Management
3
MCSE- Numerical and Statistical
004 Computing
3
MCSE- Parallel Computing
011 3

* Presently, only 3 elective courses are on offer and a student needs to select all of them. As and when we design the
new courses we will inform.
Total number of Courses are 31
Total number of Credits are 108.

6
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 & 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 to 2022-23.

1.7 Completion of BCS-012

Students who took admission into MCA (from July 2013 session onwards), and did not have
Mathematics at 10+2 level or at graduate level have to do BCS-012. They are advised to clear it
along with the first year of MCA courses. However, all such students have to successfully complete
BCS-012 (wherever applicable) before re-registering for MCA 5th semester.

1.8 Associate Studentship Scheme

There is a provision of Associate Studentship Scheme in MCA wherein the student can register for
a minimum of 8 credits and a maximum of 32 credits. This scheme is permissible for any course(s)
of any programme offered by IGNOU, subject to the conditions that the students fulfill the
minimum eligibility requirements for the respective programmes, and also undertakes the minimum
and maximum credits specified.

Students are not eligible for admission under Associate Studentship Scheme to the course(s) of the
programme(s) where clearance of an entrance test is mandatory and also to the programmes where
the intake is restricted to a limited number of seats.

1.9 Student Support Services

In order to provide individualised support to its learners, the University has created a number of
Study Centres throughout the country for this Programme. These are administratively coordinated
by the Regional Centres. The Study Centres 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
Study Centre 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 Study
Centre 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.10 Newsletter

The IGNOU Newsletter is published twice in a year (April and October) in English and Hindi. This
periodical communication is delivered by post to all the students of IGNOU along with course
material. Information regarding the examination schedule, new courses to be launched, admissions,
telecast schedule, teleconferencing schedule, etc., is also provided through the IGNOU Newsletter.
7
It covers various activities at IGNOU Headquarters, Regional Centres and Study Centres. It also
carries important notifications from time to time.

1.11 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] or by telephone with Tel No: 011-29533436.

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 learner-oriented,
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-to-face
communication. The University follows a multi-channel approach for instruction. It comprises a
suitable mix of:

 self-instructional printed material

 audio / video cassettes and CDs
 audio-video programmes transmitted through AIR and Doordarshan, and at study centre
 face-to-face counselling at study centres by academic counsellors
 reference library at study centre
 web based academic support
 assignments
 practical
 Gyan Darshan Channel, including teleconferencing, Eklavya exclusively for Technology based
programmes
 Gyan Vani.
2.1 Print Material
Printed 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. Therefore, you have to concentrate mainly on the print materials,
which we send to you. 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 printed material alone may not be sufficient to write assignments and prepare for the Term-end
Examinations. Some reference books are available at your study centre.

2.2 Audio-Video Material and CDs

These are video-cassettes meant for clarification and enhancement of understanding. However,
audio / video are supplementary materials and would not be available for all the courses. The
audio-video material supplements the print material. Hence, we advise you to make use of it as that
8
will help you to understand the subject better. However, audio-video material will normally not be
supplied to the students individually but will be made available at the Study Centres. You can
watch these programmes during counselling sessions. The schedule for screening these films has
been synchronised with the progress of relevant written material. Students desirous of buying the
audio-video CDs can procure them from:

The Director
EMPC, Sanchar Kendra
IGNOU, Maidan Garhi
New Delhi-110068
Ph. 91-11- 29532163, 29532164, 29533065
The video programmes of SOCIS are also telecast on DD-1(National Channel). The telecast
schedule of transmission of programmes is communicated through a monthly booklet called Gyan
Darshan.

You can contact your Study Centre Coordinator to go through it. You may write to the above-
mentioned address for a copy of the same or see the schedule on the IGNOU’s website.

2.3 Counselling Sessions

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

2.3.1 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.

There are academic counsellors at the Study Centres to provide counselling and guidance to you in
the courses that you have chosen for study. Normally, these sessions will be held at the study
centres 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.

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.

9
2.3.2 Practical Sessions and Compulsory Attendance

The practical sessions will be held in the computer centres / labs of the Study Centres. 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) 70% attendance is compulsory for each lab course. However, this condition is not
applicable for the computer time given for a specific assignment.
(ii) This is a pre-requisite for taking the term-end practical examination in the respective lab
courses.
(iii) A student who fails to fulfil the 70% attendance requirements will be allowed to re-register
for that lab course. For fee details and the application form, please contact your Regional
Centre.
(iv) 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.
(v) Student attendance will be recorded coursewise at the study centre.
(vi) Strictly follow the guidelines given in the Lab manuals for the respective lab courses.
(vii) Computer to Student ratio will be 1:2.

2.3.3 Counselling Schedule

I SEMESTER II SEMESTER
Year Course Course Title No. of No. of Course Course Title No. of No. of
Code Theory Practical Code Theory Practical
Credits

sessions sessions Credits sessions sessions

(2 hrs (3 hrs each) (2 hrs (3 hrs each)
each) each)

I MCS-011 Problem Solving and 3 5 2^ MCS-021 Data and File 4 8

Programming Structures
MCS-012 Computer 4 8 2^ MCS-022 Operating System 4 8 2^
Organization and Concepts and
Assembly Language Networking
Programming Management
MCS-013 Discrete 2 3 MCS-023 Introduction to 3 5 2^
Mathematics Database
Management
Systems
MCS-014 Systems Analysis 3 5 MCS-024 Object Oriented 3 5 2^
and Design Technologies and
Java Programming
MCS-015 Communication 2 2 MCSL-025 Lab (based on 4 (10+10+10+
Skills MCS-021, 022, 023 10)
& 024)
MCSL-016 Internet Concepts 2 20
and Web Design
MCSL-017 C and Assembly 2 (10+10)
Language
Programming Lab
III SEMESTER IV SEMESTER
II MCS-031 Design and Analysis 4 8 MCS-041 Operating Systems 4 8
of Algorithms
MCS-032 Object Oriented 3 5 2^ MCS-042 Data 4 8 2^
Analysis and Design Communication
and Computer
Networks
MCS-033 Advanced Discrete 2 3 MCS-043 Advanced Database 4 8 2^
Mathematics Management
Systems
MCS-034 Software 3 5 MCS-044 Mini Project 4 10
Engineering
MCS-035 Accountancy and 3 8 MCSL-045 Lab (UNIX & 2 (10+10)
Financial Oracle)
Management
MCSL-036 Lab (based on MCS- 3 (10+10+10)
032, 034 and 035)

10
 V SEMESTER VI SEMESTER
III MCS-051 Advanced Internet 3 5 2^
Technologies MCSP-060 Project 16 2#

MCS-052 Principles of 2 3
Management and
Information Systems
MCS-053 Computer Graphics 4 8 2^
and Multimedia

MCSL-054 Lab (based on MCS-

051 & 053) 2
(10+10)
Elective Courses*

Artificial Intelligence
MCSE-003 and Knowledge
Management 3 5

MCSE-004 Numerical and

Statistical Computing 3 5

MCSE-011 Parallel Computing 3 5

* Presently, only 3 elective courses are on offer and a student needs to select all of them. As and when
we design the new courses we
will inform.
# These sessions should be conducted in the 5th semester.
^ These sessions are meant for Assignment implementation and attendance is not compulsory.

Semesters and the Number of Sessions:

Semester No. of Sessions No. of Hours
Theory Practical Specific Theory Practical Specific
Assignment Assignment

I 23 40 4 46 120 12
II 26 40 6 52 120 18
III 29 30 2 58 60 6
IV 24 30 4 48 90 12
V 31 20 4 62 60 12
VI 2* - - 4
TOTAL 135 160 20 270 480 60

 These sessions should be conducted in the 5th semester.

Total Computer time = Practical time + Specific Assignment related time

= 160 Sessions + 20 Sessions
= 480 hours + 60 hours
= 540 hours

Note: 70% attendance is compulsory in Practical Lab Sessions. However, this condition is not applicable
for the time given for specific assignment.

11
2.3.4 Detailed Counselling Schedule for MCA 1st to 6th Semesters

The following is the detailed counselling schedules for 1st to 6th Semesters of MCA. The Schedule
is applicable for all the students of MCA 1st year, 2nd year and 3rd year. The respective study
centres will communicate you the exact dates of the Schedule.

MCA 1st Semester Schedule

MCS-011: Problem Solving and Programming

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 5 One Session on Block -1
Two sessions each on Block-2 and
Block - 3
2. Practical Sessions 2 These two practical sessions are not
compulsory

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Problem Solving, Basics of C, Variables and Constants,
Counselling (Units 1, 2 3 Expressions and Operators
& 4)
2 Block-2 Decision and Loop Control Statements in C and Arrays
(Units 5 & 6)
3 Block-2, Strings and Functions in C
(Units 7 & 8)
4 Block-3, Structures & Unions, Pointers
(Units 9 &
10)
5 Block-3, Unit C Preprocessor and Files
11 & 12
Practical 1&2 Assignment Design, write and test the MCS-011 assignment problems
Sessions

MCS-012: Computer Organisation and Assembly Language Programming

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 8 Two sessions each on each Block
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems.
These are not compulsory.

Session Details

Session Type Session Block to be Topics to be covered

Number Covered
Theory 1 Block 1, Unit von Neumann Architecture, Instruction execution,
Counselling 1, 2 & 3 concept of Interrupts, Fixed point and floating point
arithmetic, error detection and other codes, concepts of
Gates and Logic Circuits

12
 2 Block 1, Unit The Combinational and Sequential circuits, Design of
3&4 Combinational circuits, examples of combinational
circuits, flip flops, sequential circuit design, examples of
sequential circuits
3 Block 2, Unit The memory hierarchy, Cache, RAM, ROM, DRAM,
1&2 Flash Memory, secondary storage technologies and
Characteristics, RAID and its levels, Cache Organisation,
The Memory System of Micro-Computer, Input output
interfaces, the concepts of device controllers, Input output
techniques, DMA, Device drivers, Input output
processors, Interrupt Processing
4 Block 2, Unit Hard Drives: Partitioning and Formatting: FAT, Inodes,
3&4 Drive Speed, Access Time, Rotation Speeds, Hard Drive
Interfaces, Removable Storage Options, Video Cards,
Liquid Crystal Display (LCD), Modems, Print
Resolution, Scanners, Keyboards, Mouse, Power supply
5 Block 3, Unit The Instruction format, The Instruction set architecture,
1&2 The types of Instructions, The types of operands,
Addressing modes and their importance, Description of
Various types of Registers, Need and importance of
registers, The Micro-operation concepts, The Instruction
execution and micro-operations
6 Block 3, Unit The organization of Arithmetic logic unit, The
3, 4 &5 characteristics of ALU, Design of simple units of ALU,
Pipelining, The hardwired control, Wilkes control, The
Micro-programmed control, the microinstructions, the
execution of micro-program, RISC principles, Large
Register file in RISC, RISC pipelining
7 Block 4, Unit 8086 microprocessor, The Instruction format, The
1, 2& 3 addressing modes, The types of Instructions, The need
and use of assembly language, Input output in assembly
Language Program, Sample Assembly Programs
including Arrays, Counters, Dealing with various simple
statements, Use of various addressing modes
8 Block 4, Unit Modular Programming, Interfacing assembly with HLL,
4 Device drivers in assembly, Interrupts in assembly
Practical 1&2 Assignment Design, write and test the MCS-012 assignment problem
Sessions Problem

MCS-013: Discrete Mathematics

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 3 One Session on Block -1
Two sessions on Block-2

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Propositional Calculus, Methods of Proof & Boolean
Counselling (Units 1, 2 & Algebra and Circuits
3)
2 Block-2 Sets, Relations and Functions & Combinatorics – An
(Units 1,2) Introduction
3 Block-2 Some more Counting Principles, Partitions and
(Units 3, 4) Distributions

13
MCS-014: Systems Analysis and Design

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 5 One Session each on Block -1
and [Link] sessions on Block-
3 and one session on Block-4.

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Introduction to Systems Analysis and Design, Profession
Counselling (Units 1, 2 3 of a Systems Analyst, Process of Systems Development
& 4) and Documentation of systems
2 Block-2 Process of Systems planning, Modular and Structured
(Units 5,6 Design and System Design and Modeling
&7)
3 Block-3 Forms and Reports Design, Physical File Design and
(Units 8 & 9) Database Design
4 Block-3 CASE tools for systems development
(Unit 10)
5 Block-4 Implementation and Maintenance of systems, Audit and
(Units 11, 12 Security of Computer systems, Management Information
& 13) Systems

MCS-015: Communication Skills

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 2 One Session on Block -1
One session on Block-2

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Process of Communication, Telephonic Techniques, Job
Counselling (Units 1 to 5) Applications and Interviews, Group Discussions &
Managing Organizational Structure
2 Block-2 Meetings, Taking notes and preparing minutes,
(Units 6 to Presentation Skills I & II and Negotiation skills.
10)

14
MCSL-016: Internet Concepts and Web Design

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 20 Internet Concepts and web design

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Practical 1 Block -2, Lab All the problems given in the session - 1, session - 2 and
Sessions Manual session - 3 of Section -1 of the lab manual are to be
(Section -1) executed.
2 Block -2, Lab All the problems given in the session - 4, session - 5 and
Manual (Section - session - 6 of Section - 1 of the lab manual are to be
1) executed.
3 Block -2, Lab All the problems given in the session - 7 and session - 8
Manual (Section - of Section - 1 of the lab manual are to be executed.
1)
4 Block -2, Lab All the problems given in the session - 9 and session -10
Manual of Section - 1 of the lab manual are to be executed.
(Section -1)
5 Block -2, Lab All the problems given in the session - 1, session - 2 and
Manual session - 3 of Section - 2 of the lab manual are to be
(Section - 2) executed.
6 Block -2, Lab All the problems given in the session - 4, session -5 and
Manual session-6 of Section - 2 of the lab manual are to be
(Section -2) executed.
7 Block -2, Lab All the problems given in the session - 7, session - 8 of
Manual Section - 2 of the lab manual are to be executed.
(Section -2)
8 Block -2, Lab All the problems given in the session - 9 and session -10
Manual of Section - 2 of the lab manual are to be executed.
(Section -2)
9 Block -2 ,Lab All the problems given in the session - 1, session - 2 and
Manual session - 3 of Section - 3 of the lab manual are to be
(Section -3) executed.
10 Block -2, Lab All the problems given in the session - 4, session - 5 and
Manual session - 6 of Section - 3 of the lab manual are to be
(Section -3) executed.
11 Block -2, Lab All the problems given in the session - 7, session - 8 and
Manual session - 9 of Section - 3 of the lab manual are to be
(Section -3) executed.
12 Block -2, Lab All the problems given in the session - 10, session - 11
Manual and session - 12 of Section - 3 of the lab manual are to be
(Section -3) executed.
13 Block -2, Lab All the problems given in the session - 13, session - 14
Manual and session - 15 of Section - 3 of the lab manual are to be
(Section -3) executed.
14 Block -2, Lab All the problems given in the session - 1, session - 2 and
Manual session - 3 of Section - 4 of the lab manual are to be
(Section - 4) executed.
15 Block -2, Lab All the problems given in the session - 4, session -5 and
Manual session - 6 of Section - 4 of the lab manual are to be
(Section - 4) executed.
16 Block -2, Lab All the problems given in the session - 7 and session - 8
Manual of Section - 4 of the lab manual are to be executed.

15
 (Section - 4)
17 Block -2, Lab All the problems given in the session - 9 and session -10
Manual of Section - 4 of the lab manual are to be executed.
(Section - 4)
18 Block -2, Lab All the problems given in the session - 1, session - 2,
Manual session - 3 and session - 4 of Section - 5 of the lab manual
(Section -5) are to be executed.
19 Block -2, Lab All the problems given in the session - 5, session - 6 and
Manual session - 7 of Section - 5 of the lab manual are to be
(Section -5) executed.
20 Block -2, Lab All the problems given in the session - 8, session - 9 and
Manual session -10 of Section - 5 of the lab manual are to be
(Section -5) executed.

MCSL-017: C and Assembly Language Programming

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 10 Problem Solving and C programming

Practical Sessions 10 Digital Logic Circuits and Assembly

Language Programming

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Practical 1 to 10 Lab Manual All the problems given in the Section - 1 (session- wise)
Sessions (Section -1) of the lab manual are to be executed.
11 to 20 Lab Manual All the problems given in the Section - 2 and Section - 3
(Section -2 & (session- wise) of the lab manual are to be executed.
Section-3)

MCA 2nd Semester Schedule

MCS-021: Data and File Structures

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 8 Two sessions on each block

Session Details
Sessions Session Block to be Topics to be covered
Number Covered
Theory 1 Block-1 All topics of Unit-1 and Unit-2
Counselling 2 Block-1 All topics of Unit-3
3 Block-2 All topics of Unit-4 and Unit-5
4 Block-2 All topics of Unit-6
5 Block-3 All topics of Unit-7
6 Block-3 All topics of Unit-8 and Unit-9
7 Block-4 All topics of Unit-10 and Unit-11
8 Block-4 All topics of Unit-12

16
MCS-022: Operating System Concepts and Networking Management

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 8 Two sessions on each Block
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Session Type Session Block to be Topics to be covered

Number Covered
Theory 1 Block 1, Unit 1 Graphical User Interface and Introduction to Operating
Counselling and Unit 2 System
2 Block 1, Unit 3 Introduction to Networking concept and Internetworking:
and Unit 4 Concept, Architecture and Protocols
3 Block 2, Unit 1, Introduction to Linux OS, Linux Commands and Utilities,
Unit2 and Unit Editor
3
4 Block 2, Unit 4 User to User Communication and Unix System
and Unit 5 Administration
5 Block 3, Unit 1 Windows 2000 Networking and Managing Windows
and Unit 2 2000 Server
6 Block 3, Unit 3 Advanced Windows 2000 Networking and Windows Xp
and Unit 4 Networking
7 Block 4, Unit 1 Security Concepts and Computer Security
and Unit 2
8 Block 4, Unit 3 Security and Management
and Unit 4
Practical 1&2 Assignment Design, Implement and test the MCS-022 assignment
Sessions Problems problem. These sessions are not compulsory.

MCS-023: Introduction to Database Management Systems

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 5 Two sessions each on first two
Blocks and one session on Block 3
&4
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Session Type Session Block to be Topics to be covered

Number Covered
Theory 1 Block 1: Unit The Database system, structure of a database, three level
Counselling 1 and Unit 2 Architecture of databases and its importance, the
relational model, the entity relationship model,
conversion of ER diagrams to Relational Database.

17
 2 Block 1: Unit The concepts of integrity, referential integrity, functional
3 and Unit 4 dependency, the normal forms till BCNF, sequential file
organization, indexes, index and B tree, multi key file
organization.
3 Block 2: Unit The Structured Query Language: data definition and
1 manipulation commands, views, nested queries, examples
4 Block 2: Unit Transactions, concurrency related problems and control,
2, Unit 3 and locks, two phase locking, deadlock. Database recovery
Unit 4 techniques, security and integrity, authorization, data
access control, The need and advantages of the
distributed and client server database systems, data
replication and fragmentation, distributed queries.
5 Block 3 and Discuss the various issues on the case studies of these
Block 4 blocks. Suggest how these studies can be improved.
Practical 1&2 Assignment Design, implement and test the MCS 023 assignment
Sessions Problem problem.

MCS-024: Object Oriented Technologies and Java Programming

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 5 One Session on Block -[Link]
sessions on Block-2 and Block-3
and one session on Block-4
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Object oriented concepts, JVM, basics of Java, data
Counselling types, arrays etc.
2 Block-2 Concept of object, class, inheritance, polymorphism
etc.
3 Block-2, Exceptions Handling and Multithreading
Block-3
4 Block-3 Different types of I/O operations in java including
files handling. String and StringBuffer classes and
their methods.
5 Block-4 Applets programming, GUI components, Layouts
and their management, Networking features,
Introduction to JDBC, RMI, Java Beans.
Practical 1&2 Assignment Design, implement and test the MCS 024
Sessions Problem assignment problems.

18
MCSL-025: Data Structures, Networking, DBMS and Java Programming

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 10 Data and File Structures Lab
Practical Sessions 10 Operating System and Networking Lab

Practical Sessions 10 DBMS Lab

Practical Sessions 10 Java Programming Lab

Session Details

Sessions Session Block to be Covered Topics to be covered

Number
Practical 1 to 10 Lab Manual All the problems given in the Section – 1
Sessions (Section - 1) (session- wise) of the lab manual are to be
Data and File Structures executed.
Lab Manual
11 to 20 Lab Manual All the problems given in the Section – 2
(Section -2) (session- wise) of the lab manual are to be
Operating Systems and executed.
Networking Lab
21 to 30 Lab Manual All the problems given in the Section – 3
(Section -3) (session- wise) of the lab manual are to be
DBMS Lab executed.
31 to 40 Lab Manual All the problems given in the Section – 4
(Section - 4) (session- wise) of the lab manual are to be
Java Programming Lab executed.

MCA 3rd Semester Schedule

MCS-031: Design and Analysis of Algorithms

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8

Session Details

Sessions Session Block to be Topics to be covered

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

19
MCS-032: Object Oriented Analysis and Design
Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5 Two Session on Block -[Link] sessions
each on Block-2 and Block-3 and Block-
4
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment problems.
These sessions are not compulsory.

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 Unit 1 and Unit 2
Counselling 2 Block-1 Unit 3
3 Block-2 Unit 1, Unit2, and Unit 3

4 Block-3 Unit 1, Unit2, and Unit 3

5 Block-4 Unit 1, Unit2, and Unit 3

Practical 1&2 Assignment Design different diagrams discussed in MCS032

Sessions Problem

MCS-033: Advanced Discrete Mathematics

Counselling Sessions

S. No. Counselling Sessions Number of Sessions Comments

1. Theory Sessions 3

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 - Overview of MCS-013
Counselling 2 Block-1 All Units
3 Block-2 All Units

MCS-034: Software Engineering

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5

Session Details

Sessions Session Block(s) to Topics to be covered

Number be Covered
Theory 1 Block-1 All topics of Unit-1 , Unit-2 and Unit-3
Counselling 2 Block-1, 2 All topics of Unit-4 of Block-1 and Units-1,2 of Block-2
3 Block-2 All topics of Unit-3and Unit-4
4 Block-3 All topics of Unit-1and Unit-2
5 Block-3 All topics of Unit-3 and Unit-4
20
MCS-035: Accountancy and Financial Management

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8

Session Details

Sessions Session Block to be Topics to be covered

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

MCSL-036: Laboratory Course (For Object Oriented Analysis and Design, Software
Engineering and Accountancy and Financial Management)

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 10 Object Oriented Analysis and Design Lab
Practical Sessions 10 Software Engineering Lab

Practical Sessions 10 Accountancy and Financial Management

Lab

Session Details

Sessions Session Block to be Covered Topics to be covered

Number
Practical 1 to 10 Lab Manual All the problems given in the Section – 1
Sessions (Section -1) (session- wise) of the lab manual are to be
Object Oriented Analysis performed in the lab.
and Design Lab
11 to 20 Lab Manual All the problems given in the Section – 2
(Section -2) (session- wise) of the lab manual are to be
Software Engineering performed in the lab.
Lab
21 to 30 Lab Manual All the problems given in the Section – 3
(Section -3) (session- wise) of the lab manual are to be
Accountancy and performed in the lab.
Financial Management
Lab

21
MCA 4th Semester Schedule

MCS-041: Operating Systems

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8

Session Details

Sessions Session Block to be Topics to be covered

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

MCS-042: Data Communication and Computer Networks

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Session Type Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 All topics of Unit-1 and Unit-2
Counselling 2 Block-1 All topics of Unit-3 and Unit-4
3 Block-2 All topics of Unit-1 and Unit-2
4 Block-2 All topics of Unit-3 and Unit-4
5 Block-3 All topics of Unit-1 and Unit-2
6 Block-3 All topics of Unit-3 and Unit-4
7 Block-4 All topics of Unit-1 and Unit-2
8 Block-4 All topics of Unit-3 and Unit-4
Practical 1&2 Assignment These two practical sessions may be used for solving
Sessions Problems assignment problems. These sessions are not compulsory.

MCS-043: Advanced Database Management Systems

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8
2. Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.
22
Session Details
Session Type Session Block to be Topics to be covered
Number Covered
Theory 1 Block-1 All topics of Unit-1 and Unit-2
Counselling 2 Block-1 All topics of Unit-3 and Unit - 4
3 Block-2 All topics of Unit-1 and Topics relating to transactions
management of Unit –2.
4 Block-2 All topics of Unit-3 and Unit - 4 and topics relating to
recovery in Unit 2.
5 Block-3 All topics of Unit-1 and Unit - 2
6 Block-3 All topics of Unit – 3 and Unit - 4
7 Block-4 All topics of Unit – 1 and Unit -2
8 Block-4 All topics of Unit - 3 and Unit - 4
Practical 1&2 Assignment These two practical sessions may be used for solving
Sessions Problems assignment problems. These sessions are not compulsory.

MCS-044: Mini Project

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Practical Sessions 10

Session Details

Name of the Topic No. of Practical Sessions

(3 hrs each)
Project specification 1
Coding / Implementation 5
Testing 2
Documentation 2

MCSL-045: UNIX and DBMS LAB

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 10 UNIX lab
Practical Sessions 10 DMBS Lab

Session Details

Sessions Session Block to be Covered Topics to be covered

Number
Practical 1 to 10 Lab Manual All the problems given in the Section – 1
Sessions (Section -1) (session- wise) of the lab manual are to be
UNIX Lab executed.

11 to 20 Lab Manual All the problems given in the Section – 2

(Section -2) (session- wise) of the lab manual are to be
DBMS Lab executed.

23
MCA 5th Semester Schedule

MCS-051: Advanced Internet Technologies

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5 Two sessions each on Block – 1 and
Block – 2 and one session on Block
– 3.
2 Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 All the topics of Unit – 1 and Unit - 2
Counselling 2 Block-1 All the topics of Unit – 3 and Unit - 4
3 Block-2 All the topics of Unit – 1 and Unit - 2
4 Block-2 All the topics of Unit-3 and Unit - 4
5 Block - 3 All the topics of Unit –1, 2 and 3
Practical Sessions 1&2 Assignment To solve MCS-051 assignment problems
Problems

MCS-052: Principles of Management and Information Systems

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 3

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1: All topics of unit 1: Organisational overview and
Counselling Management Unit 2: management functions and business processes
Systems
2 Block-1: All topics of unit 3: management systems and
Management Unit 4: business values of information system
Systems
Block-2: All topics of unit 1: portfolio management and it
Information applications.
Management
3 Block-2: All topics of unit 2: enterprise resource planning system,
Information unit 3: intelligence information systems and unit 4:
Management social, ethical and legal aspects

24
MCS-053: Computer Graphics and Multimedia

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 8
2 Practical Sessions 2 These two practical sessions may be
used for solving assignment
problems. These sessions are not
compulsory.

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 All the topics of Unit – 1
Counselling Upto Line Drawing Algorithms of Unit -2
2 Block-1 Rest of the topics of Unit –2 are to be covered
All the topics of Unit - 3
3 Block-2 All the topics of Unit - 1

4 Block-2 All the topics of Unit-2

5 Block - 3 All the topics of Unit-1

Upto Depth Buffer method of Unit - 2

6 Block - 3 Rest of the topics of Unit 2

All the topics upto Shading of Unit 3

7 Block – 3 Rest of the topics of Unit 3

Block - 4 All the topics upto Simulating Accelerations of Unit -1

8 Block –4 Rest of the topics of Unit – 1

All the topics of Unit – 2

Practical Sessions 1&2 Assignment To solve MCS-053 assignment problems

Problems

MCSL-054: Laboratory Course

(Advanced Internet Technologies & Computer Graphics and Multimedia)

Counselling Sessions

Sessions Number of Sessions Comments

Practical Sessions 10 Advanced Internet Technologies Lab
Practical Sessions 10 Computer Graphics and Multimedia Lab

Session Details

Sessions Session Block to be Covered Topics to be covered

Number
Practical 1 to 10 Lab Manual All the problems given in the Section – 1
Sessions (Section -1) (session- wise) of the lab manual are to be
Advanced Internet executed.
Technologies Lab
25
 11 to 20 Lab Manual All the problems given in the Section – 2
(Section -2) (session- wise) of the lab manual are to be
Computer Graphics and executed.
Multimedia

MCSE-003: Artificial Intelligence and Knowledge Management

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5 Two Units per session

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block -1 All the topics of Unit – 1 and 2
Counselling
2 Block - 1 All the topics of Unit – 3
Block - 2 All the topics of Unit -1
3 Block - 2 All the topics of Unit-2 and Unit-3

4 Block - 3 All the topics of Unit-1 and Unit-2

5 Block – 4 All the topics of Unit- 1 and Unit - 2

MCSE-004: Numerical and Statistical Computing

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5 One session on Block – 1 and
two sessions each on Block – 2 and
Block - 3

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 All the topics of Unit – 1, 2 and 3
Counselling
2 Block-2 All the topics of Unit – 1
Upto Newton’s Cotes formulae of Unit-2
3 Block-2 Rest of the topics of Unit – 2
All the topics of Unit-3
4 Block-3 All the topics of Unit-1
Upto Inversion Method of Unit-2

5 Block - 3 Rest of the topics of Unit-2

All the topics of Unit-3

26
MCSE-011: Parallel Computing

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions 5 Two Units per session

Session Details

Sessions Session Block to be Topics to be covered

Number Covered
Theory 1 Block-1 All the topics of Unit – 1 and Unit - 2
Counselling
2 Block-1 All the topics of Unit – 3 and Unit - 4

3 Block-2 All the topics of Unit-1 and Unit-2

4 Block-2 All the topics of Unit-3

Block -3 All the topics of Unit - 1

5 Block - 3 All the topics of Unit-2 and Unit-3

MCA 6th Semester Schedule

MCSP-060: Project

Counselling Sessions

S. No. Couselling Sessions Number of Sessions Comments

1. Theory Sessions * 2 One session on the project proposal
formulation and one session on the
project report formulation

Sessions Session Topics to be covered

Number
Theory Counselling* 1 Detailed discussion on the project proposal formulation

2 Detailed discussion on the project report formulation

* These sessions need to be completed during the 5th semester (during Jan-March) of MCA programme as the
student needs to submit the project proposal during 1st April to 30th June in the first slot.

2.4 Web Based Support

The learners can have access to IGNOU’s website at the following address (URL):
[Link] 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.

27
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.

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 Sciecnes (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. You can now click on MCA programme link to get information about the MCA
Programme.

28
 Figure 2: SOCIS Programmes

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

29
4. MCA SYLLABUS

The following is the syllabus for the first to fifth semesters of MCA programme. The sixth semester is
completely spared for project work.
MCS - 011: Problem-Solving and Programming 3 Credits

Objectives

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 be used 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 efficiently using C programming. 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.
Student will learn various concepts and techniques for problem-solving and will implement those ideas using
C programming.

Syllabus

BLOCK 1: An Introduction to C  C Language

Unit 1: Problem Solving o History of C
o Salient Features of C
 Problem - Solving Techniques  Structure of a C Program
o Steps for Problem - Solving o A Simple C Program
o Using Computer as a Problem-  Writing a C Program
Solving Tool  Compiling a C Program
 Design of Algorithms o The C Compiler
o Definition o Syntax and Semantic Errors
o Features of Algorithm  Link and Run the C Program
o Criteria to be followed by an o Run the C Program through the
Algorithm Menu
o Top Down Design o Run from an Executable File
 Analysis of Algorithm Efficiency o Linker Errors
o Redundant Computations o Logical and Runtime Errors
o Referencing Array Elements  Diagrammatic Representation of Program
o Inefficiency Due to Late Termination Execution Process
o Early Detection of Desired Output
Condition Unit 3: Variables and Constants
o Trading Storage for Efficient Gains
 Analysis of Algorithm Complexity  Character Set
o Computational Complexity  Identifiers and Keywords
o The Order of Notation o Rules for Forming Identifiers
o Rules for using the Big - O Notation o Keywords
o Worst and Average Case Behavior  Data Types and Storage
 Flowcharts  Data Type Qualifiers
o Basic Symbols used in Flowchart  Variables
Design  Declaring Variables
 Initialising Variables
Unit 2: Basics of C  Constants
o Integer Constants
 What is a Program and what is a
o Floating Point Constants
Programming Language?
30
 o Character Constants  Built-in String Functions and Applications
o String Constants o Strlen Function
o Symbolic Constants o Strcpy Function
o Strcmp Function
Unit 4: Expressions and Operators o Strcat Function
 Assignment Statements o Strlwr Function
o Strrev Function
 Arithmetic Operators
o Strspn Function
 Relational Operators
 Other String Functions
 Logical Operators
 Comma and Conditional Operators Unit 8: 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
BLOCK 2: Control Statements, Arrays and o Automatic Variables
Functions o External Variables
Unit 5: Decision and Loop Control o Static Variables
Statements o Register Variables
 Types of Function Invoking
 Decision Control Statements  Call by Value
o The if Statement  Recursion
o The switch Statement BLOCK 3: Structures, Pointers and File
 Loop Control Statements Handling
o The while Loop
Unit 9: Structures and Unions
o The do-while Statement
o The for Loop  Declaration of Structures
o The Nested Loop  Accessing the Members of a Structure
 The Goto Statement  Initializing Structures
 The Break Statement  Structures as Function Arguments
 The Continue Statement  Structures and Arrays
Unit 6: Arrays  Unions
 Initializing an Union
 Array Declaration  Accessing the Members of an Union
o Syntax of Array Declaration
o Size Specification Unit 10: Pointers
 Array Initialization  Pointers and their Characteristics
o Initialization of Array Elements in  Address and Indirection Operators
the Declaration  Pointer Type Declaration and Assignment
o Character Array Initialization o Pointer to a Pointer
 Subscript o Null Pointer Assignment
 Processing the Arrays  Pointer Arithmetic
 Multi-Dimensional Arrays  Passing Pointers to Functions
o Multi-Dimensional Array o A Function Returning More than
Declaration One Value
o Initialization of Two-Dimensional o Function Returning a Pointer
Arrays  Arrays and Pointers
Unit 7: Strings  Array of Pointers
 Pointers and Strings
 Declaration and Initialization of Strings
 Display of Strings Using Different Unit 11: The C Preprocessor
Formatting Techniques
 Array of Strings  # define to Implement Constants

31
 # define to Create Functional Macros o Open a file using the function fopen
 Reading from Other Files using # include ()
 Conditional Selection of Code using #ifdef o Close a file using the function
o Using #ifdef for different computer fclose( )
types  Input and Output using file pointers
o Using #ifdef to temporarily remove o Character Input and Output in Files
program statements o String Input / Output Functions
 Other Preprocessor Commands o Formatted Input / Output Functions
 Predefined Names Defined by Preprocessor o Block Input / Output Functions
 Macros vs Functions  Sequential Vs Random Access Files
 Positioning the File Pointer
Unit 12: Files  The Unbufferred I/O - The UNIX like File
Routines
 File Handling in C Using File Pointers

MCS-012: Computer Organisation and Assembly Language Programming 4 Credits

Objectives
In the modern era, computer system is used in most aspects of life. You may use many different types of
software on a computer system for particular applications ranging from simple document creation to space
data processing. But, how does the Software is executed by the Computer Hardware? The answer to this
basic question is contained in this Course. This course presents an overview of the Computer Organisation.
After going through this course, you will not only acquire the conceptual framework of Computer
Organisation and Architecture but also would be able to use the concepts in the domain of Personal
Computers. In specific, you will be able to design Digital Circuits; describe the functions of various
components of Computers and their construction; and write simple Assembly Programs.

Structure
BLOCK 1: Introduction to Digital Circuits o Error Detection And Correction
Codes
Unit 1: The Basic Computer
 The von Neumann Architecture
 Instruction Execution: An Example Unit 3: Principles of Logic Circuits I
 Instruction Cycle  Logic Gates
o Interrupts  Logic Circuits
o Interrupts and Instruction Cycle  Combinational Circuits
 Computers: Then and Now o Canonical and Standard Forms
o The Beginning o Minimization of Gates
o First Generation Computers
 Design of Combinational Circuits
o Second Generation Computers
 Examples of Logic Combinational Circuits
o Third Generation Computers
o Adders
o Later Generations
o Decoders
o Multiplexer
Unit 2: The Data Representation
o Encoder
 Data Representation o Programmable Logic Array
 Number Systems o Read Only Memory ROM
 Decimal Representation in Computers Unit 4: Principles of Logic Circuits I
 Alphanumeric Representation
 Data Representation For Computation  Sequential Circuits: The Definition
o Fixed Point Representation  Flip Flops
o Decimal Fixed Point Representation o Basic Flip-Flops
o Floating Point Representation o Excitation Tables
32
 o Master Slave Flip Flops o Partitioning & Formatting: FAT,
o Edge Triggered Flip-flops Inode
 Sequential Circuit Design o Drive Cache
 Examples of Sequential Circuits o Hard Drive Interface: IDE, SCSI,
o Registers EIDE, Ultra DMA & ATA/66
o Counters – Asynchronous Counters  Removable Drives
o Synchronous Counters o Floppy Drives
o RAM o CD-ROM & DVD-ROM
 Design of a Sample Counter  Removable Storage Options
o Zip, Jaz & Other Cartridge Drives
BLOCK 2: Basic Computer Organisation o Recordable CDs & DVDs
o CD-R vs CD-RW
Unit 1: The Memory System
o Tape Backup
 The Memory Hierarchy
 RAM, ROM, DRAM, Flash Memory Unit 4: I/O Technology
 Secondary Memory and Characteristics
 Hard Disk Drives  Keyboard
o Optical Memories o Keyboard Layout
o CCDs, Bubble Memories o Keyboard Touch
 RAID and its Levels o Keyboard Technology
 The Concepts of High Speed Memories  Mouse
o Cache Memory  Video Cards
o Cache Organisation o Resolution
o Memory Interleaving o Colour Depth
o Associative Memory o Video Memory
 Virtual Memory o Refresh Rates
 The Memory System of Micro-Computer o Graphic Accelerators and 3-D
o SIMM, DIMM, etc., Memory Chips Accelerators
o SDRAM, RDRAM, Cache RAM o Video Card Interfaces
Types of Memory
 Monitors
o Cathode Ray Tubes
Unit 2: The Input/Output System
o Shadow Mask
 Input / Output Devices or External or o Dot Pitch
Peripheral Devices o Monitor Resolutions
 The Input Output Interface o DPI
 The Device Controllers and its Structure o Interlacing
o Device Controller o Bandwidth
o Structure of an Input /Output  Liquid Crystal Displays (LCD)
Interface  Digital Camera
 Device Drivers  Sound Cards
 Input Output Techniques  Printers
o Programmed Input /Output o Classification of Printers
o Interrupt-Driven Input /Output o Print Resolutions
o Interrupt-Processing o Print Speed
o DMA (Direct Memory Access) o Print Quality
 Input Output Processors o Colour Management
 External Communication Interfaces  Modems
 Scanners
Unit 3: Secondary Storage Techniques o Resolution
o Dynamic Range/Colour Depth
 Secondary Storage Systems o Size and Speed
 Hard Drives o Scanning Tips
o Characteristics: Drive Speed, Access  Power Supply
Time, Rotation Speed SMPS (Switched Mode Power Supply)

33
 o Types of Micro-Instructions
BLOCK 3: The Central Processing Unit o Control Memory Organisation
o Micro-Instruction Formats
Unit 1: Instruction Set Architecture  The Execution of Micro-Program

 Instruction Set Characteristics Unit 5: Reduced Instruction Set Computer

 Instruction Set Design Considerations Architecture
o Operand Data Types
o Types of Instructions  Introduction to RISC
o Number of Addresses in an o Importance of RISC Processors
Instruction o Reasons for Increased Complexity
 Addressing Schemes o High Level Language Program
o Immediate Addressing Characteristics
o Direct Addressing  RISC Architecture
o Indirect Addressing  The Use of Large Register File
o Register Addressing  Comments on RISC
o Register Indirect Addressing  RISC Pipelining
o Indexed Addressing Scheme
o Base Register Addressing BLOCK 4: Assembly Language
o Relative Addressing Scheme Programming
o Stack Addressing Unit 1: Microprocessor Architecture
 Instruction Set and Format Design Issues
o Instruction Length  Microcomputer Architecture
o Allocation of Bits Among Opcode  Structure of 8086 CPU
and Operand o The Bus Interface Unit
o Variable Length of Instructions o Execution Unit (EU)
 Example of Instruction Format  Register Set of 8086
 Instruction Set of 8086
Unit 2: Registers, Micro-Operations o Data Transfer Instructions
and Instruction Execution o Arithmetic Instructions
o Bit Manipulation Instructions
 Basic CPU Structure o Program Execution Transfer
 Register Organization
Instructions
o Programmer Visible Registers o String Instructions
o Status and Control Registers
o Processor Control Instructions
 General Registers in a Processor  Addressing Modes
 Micro-operation Concepts o Register Addressing Mode
o Register Transfer Micro-operations o Immediate Addressing Mode
o Arithmetic Micro-operations o Direct Addressing Mode
o Logic Micro-operations o Indirect Addressing Mode
o Shift Micro-operations
 Instruction Execution and Micro-operations Unit 2: Introduction to Assembly
 Instruction Pipelining Language Programming
Unit 3: ALU Organisation
 The Need and Use of the Assembly
 ALU Organisation Language
o A Simple ALU Organization  Assembly Program Execution
o A Sample ALU Design  An Assembly Program and its Components
o Arithmetic Processors o The Program Annotation
o Directives
Unit 4: The Control Unit  Input Output in Assembly Program
 The Control Unit o Interrupts
 The Hardwired Control o DOS Function Calls (Using INT
 Wilkes Control 21H)
 The Micro-Programmed Control  The Types of Assembly Programs
 The Micro-Instructions o COM Programs
34
 o EXE Programs o Some More Arithmetic Problems
 How to Write Good Assembly Programs
Unit 4: Assembly Language Programming
Unit 3: Assembly Language Programming
(Part – I)
(Part – I)
 Simple Assembly Programs  Use of Arrays in Assembly
o Data Transfer  Modular Programming
o Simple Arithmetic Application o The stack
o Application Using Shift Operations o FAR and NEAR Procedures
o Larger of the Two Numbers o Parameter Passing in Procedures
 Programming With Loops and Comparisons o External Procedures
 Interfacing Assembly Language Routines to
o Simple Program Loops High Level Language
o Find the Largest and the Smallest  Programs
Array Values o Simple Interfacing
o Character Coded Data o Interfacing Subroutines With
o Code Conversion Parameter Passing
 Programming for Arithmetic and String  Interrupts
Operations  Device Drivers in Assembly
o String Processing

MCS-013: Discrete Mathematics 2 Credits

Objectives
Discrete mathematics, sometimes called finite mathematics, is the study of mathematical structure that are
fundamentally discrete, in the sense of not supporting notion of continuity. A study of discrete sets has
become more and more necessary because of many application of computer science and various areas of
engineering. In computer science, discrete mathematics are useful to study or express objects or problems in
computer algorithm and programming languages. For instance, to improve the efficiency of a computer
programs, we need to study its logical structure, which involves a finite number of steps each requiring a
certain amount of time. Using the theory of combinatory and graph theory, major areas of discrete
mathematics we can do this. Therefore, a study of these areas would complement and improve the
understanding of courses based on algorithm and problem solving.
This Course is designed to give basic concepts of Propositions, Predicates, Boolean Algebra, Logic Circuit,
Sets, Relations, Functions, Combinatorics, Partitions and Distributions.

Syllabus
o Direct Proof
BLOCK 1: Elementary Logic o Indirect Proofs
Unit 1: Prepositional Calculus o Counter Examples
 Propositions  Principle of Induction
 Logical Connectives
o Disjunction Unit 3: Boolean Algebra and Circuits
o Conjunction  Boolean Algebras
o Negation  Logic Circuits
o Conditional Connectives  Boolean Functions
o Precedence Rule
 Logical Equivalence BLOCK 2: Basic Combinatorics
 Logical Quantifiers
Unit 1: Sets, Relations and Functions
 Introducing Sets
Unit 2: Methods of Proof  Operations on Sets
 What is a Proof? o Basic Operations
 Different Methods of Proof
35
 o Properties Common to Logic and Unit 3: Some More Counting Principles
Sets
 Pigeonhole Principle
 Relations
 Inclusion-Exclusion Principle
o Cartesian Product
o Relations and their types  Applications of Inclusion – Exclusion
o Properties of Relations o Application to Surjective
Functions
 Functions
o Application to Probability
o Types of Functions
o Application to Derangements
o Operations on Functions
Unit 4: Partitions and Distributions
Unit 2: Combinatorics – An Introduction
 Integer Partitions
 Multiplication and Addition Principles
 Distributions
 Permutations
o Distinguishable Objects into
o Permutations of Objects not
Distinguishable Containers
Necessarily Distinct
o Distinguishable Objects into
o Circular Permutations
Indistinguishable Containers
 Combinations
o Indistinguishable Objects into
 Binomial Coefficients Distinguishable Containers
 Combinatorial Probability o Indistinguishable Objects into
Indistinguishable Containers

MCS-014: Systems Analysis and Design 3 Credits

Objectives

The objectives of the Course include the enabling of learner to identify the Software projects in an
organization after studying various functionalities in the organization. Also, they should be able to structure
various requirements, do the design and select the best method to develop the system. They should be able to
implement and maintain the system . The learners should also get acquainted with different quality standards
as well as learn about Management Information Systems.

Syllabus
 Users
BLOCK 1: Introduction to Systems  Analysts in various functional areas
Development o Systems Analyst in Traditional
Unit 1: Introduction to SAD Business
 Fundamentals of System o Systems Analyst in Modern Business
o Important Terms related to Systems  Role of a Systems Analyst
o Classification of Systems  Duties of a Systems Analyst
o Real Life Business Subsystems  Qualifications of a Systems Analyst
 Real Time Systems o Analytical Skills
 Distributed Systems o Technical Skills
 Development of a successful System o Management Skills
 Various Approaches for development of o Interpersonal Skills
Information Systems
o Structured Analysis and Design Unit 3: Process of System Development
Approach  Systems Development Life Cycle
o Prototype  Phases of SDLC
o Joint Application Development o Project Identification and
Unit 2: Systems Analyst-A Profession Selection
o Project Initiation and planning
 Why do Businesses need Systems o Analysis
Analysts? o Logical Design
36
 o Physical Design Unit 7: System Design and Modelling
o Implementation
 Logical and Physical Design
o Maintenance
 Process Modeling
 Product of SDLC Phases
o Data Flow Diagrams
 Approaches to Development
 Data Modeling
o Prototyping
o E-R Diagrams
o Joint Application Design
o Participatory Design  Process Specification Tools
o Decision Tables
 Case Study
o Decision Trees
Unit 4: Introduction to Documentation of o Notation Structured English
Systems  Data Dictionary
 Concepts and process of BLOCK 3: More Design Issues and CASE
 Documentation Tools
 Types of Documentation
o System Requirements Specification Unit 8: Forms and Reports Design
o System Design Specification
 Forms
o Test Design Document
o Importance of Forms
o User Manual
 Reports
 Different Standard for Documentation
o Importance of Reports
 Documentation and Quality of Software
 Differences between Forms and
 Good Practices for Documentation Reports
BLOCK 2: Planning and Designing Systems  Process of Designing Forms and
Reports
Unit 5 : Process of System Planning  Deliverables and Outcomes
 Design Specifications
 Fact finding Techniques o Narrative Overviews
o Interviews o Sample Design
o Group Discussion o Testing and Usability Assessment
o Site Visits  Types of Information
o Presentations o Internal Information
o Questionnaires o External Information
 Issues involved in Feasibility Study o Turnaround Document
o Technical Feasibility  General Formatting Guidelines
o Operational Feasibility o Meaningful Titles
o Economic Feasibility o Meaningful Information
o Legal Feasibility o Balanced Layout
 Cost Benefit Analysis o Easy Navigation
 Preparing Schedule  Guidelines for Displaying Contents
 Gathering Requirements of System o Highlight Information
o Joint Application Development o Using Colour
o Prototyping o Displaying Text
o Designing Tables and Lists
Unit 6: Modular and Structured Design
 Criteria for Form Design
 Design Principles o Organization
o Top Down Design o Consistency
o Bottom Up Design o Completeness
 Structure Charts o Flexible Entry
 Modularity o Economy
o Goals of Design  Criteria for Report Design
o Coupling o Relevance
o Cohesion o Accuracy
o Clarity
o Timeliness
37
 o Cost o Preparing Conversion Plan
o Installing Databases
Unit 9: Physical File Design and Data base o Training the end users
Design o Preparation of User Manual
 Introduction to Database design o Converting to the new System
o Flat files vs. Database  Maintenance of Systems
o Steps in Database Design o Different Maintenance activities
o E-R model to Database Design o Issues involved in Maintenance
o Inputs to Physical Database Design
o Guidelines for Database Design Unit 12: Audit and Security of Computer
 Design of Data Base Fields Systems
o Types of Fields  Definition of Audit
o Rules for Naming Tables and Fields o Objectives of Audit
 Design of Physical Records o Responsibility and Authority of the
 Design of Physical Files System Auditor
o Types of Files o Confidentiality
o File Organization o Audit Planning
 Design of Database  Audit of Transactions on Computer
 Case Study o Transaction Audit
o Audit of Computer Security
Unit 10: CASE Tools for Systems o Audit of Application
Development o Benefits of Audit
 Use of CASE tools by organizations  Computer Assisted Audit Techniques
o Definition of CASE Tools o Audit Software
o Use of CASE tools by Organizations o Test Data
o Role of CASE Tools o Audit Expert Systems
o Advantages of CASE Tools o Audit Trail
o Disadvantages of CASE Tools  Computer System and Security issues
 Components of CASE o Analysis of Threats and Risks
o Types of CASE Tools o Recovering from Disasters
o Classification of CASE Tools o Planning the contingencies
o Reverse and Forward Engineering o Viruses
 Visual and Emerging CASE tools  Concurrent Audit Techniques
o Traditional systems development and o Need for Concurrent Audit
CASE based systems development o Techniques
o CASE environment o An Integrated Test Facility
o Emerging CASE Tools o Techniques
o Objected oriented CASE tools o The Snapshot Techniques
o Creating documentation and reports o SCARF
using CASE tools o Continuous and Intermittent
o Creating and executable prototype o Simulation Technique
using Object Oriented CASE tools
o Sequence Diagrams Unit 13: Management Information Systems
 Role of MIS in an organization
BLOCK 4: Implementation and Security of  Different kinds of Information Systems
Systems & MIS o Transaction Processing System
o Management Information
Unit 11: Implementation and Maintenance
o System
of Systems o Decision Support System
 Implementation of Systems o Expert System
o Conducting System Tests

38
MCS-015: Communication Skills 2 Credits
Objectives
This Course is aimed to develop the communication skills 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, Negotiations and many more.

Syllabus
BLOCK 1: Skills Needed at the Work Place - I  Writing
Unit 4: Group Discussions
Unit 1: The Process of Communication
 Reading
 Introduction: What is Communication?
 Writing Skills
 The Process of Communication
 Listening: How to be Successful in a Group
 Barriers to Communication
Discussion
 Different Types of Communication
 Study Skills
 Written vs. Oral Communication
 Language Focus
 Different Types of Face-to-Face
 Vocabulary
Interactions
 Speaking
 Characteristics and Conventions of
Conversation  Grammar: Connectives
 Conversational Problems of  Pronunciation
Second/Foreign Language Users Unit 5: Managing Organisational
 Difference between Conversation and Structure
Other Speech Events
 Warm Up: Ability to Influence and Lead
Unit 2: Telephone Techniques  Reading: The Role of a Manager
 Warm Up  Vocabulary: Leadership
 Speaking and Listening: Commonly Used  Speaking and Listening
Phrases in Telephone Conversations  Language Focus: Degree of Probability
 Reading: Conference Calls  Grammar: Modals
 Vocabulary  Writing: Reports
 Writing and Listening: Leaving a Message  Pronunciation
 Grammar and Usage: The Perfect Tenses Unit 6: Meetings
 Pronunciation: Contracted Forms
 Reading: A Successful Meeting
Unit 3: Job Applications and Interviews  Speaking: One to One Meetings
 Warm up  Language Focus: Opening, Middle and
 Reading Close
 Vocabulary: Apply for a Job  Study Skills: Editing
 Curriculum Vitae  Listening: Criteria for Successful Meetings
 Language Focus: Some Useful Words  Vocabulary
 Study Skills: Preparing for an Interview  Grammar: Reporting Verbs
 Listening  Writing: Memos
 Speaking
39
 Pronunciation: Stress According to Part of  Pronunciation
Speech
Unit 9: Presentation Skills – II
Unit 7: Taking Notes and Preparing
 Reading: Structure of Presentation
Minutes
 Study Skills: Visual Aids
 Taking Notes
o The Note-taking Skill: The Essential  Ending the Presentation
Components  Language Focus: Talking about Increase
o The Note-taking Skill: An Example and Decrease
 Preparing Minutes  Grammar: Prepositions
o Format of Minutes  Listening: Podium Panic
o Language and Style of Minutes  Speaking
 Grammar: Using the Passive Voice  Pronunciation: Emphasizing the Important
Words in Context
Unit 8: Presentation Skills – I
Unit 10: Negotiation Skills
 Reading: Presentation Skills
 Grammar: Verbs often Required in  Language Focus: Idiomatic Expressions
Presentations  Study Skills: Process of Negotiations
 Language Focus  Grammar: Phrasal Verbs
 Listening: Importance of Body Language in  Listening: Effective Negotiations
Presentations  Speaking
 Speaking: Preparing an Outline of a  Writing
Presentation
MCSL-016: Internet Concepts and Web Design (Lab Course) 2 Credits
Objectives

The main objective of the Course is to introduce the whole range of web technologies starting from HTML,
DHTML, Java Script, VBScript, and Dreamweaver. It also gives a brief description on Internet. Through
various examples, the Course will describe how to design specific page, dynamic web page, forms and
frames. It also focuses on the practical aspects of these technologies.

Syllabus

BLOCK 1: Scripting Languages o Usenet and Newgroups

o FTP
Unit 1: The Internet o Telnet
o Internet Tools
 Classification of Networks
o Search Engines
 Networking Models
o Web Browser
 What is Packet Switching Unit 2: Introduction to HTML
 Accessing the Internet
 Internet Protocols  What is HTML
o Internet Protocol (IP)  Basic Tags of HTML
o Transfer Control Protocol (TCP) o HTML Tag
 Internet Address o TITLE Tag
o Structure of Internet Servers Address o BODY Tag
o Address Space  Formatting of Text
 How does the Internet work o Headers
 Intranet & Extranet o Formatting Tags
 Internet Infrastructure o PRE Tag
 Protocols and Services on Internet o FONT Tag
o Domain Name System o Special Characters
o SMTP and Electronic Mail  Working with Images
o HTTP and World Wide Web  META Tag

40
Unit 3: Advanced HTML Unit 5: VB Script
 Links  What is VBScript
o Anchor tag  Adding VBScript Code to an HTML Page
 Lists
o VB Script Basics
o Unordered Lists
o VBScript Data Types
o Ordered Lists
o VBScript Variables
o Definition Lists
o VBScript Constants
 Tables o VBScript Operators
o TABLE, TR and TD Tags
 Using Conditional Statements
o Cell Spacing and Cell Padding
 Looping Through Code
o Colspan and Rowspan
 VBScript Procedures
 Frames
o Frameset  VBScript Coding Conventions
o FRAME Tag  Dictionary Object in VBScript
o NOFRAMES Tag o Methods: VBScript Dictionary
 Forms Object
o FORM and INPUT Tag o VBScript Dictionary Object
o Text Box Properties
o Radio Button  Err Object
o Checkbox o Methods: VBScript Err Object
o SELECT Tag and Pull Down Lists o Properties: VBScript Err Object
o Hidden Unit 6: Dreamweaver
o Submit and Reset
 Some Special Tags  Using Dreamweaver
o COLGROUP  Create a Site Home Page
o THREAD, TBODY, TFOOT  Design a Page in Layout View
o _blank, _self, _parent, _top  Insert Images
o IFRAME  Insert Text
o LABEL  Work in Standard View
o Attribute for <SELECT>  View the Site Files
o TEXTAREA  Link your Documents
Unit 4: Introduction to JavaScript
BLOCK 2: Lab Manual
 JavaScript Variables and Data Types Section 1: HTML (Hypertext Markup
o Declaring Variables Language)
o Data Types
 Basic of HTML
 Statements and Operators
 How to Create HTML Document
 Control Structures
o Conditional Statements  Steps for Creating a Simple HTML
o Loop Statements Program
 Object-Based Programming Section 2: Advanced HTML
o Functions
 Advanced Topics of HTML
o Executing Deferred Scripts
o Objects Section 3: JavaScript
 Message box in Javascript
 Script Basics
o Dialog Boxes
o Alert Boxes  Incorporating JavaScript into a Web Page
o Confirm Boxes Section 4: VBScript
o Prompt Boxes
 Javascript with HTML  VBScript Basics
o Events  Incorporating VBScript into HTML Page
o Event Handlers Section 5: Dreamweaver
 Forms
o Forms Array  How to Work in Dreamweaver??

41
 How to save your file?  Adding CSS Style to your Page
 Adding Layers to the Timeline and Giving  Adding XML Files to your Page
Motion to the Layer  To Export a Dreamweaver Document as
 Inserting Scripts XML File, checking entries, working in
 Inserting External Media in the Web Page frames, windows control, the Java script
 Adding SSI(Server-side include to the URL.
Page)

MCSL -017: Lab (C and Assembly Language Programming) (Lab Course) 2 Credits

Objectives

This lab Course is completely based on MCS-011 and MCS-012 courses. The basic objective of the Course
is to provide hands on experience on C Programming and Assembly Language Programming and improve
the practical skill. Also to apply all the concepts that have been covered in the theory courses MCS-011 and
MCS – 012. The learner will try to apply the alternate ways to provide the solution to a given problem. The
learner will be able to develop the logic for the given problem, recognize and understand the syntax and
construction of C code, gains experience of C and Assembly Language Programming, know the steps
involved in compiling, linking and debugging C code, feel more confident about writing the C functions,
including the writing of some complex programs.

Syllabus

Section 1 C Programming Lab  A Revisit of Steps of Logic Circuit Design

 Salient Features of C  Session-wise problems
 C Programming Using Borland Compiler Section 3 Assembly Language
 Using C with UNIX Programming
 Running C Programs using MS Visual C++  Assemblers
 Program Development Life Cycle o Turbo Assembler (TASM)
 List of Lab Assignments – Session wise o MASM
o Emu 8086
Section 2 Digital Logic Circuits o The DEBUG Program
 Assembly Programming File
 Logic Gates Circuit Simulation Program  Session-wise List of Programs
 Making a Logic Circuit Using Logic

MCS-021: Data and File structures 4 Credits

Objectives

The learner should be well versed with the fundamentals of Algorithms, learn various data structures, 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
learner should have the knowledge about file structures and finally, s/he should also know the concepts of
advanced data structures.

Syllabus  Process of Analysis

 Calculation of Storage Complexity
BLOCK 1: Introduction to Algorithms and  Calculation of Run Time Complexity
Data Structures
Unit 1: Analysis of Algorithms Unit 2 Arrays

 Mathematical Background  Arrays and Pointers

 Sparse Matrices
42
 Polynomials  Applications
 Representation of Arrays
o Row Major Representation BLOCK 3: Graph Algorithms and Searching
o Column Major Representation Techniques
 Applications Unit 7: Advanced Trees
Unit 3: Lists  Binary Search Trees
 Abstract Data Type-List o Traversing a Binary Search Trees
 Array Implementation of Lists o Insertion of a node into a Binary
Search Tree
 Linked Lists-Implementation
o Deletion of a node from a Binary
 Doubly Linked Lists-Implementation
Search Tree
 Circularly Linked Lists-Implementation
 AVL Trees
 Applications o Insertion of a node into an AVL Tree
o Deletion of a node from and AVL
BLOCK 2: Stacks, Queues and Trees Tree
Unit 4: Stacks o AVL tree rotations
o Applications of AVL Trees
 Abstract Data Type-Stack
 B-Trees
 Implementation of Stack o Operations on B-Trees
o Implementation of Stack using o Applications of B-Trees
Arrays
o Implementation of Stack using Unit 8: Graphs
Linked Lists
 Algorithmic Implementation of Multiple  Definitions
Stacks  Shortest Path Algorithms
 Applications o Dijkstra’s Algorithm
o Graphs with Negative Edge costs
Unit 5: Queues o Acyclic Graphs
 Abstract Data Type-Queue o All Pairs Shortest Paths Algorithm
 Implementation of Queue  Minimum cost Spanning Trees
o Array Implementation o Kruskal’s Algorithm
o Linked List Implementation o Prims’s Algorithm
 Implementation of Multiple Queues o Applications
 Implementation of Circular Queues  Breadth First Search
o Array Implementation  Depth First Search
o Linked List Implementation of a  Finding Strongly Connected Components
circular queue Unit 9: Searching
 Implementation of DEQUEUE
o Array Implementation of a  Linear Search
dequeue  Binary Search
o Linked List Implementation of  Applications
a dequeue
BLOCK 4: File Structures and Advanced
Unit 6: Trees Data Structures
 Abstract Data Type-Tree
 Implementation of Tree Unit 10 Sorting
 Tree Traversals
 Binary Trees  Internal Sorting
 Implementation of Binary Tree o Insertion Sort
 Binary Tree Traversals o Bubble Sort
o Recursive Implementation of Binary o Quick Sort
Tree Traversals o 2-way Merge Sot
o Non Recursive Implementations of o Heap Sort
Binary Tree Traversals  Sorting on Several Keys
43
Unit 11: Advanced Data Structures  Terminology
 Splay Trees  File Organisation
o Splaying steps  Sequential Files
o Splaying Algorithm o Structure
 Red-Black trees o Operations
o Properties of a Red-Black tree o Disadvantages
o Insertion into a Red-Black tree o Areas of use
o Deletion from a Red-Black tree  Direct File Organisation
 AA-Trees  Indexed Sequential File Organisation

Unit 12: File Structures

MCS-022: Operating System Concepts and Networking Management 4 Credits

Objectives

This Course is intended to introduce the concepts, structure, features, trends and design mechanism of
Operating System. The Operating System has seen consistent innovations and developments like other fields
of computer science. In this Course efforts have been to capture these changes. The trend is towards GUI
based free, platform independent, secure and network-based operating system. Linux and Windows 2000
have got very wide coverage in the Course. Security and network management, a part of modern Operating
System design, have also been taken up.

Syllabus
 Classification of Advanced Operating
BLOCK 1: Operating System Fundamentals System
Networking o Architecture Driven Operating
Unit 1: Graphical User Interface System
o Application Driven Operating
 What is Graphical User Interface System
 Evolution of Human and Machine  Characteristics of Modern Operating
Interaction System
 Common Graphical User Interfaces o Microkernel Architecture
 Functionality of Graphical User Interface o Multithreading
 GUI Design Consideration: psychological o Symmetric Multiprocessing
factors
 GUI Design Consideration: standards Unit 3: Introduction to Networking
 GUI Example Concepts
o Microsoft Windows  Why Computer Networks
o Macintosh Toolbox  The Topologies
o X-windows  Characteristics of the OSI Layers
o NeXT  OSI Models and Communication between
Unit 2: Introduction to Operating System Systems
 Interaction between OSI Model Layers
 What is an Operating System?  Protocols Types of Networks
 Evolution of Operating System o Local Area Network (LANs)
o Serial Processing o Metropolitan Networks (MANs)
o Batch Processing o Wide Area Network (WANs)
o Multiprogramming  Medium
 Operating System Structure  Data Flow
o Layered Structure Approach
 Physical Connection
o Virtual Machine
 Transmission Media
o Client-Server Model
o Kernel Approach  Connecting Devices
o Repeaters
44
 o Hubs Unit 3: Linux Utilities and Editor
o Bridges
 Some Useful Commands
o Routers
o Gateways  Permission Modes and Standard Files
 Pipes, Filters and Redirection
Unit 4: Internetworking: Concept,  Shell Scripts
Architecture and Protocols  Graphical User Interface
 History of internetworking  Editor
 Packet Switching Unit 4: User-to-User Communication
 Internetworking Concepts
 Internet Addresses Object-Based  On-Line Communication
Programming  Off-Line Communication
 Configuring IP Addresses  Apache Server Settings
 TCP/ IP  Network Server Settings
 Additional TCP/ IP – Related Protocols o Domain Name Server
 Application Layer Protocols o Network File Server
o File Transfer Protocols
o Trivial File Transfer Protocol Unit 5: Unix System Administration
(TFTP)  System Administration
o TELNET  Installing Linux
o Remote login  Choosing an Installation Method
o Electronic Mail (Email)  Choosing an Installation Class
 World Wide Web  Pre-installation checks
 Domain Name System  Installation
 SNMP and UDP  Booting the System
 Maintaining User Accounts
BLOCK 2: Linux Operating System
 File Systems and Special Files
Unit 1: Introduction to Linux Operating  Backups and Restoration
System
BLOCK 3: Windows 2000
 Features of Linux
Unit 1: Windows 2000 Networking
 Drawbacks of Linux
 Components of Linux  Windows 2000 Operating System
o Memory Management Subsystems Architecture
o Linux Process and Thread o Peer-To-Peer Network
Management o Domains
o File Management System o Network Protocols
o Device Drivers o File Services
o Shared Folders
Unit 2: Linux Commands and Utilities
o Distributed File System
 Entering the Machine o Print Services
o User Names and Groups  Using the Mapped Drive
o Logging In o Printing a Mapped Drive
o Correcting Typing Mistakes o Disconnecting a Mapped Drive
o Format of Linux Commands o Viewing Directory Information
o Changing Your Password o Creating a Shared Folder
o Characters with Special Meanings o Logging off a Client
o Linux Documentation  A Few Important Facts About Windows
 The File System 2000 Usages
o Current Directory
o Looking at the Directory Contents
o Absolute and Relative Pathnames Unit 2: Managing Windows 2000 Server
o Some Linux Directories and Files
 Using Windows 2000 and Client
 Logging on to the Network
45
 Browsing Network Resources Unit 2: Computer Security
 Accessing Network Resources Using My  Hardening Operating System and
Network Places Application Code
 Mapping a Folder  Hardening File System Security
Unit 3: Advanced Windows 2000  Hardening Local Security Policies
Networking  Hardening Services
 Windows 2000 Domains, Workgroups &  Hardening Default Accounts
Trusted Relationships  Hardening Network Activity
o Concept of Domains o Malicious Code
o Trust Relationships o Firewall
o Building Domains  Fault Tolerant System
 User Administration  BACKUP and UPS
 Remote Access Unit 3: Security and Management-I

Unit 4: Windows XP Networking  Main Issues In Windows Security

Management
 Introduction to Windows XP Networking o Physical Security Management
o TCP/IP Protocol Setting for o Logon Security Management
Windows XP o Users and Groups Management
o To Select a Network Protocol o Managing Local and Global Groups
o Virtual Private Networks and o Managing User Accounts
Remote Networking o Windows NT Domain Management
 Windows XP in File System  Domain Controller
 Sharing Network Resources in Windows o The Primary Domain Controller
XP (PDM)
o Sharing Files in Windows XP o Backup Domain Controller (BDC)
o Sharing Folders in Windows XP  Windows Resources Management
o Sharing Drives in Windows XP  Registry Management
 Enabling Offline File Features o Removing Registry Access
BLOCK 4: Security and Management o Managing Individual Keys
o Audit Registry Access
Unit 1: Security Concepts
 Printer Management
 Goals of Computer Security  Managing Windows 2000 Operating
o Integrity System
o Confidentiality  Active Directory
o Availability o Logical Structure
 Security Problem and Requirements o Physical Structure
o Identifying the Assets  Windows 2000 DNS Management
o Identifying the Threats  Managing Group Policy
o Identifying the Impact
 Threat and Vulnerabilities Unit 4: Security and Management-II
 User Authentication  User Authentication Management
 Security System and Facilities o Subsystems Component
o System Access Control Management
o Password Management o Kerberos Management
o Privileged User Management  User and Group Management
o User Account Management o Configuring User Accounts
o Data Resource Protection o Creating Domain User Accounts
o Sensitive System Protection o Managing Logon Hours
 Cryptography o Managing Expiry Date for a User
 Intrusion detection Account
 Computer-Security Classifications o Windows 2000 Groups Management
o Default Group Types

46
 o Security Configuration Management o Printer Security Management
Tool  Windows 2000 Network – Security and
 Resource Management Management
o NAT and ICS
o Files and Folder Management
o RRAS, RADIUS and IAS
o Files and Folder Permission
o IPSec
o Inheritances and Propagation
o Moving Data and Permission  Encrypting File System Management
o Shared Resources Management o Encrypting File System (EFS)
o The NULL Session o EFS and Users Management
o Registry Management o Data Recovery Management
o Default Registry Configurations o EFS Cryptography Management
o Registry Backup Managements

MCS-023: Introduction to Database Management Systems 3 Credits

Objectives
Database systems are pervasive. They are present in every segment of commercial, academic and virtual
world. They are required as the backbone of any information system, enterprise resource planning, research
activities and other activity that require permanence of data storage. This Course provides the basic
introduction to database system technologies; and concurrency, security and recovery issues of database
management systems.
This Course also provides the basic conceptual background necessary to design and develop simple database
systems. The major focus in this Course is the relational database model; however, it also discusses about
the ER model and distributed databases. This Course enables you to write good queries using a standard
query language called SQL.

Syllabus

BLOCK 1: The Database Management System Concepts

Unit 1: The Basic Concepts

 Need for a Database Management System

o The file based system Unit 2: Relational And ER Models
o Limitations of file based system
o The Database Approach
 The Logical DBMS Architecture  The Relational Model
o Three level architecture of DBMS or o Domains, Attributes, Tuple and
logical DBMS architecture Relation
o Mappings between levels and data o Super keys Candidate keys and
independence Primary keys for the Relations
o The need for three level architecture
 Relational Constraints
 Physical DBMS Architecture
o DML Precompiler o Domain Constraint
o DDL Compiler o Key Constraint
o File Manager o Integrity Constraint
o Database Manager o Update Operations and Dealing with
o Query Processor Constraint Violations
o Database Administrator  Relational Algebra
o Data files indices and Data o Basic Set Operation
Dictionary o Cartesian Product
 Commercial Database Architecture o Relational Operations
 Data Models  Entity Relationship (ER) Model
o Entities
47
 o Attributes BLOCK 2: Structured Query Language and
o Relationships Transaction Management
o More about Entities and
Unit 1: The Structures Query Language
Relationships
o Defining Relationship for College  What is SQL?
Database  Data Definition Language
 E-R Diagram  Data Manipulation Language
 Conversion of E-R Diagram to Relational  Data Control
Database  Database Objects: Views, Sequences,
Unit 3: Database Integrity and Indexes and Synonyms
Normalisation o Views
o Sequences
 Relational Database Integrity o Indexes and Synonyms
o The Keys  Table Handling
o Referential Integrity  Nested Queries
o Entity Integrity
 Redundancy and Associated Problems Unit 2: Transactions and Concurrency
Management
 Single-Valued Dependencies
 Single-Valued Normalisation  The Transactions
o The First Normal Form  The Concurrent Transactions
o The Second Normal Form  The Locking Protocol
o The Third Normal Form o Serialisable Schedules
o Boyce Codd Normal Form o Locks
 Desirable Properties of Decomposition o Two Phase Locking (2PL)
o Attribute Preservation  Deadlock and its Prevention
o Lossless-join Decomposition  Optimistic Concurrency Control
o Dependency Preservation
o Lack of redundancy Unit 3: Database Recovery and Security
 Rules of Data Normalisation
o Eliminate Repeating Groups  What is Recovery?
o Eliminate Redundant Data o Kinds of failures
o Eliminate Columns Not Dependent o Failure controlling methods
on Key o Database errors
 Recovery Techniques
Unit 4: File Organisation in DBMS  Security & Integrity
 Physical Database Design Issues o Relationship between Security and
 Storage of Database on Hard Disks Integrity
 File Organisation and Its Types o Difference between Operating
o Heap files (Unordered files) System and Database Security
o Sequential File Organisation  Authorization
o Indexed (Indexed Sequential) File
Organisation Unit 4: Distributed and Client Server
o Hashed File Organisation Databases
 Types of Indexes  Need for Distributed Database Systems
 Index and Tree Structure  Structure of Distributed Database
 Multi-key File Organisation99  Advantages and Disadvantages of DDBMS
o Need for Multiple Access Paths o Advantages of Data Distribution
o Multi-list File Organisation o Disadvantages of Data Distribution
o Inverted File Organisation  Design of Distributed Databases
 Importance of File Organisation in o Data Replication
Databases o Data Fragmentation
 Client Server Databases

48
 o Emergence of Client Server  Developing Front End Forms
Architecture
o Need for Client Server Computing  Reports
o Structure of Client Server Systems  Using Queries and Record set
o Advantages of Client Server Systems
BLOCK 4: Study Centre Management
BLOCK 3: Application Development: System: A Case Study
Development of a Hospital Management
 Software Development Process: Analysis
System
 System Designing
 Need to Develop the Hospital Management  Issues relating to Software Development,
System (An HMS) Testing and Maintenance
 Creating a Database for HMS
MCS-024: Object Oriented Technology and Java Programming 3 Credits
Objectives

Today almost every branch of computer science is feeling presence of object- orientation. Object oriented
technology is successfully incorporated in various fields of computer science. Since its arrival on the scene
in 1995, the Java has been accepted as one of the primary programming language.

This Course is designed to give you exposure to basic concepts of object-oriented technology. It will help in
learning to write programs in Java using object-oriented paradigm. Approach in this Course is to take Java as
a language that is used as a primary tool in many different areas of programming work.

Syllabus

BLOCK 1: Object Oriented Technology and Java

Unit 1: Object Oriented Methodology-1 o Character and Boolean Types

o Declaring and Initialization
 Paradigms of Programming Languages
Variables
 Evolution of OO Methodology
 Java Operators
 Basic Concepts of OO Approach
 Comparison of Object Oriented and Unit 4: Expressions, Statements and
Procedure Oriented Approaches Arrays
 Benefits of OOPs  Expressions
 Introduction to Common OO Language  Statements
 Applications of OOPs  Control Statements
 Selection Statements
Unit 2: Object Oriented Methodology-2  Iterative Statements
 Classes and Objects  Jump Statements
 Abstraction and Encapsulation  Arrays
 Inheritance
 Method Overriding and Polymorphism BLOCK 2: Object Oriented Concepts and
Exceptions Handling
Unit 3: Java Language Basics
Unit 1: Class and Objects
 Introduction To Java
o Basic Features  Class Fundamentals
o Java Virtual Machine Concepts o Creating objects
o A Simple Java Program o Assigning object reference variables
 Primitive Data Type And Variables  Introducing Methods
o Java Keywords o Static methods
o Integer and Floating Point Data o Constructors
Type  Overloading constructors
o This Keyword
49
 o Using Objects as Parameters  I/O Stream Classes
o Argument passing o Input and Output Stream
o Returning objects o Input Stream and Output Stream
 Method Overloading Hierarchy
 Garbage Collection  Using Package Members
 The Finalize ( ) Method  Interfaces
Unit 2: Inheritance and Polymorphism  Implementing Interfaces
 Interface and Abstract Classes
 Inheritance Basics  Extends and Implements Together
 Access Control
 Multilevel Inheritance Unit 4: Exceptions Handling
 Method Overriding  Exception
 Abstract Classes  Handling of Exception
 Polymorphism o Using try-catch
 Final Keyword o Catching Multiple Exceptions
Unit 3: Packages and Interfaces o Using finally clause
 Types of Exceptions
 Package  Throwing Exceptions
o Defining Package  Writing Exception Subclasses
o CLASSPATH  Text Streams
o Package naming  Stream Tokenizer
 Accessibility of Packages  Serialization
 Buffered Stream
BLOCK 3: Multithreading, I/O and String
 Print Stream
Handling
 Random Access File
Unit 1: Multithreaded Programming
BLOCK 4: Applets Programming and
 Multithreading: An Introduction Advance Java Concepts
 The Main Thread
Unit 1: Applets
 Java Thread Model
 Thread Priorities  The Applet Class
 Synchronization in Java  Applet Architecture
 Interthread Communication  An Applet Skeleton: Initialization
and Termination
Unit 2 : I/O in Java
 Handling Events
 I/O Basics  HTML Applet Tag
 Streams and Stream Classes Unit 2: Graphics and User Interfaces
o Byte Stream Classes
o Character Stream Classes  Graphics Contexts and Graphics Objects
 The Predefined Streams o Color Control
 Reading from, and Writing to, Console o Fonts
 Reading and Writing Files o Coordinate System
 The Transient and Volatile Modifiers  User Interface Components
 Using Instance of Native Methods  Building User Interface with AWT
 Swing-based GUI
Unit 3: Strings and Characters  Layouts and Layout Manager
 Fundamentals of Characters and Strings  Container
 The String Class
 String Operations Unit 3: Networking Features
 Data Conversion using Value Of ( )  Socket Overview
Methods  Reserved Parts and Proxy Servers
 String Buffer Class and Methods  Internet Addressing: Domain
Unit 4: Exploring Java I/O  Naming Services (DNS)
 Java I/O Classes and Interfaces  JAVA and the net: URL
50
 TCP/IP Sockets o RMI Architecture
 Datagrams o RMI Object Hierarchy
o Security
Unit 4: Advance Java
 Java Servlets
 Java Database Connectivity o Servlet Life Cycle
o Establishing A Connection o Get and Post Methods
o Transactions with Database o Session Handling
 An Overview of RMI Applications  Java Beans
o Remote Classes and Interfaces

MCSL-025: Lab (Data Structures using C, WINDOWS 2000, LINUX / UNIX, Java and
MS-ACCESS, My SQL) 4 Credits

Objectives

This Lab Course is based on the courses MCS-021, MCS-022, MCS-023 and MCS-024. It involves the
development of the practical skills in Data structures using C programming, Networking, DBMS and Java
Programming. Theoretical aspects were already covered in the respective theory courses. This course is an
attempt to upgrade and enhance your theoretical skills and provide the hands on experience. By the end of
these practical sessions of this Course, you will be able to write programs using basic data structures such as
Arrays etc. as well as advanced data structures such as trees etc.

Syllabus

SECTION 1: Data and File Structures Lab  LINUX administration

Manual  Unix Networking
 Arrays  Installation and Configuration of the
 Structures networking services like TCP/IP, DNS,
 Linked Lists DHCP, FTP, SMTP
 Stacks
 Queues SECTION 3: DBMS Lab
 Trees
 Advanced Trees  Introduction to MS-Access
 Graphs  Database Creation
 Searching  Use of DBMS Tools/ Client-Server Mode
 Sorting  Forms and Procedures

SECTION 2: Operating Systems and SECTION 4: Java Programming Lab

Networking Lab
 Programming with Java
 Overview of Windows 2000  PATH and CLASSPATH Setting
 Unix and Linux  Example Programs
 Advanced concepts of Local Area Network  List of Lab Assignments
 Network administration of Windows 2000

MCS-031: Design and Analysis of Algorithms 4 Credits

Objectives

Algorithm is the central concept of computer science. Whole of computer science can be thought of as
revolving around the concept of algorithm - the machines are designed and fabricated to execute algorithms;
the programming languages are defined to describe algorithms so that the machines can understand and
execute programs written in programming languages; the foundation/theory of Computer Science is the

51
study of the limits of algorithmic methods, i.e., the study tells whether a particular task is accomplishable by
a computer or not, etc.

Hence, the study of the Design and Analysis of Algorithm has to be an essential part of any Computer
Science/Engineering curriculum. Even if, software for solving all types of problems may become available
in the future and the user/student may not be required to write an algorithm to solve any problem, still
training the students in the skills of designing and analyzing the algorithms will remain essential, because
these constitute the fundamental skills for solving problems with computers. It is like teaching of geometry
to instill in students the skills of logical reasoning.

The objectives of the Course is to make the students aware of and well-groomed in the use of the tools &
Techniques of designing and analyzing algorithms.

Syllabus

BLOCK 1 Introduction to Algorithmics  Integer Multiplication

Unit 1: Elementary Algorithmics  Binary Search
 Sorting
 Example of an Algorithm  Finding the Median
 Problems and Instances  Matrix Multiplication
 Characteristics of an Algorithm  Exponentiation
 Problems, Available Tools & Algorithms
Unit 2: Graphs Algorithms
 Building Blocks of Algorithms
 Examples
 Outline of Algorithms
 Traversing Trees
Unit 2: Some pre-rquisites and  Depth-First Search
Asymptotic Bounds  Breadth-First Search
 Some Useful Mathematical Functions &  Best-First Search & Minimax Principle
Notations
 Topological Sort
 Mathematical Expectation
 Principle of Mathematical Induction BLOCK 3 Design Techniques - II
 Concept of Efficiency of an Algorithm
Unit 1 Dynamic Programming
 Well Known Asymptotic Functions &
Notations  The Problem of Making Change
Unit 3: Basics of Analysis  The Principle of Optimality
 Chained Matrix Multiplication
 Analysis of Algorithm ─ Simple Example  Matrix Multiplication Using Dynamic
 Well Known Sorting Algorithms Programming
 Best-Case and Worst-Case Analyses
 Analysis of Non-Recursive Control
Unit 2 Greedy Algorithms
Structures  Some Examples
 Recursive Constructs  Formalization of Greedy Technique
 Solving Recurrences  Minimum Spanning Trees
 Average-Case & Amortized Analyses  Prim’s Algorithm
 Kruskal’s Algorithm
BLOCK 2 Design Techniques-I  Dijkstra’s Algorithm
Unit 1: Divide-and-Conquer

 General Issues in Divide-And Conquer

52
Unit 3 Models for Executing Algorithms –I:  Instantaneous Description and Transition
FA Diagram
 Regular Expressions  Some Formal Definitions
 Regular Languages  Observations
 Finate Automata  Turing Machine as a Computer of Functions

Unit 4 Models for Executing Algorithms –II Unit 2 Algorithmically Unsolvable Problems
PDFA & CFG  Decidable And Undecidable Problems
 Formal Language & Grammer  The Halting Problem
 Context Free Grammer(CFG)  Reduction to Another Undecidable Problem
 Pushdown Automata (PDA)  Undecidable Problems for CFL
BLOCK 4 Complexity & Completeness  Other Undecidable Problems
Unit 1: Models for Executing Algorithms – Unit 3 Complexity of Algorithms
III :TM
 Notations for the Growth Rates of
 Prelude to Formal Definition Functions
 Turing Machine: Formal Definition and
Examples

MCS-032: Object Oriented Analysis and Design 3 Credits

Objectives

Object oriented analysis and design has emerged as a new 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.

Syllabus
o Functional Modeling
BLOCK 1: Object Oriented Modeling and  Adding Operations
UML  Analysis Iteration
Unit 1: Introduction to Object Oriented
Modelling
Unit 3: Using UML
 Object Oriented Modeling  UML: Introduction
 Characteristics Object Oriented Modeling  Object Model Notations:
o Class and Objects
 Basic Concepts
o Links and Association
 Structural Diagrams
o Generalization and Inheritance
o Class
 An Object Model
o Object
 Benefits of OO Modeling o Composite
 Introduction to OOAD tools o Package
o Component
Unit 2: Object Oriented Analysis o Deployment
 Object Oriented Analysis  Behavioral Diagrams:
 Problem Statement: an Example o Use Case
 Differences between Structured Analysis o Communication
and Object Oriented Analysis o Sequence
 Analysis Techniques o Interaction Overview
o Object Modeling o Activity
o Dynamic Modeling o State
53
 Modeling with Objects Unit 8: Dynamic Modeling
 Events
BLOCK 2: Object Oriented Design  State and State Diagram
Unit 4: System Design  Elements of State Diagrams
 System Design: An Object Oriented  Examples of State Diagrams
Approach  Advance Concepts in Dynamic Modeling
 Breaking into Subsystems  Concurrency
 Concurrency Identification  A Dynamic model
 Management of data store Unit 9: Functional Modeling
 Controlling events between Objects
 Handling Boundary Conditions  Functional Models
 Data Flow Diagrams
Unit 5: Object Design  Features of a DFD
 Object Design for Processing  Design flaws in DFD
 Object Design Steps  A Functional model
 Designing a Solution  Relationship between Object, Dynamic,
 Choosing Algorithms and Functional Models
 Choosing Data Structures Block 4: Implementation
 Defining Classes and delegation of
Responsibilities to Methods Unit 10: Implementation Strategies

Unit 6: Advance Object Design  Implementation

o Using Programming Languages
 Control and its Implementation o Using Database System
o Control as a State within Program  Unidirectional Implementation
o Control as State Machine Engine  Bi-directional Implementation
o Control as Concurrent Task  Implementing associations
 Inheritance Adjustment  Implementing Constraints
 Association: Design  Implementing Statecharts
 Object Representation  Persistency
 Design Optimization Unit 11: Object Mapping with Databases
 Design Documentation
 Relational Database Schema for Object
BLOCK 3: Modeling Modes
Unit 7: Object Modeling  Object Classes to Database Tables
 Mapping Associations to Tables
 Advance Modeling Concepts
 Mapping Generalizations to Tables
o Aggregation
o Abstract Class  Interfacing to Database
 Multiple Inheritance  Object Mapping with Databases:
an Example
 Generalization as an Extension
 Generalization as a Restriction Unit 12: Case Study
 Metadata  This unit will cover all the OOAD aspects
 Constraints Covered in previous 11(eleven) units of this
 An Object Model course.

MCS-033 Advanced Discrete Mathematics 2 credits

Objectives
This Course assumes the knowledge of the course MCS-013, “Discrete Mathematics”. In the two blocks of
this Course, we discuss recursion and graph theory, respectively. The first Block is aimed at developing the
understanding of a very important tool for analyzing recursive programmes, namely, recurrence relations. In

54
the second Block we aim to develop a basic understanding of graph theory, which is a very useful modeling
tool for computer programming.

Syllabus
BLOCK 1: Recurrences
BLOCK 2: Graph Theory
Unit 1: Recurrence Relations Unit 1: Basic Properties of Graphs
 The Fibonacci Sequences, The Tower of  What Graphs are
Hanoi, Catalan Numbers  Degree, Regularity and Isomorphism
 Related Definitions  SubGraphs
 Divide and Conquer Methods
Unit 2 Connectedness
Unit 2 Generating Functions
 Connected Graphs
 Definitions and Constructions o Paths, Circuits and Cycles
 Applications for Finding the Number of o Components
Integers Solutions of Linear Equations o Connectivity
 Exponential Generating Functions  Bipartite Graphs
 Solving Recurrence Relations using Unit 3 Eulerian and Hamiltonian Graphs
Generating Functions
 Applying Generating Functions for  Eulerian Graphs
Combinatorial Identities and Partitions  Hamiltonian Graphs
 Travelling Salesperson Problem
Unit 3 Solving Recurrences
Unit 4 Graph Colourings
 Linear Homogeneous Recurrences
 Linear Non- Homogeneous Recurrences  Vertex Colouring
 Methods of Inspection, Telescoping Sums,  Edge Colouring
Iteration, Substitution  Planar Graphs
 Map Colouring Problem

MCS-034: Software Engineering 3 Credits

Objectives

The objectives 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. The learner should be able to apply
the concepts learned for doing research.

Syllabus
BLOCK 1 : Overview of Software Unit 3 Software Design
Engineering  Data design
Unit 1 Software Engineering and its  Architectural design
models  Interface design
 Evolution of Software Engineering  HCI design
 Software development models  Modular design
 Capability maturity models Unit 4 Software testing
 Software process technology
 Testing techniques
Unit 2: Principles of Software  Testing for specialized environments
Requirements Analysis  Debugging
 Engineering the product BLOCK 2: Software Project Management
 Modeling the system architecture Unit 5: Software Project Planning
 Software prototyping and specification  Different types of project metrics

55
 Software project estimation  Different layers
 Models for estimation  Issues of management of web based
 Automated tools for estimation projects
 Metrics
Unit 6: Risk management and Project  Analysis
Scheduling  Design
 Identification of Software risks  Testing
 Monitoring of risks
 Management of risks Unit 10: Mobile Software Engineering
 Formulating a task set for the project  Transition from design to coding of mobile
 Choosing the tasks of software engineering applications
 Scheduling methods  Elements of mobile applications
 The Software project plan  Approaches to the development of mobile
applications
Unit 11: CASE tools
Unit 7 Software Quality Assurance
 Analysis tools
 Formal technical reviews
 Design tools
 Software reliability
 SQA tools
 Software quality standards
 UI design tools
Unit 8 Software change management  Software testing tools
 Baselines  Web engineering tools
 Version control Unit 12: Advanced Software Engineering
 Change control\
 Clean room Software engineering
 Auditing and reporting
 Component based Software engineering
 Re-engineering
BLOCK 3: Advanced Software Engineering
 Reverse engineering
Unit 9: Web Software Engineering

MCS-035: Accountancy and Financial Management 3 Credits

Objectives

This Course aims at introducing the basic accounting procedures and financial management processes. It
also focuses on the computerised implementation of the various accounting principles discussed at different
levels.

Syllabus
BLOCK 1: Accounting System  Accounting Concepts
 Accounting Standards
Unit 1: Accounting and its Functions  Changing Nature of Generally Accepted
 Scope of Accounting  Accounting Principles (GAAP)
 Emerging Role of Accounting  Attempts towards Standardisation
 Accounting as an Information System  Accounting Standards in India
 Role and Activities of an Accountant Unit 3: Basic Accounting Process:
 Accounting Personnel Preparation of Journal, Ledger
 Nature of Accounting Function and Trial Balance
 Organisation Chart for Accounting and
 Accounting Equation
 Finance
 Classification of Accounts
Unit 2: Accounting Concepts and Standards  Definitions of Journal and
 Accounting Framework Ledger
o Journalising Process
56
 o Ledger Posting o Activity or Turnover Ratios
o Balancing an Account o Profitability Ratios
 Trial Balance o Market Test Ratios
 Objectives of Preparing Trial Balance
o Total Method of Preparing the BLOCK 3: Financial Management and
Trial Balance Decisions
o Balance Method of Preparing the
Trial Balance Unit 1: Introduction to Financial
o Limitations of Trial Balance Management
 Accounting Cycle  Evolution of Financial Management
BLOCK 2: Understanding and Analysis of  Significance of Financial Management
Financial Statements  Principles of Financial Management
 Economic Value Added
Unit 1: Preparation and Analysis of Final  Agency Relationship
Accounts
 Changing Financial Landscape
 Trading Account
o Opening/Closing Stock
Unit 2: Time Value of Money and
o Net Purchases Investment Decisions
o Direct Expenses
 Determining The Future Value
o Net Sales
o Shorter Compounding Period
 Profit And Loss Account o Effective versus Nominal Rates
 Difference between Trading and Profit & o Continuous Compounding
Loss Account  Annuity
 Balance Sheet
 Constructing a Balance Sheet Unit 3: Working Capital Decisions
 Classification of Balance Sheet’s Items  Characteristics of Current Assets
 Adjustment Entries  Operating Cycle Concepts
 Factors Influences Working Capital
o Closing Stock Environment
o Depreciation  Estimating working capital Requirement
o Bad Debts BLOCK 4: Working Capital Management
o Provision for Bad and Doubtful
Debts Unit 1: Cash and Treasury Management
o Salaries and Wages  Treasury Management
o Outstanding Expenses o Treasury Risk Management
o Prepaid Expenses o Functions of Treasury Department
o Accrued Income  Facets of Cash Management
o Income Received in Advance o Motives for Holding Cash
o Cash Planning
Unit 2: Funds Flow and Cash Flow o Determining the Optimum Cash
Statements Balance
 Statements of changes in Financial  Methods of Cash Flow Budgeting
Positions
 Investing Surplus Cash
 Fund Flow Statement
 Cash Collection and Disbursements
 Analysing Changes in Working Capital
 Sources of Funds Unit 2: Receivables Management
 Uses (Applications) of Funds  Terms of Payment
 Cash Flow Statement  Credit Policy Variables
 Sources and Uses of Cash  Credit Evaluation
Unit 3: Ratio Analysis  Monitoring Receivables
 Factoring
 Categories of Ratios
Unit 3: Inventory Management
o Long-term Solvency Ratios
o Short-term Solvency Ratios  Reasons for Holding Inventory
57
 Objectives of Inventory Management  Modern Techniques
 Techniques of Inventory Control  Traditional Techniques

MCSL-036 Lab 3 credits

Objectives
This Course is based on three courses namely MCS-032 (Object Oriented Analysis and Design), MCS-034
(Software Engineering) and MCS-035 (Accountancy and Financial Management). The prime objectives of
this Course are (i) To help in learning the use of the computer for object oriented analysis and design
concepts, making of UML diagrams with the help of software tools. (ii) to use Software tools for different
phases of software development like cycle (iii) to familiarise with the use of software for basic accounting
procedures and financial management.

This lab course is based on the courses MCS-032, MCS-034 and MCS-035

MCS-041: Operating Systems 4 Credits

Objectives
In the second semester student will get exposed to the fundamental concepts of Operating Systems in
MCS-022. But that course completely provides knowledge from the implementation, networking and from
the practical point of view. This is the core Course on Operating Systems and the main objective of this
course is to provide core knowledge of Operating Systems features, functions and techniques. Each and
every Operating System function is discussed in detailed. This Course also provides an attempt to throw
some light on the advanced topics in O/S like Multiprocessors Systems and Distributed O/S. Case studies of
WINDOWS and LINUX are organized at the end of this Course so as to provide the support what ever they
had pursued theoretically.

Syllabus

BLOCK 1 Introduction to Operating Systems,  Performance evaluation of the Scheduling

Process Management Algorithms
Unit 3: Interprocess Communication and
Unit 1 Operating System-An Overview
Synchronization
 What is an Operating System (OS)?
 Goals of an Operating System  Interprocess Communication
 Generations of Operating Systems  Interprocess Synchronization
 Types of Operating Systems  Semaphores
 Desirable Qualities of OS  Classical problems in concurrent
 Operating Systems : Some Examples programming
 Functions of OS  Locks
 Monitors and Conditional Variables
Unit 2 Processes  Summary
Unit 4: Deadlocks
 Concept of Process
 System Calls for Process Management  Deadlocks
 Process Scheduling  Characterization of a Deadlock
 Scheduling Algorithms  A Resource Allocation Graph
o First Come First serve (FCFS)  Dealing with Deadlock Situations
o Shortest Job First (SJF) o Deadlock Prevention
o Round Robin (RR) o Deadlock Avoidance
o Shortest remaining time next o Deadlock Detection and Recovery
(SRTN)  Deadlock detection and recovery
o Priority Based Scheduling or Event  Deadlock Prevention
Driven (ED) scheduling o Havender’s Algorithm

58
 Deadlock Avoidance Unit 4: Security and Protection
o Banker’s Algorithm
 Security Threats
BLOCK 2: Memory Management, File  Security Policies and Mechanisms
Management and Security  Authentication
Unit 1: Memory Management o Passwords
 Overlays and Swapping o Alternative Forms of Authentication
 Logical and Physical Address Space  Protection in Computer Systems
 Single Process Monitor  Security Models
o Access-Control Matrix
 Contiguous Memory Methods
o Mandatory Access Control
 Paging
o Discretionary Access Control
o Principles of operation
o Rule-Based Access Control
o Page allocation
o Role-Based Access Control
o Hardware Support for Paging
o The Take-grant Model
o Protection and Sharing
o Multilevel Models
 Segmentation
o Principles of operation BLOCK 3: Advanced Topics and Case Studies
o Address Translation
o Protection and Sharing Unit 1: Multiprocessor Systems
Unit 2: Virtual Memory
 Multiprocessor and Processor Coupling
 Virtual Memory
o Principles of operation  Multiprocessor Interconnections
o Virtual Memory management o Bus-Oriented Systems
o Protection and sharing o Crossbar-Connected systems
 Demand paging o Hypercubes
o Multistage Switch-based systems
 Page Replacement policies
 Types of Multiprocessor Operating System
 Thrashing
o Separate Supervisors
o Working Set Model
o Master/Slave
o Page Fault Rate
o Symmetric
 Demand Segmentation
 Multiprocessor OS Functions and
 Combined Systems
Requirements
o Segmented paging
 Multiprocessor Synchronization
o Paged segmentation
o Test and set
Unit 3: I/O and File Management o Compare and swap
o Fetch and Add
 Organization of the I/O function
 I/O Buffering Unit 2: Distributed Operating Systems
 Disk Organization  History ofr Distributed Computing
 Disk Scheduling  Distributed Systems
 RAID  Key features and Advantages of a
 Disk Cache Distributed System
 Command language user’s view of File  Design Goals of Distributed Systems
System  Design Issues Involved in Distributed
 The System programmer’s view of the file Systems
System  Distributed System Structure
 The Operating systems’ view of file  Mutual Exclusion in Distributed Systems
Management
 Remote Procedure Calls
o Directories
 Other Middleware Technologies
o Disk Space Management
o Disk address translation
o File related system services
Unit 3: Case Study - UNIX
o Asynchronous Input / Output
Unit 4: Case Study – WINDOWS 2000
59
MCS 042: Data Communication and Networks 3 Credits
Objectives
The main objective of the Course is to deal with fundamental issues of computer network. The Course is
designed around the TCP/IP Model. Some of the important topics discussed in the Course are: Data
Encoding Techniques, MAC Protocols, Routing Techniques, Transport Services, Mechanism and Network
Security.
Syllabus
 Wireless LAN
BLOCK 1: Introduction to Data
Communication and Computer Unit 3: Data Encoding & Communication
Network Concepts Technique
Unit 1: Introduction to Computer  Pulse Code Modulation (PCM)
Networks  Amplitude Modulation
 What is computer Network  Frequency and Phase Modulation
 Network Goals / Motivation  Asynchronous Transmission
 Application of Networks  Synchronous Transmission
 Point to Point or Switched Networks Unit 4: Multiplexing and Switching
o Circuit Switched Networks
o Packet-Switched Networks  Frequency Division Multiplexing
 Broadcast Networks  Synchronous Time Division Multiplexing
o Packet Radio Networks  Statistical Time Division Multiplexing
o Satellite Networks  Modems
o Local Area Networks  Switching
 Network Protocols
 Networking Model BLOCK 2: Media Access Control and Data
 Examples of Some Networks Link Layer
Unit 1: Data Link Layer Fundamentals
Unit 2: Data Transmission  Framing
 Transmission Terminology  Basics of Error Detection
o Simplex, Half duplex & full duplex  Forward Error Correction
spectrum and Bandwidth, frequency  Cyclic Redundancy Check codes for Error
 Serial & Parallel Communication Detection
 Analog and Digital Data Transmission  Flow Control
 Bandwidth & Date Rate Throughout Unit 2: Retransmission Strategies
 Transmission Impairments
 Attenuation and Distortion  Stop-&-Wait ARQ
 Delay Distortion  Go-Back-NARQ
 Noise  Selective Repeat ARQ
 Concept of Delays  Pipelining
 How to reduce delays
Unit 3: Contention-based Media Access
 Transmission Media and its Characteristics Protocols
 Twisted Pair
 IBM Cable  The advantages of Multiple-Access Sharing
 Coaxial Cable of Channel Resource
 Twin Axial Cable  Pure ALOHA
 Optical Fiber  Slotted ALOHA
 Terrestrial Microwave  Carrier Sense Multiple Access (CSMA)
 Satellite Microwave  CSMA with Collision Detection
 Wireless Transmission (CSMA/CD)
 Radio
 Infra red
60
Unit 4: Polling-based Media Access  Internet Control Protocols
Control Protocols  OSPF – The Interior Gateway Routing
 Token Ring Protocol
 Token Bus  BGP – The Exterior Gateway Routing
Protocol
Unit 5: Media Access Control Protocols  Internet Multicasting
for High Speed Networks  Mobile IP
 IPv6
 FDDI-I and FDDI-H BLOCK 4: Transport Layer and Application
 DQDB with Bandwidth Balancing for Fair Layer Services
Access
 Asynchronous Transfer Mode (ATM) Unit 1: Transport Services and
Mechanism

 Type of Services
 Quality of Services
BLOCK 3: Network Layer
 Data Transfer
Unit 1: Introduction to Layer  Connection Management Transport Control
Functionality and Design Issues Mechanism
 Addressing
 Connection Oriented Vs Connectionless  Multiplexing
Services  Flow Control and Buffering
 Addressing  Connection Establishment
 Concept of Congestion  Crash Recovery
 Routing
 Network Layer in ATM Protocols Unit 2: TCP/UDP
 Network Layer Design Issues
 Introduction to UDP
Unit 2: Routing Algorithms  Remote procedure Call
 Shortest Path Routing  The Real-Time Transport Protocol
 Flooding  Introduction to TCP
 Distance Vector Routing  TCP Service Model
 Link State Routing  TCP Protocol
 Hierarchical Routing  TCP Segment Header
 Broadcast Routing  TCP Connection Establishment
 Multicast Routing  TCP Connection Release
 Modeling TCP Connection Management
Unit 3: Congestion Control Algorithms
 TCP Transmission Policy
 General Principles of Congestion Control  TCP Congestion Control
 Congestion Prevention Policies  TCP Timer Management
 Congestion Control in Virtual Circuit
Subnets Unit 3: Network Security I
 Load Shedding  Cryptography
 Jitter Control  Symmetric Key Algorithms
Unit 4: Internetworking & Network Layer  Public Key Algorithms
in the Internet Unit 4: Network Security II
 Tunneling  Digital Signatures
 Internetworking Routing  Management of Public Keys
 Fragmentation  Communication Security
 IP Protocol  Web Security
 IP Addresses

61
MCS 043: Advanced Database Management Systems 4 Credits
Objectives
This Course will help the students to acquire the theoretical foundation of Database Management Systems. It
includes concepts relating to various advanced database models, and concepts like database mining and
warehousing. This Course also describes in major details about the advanced concepts of relation database
management systems. Additionally, the Course also provides sample database management system
architecture. Thus, this is an advanced course, which will further develop the knowledge and skill acquired
by the students at the basic level.

Structure
Unit 4: Database System Catalog
BLOCK 1: Database Design and  Catalogs for relational DBMS
Implementation  System Catalog in Oracle
 Data dictionary and data repository system
Unit 1: Relational Database Design  Catalog in Distributed database and object
oriented database systems
 Features of good database design  Role of system catalog in administration
 Enhanced ER tools
o Subclasses, Super class, and BLOCK 2: DBMS Advanced Features and
Inheritance
o Specialization and Generalization Distributed Database
o Constraints and Characteristics of Unit 1: Query Processing and Evaluation
Specialization and Generalization
 Measures of Query Cost
 Converting EER diagram to tables
o Selection Operation,
 Functional dependency theory and
o Sorting
normalization
o Join Operation
 Multi value dependency and 4NF o other Operations
 Join Dependency and 5NF  Evaluation of Expression
 Inclusion Dependencies and Template  Transformation of Relational Expressions
Dependency
 Role of Relational Algebra and Relational
 PJNF/DKNF Calculus in query optimisation
 Modeling temporal data  Estimating Statistics of Expression
Unit 2: Database implementation and  Choice of Evaluation Plans
Tools  Views and query processing
 Information system and organization  Storage and query optimization
 Data Design and Implementation in an Unit 2: Transaction Management and
Organization Recovery
 Use of UML and its support for database
 Advanced feature of Transactions
design specifications
 Enhanced Lock Based and timestamp based
 Representing specialization and
Protocols
generalization in UML Class diagram.
 Multiple Granularity
 UML based design tools
 Multi-version Schemes
 Automated database design tools.
 Deadlock Handling
Unit 3: Advanced SQL  Weak Levels of Consistency
 Assertion and views  Concurrency in Index Structures
 Cursors, triggers and stored procedures  Recovery and Atomicity
 Embedded SQL, dynamic SQL, SQLJ,  Recovery with Concurrent Transaction
 Advanced Features of SQL  Buffer Management
 Examples of above in Oracle  Advanced Recovery Techniques
 Remote Backup Systems
 Use of SQL in recovery
62
 Examples of e-transactions  XML database applications
Unit 3: Database Security and Unit 3: Introduction to data warehousing
Authorization
 What is Data Warehousing, DSS and EIS?
 Levels of database security  Characteristics and functioning and
 Access control architecture of Data Warehousing
 Multilevel security  Data marts
 Statistical database security  Data warehousing Life Cycle
 Audit trails in the databases  Data modeling (Multidimensional
 Examples of e security Database) for data warehousing
 Building of data warehouse
Unit 4: Distributed Databases
 OLAP, MOLAP, ROLAP
 Centralised versus non centralized  Data warehouse and views
Databases  Future open issue for data warehouse
 Homogeneous and Heterogeneous DDBMS
and their comparison Unit 4: Introduction to Data Mining
 Functions and Architecture  What is data mining Technology and its
 Distributed database design, query relationship to Data warehousing
processing in DDBMS  Association rules
 Distributed concurrency management,  Classification
deadlock management  Clustering
 Distributed Commit Protocols: 2 PC and 3  Approaches to data mining problems
PC  Applications of Data mining problem
 Concepts of replication servers  Commercial tools of data mining
 Knowledge Discovery
BLOCK 3: ENHANCED DATABASE
MODELS BLOCK 4: Emerging Trends and Example
Unit 1: Object Oriented Database DBMS Architectures
 Limitations of Relational databases Unit 1: Emerging Database Models,
 The need of Object oriented databases Technologies and Applications I
 Complex Data Types
 Structured Types and Inheritance in SQL  Multimedia database
 Table Inheritance  Geography databases, Gnome databases
 Data types (arrays, multi-set etc) and  Knowledge databases, deductive databases
structure in Object oriented databases using and semantic databases
SQL  Spatial database
 Object-Identity and Reference Types in  Information visualization
SQL Unit 2: Emerging Database Models,
 ODL and OQL Technologies and Applications II
 Implementing O-R Features  Mobile databases
 Persistent Programming Languages  Web databases (JDBC, ODBC)
 Object-Oriented versus Object-Relational  Personal databases
 An Example of Object oriented and object  Digital libraries
relational database implementation  Data grids
Unit 2: Database and XML  Wireless networks and databases
 Structured Semi structure and unstructured Unit 3: PostgreSQL
data  Important features and brief architecture
 XML hierarchical tree data model  User Interfaces
 Documents DTD and XML schema  SQL Variations and Extensions
 XML Documents & Database  Transaction Management
 XML query and tranasformation  Storage and Indexing
 Storage of XML data
63
 Query Processing and evaluation and  Storage and Indexing
optimization  Query Processing, evaluation and
Optimization
 Concurrency Control and Recovery
Unit 4: Oracle  Distributed Oracle
 Features and basic architecture  Database administration and other
 Database Design and Querying Tools advanced tools
 SQL Variations and Extensions

MCS - 044: Mini Project 4 Credits

Objectives

The project work constitutes a major component in most of the professional programmes and it is to be
carried out with due care and should be executed with seriousness by the students. The objective of the
project is to motivate them to work in emerging/ latest technologies, help the student to develop ability to
apply theoretical and practical tools/techniques to solve real life problems related to industry, academic
institutions and research laboratories. This project will help the student make ease and provide enough
experience to carry out the larger project in the sixth semester. You will receive a block containing the
guidelines for the mini project along with the list of project specifications, category-wise.

MCSL-045 Lab (UNIX & DBMS) 2 Credits

Objectives
This lab Course is based on MCS-041(Operating Systems) and MCS-043(Advanced Database Management
Systems) courses. The basic objective of the Course is to provide the hands on experience to improve the
practical skills on UNIX Operating System and Oracle DBMS and also to apply the concepts that been
covered in the courses MCS-041 and MCS – 043. This Course is divided into 2 Sections: Section – 1 covers
the Unix Lab and Section – 2 covers the DBMS Lab. At the end of each Section, lists of exercises are given
for your practice.

MCS-051: Advanced Internet Technologies 3 Credits

Objectives
The Major Objectives of the Course is to introduce concepts, tools/technologies and programming to rapidly
develop Internet based distributed, secure, reliable and scalable application. The discussion in the course is
centered around Servelet and JSP (Java Server Pages) Programming, JDBC APIs, Server Side component
architecture (Enterprise Java Beans), and XML. It also introduces Web Security and its implementation.

Syllabus

BLOCK 1: Servelet and JSP Programming Unit 2: Database Connection

 JDBC Drivers
Unit 1: Introduction to Servelet  JDBC APIs
 Servelet life Cycle  JDBC Techniques
 HTTP Servelet Class  Statements & its Types
 Request Interface  Record Sets
 Response Interface  Various Operations (Insertion, Deletion &
 Session Tracking (Cookies VRL) updation)
 Database Connectivity from Servelet
 Interservelet Communication Unit 3: JSP-I
 Handling Servelet  Overview of JSP
 Servelet Collaboration
64
  Relation of Applets and Servelets with Unit 3: Deploying Beans
JSP  Deploying J2EE Applications
 Scripting Elements
 JSP Expressions Unit 4: XML
 JSP Scriplets  Overview of XML
 JSP Declarations  Overview of SGML
 Predefined Variables  Differentiate Between SGML and XML
 Creating Custom JSP Tag Libraries Using  XML Development Goal
Nested Tags  Structure of XML Document
 Using DTD
Unit 4: JSP-II  XML Parser
 Structuring Generated Servelet in JSP  Using XML Introduction
Pages  XML Entities
 Including Files and Applets in JSP
Documents
 Integrating Servelet and JSP BLOCK 3: Web Security and Case Study

BLOCK 2: EJB and XML Unit 1: Web Security Concepts

 HTTP Authentication
Unit 1: Introduction to Beans  Compare and Contrast
 Types of Beans  Application Types (BASIC, DIGEST,
 Session Beans FORM and Client CERT)
 Counting Beans
 Message Beans Unit 2: Security Implementation
 Context and Naming Convention  Retrieving Authentication Information
 Security in Servelet
Unit 2: Creating Beans  Form Based Custom Authorisation
 How to Create Beans  Retrieving SSL Authentication
 Create Web Application
 Create Application Client Unit 3: Case Study

MCS-052: Principles of Management and Information Systems 2 Credits

Objectives

The Course objective is to provide the use and function of management information systems. It describes
and evaluates information systems development processes and techniques.

Syllabus
 Life cycle of organisation
BLOCK 1: Management Systems  Vertical and horizontal organisations
Unit 1: Organisational Overview Unit 2: Management Functions and Business
 Oraganisation Types Processes
o Service, Business, Government,  Overview of management Levels
Social
 Business Processes
o Industry Types
o Sale and orders
 Organisational Structure o Finance
 Organisational Characteristics o Human resource
o Size o Production
o Location o Marketing
o Others  Information systems requirements
 Organisation functions
65
  Requirement analysis Unit 6: Enterprise Information Systems
 Tools and methods for requirement  Evolution of enterprise information
analysis Systems
 Enterprise Resource Planning
Unit 3:Management Systems  Resource planning management
 ERP Market
 Management Systems Types  Supply Chain Management
 Management Systems Requirements  Customer Relationship Management
 Levels of management activities  E-CRM Systems
 Strategic level  Emerging technologies
 Management level
 Middle Management Level Unit 7: Intelligence Information Systems

Unit 4: Business values of Information System  Knowledge Management in organization

 Impact of Information Systems  Creating, developing & sharing
 Empirical studies Knowledge
 Cost Value Performance  Artificial intelligence in business
 Total cost of ownership  Business Analytics
 Culture for Information Systems  Business Intelligence
 Decision management with Information  Role of Business Intelligence
Systems o Sale and orders
o Finance
BLOCK 2: Information Systems o Human resource
o Marketing
Unit 5: Portfolio Management and IT  Business Intelligence Tools
applications  Business Intelligence reports

 What is portfolio management Unit 8: Social, Ethical and Legal Aspects

 Portfolio management methods
 Design and implementation of portfolio  Society in information age
management  Moral dimensions and information age
 Risk Management  Technology trends and ethical issues
 Disaster Management  Ethical principal and dilemma
 Portfolio management issues and  Responsibility, accountability and
challenges liability
 Tools and techniques  Information right and acts
 Emerging technologies

MCS-053 Computer Graphics and Multimedia 4 Credits

Objectives

The Aim & Objective of the Course is to enable the learner's thinking process in the field of Computer
Graphics, Animation, Simulation and Multimedia. After going through the Course the learner will be able to
understand the abilities required to develop the graphical tools. The understanding of the learned concepts
will help the learner in executing the practical component i.e. Lab component of the Computer Graphics

Syllabus
 Application of Computer Graphics
BLOCK 1: Raster Graphics and Clipping o Presentation Graphics
o Painting and Drawing
Unit 1: Introduction to Computer Graphics o Photo Editing
 What is Computer Graphics? o Scientific Visualization
66
 o Image Processing Unit 5: Viewing Transformation
o Digital Art
o Education, training,  Projections
Entertainment and CAD o Parallel Projection
o Simulation o Orthographic & Oblique
o Animation and Games Projections
 Graphics Hardware o Isometric Projections
 Input and Output Devices  Perspective Projections
o Touch Panel
o Light Pens
o Graphic Tablets
o Plotters BLOCK 3: Modeling & Rendering
o Film Recorders
 Display Devices Unit 6: Curves and Surfaces
 Refreshing Display Devices
o Raster-Scan  Polygon Representation Methods
o Random-Scan o Polygon Surfaces
 Plasma Panel and LCD panels o Polygon Tables
o Plane Equations
Unit 2: Graphics Primitives o Polygon Meshes
 Bezier Curves and Surfaces
 Points and Lines o Bezier Curves
 Line-drawing Algorithms o Properties of Bezier Curves
o DDA Algorithm o Bezier Surfaces
o Bresenham’s line Algorithm  Surface of Revolution
 Circle-generating Algorithm
o Properties of Circles Unit 7: Visible – Surface Detection
o Midpoint Circle of Algorithm  Depth Buffer Method
 Polygon Filling Algorithm: Scan-Line  Scan-Line Method
 Area-Subdivision Method
Unit 3: 2-D Viewing and Clipping
 Point Clipping Unit 8: Polygon Rendering and Ray Tracing
 Line Clipping Methods
o Cohen-Sutherland Line Clippings
o Cyrus-Beck Line Clipping  Illumination Model
Algorithm o Ambient Reflection
 Polygon Clipping: Sutherland o Diffuse Reflection
Hodgman Algorithm o Specular Reflection
 Windowing Transformation  Shading
o Gouraud Shading
BLOCK 2: Transformations o Phong Shading
 Ray Tracing
Unit 4: 2-D and 3-D Transformations o Basic Ray-Tracing Algorithm

 Basic Transformations BLOCK 4: Multimedia and Animation

o Translation
o Rotation Unit 9: Computer Animation
o Scaling
o Shear  Basic of Animation
 Composite Transformations  Types of Animation
o Rotations about a point  Simulating Accelerations
o Reflection about a line  Computer Animation Tools
 Homogeneous Coordinate Systems  Applications
 3-D Transformations
67
Unit 10: Multimedia Concepts and o Entertainment
Applications o Electronic Encyclopedia
 Images
 Concepts of Hypertext/Hypermedia  Audio and Video
 Multimedia Applications o Analog and Digital Sound and
o Education Video
o Video Conferencing o Mpeg, mpi, wav, etc.
o Training  Multimedia Tools

MCSL-054 Lab (Advanced Internet Technologies and Computer Graphics) 2 Credits

MCSE-003 Artificial Intelligence and Knowledge Management 3 Credits

Objectives

One of the ways of looking at Artificial Intelligence (AI) is as the study concerned with solving 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. In order to encode knowledge structures
obtained using these formalisms, the syntax of each of the two well-known AI programming languages
LISP and PROLOG is discussed along with explanation of how the language can be to encode proposed
solutions. Finally, as applications/ products of AI, the topics on Expert Systems and Intelligent Agents are
discussed briefly.

MCSE-003 is a 4-credit course and the course material consists of 4 blocks. The pre-requisites for the
course include Design and Analysis of Algorithms, Discrete Mathematics and programming and problem
solving experience.

Syllabus
Unit 3: Game Playing
BLOCK 1: Problem Solving & Search  Overview of One & Two Player Game
Techniques  The Min-Max Search Procedure
 Alpha-Beta Cutoffs
Unit 1: Introduction
BLOCK 2: Knowledge Representation
 Concepts & definitions of AI
 Brief history of AI Unit 1: Propositional & Predicate Logic
 AI and related fields  Syntax and semantics for prepositional
 Problems logic
 Techniques  Syntax & semantics of First Order
 Characteristics and underlying Predicate Logic (FOPL)
assumption of AI  Properties of well-formed formula (wff)
 Turing test Uninformed searches  Conversion to clausal form
 Informed searches: generate and test  Inference rules
 Hill-climbing  The resolution principle
 best-first search  Non-deductive inference methods

Unit 2: Structured Knowledge

Unit 2: State Space Representation & Search Representations
Techniques
 A* algorithm  Production Rules
 Problem reduction  Semantic Nets
 Constraint satisfaction  Frames
68
  Conceptual Dependencies and Scripts  Dempster-Shafter Theory

Unit 3: AI Programming Languages Unit 2: Fuzzy Logic

 Introduction to LISP  Fuzzy Sets

 Syntax and Numeric Functions  Fuzzy Operators & Arithmetic
 Basic List Manipulation Functions in  Membership Functions
LISP Functions  Fuzzy Relations
 Predicates and Conditionals
 Input, Output, and Local Variables BLOCK 4: Applications of Artificial
 Iteration and Recursion Intelligence
 Property Lists and Arrays
 PROLOG: List, Operators, Arithmetic Unit 1: Expert Systems
 Cut & Fail  Introduction and Concept of Planning
 Backtracking  Representing and Using Domain
Knowledge
BLOCK 3: Handling Uncertainty  Expert System Shells
 Knowledge Acquisition
Unit 1: Handling Inconsistent and Incomplete
Knowledge Unit 2: Intelligent Agents

 Truth Maintenance Systems  Agents and environments

 Reasoning Techniques  Rationality and other performance
 Concept of Uncertainty measures
 Bayes’ Theorem  Nature of environments
 Certainty Factors and Rule-Based  Structure of agents
Systems
 Bayesian Networks

MCSE-004 Numerical and Statistical Computing 3 Credits

Objectives

The main objective of this course is to prepare the firm footing of learners in the domain of numerical and
statistical computation. Understanding the concepts covered in the course, will make the learner to realize
the need of Numerical and statistical components in computer science. Further, the concepts covered in this
course will enable the analytical skill of the learner, and s/he may appreciate the need of this course in
various domain of computer science viz. Software Reliability, Software Quality Assurance , Software
Testing and many more.

Syllabus

BLOCK-1 Numerical Computing-I  Regula-Falsi Method

 Secant Method
Unit 1 Floating Point Arithmetic and Errors  Newton-Raphson Method
 Successive Iteration Method
 Floating Point Representation
 Sources of Errors Unit 3 Solution of Linear Algebraic Equations
 Propagated Errors
Direct Method
Unit 2 Solution of Non-Linear Equations  Gauss Elimination Method (without and
with Pivoting)
 Bisection Method  LU-Decomposition Method

69
 Iterative Method  Discrete Distribution
 Jacobi Method  Binomial Distribution
 Gauss Seidel Method  Poisson Distribution
 Successive Over Relaxation Method
Continuous Distribution
BLOCK-2 Numerical Computing-II  Uniform Distribution
 Exponential Distribution
Unit 1 Interpolation  Normal Distribution
 Chi-square Distribution
 Differences – Forward and Backward
Differences Unit 2 Pseudo Random Number Generation
 Newton’s – Forward and Backward
Difference Formulas  Uniform Distribution
 Lagrange’s Interpolation o Method of Generation
(Discrete Case)
Unit 2 Numerical Integration o Inversion Method
(Exponential Distribution)
 Newton – Cotes Formulas o Acceptance and Rejection
 Composite Formulas
 Gaussian Quadrature Unit 3 Regression

Unit 3 Numerical Solution of ODE  Linear Regression Model

 Euler’s Method o Least Square for Parameter
 Runge Kutta Method Estimation
o Goodness-of-Fit
o Residual Analysis
BLOCK-3 Statistical Computing
 Non-Linear Regression
Unit 1 Probability Distribution

MCSE-011 Parallel Computing 3 Credits

Objectives

In view of the limitations of the sequential paradigms in respect of solving difficult problems; over the years,
a number of parallel/ concurrent paradigms have emerged that include parallel computer architectures,
parallel operating systems, parallel algorithms and parallel programming languages. Based on these
paradigms, parallel computer systems have been designed, developed and studied in depth. The purpose of
the course is to equip students with skills for solving difficult problems using these paradigms, architectures
etc.

MCSE-011 is a 3-credit course and the course material consists of three blocks. The pre-requisites for the
course include knowledge of computer architecture, operating system, design and analysis of algorithm and
problem solving and programming experience.

Syllabus
Execution Parallel Execution,
BLOCK –I Elements of Parallel Computing granularity, Potential of Parallelism
and Architecture  Need of Parallel Computation
 Levels of parallel processing
Unit 1 Introduction to Parallel Computing  Parallel processing Vs. Parallel
 Basic concepts about computing
program/process/ thread concurrent  Dataflow Computing concept
70
  Applications of parallel processing Unit –2 PRAM Algorithms
o Scientific Applications /
Image processing  Message passage programming
o Engineering Application o Shared memory
o Database query / o Message passing libraries
Answering applications o Data Parallel programming
o A I Applications  Data Structures for parallel
o Mathematical simulations algorithms
and modeling o Link list
o Arrays pointers
Unit 2 Classification of Parallel Computers o Hypercube network

 Types of Classification Unit 3 Parallel Programming

 Flynn’s/ Handler classification
 UMA / NUMA /COMA  Introduction to Parallel Programming
 Loosely coupled / tightly coupled  Types of parallel programming
 Classification based grain size and o Programming based on
Instruction level parallelism message passing
o Programming based on
Unit 3 Interconnection Network data parallelism
o Programming for shared
 Need of Interconnection Network memory systems
 Concept Bandwidth Nod degree o Example programs for
diameter bisection bandwidth, In parallel systems
degree and Out degree
 Static and Dynamic Interconnection BLOCK –3 Advanced Topics
network
 Omega, Parallel Shifter, Bens, Unit 1 Operating System for Parallel
permutation, hypercube, butterfly, Computers
 Shuffle exchange Network
 Basic issues of Operating Systems for
Unit 4 Parallel Computer Architecture Parallel Computers
 Process Management
 Introduction to various computer  Resource Management
architecture  Memory management
 Pipeline processing  I/O Management
 Vector / Array processing  Inter-Processor Communication
 VLIW and Super scalar architecture  Vectorisation Compiler
 Associative architecture
o Multithreaded architecture Unit 2 Performance Evaluation

BLOCK 2 Parallel Algorithm & Parallel  Introduction to performance

Programming evaluation
 Metric of Parallel overhead
Unit 1 Parallel Algorithm  Law Speedup
 Measurement Tools
 Introduction to Parallel Algorithms
 Analysis of Parallel Algorithms Unit 3 Recent Trends for Parallel
 Different models of computation Computer
o Combinational circuit
o Permutation Circuit  Development of last 3 years
o Sorting circuit  Multicompontent CPU
o Matrix computation  Apex architecture IA 64
 Hyperthreading
71
MCSP-060 Project 16 Credits

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 at least six man-months 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. Student will receive Project Guidelines
along with their 5th semester course material. Students should strictly follow and adhere to the MCSP-060
project guidelines.

4.1 Syllabus for BCS-012

BCS-012 BASIC MATHEMATICS

Students who took admission into MCA (from July 2013 session onwards), and did not have Mathematics at
10+2 level or at graduate level have to do BCS-012. They are advised to clear it along with the first year of
MCA courses. However, all such students have to successfully complete BCS-012 (wherever applicable)
before re-registering for MCA 5th semester.

No assignments need to be submitted for BCS-012. Also, the University offers no counseling sessions for
BCS-012 course. Students need to appear only for the Term-end Examination for BCS-012. After
completion of BCS-012, they would not get any certificate, however the marks will be reflected in the MCA
grade card under the non-credit course column. This course (BCS-012) does not add to the credits of MCA
programme and the marks will not be counted in the grand total.

Students need to secure at least 40% marks in the Term-end examination for BCS-012 to be declared as
successfully completed. The syllabus is given below:

BCS-012: Basic Mathematics Unit-3: Matrices -2

Elementary row operations; rank of a
Block-1: Algebra 1 matrix, reduction to normal form, Inverse
of a matrix using elementary row
Unit-1: Determinants operations.
Determinants of order 2 and 3, properties
and evaluation of determinants. Area of
triangles using determinants, Cramer’s Unit-4: Mathematical Induction
rule. Principle of mathematical induction

Unit-2: Matrices -1
Definition, equality, addition and Block 2: Algebra 2
multiplication of matrices. Adjoint and
inverse of a matrix. Solution of a system Unit 1: Sequence and Series
of linear equations – homogeneous and Definition of sequence and series; A.P,
non-homogeneous. G.P, H.P and A.G.P. ∑n, ∑n2 and ∑n3,
Idea of limit of a sequence.

72
Unit 2: Complex Number Unit 3: Three- Dimensional Geometry-1
Complex number in the form of a+ib. Introduction, Distance formula. Direction
Addition, multiplication, division of cosines/ratio of a line passing through
complex numbers. Conjugate and two points. Equations of a line in
modulus of complex numbers. De different forms; angle between two lines;
Moivre’s Theorem. Coplanar and skew lines. Distance
between skew lines.
Unit 3: Equations
Quadratic, cubic and biquadratic Unit 4: Linear Programming
equations. Relationship between roots and Introduction, definition and related
co-efficient. Symmetric functions of terminology such as constrains, objective
roots. function, optimization. Mathematical
Unit 4: Inequalities Formulation of LPP. Graphical method of
Solution of linear and quadratic solving LPP in two variables. Feasible
inequalities. and inferring solution (up to three non-
trivial constraints)
Block 3 Calculus (Without Trigonometry)

Unit 1: Differential Calculus

Concept of limit and continuity;
differentiation of the sum, difference,
product and quotient of two functions,
chain rule. Differentiation of parametric
functions. 2nd order derivatives.

Unit 2: Simple Application of Differential

Calculus
Rate of change; monotoncity-increasing
and decreasing; maxima and minima.

Unit 3: Integration
Integration as an anti-derivative.
Integration by substitution and by parts.

Unit 4: Application of Integration

Finding area under a curve. Rectification.

Block 4 Vectors and Three-Dimensional

Geometry

Unit 1: Vectors-1
Vectors and scalars, magnitude and
direction of a vector. Direction
cosines/ratio of vectors. Addition of two
vectors. Multiplication of a vector by a
scalar. Position vector of a point and
section formula.

Unit 2: Vector-2
Scalar (Dot) product of vectors, Vector
(Cross) product of vectors. Scalar triple
product and vector triple product.

73
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 31 and the total number of credits is 108.
Evaluation for each course covers two aspects:

(a) Continuous evaluation through Assignment with a weightage of 25% (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 75% (please refer to the table below).

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 him.

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 printed 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 easily available at the Study Centre / Regional Centre
libraries or through websites for working on the assignments. This will enhance his/her learning
capabilities. Mostly the assignments are designed in such a way as to help her/him concentrate mainly
on the printed course material, exploit their personal experiences and apply the knowledge gained from
various sources.

Assignments

There will be only one assignment for each course worth 100 marks (weightage of 25%). The set of
all the assignments for each semester are given in one booklet that you will get along with your course
material as well as the same will be uploaded on the IGNOU’s website also.

The table shown below provides the detailed marking scheme for the MCA courses.

Seme- Course Course Title Continuous Term End Examination

ster Code Evaluation
Credits

Theory OR Practicals* ( for Lab courses only)

Assignment (Weightage – 75%)

(Weightage –
25%)
Max Min. Duration Max. Min.
Marks Marks Marks Marks
I MCS-011 Problem Solving and 3 100 40 3 100 40
Programming
MCS-012 Computer Organization 4 100 40 3 100 40
and Assembly language
Programming
MCS-013 Discrete Mathematics 2 100 40 2 50 20
MCS-014 Systems Analysis and 3 100 40 3 100 40
Design
MCS-015 Communication Skills 2 100 40 2 50 20
MCSL-016 Internet Concepts and 2 100 40 2 50 20
Web Design
MCSL-017 C and Assembly 2 100 40 2 50 20
Language Programming
Lab
II MCS-021 Data and File Structures 4 100 40 3 100 40
MCS-022 Operating System 4 100 40 3 100 40
Concepts and
Networking
Management
MCS-023 Introduction to Database 3 100 40 3 100 40
Management Systems
MCS-024 Object Oriented 3 100 40 3 100 40
Technologies and Java
Programming

74
 MCSL-025 Lab (based on MCS- 4 100 40 3 100 40
021, 022, 023 & 024)
III MCS-031 Design and Analysis of 4 100 40 3 100 40
Algorithms
MCS-032 Object Oriented 3 100 40 3 100 40
Analysis and Design
MCS-033 Advanced Discrete 2 100 40 2 50 20
Mathematics
MCS-034 Software Engineering 3 100 40 3 100 40
MCS-035 Accountancy and 3 100 40 3 100 40
Financial Management
MCSL-036 Lab(based on MCS-032, 3 100 40 3 100 40
034 and 035)
IV MCS-041 Operating Systems 4 100 40 3 100 40

MCS-042 Data Communication 4 100 40 3 100 40

and Computer Networks
MCS-043 Advanced Database 4 100 40 3 100 40
Management Systems
MCSL-044 Mini Project 4 100 40 (50+25 ) *** 40
MCSL-045 Lab(UNIX & Oracle) 2 100 40 2 50 20
V MCS-051 Advanced Internet 3 100 40 3 100 40
Technologies
MCS-052 Principles of 2 100 40 2 50 20
Management and
Information Sytems
MCS-053 Computer Graphics and 4 100 40 3 100 40
Multimedia
MCSL-054 Lab( based on MCS-051 2 100 40 2 50 20
& 053)
MCSE-003 Each Elective Course** 3 each 100 40 2 100 40
MCSE-004
MCSE-011
VI MCSP-060 Project 16 (150 + 50 )*** 60 +20

* No practical examinations for the non-lab courses. 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 section in the practical course of
Term End Practical Examination is compulsory in order to get it declared successful in the respective course.
** There will be 3 elective courses of 3 credits worth.
*** 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 and 40% in the
term-end examinations, with an overall average of 40% for a pass in the course.
The viva voce is compulsory for the assignment evaluation. For any course, in case, if a
student submitted the assignment and not attended 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

The following are the evaluation guidelines for the lab courses.
75
(i) Evaluation of Assignments for Lab Courses

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-016 40 40 20 100

MCSL-017 Section –1(20) Section –1(20) 20 100

Section –2(20) Section –2(20)

MCSL-025 Section –1(10) Section –1(10) 20 100

Section –2(10) Section –2(10)
Section –3(10) Section –3(10)
Section –4(10) Section –4(10)

MCSL-36 Section –1(13) Section –1(13) 20 100

Section –2(13) Section –2(13)
Section –3(14) Section –3(14)

MCSL-45 Section –1(20) Section –1(20) 20 100

Section –2(20) Section –2(20)

It is to be noted that minimum passing marks 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 Marks Marks Marks
practical Section-1 Section-2 Section-3 Section-4
exam. (Each
section gets
equal time)
MCSL-016 2 hours 40(P) + 10 (V) # # #
(2 credits) = 50 marks
MCSL-017 2 hours 20 (P) +5(V) 20(P) + 5(V) # #
(2 credits) = 25 marks = 25 marks

76
 MCSL-025 3 hours 20(P) + 5(V) 20(P) + 5(V) 20(P) + 5(V) 20(P) +
(4 credits) = 25 marks = 25 marks = 25 marks 5(V)
=25 marks
MCSL-036 3 hours 25 (P) + 5(V) 25(P) + 5(V) 30(P) + 10(V) #
(3 credits) = 30 marks = 30 marks = 40 marks
MCSL-045 2 hours 20 (P) + 5(V) 20(P)+ 5(V) # #
(2 credits) = 25 marks = 25 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 Guidelines for MCS-044 (Mini Project)

The mini project is designed to help students develop practical ability and knowledge about
practical tools/techniques in order to solve real life problems related to the industry, academic
institutions and computer science research. The Mini Project involves practical work for
understanding and solving problems in the field of computing. Every year, the list of problem
definitions will change and will be sent as a separate booklet along with the course material/
Assignments.

(i) Project Proposal

Project proposal should be presented to, reviewed by and agreed upon in consultation with the
project counselor to provide constructive feedback on the proposal and planned programme of
the project work. No need of any formal approval to be taken on any proforma for MCS-044
project.

(ii) Mini Project (MCS-044) Report

The project report of MCS-044 will contribute to the assessment and your marks. The format of
this report will follow the format, guidelines and suggestions given in the block, but details
should also be discussed with your counsellor. The final reports of students doing the project in
a group should not be identical. Each student should emphasise on his/her role and
responsibilities in the project work.

(iii) Submission of the Project Report

One copy of the original MCS-044 project report is to be submitted to the Study Centre
concerned. A photocopy of the same project report must be retained by the student and should be
carried with him/her at the time of the viva-voce.

(iv) Evaluation Scheme of MCS-044

MCS-044 course has three main evaluation components consisting of assignment (25 marks),
project report (50 marks) and viva-voce (25marks). A student is required to score 40% marks
in each of these components separately for successful completion of the course.

The project will be assessed by a written report and a combined presentation and viva-voce. To
help the students we have given some guidelines about evaluation and assessment in the next
section. If the examiner finds that the project is lacking in any key areas then the student will be
asked to re-submit the project by selecting a new topic in the next session.

(v) Re-submission of the project by the failed students

If the student fails in project report evaluation or viva-voce or in both, the students needs to redo
the entire process by selecting a new problem from the list of problems which will be updated
every year.
77
(vi) Assignment/ Continuous Evaluation

25% of total marks are allotted to assignment/continuous evaluation. The assignment questions
are given in the MCA 4th semester assignment booklet.
If the student failed only in assignment component and successfully passed in project report
evaluation and viva-voce, s/he needs to submit the fresh assignment of the current year, as is
done in the normal courses.

(vii) Final Evaluation

The term-end practical examination of Mini Project will be conducted at the Study Centre
concerned. 75% of total marks are evaluated in the final evaluation. Out of these 75 marks, 50
marks are allotted for the project report evaluation and 25 marks are allotted for the viva-voce.

5.3 Instructions for Assignments

While answering Assignments, the following guidelines are required to be followed:

1. Tips for assignments

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 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 : ........................................
STUDY CENTRE : ..................................... DATE : ...................................................

3. Read instructions for submission of assignments given here. The assignments response
sheets should be hand written. However the s/w coding, snapshots, test cases, etc. can be in
78
 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 Study
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 Study Centre in
person, the students should get the acknowledgement from the Co-ordinator 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 Study 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 Study Centre, s/he should submit her/his
assignments only to the original Study Centre until the University effects the change of
Study Centre.

5.4 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. Whenever the students receive a set of assignments, they should check them immediately
and ask for missing pages, if any, from Registrar (MPDD), IGNOU, Maidan Garhi, New
Delhi-110 068 or the Co-ordinator of the Study Centre or else download them from the
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 Study Centre 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. The
request for the new assignments in the prescribed form (Form No. 2) is to be addressed to
the Registrar, MPDD, Indira Gandhi National Open University, Maidan Garhi, New Delhi-
110068.
7. For their own record, students should retain a photocopy of all the assignment responses,
which they submit to the Co-ordinator of their Study Centre. If they do not get back their
duly evaluated assignment within a month after submission, they should try to get it from
their Study Centre personally. This may help them to improve upon future assignments.

79
8. As per the University norms, once the student’s scores pass marks in an assignment, they
can not 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 Co-ordinator of the Study Centre, 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 Study Centre.

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 Study Centre or
at different Study Centres for evaluation.

5.5 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 for each course is sent to
all the Regional Centres/ Study Centres in advance. The same is also notified through
IGNOU Newsletter from time to time and displays on the website of IGNOU
[Link].
4. The online examination form is to be filled up from IGNOU website, in general, as per the
following schedule (You MUST visit IGNOU website for actual cutoff dates. The details of
late fee are displayed on the website. For June 2019 Term-end examination is INR 1000/-):
Term-End Examination Dates for filling up examination form
(without Late Fee) (With Late Fee)
June Term-End 1st March to 31st March 1st April to 10th
Examination April
December Term-End 1st September to 30th 1st October to 10th
Examination September October

You are required to pay examination fee per course at the time of filling up of the
form. For June 2019 term-end examination this fee is @150/- per course for theory
courses and @150/- per course for practical courses. You can pay online using Credit

80
 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. For example, For June 2019 term-end examination, you can fill up the form
(provided you are filling up the form as per cutoff dates) from the link:
[Link]
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
 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 intimation slip (download hall ticket from
IGNOU website indicating Centre & 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.

81
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 45 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 marks-sheet/grade
card by a specified given date may apply for early process of their answer-scripts 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 declaration
before the commencement of the Term-end Examination i.e., before 1st June and 1st
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
Bachelors Degree and Masters Degree Programmes, but falling short of 2% marks for
securing 1st Division/2nd 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 including the re-
admission period has expired. 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.

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

82
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 for reimbursement of Programme Fee to SC/ST students can be downloaded from
the 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 Study Centre

Counselling facilities are not available for all the programmes at all the Study 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 Study Centre is acceded to 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 copies 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-110 068. Further, s/he has to obtain a certificate
from the Co-ordinator of the Study 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 Study Centre.

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.

6.7 Study Materials for Your Programme of Study

[1] After confirmation of admission, study materials are dispatched to the student’s registered address
by speed/ registered post.
[2] Keep checking status of dispatch of study materials on the IGNOU website using the weblink,
[Link]/ignou/aboutignou/division/mpdd/material, provided by MPDD.
[3] You should visit Learner Support Centre (LSC) concerned with ID card for schedule of classes/lab
[4] If you not received Study Material then visit Regional Centre concerned only or write to
mpdd@[Link]
83
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
(iii) Study materials and Assignments, Regional Director of the Regional Centre
Admission , Fees, Scholarship,Change of concerned.
Address/Study Centre/Regional Centre,
Change of Course/Programme, Isssue of
Bonafide Certificate, Migration
Certificate, Duplicate Identity Card
(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 Study Centre/Regional
missing score of TMAs/Project Director of the Regional Centre concerned
assignments/Practical assignments,
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. 1312/1319/1325
E-mail: assignments@[Link]
(xi) Online students grievances Portal [Link]

84
 (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 Study Centres for
advance/timely/day-to-day information or visit the website with URL [Link]

8. LINK TO OLD QUESTION PAPERS

You can download the previous year’s question papers from IGNOU website. 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.

85
 Note: You must Download the Forms from the
Website

Forms and Useful links

 Change of Address (Form No. 1)
 Assignments Remittance-Cum-Acknowledgement Card (Form No.2)
 Link to Latest Assignment(s)
 Link to Online Re-Registration for MCA Programme
 Link to Re-admission form for MCA programme
 Link to Online Term end Examination form
 Link to Offline 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)

(It is attached on page No. 88)

Assignments related links

Assignment Remittance-cum-Acknowledgement (Form 2)

(It is attached on page No. 89)

Link to Latest Assignment(s)

[Link]

Re-registration and Re-admission

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

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

general, the re-admission is to be done 2-3 months prior to the start of
session. For example, the last date of re-registration for session starting
from July 2019 is 31 May 2019. Similarly, the last date for session starting
January, 2020 may be 30 Nov, 2019. Offline re-registration form is attached
as Form 3 on page 91. You must verify the cutoff dates and fee from the
website prior to filling up this offline form.

Link to Re-admission form for MCA Programme

[Link]
86
Term end Examination and related links

Link to online Term End Examination form

[Link]

Link to Offline Term end Examination form

[Link]

Link to form for Early Declaration of Result

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

Link to Application Form for Obtaining Photocopy of the Answer

Script
[Link]
20Answer%20Scripts(1).pdf

Link to form for Re-evaluation of Answer script

[Link]
20Answer%20Scripts(1).pdf

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]

87
 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 Registrar, SRD

IGNOU
Maidan Garhi
New Delhi-110 068.
THROUGH THE REGIONAL DIRECTOR CONCERNED

Enrolment No._____________________

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 matter that you submit to the

University.
88
 Form No. 2

ASSIGNMENTS REMITTANCE -CUM-ACKNOWLEDGEMENT CARD

Enrol. No._____________ INDIRA GANDHI NATIONAL OPEN UNIVERSITY

Programme Title: ________________ ASSIGNMENTS REMITTANCE -CUM-ACKNOWLEDGEMENT
CARD
Name : __________________________________
Enrol. No._________________________ Programme Title: _______________
Course Code: ______________Medium:
_______ Name : ___________________________ Medium : _____________________
Course Code: _____________________
[Link]. Assignment No. For Office Use Only
[Link]. Assignment No.
For Office Use Only [Link]. ___________________________

S .No. ___________
Signature of the recevier ____________
Date of Receipt: ____
Name of Evaluator: _ Date : ____________

Signature of the Student

Date of despatch to
Date : _____________ Signature of the Student Seal
the Evaluator:
________________
Name : _______________________
Date of receipt from Address of the Student : ________________________
the Evaluator: Date : _____________
_________________
(Please write your complete address and affix adequate postal stamp on reverse)

Affix
Stamp
Here

From: To

The Coordinator (ADDRESS OF THE STUDENT)

Study Centre concerned ………………………………..
…………………………………..
…………………………………..
 Form No.3
Indira Gandhi National Open University Send this filled-in form
RE-REGISTRATION/COURSE OPTION FORM along with fee to:
For BCA/MCA/MP– Session __________ The Regional Director
and of your Regional Centre
_____________________
RE-ADMISSION FORM FOR MP * As per schedule
I opt for the following courses and enclose a Demand Draft towards the course fee as per details given below:
(For details of courses on offer, please see overleaf).
1. Name of Student : ______________________________
in block letters Draft No. : ____________

Issuing Bank
2. Enrolment Number : and Branch
Payable at : ______________
3. Region Code : ______________

Date : ______________
4. Programme Code :
Amount Rs. : ______________
5. Specialisation :
Diploma Code for
MBA degree

6. Semester for which MCA (for revised syllabus BCA (for pre-revised sylb. only)
re-regn. is sought only)
(Please ): II III IV V VI II III IV V VI

7. Details of course(s) opted (for MP students only)

[Link]. Course Code Course Fee
Course Title
1. Rs.
2. Rs.
3. Rs.
4. Rs.
Late fee, if applicable Rs.
Total fee Rs.
Note: 1. A student can remit the fee pertaining to one semester only at a time. Only one RR Form will
be accepted for a given semester.
For MP students only:
2. A student should opt for and indicate the Specialisation Diploma of his/her choice, if not already done, as
soon as he/she registers for the first course of specialisation stream and should indicate the
Specialisation Diploma code in item No. 5 above. The option once exercised shall be final. If no
specialisation is indicated in item 5 above, University shall register you for specialisation area on the basis
of first course opted from specialisation stream. No change would be permissible at subsequent stage.
3. A student can opt up to four courses in a given session. Courses already opted need not be repeated
unless the validity of registration of such a course has already expired. Further, a student can submit
only one RR Form for a given session. For registration purposes, MS-100 is treated as one course.
The fee for MS-100 is Rs.3000/-.
4. A course once selected for study must be successfully completed within 4 semesters. In case of failure
to do so, the student will be required to seek RE-ADMISSION by paying a fee of Rs.1500/- per course,
as per schedule given below.
5. Request for change of course should be submitted to the RC, as per schedule (fee @Rs.1500/- per
course).
6. MBA old students initially registered up to JULY 2006 cycle of admission are not eligible for
Re-registration in JULY 2014 session.

90
7. The validity of registration of the courses being done in JULY 2014 session by the old students of
Jan.2007, July 2007 & Jan.2008 batches will be reduced to ONE, TWO & THREE semesters
respectively, as against the normal four semesters due to fixing of Maximum duration of 8 (eight) years
in Management Programmes.

Signature of the Student with date

_______________________________________________
Address:
_______________________________________________
Mobile No
_______________________________________________
Phone No & E-mail Id:
_______________________________________________

* Schedule for submission of Re-registration form at the Regional Centre only:

For July Session For January Session Late Fee

1. 1st February to 31st March 1st August to 1st October Nil
2. 1st April to 30th April 3rd October to 31st October 200.00
3. 1st May to 31st May 1st November to 30th November 500.00
4. 1st June to 20th June 1st December to 20th December 1000.00

91
QR Code of Some of the Useful Web Links

eGyankosh Online Re-Registration Form

( for Online Course Materials)

iGRAM To Watch Live Telecast/

(IGNOU Grievance control Room) To listen live Broadcast

Note: The above QR Codes can be scanned and open through and QR Code Scanner
Application/App.

92