Mcaprogramme Guide2006

PROGRAMME GUIDE
FOR
MASTER OF COMPUTER APPLICATIONS
JANUARY, 2006
SCHOOL OF COMPUTER AND INFORMATION SCIENCES

INDIRA GANDHI NATIONAL OPEN UNIVERSITY
MAIDAN GARHI, NEW DELHI - 110 068
www.ignou.ac.in
Page No.
CONTENTS
Message from the MCA Programme Coordinator 3
1. Basic information 4
1.1 MCA Programme Objectives 4
1.2 Duration of the Programme 4
1.3 Medium of Instruction 4
1.4 Credit System 4
1.5 Recognition 4
1.6 MCA Programme Structure 5
1.7 Constraint for Moving to MCA 3rd year 5
1.8 Student Support Services 6
1.9 Newsletter 6
1.10 How to contact the MCA Programme Coordinator 6
2. Instructional System 7
2.1 Print Material 7

2.2 Audio - Video Material and CDs 7
2.3 Counselling Sessions 8
2.4 Web Based Support 17
3. Browsing IGNOU’s Website 18

3.1 Navigation from Home Page 19
3.2 Navigation from SOCIS Page 19
3.3 Procedure to Browse Through MCA pages 20
4. MCA Syllabus 21
5. Evaluation Scheme 58
5.1 Assignments and Term – End Examination 58
5.2 Instructions for Assignments 60
5.3 Guidelines Regarding the Submission of Assignments 61
5.4 General Guidelines Regarding the Term-End Examination 62
6. Other Useful Information 64
6.1 Reservation of Seats 64

6.2 Scholarships and Reimbursement of Fee 64
6.3 Change / Correction of Address 64
6.4 Change of Regional Study Centre 64
6.5 Disputes on Admission and Other University Matters 64
7. Some Useful Addresses 65
8. Model Question Papers 66
9. Forms and Enclosures 77

• Assignments Remittance-Cum-Acknowledgement Card (Form No.1)
• Non receipt of Study Material(s )/ Assignment(s) (Form No.2)
• Term End Examination Form (Form No.3)
• Application Form for Re-checking of Result of Term-end-Examination (Form No.4)
• Application Form for obtaining Duplicate Grade Card / Mark-sheet (Form No.5)
• Change of Address / Study Centre (Form No. 6)
• Re-Registration Form for MCA (Form No. 7)
MESSAGE FROM THE PROGRAMME CO-ORDINATORS
Dear student,
2
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 addresses
given below.
Along with this Programme Guide, you would have received the entire course material and the
assignments booklet for the first semester. This consists of 7 courses: MCS-011, MCS-012, MCS-
013, MCS-014, MCS-015, MCSL-016 and MCSL-017. Each course contains only one assignment
which 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.
At your study centre you will be able to avail 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. Also must submit the assignments of any 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 may be 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 are also given at the end of this booklet. You may use the photocopies of them. The
programme guide, forms and formats are also available on the website. Please confirm the fees
with the Regional Centre / Study Centre / web site before you pay.
In case a student needs the assignments, s/he can obtain a copy of the same from the Study centre
or Regional centre or may download them from the IGNOU’s website with URL www.ignou.ac.in.
As a distance learner, you may have several queries. Many of them would be answered 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 all 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.
We wish you all the success in pursuing the MCA programme.
Akshay Kumar V.V. Subrahmanyam

Email: akshay@ignou.ac.in Email: mca@ignou.ac.in
1. BASIC INFORMATION
3
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.3 Medium of Instruction
The medium of instruction is only in English. The course material is also in English.
1.3 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.
1.5 Recognition
IGNOU is a Central University established by an Act of Parliament in 1985 (Act No.50 of 1985)
IGNOU Degrees/Diplomas/Certificates are recognised 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
5th May, 2004 & AIU Circular No. EV/B(449)/94/177115 dated January 14, 1994.
1.6 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
4
semester courses. The students are at liberty to appear for any of the examinations schedule
conducted by the University during the year subject to completing the minimum time framework
other formalities prescribed for the programme.
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 3
Design and Java Programming
MCS-015 Communication Skills 2 MCSL-025 Lab (based on MCS-021, 022, 4

023 & 024)
MCSL- Internet Concepts and 2
016 Web Design
MCSL- C and Assembly 2
017 Language Programming
Lab
III SEMESTER IV SEMESTER
II MCS-031 Design and Analysis of 4 MCS-041 Operating Systems 4
Algorithms
MCS-032 Object Oriented 3 MCS-042 Data Communication and 4
Analysis and Design Computer Networks
MCS-033 Advanced Discrete 2 MCS-043 Advanced Database 4
Mathematics Management Systems
MCS-034 Software Engineering 3 MCS-044 Mini Project 4

MCS-035 Accountancy and 3 MCSL-045 Lab (UNIX & Oracle) 2
Financial Management
MCSL- Lab (based on MCS- 3
036 032, 034 and 035)
V SEMESTER VI SEMESTER
III MCS-051 Advanced Internet 3 MCSP-060 Project 16
Technologies
MCS-052 Principles of 2
Management and
Information Systems
MCS-053 Computer Graphics and 4
Multimedia
MCSL- Lab (based on MCS-051

054 & 053) 2
MCSE- 3 Stream* Courses 9
001 TO
012
* Student should select one stream from the available streams comprising of 3 courses
Total number of Courses are 31
Total number of Credits are 108.
1.7 Constraint for Moving to MCA 3rd year

A student will be allowed to move to MCA 3rd year (5th semester) only after successful completion
of 1st and 2nd semesters of MCA programme.
The students who don’t have Mathematics at 10+2 level and opted for CS-60 are advised to clear
CS-60 along with the first year of MCA. However, all students have to successfully complete the 1 st
and 2nd semester courses, as well as CS-60 and CIC (wherever applicable) before re-registering for
MCA 5th semester.
1.4 Student Support Services
5
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, practicals, 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.5 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.
It covers various activities at IGNOU Headquarters, Regional Centres and Study Centres. It also
carries important notifications from time to time.
1.10 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, C-Block, IGNOU Academic Complex, IGNOU,
Maidangarhi, New Delhi – 110068, or can send an Email to mca@ignou.ac.in or by telephone with
Tel Nos: 011-29535924 to 29535932 (EPABX).
2. INSTRUCTIONAL SYSTEM
The methodology of instruction in this university is different from that of the conventional
universities. The Open 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 a
distance 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
6
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
practicals
Gyan Darshan Channel, including teleconferencing, Eklavya exclusively for Technology
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 material and would not be available in all the courses. The audio-
video material supplements the print material. Hence, we advise you to make use of it as that 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 tapes can procure them from:
The Director
EMPC, Sanchar Kendra
IGNOU, Maidan Garhi
New Delhi-110068
Ph./Fax:91-011-29534299
The 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
7
doubts which 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 will 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 which 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 may
not be fruitful.
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 assignment implementation.
(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. This lab
record should be duly signed by the practical counsellor 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
Credits
Credits
Year Course Course Title No. of No. of Course Course Title No. of No. of
Code Theory Practical Code Theory Practical
sessions sessions sessions sessions
(2 hrs (3 hrs (2 hrs (3 hrs
each) each) each) each)
I MCS-011 Problem Solving 3 5 2^ MCS-021 Data and File 4 8
and Programming Structures
MCS-012 Computer 4 8 2^ MCS-022 Operating 4 8 2^
Organization and System Concepts
Assembly and Networking
language Management
Programming
MCS-013 Discrete 2 3 MCS-023 Introduction to 3 5 2^
Mathematics Database
8
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- Lab (based on 4 (10+10+10
Skills 025 MCS-021, 022, +10)
023 & 024)
MCSL- Internet Concepts 2 20
016 and Web Design
MCSL- C and Assembly 2 (10+10)
017 Language
Programming Lab
III SEMESTER IV SEMESTER
II MCS-031 Design and 4 8 MCS-041 Operating 4 8
Analysis of Systems
Algorithms
MCS-032 Object Oriented 3 5 2^ MCS-042 Data 4 8 2^
Analysis and Communication
Design and Computer
Networks
MCS-033 Advanced Discrete 2 3 MCS-043 Advanced 4 8 2^
Mathematics Database
Management
Systems
MCS-034 Software 3 5 MCS-044 Mini Project 4 10
Engineering
MCS-035 Accountancy and 3 8 MCSL- Lab (UNIX & 2 (10+10)
Financial 045 Oracle)
Management
MCSL- Lab (based on 3 (10+10+10)
036 MCS-032, 034 and
035)
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 4 8 2^
Graphics and
Multimedia
MCSL- Lab (based on

054 MCS-051 & 053) 2 (10+10)
MCSE- 3 Stream* Courses 9 (5+5+5)
001 TO
012
* Student should select one stream from the available, comprising of 3 courses.
# 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 Assignment Theory Practical Assignment
implementation implementation
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
• th
These sessions should be conducted in the 5 semester.
Total Computer time = Practical time + Assignment implementation time
9
= 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 assignment implementation.
2.3.4 Detailed Counselling Schedule for MCA 1st and 2nd Semesters
The following is the Counselling schedules for 1st and 2nd Semesters of MCA. The Schedule is
applicable for all the students of MCA 1st year. The exact dates of the Schedule will be
communicated to you by the respective study centres.
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
Sessions problems
MCS-012: Computer Organisation and Assembly Language Programming
Counselling Sessions

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
10
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
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
4 with HLL, Device drivers in assembly, Interrupts
in assembly
Practical 1&2 Assignment Design, write and test the MCS-012 assignment
Sessions Problem problem
MCS-013: Discrete Mathematics

Two sessions on Block-2
Session Details

Number Covered
11
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
MCS-014: Systems Analysis and Design

1. Theory Sessions 5 One Session each on Block -1
and Block-2.Two sessions on Block-
3 and one session on Block-4.
Session Details

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
One session on Block-2
Session Details
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)
MCSL-016: Internet Concepts and Web Design
Sessions Number of Sessions Comments
Practical Sessions 20 Internet Concepts and web design
Session Details
12
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)
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
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)
(Section -2)
9 Block -2 ,Lab All the problems given in the session - 1, session - 2 and
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
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
15 Block -2, Lab All the problems given in the session - 4, session -5 and
16 Block -2, Lab All the problems given in the session - 7 and session - 8
(Section - 4)
(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.
Manual session -10 of Section - 5 of the lab manual are to be
13
MCSL-017: C and Assembly Language Programming

Practical Sessions 10 Problem Solving and C programming
Practical Sessions 10 Digital Logic Circuits and Assembly

Language Programming
Session Details

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

1. Theory Sessions 8 Two sessions on each block
Session Details

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
MCS-022: Operating System Concepts and Networking Management
1. Theory Sessions 8 Two sessions on each Block
problems. These sessions are not
compulsory.
Session Details

Number Covered
14
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
Sessions Problems assignment problem. These sessions are not
compulsory.
MCS-023: Introduction to Database Management Systems

1. Theory Sessions 5 Two sessions each on first two
Blocks and one session on Block 3
&4
compulsory.
Session Details

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.
2 Block 1: Unit The concepts of integrity, referential integrity,
3 and Unit 4 functional dependency, the normal forms till
BCNF, sequential file organization, indexes,
index and B tree, multi key file organization.
3 Block2: Unit The Structured Query Language: data definition
1 and manipulation commands, views, nested
queries, examples
4 Block2: 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 Block3 and Discuss the various issues on the case studies of
Block 4 these blocks. Suggest how these studies can be
improved.
Practical 1&2 Assignment Design, implement and test the MCS 023
Sessions Problem assignment problem.
15
MCS-024: Object Oriented Technologies and Java Programming

1. Theory Sessions 5 One Session on Block -1.Three
sessions on Block-2 and Block-3
and one session on Block-4
compulsory.
Session Details

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.
MCSL-025: Data Structures, Networking, DBMS and Java Programming

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
16
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
(Section -3) (session- wise) of the lab manual are to be
DBMS Lab executed.
(Section - 4) (session- wise) of the lab manual are to be
Java Programming Lab executed.
2.4 Web Based Support
The learners can have access to IGNOU’s website at the following address (URL):
http://www.ignou.ac.in.You can download assignments, old question papers, circulars etc. from the
website. The Programme guide is also available at the website. The following section gives you
how to browse the IGNOU’s website.
17
3. BROWSING IGNOU’S WEBSITE
The IGNOU’s website is a dynamic source of latest information and will be undergoing continuous
updates. IGNOU itself is continuously changing to bring about improvement in quality of its
services. There are contents on the site which are open to all, but then there are also areas of
restricted access. For example, course materials, FAQs, assignments and related contents are
available only to those who have registered for and paid fees for the said course. Some sample
courses are open to visitors to have a feel of them, before taking the decision to register with
IGNOU.
3.1 Navigation from Home Page

The learners can have access to IGNOU’s website at the following address (URL)
http://www.ignou.ac.in. 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
The Student Support link provides you the latest information such as results, assignments, last
dates for submissions, updates, notices, details about the delivery of the course material
important circulars etc.
Upon clicking on the Schools option the page related to the links of various schools is displayed as
shown in the Figure 2. From this page students can access the required information as described,
briefly, in subsequent pages.
SOCIS School of Computer and Information Sciences offers the Computer Programmes
MCA, BCA and CIC.
18
Figure 2
3.2 Navigation from SOCIS Page

School of Computer and Information Sciences provides Computer Education Programmes. As soon
as School of Computer and Information Sciences link is selected, a page introducing the school is
displayed as shown in the Figure 3. The page of School of Computer and Information Sciences
looks like this:
Figure 3
3.3 Procedure to Browse Through MCA Pages
19
By clicking on the sub-option “Post Graduate” under the Programmes option views the page as
shown in the Figure 4.
Figure 4
After selecting the Master of Computer Applications link, a page introducing the MCA programme
is displayed. At the bottom of the page you will find the Student’s login. In order to access the
details of the Course, students need to enter Enrolment Number provided to them by the
University at the time of admission and press LOGIN. As shown below in Figure 5 the page
provides all the details related to the selected MCA programme.
Figure 5
Various links are provided to get information related to the programme. Students need to click on
these to get the related information.
20
4. MCA SYLLABUS
The following is the syllabus for the first to fourth semesters of MCA programme. The 6th semester is
completely devoted 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 use in their subsequent course work and professional development. Emphasis of this course is to act as an
introduction to the thinking world of computers, to help students develop the logic, ability to solve the
problems 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. The
student will learn various concepts and techniques for problem solving and will implement those ideas using
C programs.
Syllabus
BLOCK 1: An Introduction to C o History of C

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

• Logic Circuits
• The von Neumann Architecture
• Combinational Circuits
• Instruction Execution: An Example
Canonical and Standard Forms
• Instruction Cycle
Minimization of Gates
Interrupts
• Design of Combinational Circuits
Interrupts and Instruction Cycle
• Examples of Logic Combinational Circuits
• Computers: Then and Now
Adders
The Beginning
Decoders
First Generation Computers
Multiplexer
Second Generation Computers
Encoder
Third Generation Computers
Programmable Logic Array
Later Generations
Read Only Memory ROM
Unit 2: The Data Representation Unit 4: Principles of Logic Circuits I
• Data Representation • Sequential Circuits: The Definition

• Number Systems • Flip Flops
• Decimal Representation in Computers Basic Flip-Flops
• Alphanumeric Representation Excitation Tables
• Data Representation For Computation Master Slave Flip Flops
Fixed Point Representation Edge Triggered Flip-flops
Decimal Fixed Point Representation • Sequential Circuit Design
Floating Point Representation • Examples of Sequential Circuits
Error Detection And Correction Codes Registers
Counters – Asynchronous Counters
Synchronous Counters
23
RAM Floppy Drives
• Design of a Sample Counter CD-ROM & DVD-ROM
• Removable Storage Options
BLOCK 2: Basic Computer Organisation Zip, Jaz & Other Cartridge Drives
Unit 1: The Memory System Recordable CDs & DVDs
CD-R vs CD-RW
• The Memory Hierarchy
Tape Backup
• RAM, ROM, DRAM, Flash Memory
• Secondary Memory and Characteristics Unit 4: I/O Technology
• Hard Disk Drives
o Optical Memories • Keyboard
o CCDs, Bubble Memories Keyboard Layout
• RAID and its Levels Keyboard Touch
• The Concepts of High Speed Memories Keyboard Technology
Cache Memory • Mouse
Cache Organisation • Video Cards
Memory Interleaving Resolution
Associative Memory Colour Depth
• Virtual Memory Video Memory
• The Memory System of Micro-Computer Refresh Rates
SIMM, DIMM, etc., Memory Chips Graphic Accelerators and 3-D
SDRAM, RDRAM, Cache RAM Types Accelerators
of Memory Video Card Interfaces
Unit 2: The Input/Output System • Monitors

Cathode Ray Tubes
• Input / Output Devices or External or Shadow Mask
Peripheral Devices Dot Pitch
• The Input Output Interface Monitor Resolutions
• The Device Controllers and its Structure DPI
Device Controller Interlacing
Structure of an Input /Output Interface Bandwidth
• Device Drivers • Liquid Crystal Displays (LCD)
• Input Output Techniques • Digital Camera
Programmed Input /Output • Sound Cards
Interrupt-Driven Input /Output • Printers
Interrupt-Processing Classification of Printers
DMA (Direct Memory Access) Print Resolutions
• Input Output Processors Print Speed
• External Communication Interfaces Print Quality
Colour Management
Unit 3: Secondary Storage Techniques • Modems
• Scanners
• Secondary Storage Systems Resolution
• Hard Drives Dynamic Range/Colour Depth
Characteristics: Drive Speed, Access Size and Speed
Time, Rotation Speed Scanning Tips
Partitioning & Formatting: FAT, Inode • Power Supply
Drive Cache SMPS (Switched Mode Power Supply)
Hard Drive Interface: IDE, SCSI,
EIDE, Ultra DMA & ATA/66
• Removable Drives
24
• The Micro-Programmed Control
BLOCK 3: The Central Processing Unit • The Micro-Instructions
o Types of Micro-Instructions
Unit 1: Instruction Set Architecture o Control Memory Organisation
o Micro-Instruction Formats
• Instruction Set Characteristics • The Execution of Micro-Program
• Instruction Set Design Considerations
Operand Data Types Unit 5: Reduced Instruction Set Computer
Types of Instructions Architecture
Number of Addresses in an Instruction
• Introduction to RISC
• Addressing Schemes
Importance of RISC Processors
Immediate Addressing
Reasons for Increased Complexity
Direct Addressing
High Level Language Program
Indirect Addressing
Characteristics
Register Addressing
• RISC Architecture
Register Indirect Addressing • The Use of Large Register File
Indexed Addressing Scheme • Comments on RISC
Base Register Addressing • RISC Pipelining
Relative Addressing Scheme
Stack Addressing Block 4: Assembly Language
• Instruction Set and Format Design Programming
Issues
Unit 1: Microprocessor Architecture
Instruction Length
Allocation of Bits Among Opcode and
Operand
• Microcomputer Architecture
Variable Length of Instructions
• Structure of 8086 CPU
• Example of Instruction Format
The Bus Interface Unit
Unit 2: Registers, Micro-Operations
and Instruction Execution Execution Unit (EU)
• Basic CPU Structure
• Register Set of 8086
• Register Organization
• Instruction Set of 8086
Programmer Visible Registers
o Data Transfer Instructions
Status and Control Registers
• General Registers in a Processor Arithmetic Instructions
• Micro-operation Concepts Bit Manipulation Instructions
Register Transfer Micro-operations Program Execution Transfer
Instructions
Arithmetic Micro-operations
String Instructions
Logic Micro-operations
Processor Control Instructions
Shift Micro-operations
• Addressing Modes
• Instruction Execution and Micro-operations
o Register Addressing Mode
• Instruction Pipelining
Immediate Addressing Mode
Unit 3: ALU Organisation Direct Addressing Mode
Indirect Addressing Mode
• ALU Organisation
A Simple ALU Organization Unit 2: Introduction to Assembly
A Sample ALU Design Language Programming
Arithmetic Processors • The Need and Use of the Assembly Language
Unit 4: The Control Unit • Assembly Program Execution

• The Control Unit • An Assembly Program and its Components
• The Hardwired Control The Program Annotation
• Wilkes Control Directives
25
• Input Output in Assembly Program • Programming for Arithmetic and String
Interrupts Operations
DOS Function Calls (Using INT String Processing
21H) Some More Arithmetic Problems
• The Types of Assembly Programs
COM Programs Unit 4: Assembly Language Programming
EXE Programs (Part – I)
• How to Write Good Assembly Programs • Use of Arrays in Assembly
Unit 3: Assembly Language Programming • Modular Programming
(Part – I) The stack
• Simple Assembly Programs FAR and NEAR Procedures
Data Transfer Parameter Passing in Procedures
Simple Arithmetic Application External Procedures
Application Using Shift Operations • Interfacing Assembly Language Routines to
Larger of the Two Numbers High Level Language
• Programming With Loops and Comparisons • Programs
Simple Interfacing
Simple Program Loops
Interfacing Subroutines With Parameter
Find the Largest and the Smallest Array
Passing
Values
• Interrupts
Character Coded Data
Code Conversion • Device Drivers in Assembly
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. Regarding computer science concept from 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
Block 1: Elementary Logic Unit 2: Methods of Proof

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

Development • Users
Unit 1: Introduction to SAD • Analysts in various functional areas
• Fundamentals of System o Systems Analyst in Traditional
o Important Terms related to Systems Business
o Classification of Systems o Systems Analyst in Modern Business
o Real Life Business Subsystems • Role of a Systems Analyst
• Real Time Systems • Duties of a Systems Analyst
• Distributed Systems • Qualifications of a Systems Analyst
• Development of a successful System o Analytical Skills
• Various Approaches for development of o Technical Skills
Information Systems o Management Skills
o Structured Analysis and Design o Interpersonal Skills
Approach
o Prototype Unit 3: Process of System Development
o Joint Application Development • Systems Development Life Cycle
Unit 2: Systems Analyst-A Profession • Phases of SDLC
o Project Identification and
27
Selection • Modularity
o Project Initiation and planning o Goals of Design
o Analysis o Coupling
o Logical Design o Cohesion
o Physical Design
Unit 7: System Design and Modelling
o Implementation
o Maintenance • Logical and Physical Design
• Product of SDLC Phases • Process Modeling
• Approaches to Development o Data Flow Diagrams
o Prototyping • Data Modeling
o Joint Application Design o E-R Diagrams
o Participatory Design • Process Specification Tools
• Case Study o Decision Tables
o Decision Trees
Unit 4: Introduction to Documentation of o Notation Structured English
Systems • Data Dictionary
• Concepts and process of
• Documentation Block 3: More Design Issues and CASE
• Types of Documentation Tools
o System Requirements Specification
o System Design Specification Unit 8: Forms and Reports Design
o Test Design Document • Forms
o User Manual o Importance of Forms
• Different Standard for Documentation • Reports
• Documentation and Quality of Software o Importance of Reports
• Good Practices for Documentation • Differences between Forms and
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
28
o Economy Block 4: Implementation and Security of
• Criteria for Report Design Systems & MIS
o Relevance
o Accuracy Unit 11: Implementation and Maintenance
o Clarity of Systems
o Timeliness • Implementation of Systems
o Cost o Conducting System Tests
o Preparing Conversion Plan
Unit 9: Physical File Design and Data base o Installing Databases
Design
o Training the end users
• Introduction to Database design o Preparation of User Manual
o Flat files vs. Database o Converting to the new System
o Steps in Database Design • Maintenance of Systems
o E-R model to Database Design o Different Maintenance activities
o Inputs to Physical Database Design o Issues involved in Maintenance
o Guidelines for Database Design
• Design of Data Base Fields Unit 12: Audit and Security of Computer
o Types of Fields Systems
o Rules for Naming Tables and Fields • Definition of Audit
• Design of Physical Records o Objectives of Audit
• Design of Physical Files o Responsibility and Authority of the
o Types of Files System Auditor
o File Organization o Confidentiality
• Design of Database o Audit Planning
• Case Study • Audit of Transactions on Computer
o Transaction Audit
Unit 10: CASE Tools for Systems o Audit of Computer Security
Development o Audit of Application
• Use of CASE tools by organizations o Benefits of Audit
o Definition of CASE Tools • Computer Assisted Audit Techniques
o Use of CASE tools by Organizations o Audit Software
o Role of CASE Tools o Test Data
o Advantages of CASE Tools o Audit Expert Systems
o Disadvantages of CASE Tools o Audit Trail
• Components of CASE • Computer System and Security issues
o Types of CASE Tools o Analysis of Threats and Risks
o Classification of CASE Tools o Recovering from Disasters
o Reverse and Forward Engineering o Planning the contingencies
• Visual and Emerging CASE tools o Viruses
o Traditional systems development and • Concurrent Audit Techniques
CASE based systems development o Need for Concurrent Audit
o CASE environment o Techniques
o Emerging CASE Tools o An Integrated Test Facility
o Objected oriented CASE tools o Techniques
o Creating documentation and reports o The Snapshot Techniques
using CASE tools o SCARF
o Creating and executable prototype o Continuous and Intermittent
using Object Oriented CASE tools o Simulation Technique
o Sequence Diagrams
Unit 13: Management Information Systems
• Role of MIS in an organization
• Different kinds of Information Systems
29
o Transaction Processing System o Decision Support System
o Management Information o Expert System
o System
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, making negotiations and many more.
Syllabus
BLOCK 1: Skills Needed at the Work Place - I • Vocabulary: Apply for a Job
• Curriculum Vitae
Unit 1: The Process of Communication • Language Focus: Some Useful Words
• Introduction: What is Communication? • Study Skills: Preparing for an Interview
• The Process of Communication • Listening
• Barriers to Communication • Speaking
• Different Types of Communication • Writing
• Written vs. Oral Communication Unit 4: Group Discussions
• Different Types of Face-to-Face Interactions
• Characteristics and Conventions of • Reading
Conversation • Writing Skills
• Conversational Problems of Second/Foreign • Listening: How to be Successful in a Group
Language Users Discussion
• Difference between Conversation and Other • Study Skills
Speech Events • Language Focus
• Vocabulary
Unit 2: Telephone Techniques
• Speaking
• Warm Up • Grammar: Connectives
• Speaking and Listening: Commonly Used • Pronunciation
Phrases in Telephone Conversations
• Reading: Conference Calls Unit 5: Managing Organisational
Structure
• Vocabulary
• Writing and Listening: Leaving a Message • Warm Up: Ability to Influence and Lead
• Grammar and Usage: The Perfect Tenses • Reading: The Role of a Manager
• Pronunciation: Contracted Forms • Vocabulary: Leadership
• Speaking and Listening
Unit 3: Job Applications and Interviews
• Language Focus: Degree of Probability
• Warm up • Grammar: Modals
• Reading • Writing: Reports
30
• Pronunciation • Grammar: Verbs often Required in
Presentations
Unit 6: Meetings
• Language Focus
• Reading: A Successful Meeting • Listening: Importance of Body Language in
• Speaking: One to One Meetings Presentations
• Language Focus: Opening, Middle and Close • Speaking: Preparing an Outline of a
• Study Skills: Editing Presentation
• Listening: Criteria for Successful Meetings • Pronunciation
• Vocabulary Unit 9: Presentation Skills – II
• Grammar: Reporting Verbs
• Writing: Memos • Reading: Structure of Presentation
• Pronunciation: Stress According to Part of • Study Skills: Visual Aids
Speech • Ending the Presentation
• Language Focus: Talking about Increase and
Unit 7: Taking Notes and Preparing Decrease
Minutes
• Grammar: Prepositions
• Taking Notes
• Listening: Podium Panic
o The Note-taking Skill: The Essential
• Speaking
Components
o The Note-taking Skill: An Example • Pronunciation: Emphasizing the Important
• Preparing Minutes Words in Context
o Format of Minutes Unit 10: Negotiation Skills
o Language and Style of Minutes
• Language Focus: Idiomatic Expressions
• Grammar: Using the Passive Voice
• Study Skills: Process of Negotiations
Unit 8: Presentation Skills – I • Grammar: Phrasal Verbs
• Reading: Presentation Skills • Listening: Effective Negotiations
• Speaking
• Writing
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
the 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 • Intranet & Extranet

• Internet Infrastructure
Unit 1: The Internet
• Protocols and Services on Internet
• Classification of Networks o Domain Name System
• Networking Models o SMTP and Electronic Mail
• What is Packet Switching o Http and World Wide Web
• Accessing the Internet o Usenet and Newgroups
• Internet Protocols o FTP
o Internet Protocol (IP) o Telnet
o Transmission Control Protocol (TCP) o Internet Tools
o Search Engines
• Internet Address
o Web Browser
o Structure of Internet Servers Address
Unit 2: Introduction to HTML
o Address Space
• How does the Internet work • What is HTML
31
• Basic Tags of HTML • Object-Based Programming
o HTML Tag o Functions
o TITLE Tag o Executing Deferred Scripts
o BODY Tag o Objects
• Formatting of Text • Message box in Javascript
o Headers o Dialog Boxes
o Formatting Tags o Alert Boxes
o PRE Tag o Confirm Boxes
o FONT Tag o Prompt Boxes
o Special Characters • Javascript with HTML
• Working with Images o Events
• META Tag o Event Handlers
Unit 3: Advanced HTML • Forms
o Forms Array
• Links
o Anchor tag Unit 5: VB Script
• Lists • What is VBScript
o Unordered Lists
• Adding VBScript Code to an HTML Page
o Ordered Lists
o Definition Lists o VB Script Basics
• Tables o VBScript Data Types
o TABLE, TR and TD Tags o VBScript Variables
o Cell Spacing and Cell Padding o VBScript Constants
o Colspan and Rowspan o VBScript Operators
• Frames • Using Conditional Statements
o Frameset • Looping Through Code
o FRAME Tag • VBScript Procedures
o NOFRAMES Tag • VBScript Coding Conventions
• Forms • Dictionary Object in VBScript
o FORM and INPUT Tag o Methods: VBScript Dictionary Object
o Text Box o VBScript Dictionary Object 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 Program
o Loop Statements Section 2: Advanced HTML
32
• Advanced Topics of HTML • Adding Layers to the Timeline and Giving
Motion to the Layer
Section 3: JavaScript
• Inserting Scripts
• Script Basics • Inserting External Media in the Web Page
• Incorporating JavaScript into a Web Page • Adding SSI(Server-side include to the
Section 4: VBScript Page)
• Adding CSS Style to your Page
• VBScript Basics • Adding XML Files to your Page
• Incorporating VBScript into HTML Page • To Export a Dreamweaver Document as
Section 5: Dreamweaver XML File, checking entries, working in
frames, windows control, the Java script
• How to Work in Dreamweaver?? URL.
• How to save your file?
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 the hands on experience on C Programming and Assembly
language programming and improve the practical skill set. 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, write some complex programs
Syllabus
Section 1 C Programming Lab • Making a Logic Circuit Using Logic

• Salient Features of C • A Revisit of Steps of Logic Circuit Design
• C Programming Using Borland Compiler • Session-wise problems
• Using C with UNIX Section 3 Assembly Language
• Running C Programs using MS Visual C++ Programming
• Program Development Life Cycle • Assemblers
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
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 BLOCK 1: Introduction to Algorithms and

Data Structures
33
Unit 1: Analysis of Algorithms • Abstract Data Type-Tree
• Mathematical Background • Implementation of Tree
• Process of Analysis • Tree Traversals
• Calculation of Storage Complexity • Binary Trees
• Calculation of Run Time Complexity • Implementation of Binary Tree
• Binary Tree Traversals
Unit 2 Arrays o Recursive Implementation of Binary
• Arrays and Pointers Tree Traversals
• Sparse Matrices o Non Recursive Implementations of
• Polynomials Binary Tree Traversals
• Representation of Arrays • Applications
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
• Linked Lists-Implementation Search Tree
• Doubly Linked Lists-Implementation o Deletion of a node from a Binary
• Circularly Linked Lists-Implementation Search Tree
• Applications • AVL Trees
o Insertion of a node into an AVL Tree
Block-2: Stacks, Queues and Trees o Deletion of a node from and AVL Tree
o AVL tree rotations
Unit 4: Stacks
o Applications of AVL Trees
• Abstract Data Type-Stack • B-Trees
• Implementation of Stack o Operations on B-Trees
o Implementation of Stack using Arrays o Applications of B-Trees
o Implementation of Stack using Linked
Lists Unit 8: Graphs
• Algorithmic Implementation of Multiple • Definitions
Stacks
• Shortest Path Algorithms
• Applications
o Dijkstra’s Algorithm
Unit 5: Queues o Graphs with Negative Edge costs
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
circular queue • Finding Strongly Connected Components
• Implementation of DEQUEUE
Unit 9: Searching
o Array Implementation of a
dequeue • Linear Search
o Linked List Implementation of • Binary Search
a dequeue • Applications
Unit 6: Trees BLOCK 4: File Structures and Advanced Data
34
Structures • Red-Black trees
Unit 10 Sorting
o Properties of a Red-Black tree
o Insertion into a Red-Black tree
• Internal Sorting o Deletion from a Red-Black tree
o Insertion Sort • AA-Trees
o Bubble Sort Unit 12: File Structures
o Quick Sort
• Terminology
o 2-way Merge Sot
o Heap Sort • File Organisation
• Sorting on Several Keys • Sequential Files
o Structure
Unit 11: Advanced Data Structures o Operations
• Splay Trees o Disadvantages
o Splaying steps o Areas of use
o Splaying Algorithm • Direct File Organisation
• Indexed Sequential File Organisation
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
BLOCK 1: Operating System Fundamentals • Operating System Structure

Networking o Layered Structure Approach
o Virtual Machine
Unit 1: Graphical User Interface
o Client-Server Model
• What is Graphical User Interface o Kernel Approach
• Evolution of Human and Machine Interaction • Classification of Advanced Operating
• Common Graphical User Interfaces System
• Functionality of Graphical User Interface o Architecture Driven Operating System
• GUI Design Consideration: psychological o Application Driven Operating System
factors • Characteristics of Modern Operating
• GUI Design Consideration: standards System
• GUI Example o Microkernel Architecture
o Microsoft Windows o Multithreading
o Macintosh Toolbox o Symmetric Multiprocessing
o X-windows
o NeXT Unit 3: Introduction to Networking
Concepts
Unit 2: Introduction to Operating System • Why Computer Networks
• What is an Operating System? • The Topologies
• Evolution of Operating System • Characteristics of the OSI Layers
o Serial Processing • OSI Models and Communication between
o Batch Processing Systems
o Multiprogramming • Interaction between OSI Model Layers
• Protocols Types of Networks
35
o Local Area Network (LANs) o Changing Your Password
o Metropolitan Networks (MANs) o Characters with Special Meanings
o Wide Area Network (WANs) o Linux Documentation
• Medium • The File System
• Data Flow o Current Directory
• Physical Connection o Looking at the Directory Contents
• Transmission Media o Absolute and Relative Pathnames
• Connecting Devices o Some Linux Directories and Files
o Repeaters Unit 3: Linux Utilities and Editor
o Hubs
o Bridges • Some Useful Commands
o Routers • Permission Modes and Standard Files
o Gateways • Pipes, Filters and Redirection
• Shell Scripts
Unit 4: Internetworking: Concept,
• Graphical User Interface
Architecture and Protocols
• Editor
• History of internetworking
Unit 4: User-to-User Communication
• Packet Switching
• Internetworking Concepts • On-Line Communication
• Internet Addresses Object-Based • Off-Line Communication
Programming • Apache Server Settings
• Configuring IP Addresses • Network Server Settings
• TCP/ IP o Domain Name Server
• Additional TCP/ IP – Related Protocols o Network File Server
• Application Layer Protocols
o File Transfer Protocols Unit 5: Unix System Administration
o Trivial File Transfer Protocol (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 Management o Peer-To-Peer Network
o File Management System o Domains
o Device Drivers o Network Protocols
o File Services
Unit 2: Linux Commands and Utilities o Shared Folders
• Entering the Machine o Distributed File System
o User Names and Groups o Print Services
o Logging In • Using the Mapped Drive
o Correcting Typing Mistakes o Printing a Mapped Drive
o Format of Linux Commands o Disconnecting a Mapped Drive
36
o Viewing Directory Information • Security System and Facilities
o Creating a Shared Folder o System Access Control
o Logging off a Client o Password Management
• A Few Important Facts About Windows o Privileged User Management
2000 Usages o User Account Management
o Data Resource Protection
o Sensitive System Protection
Unit-2: Managing Windows 2000 Server • Cryptography
• Using Windows 2000 and Client • Intrusion detection
• Logging on to the Network • Computer-Security Classifications
• Browsing Network Resources 1 Unit 2: Computer Security
• Accessing Network Resources Using My • Hardening Operating System and
Network Places Application Code
• Mapping a Folder • Hardening File System Security
Unit3: Advanced Windows 2000 • Hardening Local Security Policies
Networking • Hardening Services
• Hardening Default Accounts
• Windows 2000 Domains, Workgroups &
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 Windows o Logon Security Management
XP o Users and Groups Management
o To Select a Network Protocol o Managing Local and Global Groups
o Virtual Private Networks and Remote o Managing User Accounts
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 Unit 4: Security and Management-II
• Threat and Vulnerabilities
• User Authentication • User Authentication Management
37
o Subsystems Component Management o Moving Data and Permission
o Kerberos Management o Shared Resources Management
• User and Group Management o The NULL Session
o Configuring User Accounts o Registry Management
o Creating Domain User Accounts o Default Registry Configurations
o Managing Logon Hours o Registry Backup Managements
o Managing Expiry Date for a User o Printer Security Management
Account • Windows 2000 Network – Security and
o Windows 2000 Groups Management Management
o Default Group Types o NAT and ICS
o Security Configuration Management o RRAS, RADIUS and IAS
Tool o IPSec
• Resource Management • Encrypting File System Management
o Encrypting File System (EFS)
o Files and Folder Management o EFS and Users Management
o Files and Folder Permission o Data Recovery Management
o Inheritances and Propagation o EFS Cryptography Management
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 Query Processor

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

• Types of Indexes
39
• Structure of Distributed Database • Need to Develop the Hospital Management
• Advantages and Disadvantages of DDBMS System (An HMS)
Advantages of Data Distribution • Creating a Database for HMS
Disadvantages of Data Distribution • Developing Front End Forms
• Design of Distributed Databases
• Reports
Data Replication
• Using Queries and Record set
Data Fragmentation
• Client Server Databases BLOCK 4: Study Centre Management
Emergence of Client Server System: A Case Study
Architecture • Software Development Process: Analysis
Need for Client Server Computing • System Designing
Structure of Client Server Systems • Issues relating to Software Development,
Advantages of Client Server Systems Testing and Maintenance
BLOCK 3: Application Development:
Development of a Hospital Management
System
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. This course
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 A Simple Java Program

• Primitive Data Type And Variables
• Paradigms of Programming Languages
o Java Keywords
• Evolution of OO Methodology
o Integer and Floating Point Data Type
• Basic Concepts of OO Approach
o Character and Boolean Types
• Comparison of Object Oriented and o Declaring and Initialization Variables
Procedure Oriented Approaches • Java Operators
• Benefits of OOPs
• Introduction to Common OO Language Unit 4: Expressions, Statements and
Arrays
• Applications of OOPs
• Expressions
Unit 2: Object Oriented Methodology-2 • Statements
• Classes and Objects • Control Statements
• Abstraction and Encapsulation • Selection Statements
• Inheritance • Iterative Statements
• Method Overriding and Polymorphism • Jump Statements
• Arrays
Unit 3: Java Language Basics
• Introduction To Java
o Basic Features
o Java Virtual Machine Concepts
40
BLOCK 2: Object Oriented Concepts and • Polymorphism
Exceptions Handling • Final Keyword
Unit 1: Class and Objects Unit 3: Packages and Interfaces
• Class Fundamentals • Package
o Creating objects o Defining Package
o Assigning object reference variables o CLASSPATH
• Introducing Methods o Package naming
o Static methods • Accessibility of Packages
o Constructors • Using Package Members
o Overloading constructors • Interfaces
• This Keyword • Implementing Interfaces
• Using Objects as Parameters • Interface and Abstract Classes
o Argument passing
• Extends and Implements Together
o Returning objects
• Method Overloading Unit 4: Exceptions Handling
• Garbage Collection
• Exception
• The Finalize ( ) Method
• Handling of Exception
Unit 2: Inheritance and Polymorphism o Using try-catch
• Inheritance Basics o Catching Multiple Exceptions
o Using finally clause
• Access Control
• Types of Exceptions
• Multilevel Inheritance
• Method Overriding • Throwing Exceptions
• Abstract Classes • Writing Exception Subclasses
BLOCK 3: Multithreading, I/O and String Handling

Unit 1: Multithreaded Programming Unit 3: Strings and Characters
• Fundamentals of Characters and Strings
• Multithreading: An Introduction • The String Class
• The Main Thread • String Operations
• Java Thread Model • Data Conversion using Value Of ( ) Methods
• Thread Priorities • String Buffer Class and Methods
• Synchronization in Java
• Interthread Communication Unit 4: Exploring Java I/O
Unit 2 : I/O in Java • Java I/O Classes and Interfaces
• I/O Stream Classes
• I/O Basics o Input and Output Stream
• Streams and Stream Classes o Input Stream and Output Stream
o Byte Stream Classes Hierarchy
o Character Stream Classes • Text Streams
• The Predefined Streams • Stream Tokenizer
• Reading from, and Writing to, Console • Serialization
• Reading and Writing Files • Buffered Stream
• The Transient and Volatile Modifiers • Print Stream
• Using Instance of Native Methods • Random Access File
BLOCK 4: Applets Programming and Unit 1: Applets

Advance Java Concepts
• The Applet Class
• Applet Architecture
• An Applet Skeleton: Initialization
41
and Termination • Naming Services (DNS)
• Handling Events • JAVA and the net: URL
• HTML Applet Tag • TCP/IP Sockets
Unit 2: Graphics and User Interfaces • Datagrams
• Graphics Contexts and Graphics Objects Unit 4: Advance Java

o Color Control • Java Database Connectivity
o Fonts o Establishing A Connection
o Coordinate System o Transactions with Database
• User Interface Components • An Overview of RMI Applications
• Building User Interface with AWT o Remote Classes and Interfaces
• Swing-based GUI o RMI Architecture
• Layouts and Layout Manager o RMI Object Hierarchy
• Container o Security
• Java Servlets
Unit 3: Networking Features o Servlet Life Cycle
• Socket Overview o Get and Post Methods
• Reserved Parts and Proxy Servers o Session Handling
• Internet Addressing: Domain • Java Beans
MCSL-025: Lab (Data Structures using C, WINDOWS 2000, LINUX / UNIX, Java and MS-
ACCESS, My SQL) 4 Credits
Objectives
This lab is based on the courses MCS-021, MCS-022, MCS-023 and MCS-024. This lab course 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 • Network administration of Windows 2000
Manual • LINUX administration
• Arrays • Unix Networking
• Structures • Installation and Configuration of the
• Linked Lists networking services like TCP/IP, DNS,
• Stacks DHCP, FTP, SMTP
• Queues
• Trees SECTION 3: DBMS Lab
• Advanced Trees
• Graphs • Introduction to MS-Access
• 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
42
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 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 is 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 objective 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 Unit 2: Some pre-rquisites and

Asymptotic Bounds
Unit 1: Elementary Algorithmics •Some Useful Mathematical Functions
&Notations
•Example of an Algorithm o Functions & Notations
•Problems and Instances o Modular Arithmetic/Mod Function
•Characteristics of an Algorithm •Mathematical Expectation
•Problems, Available Tools & Algorithms •Principle of Mathematical Induction
•Building Blocks of Algorithms •Concept of Efficiency of an Algorithm
o Basic Actions & Instructions •Well Known Asymptotic Functions & Notations
o Control Mechanisms and Control o Enumerate the Five Well-Known
Structures Approximation Functions and
o Procedure and Recursion How these are Pronounced
•Outline of Algorithms o The Notation O
o Understanding the Problem o The Ω Notation
o Analyzing the Problem o The Notation Θ
o Capabilities of the Computer System o The Notation o
o Approximate vs Exact Solution o The Notation ω
o Choice of Appropriate Data Structures Unit 3: Basics of Analysis
o Choice of Appropriate Design
Technology •Analysis of Algorithm ─ Simple Example
o Specification Methods for Algorithms •Well Known Sorting Algorithms
o Proving Correctness of an Algorithm o Insertion Sort
o Analyzing an Algorithm
o Bubble Sort
o Coding the Algorithm o Selection Sort
o Shell Sort
o Heap Sort
o Divide and Conquer Technique
o Merge Sort
43
o Quick Sort BLOCK 3 Design Techniques - II
o Comparison of Sorting Algorithms
Unit 1 Dynamic Programming
•Best-Case and Worst-Case Analyses
o Various Analyses of Algorithms •The Problem of Making Change
o Worst-Case Analysis •The Principle of Optimality
o Best-Case Analysis
•Chained Matrix Multiplication
•Analysis of Non-Recursive Control
Structures •Validity of Optimality Principle
o Sequencing
o For Construct UNIT 2 BACKTRACKING
o While and Repeat Constructs •Backtracking
•Recursive Constructs
Unit 3 Greedy Algorithms
•Solving Recurrences •General Characteristics of Greedy
algorithms
o Method of Forward Substitution •Graphs: Minimum Spanning Trees
o Solving Linear Second-Order o Kruskal’s Algorithm
o Recurrences with Constant Coefficients o Prim’s Algorithm
•Average-Case & Amortized Analyses •Graphs: Shortest Paths
•The Knapsack Problem
o Average-Case Analysis
o Amortized Analysis •Scheduling
BLOCK 4:omplexity & Completeness
BLOCK 2 Design Techniques-I
Unit 1: Computational Complexity
Unit 1: Divide-and-Conquer
•Classification of Problems
•General Issues in Divide-And Conquer
UNIT 2 Adversary Arguments & Linear
•Binary Search
Reductions
•Sorting
o Merge Sort
•Finding the Maximum of an Array
o Quick Sort •Testing Graph Connectivity
•Finding the Median •The Median Revisited
•Matrix Multiplication •Formal Definitions
•Exponentiation •Reductions Among Matrix Problems
•Reductions Among Shortest Path Problems
UNIT 2: Graphs Algorithms
•An Example Unit 3: Introduction to NP-Completeness
•Traversing Trees •Establishing NP-Completeness of Problems
o Preconditioning
•Depth-First Search Unit 4: NP-Completeness Proofs & Head
Problems
•Breadth-First Search •A Few NP-Completeness Proofs
•Best-First Search & Minimax Principle •NP-Hard Problems
•Topological Sort •Non-Deterministic Algorithms
MCS-032: Object Oriented Analysis and Design 3 Credits
Objectives
44
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
Block 1: Object Oriented Modeling and o Sequence

UML o Interaction Overview
Unit 1: Introduction to Object Oriented o Activity
Modelling o State
• Modeling with Objects
• Object Oriented Modeling
• Characteristics Object Oriented Modeling Block 2: Object Oriented Design
o Class and Objects Unit 4: System Design
o Links and Association • System Design: An Object Oriented Approach
o Generalization and Inheritance • Breaking into Subsystems
• An Object Model • Concurrency Identification
• Benefits of OO Modeling • Management of data store
• Introduction to OOAD tools • Controlling events between Objects
• Handling Boundary Conditions
Unit 2: Object Oriented Analysis
• Object Oriented Analysis Unit 5: Object Design
• Problem Statement: an Example • Object Design for Processing
• Differences between Structured Analysis and • Object Design Steps
Object Oriented Analysis • Designing a Solution
• Analysis Techniques • Choosing Algorithms
o Object Modeling • Choosing Data Structures
o Dynamic Modeling • Defining Classes and delegation of
o Functional Modeling Responsibilities to Methods
• Adding Operations
Unit 6: Advance Object Design
• Analysis Iteration
• Control and its Implementation
Unit 3: Using UML
o Control as a State within Program
• UML: Introduction o Control as State Machine Engine
• Object Model Notations: o Control as Concurrent Task
• Basic Concepts • Inheritance Adjustment
• Structural Diagrams • Association: Design
o Class • Object Representation
o Object • Design Optimization
o Composite
• Design Documentation
o Package
o Component Block 3: Modeling
o Deployment Unit 7: Object Modeling
• Behavioral Diagrams:
o Use Case • Advance Modeling Concepts
o Communication o Aggregation
o Abstract Class
45
• Multiple Inheritance
• Generalization as an Extension
• Generalization as a Restriction
• Metadata
• Constraints
• An Object Model
Unit 8: Dynamic Modeling

• Events
• State and State Diagram
• Elements of State Diagrams
• Examples of State Diagrams
• Advance Concepts in Dynamic Modeling
• Concurrency
• A Dynamic model
Unit 9: Functional Modeling
• Functional Models
• Data Flow Diagrams
• Features of a DFD
• Design flaws in DFD
• A Functional model
• Relationship between Object, Dynamic, and
Functional Models
Block 4: Implementation
Unit 10: Implementation Strategies
• Implementation
o Using Programming Languages
o Using Database System
• Unidirectional Implementation
• Bi-directional Implementation
• Implementing associations
• Implementing Constraints
• Implementing Statecharts
• Persistency
Unit 11: Object Mapping with Databases
• Relational Database Schema for Object

Modes
• Object Classes to Database Tables
• Mapping Associations to Tables
• Mapping Generalizations to Tables
• Interfacing to Database
• Object Mapping with Databases:
an Example
Unit 12: Case Study
• This unit will cover all the OOAD aspects
Covered in previous 11(eleven) units of this
course.
46
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
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: Basic Properties of Graphs
Unit 1: Recurrence Relations
• What Graphs are
• The Fibonacci Sequences, The Tower of • Degree, Regularity and Isomorphism
Hanoi, Catalan Numbers • SubGraphs
• Related Definitions
Unit 2 Connectedness
• Divide and Conquer Methods
• Connected Graphs
Unit 2 Generating Functions
o Paths, Circuits and Cycles
• Definitions and Constructions o Components
• Applications for Finding the Number of o Connectivity
Integers Solutions of Linear Equations • Bipartite Graphs
• Exponential Generating Functions
Unit 3 Eulerian and Hamiltonian Graphs
• Solving Recurrence Relations using
Generating Functions • Eulerian Graphs
• Applying Generating Functions for • Hamiltonian Graphs
Combinatorial Identities and Partitions • Travelling Salesperson Problem
Unit 3 Solving Recurrences Unit 4 Graph Colourings
• Linear Homogeneous Recurrences • Vertex Colouring
• Linear Non- Homogeneous Recurrences • Edge Colouring
• Methods of Inspection, Telescoping Sums, • Planar Graphs
Iteration, Substitution • Map Colouring Problem
MCS-034: Software Engineering 3 Credits
Objectives
The objective of the courses 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 Engineering Unit 2: Principles of Software
Requirements Analysis
Unit 1 Software Engineering and its
models • Engineering the product
• Evolution of Software Engineering • Modeling the system architecture
• Software development models • Software prototyping and specification
• Capability maturity models Unit 3 Software Design
• Software process technology • Data design
• Architectural design
• Interface design
47
• HCI design • Change control\
• Modular design • Auditing and reporting
Unit 4 Software testing
BLOCK 3: Advanced Software Engineering
• Testing techniques
Unit 9: Web Software Engineering
• Testing for specialized environments
• Debugging • Different layers
• Issues of management of web based projects
BLOCK 2: Software Project Management
• Metrics
Unit 5: Software Project Planning • Analysis
• Different types of project metrics • Design
• Software project estimation • Testing
• Models for estimation
• Automated tools for estimation Unit 10: Mobile Software Engineering
• Transition from design to coding of mobile
Unit 6: Risk management and Project applications
Scheduling • Elements of mobile applications
• Identification of Software risks
• Monitoring of risks • Approaches to the development of mobile
• Management of risks applications
• Formulating a task set for the project Unit 11: CASE tools
• Choosing the tasks of software engineering
• Analysis tools
• Scheduling methods
• Design tools
• The Software project plan
• SQA tools
• UI design tools
Unit 7 Software Quality Assurance • Software testing tools
• Web engineering tools
• Formal technical reviews
• Software reliability Unit 12: Advanced Software Engineering
• Software quality standards • Clean room Software engineering
Unit 8 Software change management • Component based Software engineering
• Re-engineering
• Baselines • Reverse engineering
• Version control
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 • Nature of Accounting Function
• Organisation Chart for Accounting and
Unit 1: Accounting and its Functions
• Finance
• Scope of Accounting
• Emerging Role of Accounting
• Accounting as an Information System
Unit 2: Accounting Concepts and Standards
• Role and Activities of an Accountant
• Accounting Personnel • Accounting Framework
• Accounting Concepts
48
• Accounting Standards Unit 2: Funds Flow and Cash Flow
• Changing Nature of Generally Accepted Statements
• Accounting Principles (GAAP) • Statements of changes in Financial
• Attempts towards Standardisation Positions
• Accounting Standards in India • Fund Flow Statement
• Analysing Changes in Working Capital
Unit 3: Basic Accounting Process: • Sources of Funds
Preparation of Journal, Ledger
• Uses (Applications) of Funds
and Trial Balance
• Cash Flow Statement
• Accounting Equation • Sources and Uses of Cash
• Classification of Accounts
• Definitions of Journal and Unit 3: Ratio Analysis
Ledger • Categories of Ratios
o Journalising Process o Long-term Solvency Ratios
o Ledger Posting o Short-term Solvency Ratios
o Balancing an Account o Activity or Turnover Ratios
• Trial Balance o Profitability Ratios
• Objectives of Preparing Trial Balance o Market Test Ratios
o Total Method of Preparing the
Trial Balance BLOCK 3: Financial Management and
o Balance Method of Preparing the Decisions
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
Accounts • Agency Relationship
• Trading Account • Changing Financial Landscape
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 Unit 3: Working Capital Decisions
• Constructing a Balance Sheet
• 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
Unit 1: Cash and Treasury Management
Debts
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
49
o Determining the Optimum Cash • Credit Evaluation
Balance • Monitoring Receivables
• Methods of Cash Flow Budgeting • Factoring
• Investing Surplus Cash Unit 3: Inventory Management
• Cash Collection and Disbursements
• Reasons for Holding Inventory
Unit 2: Receivables Management • Objectives of Inventory Management
• Terms of Payment • Techniques of Inventory Control
• Credit Policy Variables • Modern Techniques
• Traditional Techniques
MCSL-036 Lab 3 credits

This lab 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 System, o Process Switch
Processes and Interprocess o Threads
Synchronization • OS services for process management
• Scheduling and its types
Unit 1 Operating System-An Overview • Scheduling Algorithms
• What is an Operating System (OS)? o First Come First serve (FCFS)
• Goals of an OS o Shortest remaining time next (SRTN)
• The evolution of operating systems o Round Robin (RR)
• Types of Operating systems o Event Driven (ED)
• Different views of operating systems o Multiple Level Queues (MLQ)
o Command-language User’s view o Multiple Level Queues with Feedback
of the OS scheduling
o System-call User’s view of the • Performance evaluation of the scheduling
OS algorithms
• Functions of OS
Unit 3: Interprocess Communication and
• Structure of Operating systems
Synchronization
o Layered structure
o Kernel-based structure • Need for Interprocess Synchronization
o Microkernel based OS structure • Mutual Exclusion
• Semaphores
Unit 2 Processes • Queuing implementation of semaphores
• Classical problems in concurrent
• Process concept programming
• Programmer view of processes o Producers/consumers problem
• OS view of processes • With an unbounded buffer
o Process Control Block • With a bounded buffer
o System state and process lists o Readers and writers problem
o Process state transitions
50
• Introduction to critical region and conditional Unit 7: I/O and File Management
critical region
• Organization of the I/O function
• Monitors
• Messages • I/O Buffering
• Disk Scheduling
Unit 4: Deadlocks • RAID
• Deadlocks • Disk Cache
o Graphical Representation of a • Command language user’s view of File
Deadlock system
• Deadlocks in Resource allocation • System programmer’s view of the file
• Deadlock detection and recovery system
• Deadlock Prevention • Operating systems’ view of file
o Havender’s Algorithm management
• Deadlock Avoidance o Directories
o Banker’s Algorithm o Disk space management
BLOCK 2: Memory Management, File o Continuous
Management, Security and o Non-continuous (Indexing and
Protection Chaining)
o Disk address translation
Unit 5: Memory Management o File related system services
• Single process monitor o Asynchronous Input/output
• Overlays Unit 8: Security and Protection
• Contiguous Memory allocation
• Partitioned Memory allocation –static and • Security threats and goals
dynamic • Security policies and mechanisms
• Logical and Physical addresses generation • Authentication
• Paging o Passwords
o Principles of operation o Artifact-based authentication
o Page allocation o Biometric Techniques
• Best fit, First fit, Worst fit • Protection and Access control
o Hardware support for paging o Protection in Computer Systems
o Protection and sharing o Access-Matrix Model of protection
• Segmentation o Access hierarchies
o Principles of operation o Access lists
o Address Translation • Formal models of protection
o Protection and Sharing o Access-Control Matrix
Unit 6: Virtual Memory o The Take-grant Model
o The Bell-LaPadula Model
• Virtual Memory o Lattice Model of information flow
o Principles of operation
o Instruction Interruptibility BLOCK 3: Multiprocessors, Distributed OS
o Virtual Memory management and Case Studies
o Protection and sharing
• Demand paging Unit 9: Multiprocessor systems
• Page Replacement policies • Multiprocessor Interconnections
o Optimal o Bus-Oriented Systems
o FIFO o Crossbar-Connected systems
o LRU o Hypercubes
• Thrashing o Multistage Switch-based systems
o Working Set Model • Types of Multiprocessor Operating System
o Page Fault Rate o Separate Supervisors
• Combined systems o Master/Slave
o Segmented paging o Symmetric
o Paged segmentation • Multiprocessor OS Functions and
51
Requirements o Lamport’s algorithm
• Multiprocessor Synchronization o Ricart and Agrawala’s Algorithm
o Test and set • Models of Distributed systems
o Compare and swap o Host-based model
o Fetch and Add o Processor pool model
Unit 10: Distributed Operating Systems o Workstation/server model
o Integrated model
• Need for Distributed systems • Remote procedure calls
• Architecture of Distributed systems • Distributed Shared Memory
• Algorithms of Distributed Processing
Unit 11: Case Study - UNIX / LINUX
Unit 12: Case Study – WINDOWS 2000
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
BLOCK 1: Introduction to Data Ο Noise

Communication and Computer Ο Concept of Delays
Network Concepts Ο How to reduce delays
• Transmission Media and its Characteristics
Unit 1: Introduction to Computer
Ο Twisted Pair
Networks
Ο IBM Cable
• What is computer Network Ο Coaxial Cable
• Network Goals / Motivation Ο Twin Axial Cable
• Application of Networks Ο Optical Fiber
• Point to Point or Switched Networks Ο Terrestrial Microwave
o Circuit Switched Networks Ο Satellite Microwave
o Packet-Switched Networks • Wireless Transmission
• Broadcast Networks Ο Radio
o Packet Radio Networks Ο Infra red
o Satellite Networks Ο Wireless LAN
o Local Area Networks Unit 3: Data Encoding & Communication
• Network Protocols Technique
• Networking Model • Pulse Code Modulation (PCM)
• Examples of Some Networks • Amplitude Modulation
Unit 2: Data Transmission • Frequency and Phase Modulation
• Asynchronous Transmission
• Transmission Terminology
o Simplex, Half duplex & full duplex • Synchronous Transmission
spectrum and Bandwidth, frequency Unit 4: Multiplexing and Switching
• Serial & Parallel Communication
• Analog and Digital Data Transmission • Frequency Division Multiplexing
• Bandwidth & Date Rate Throughout • Synchronous Time Division Multiplexing
• Transmission Impairments • Statistical Time Division Multiplexing
Ο Attenuation and Distortion • Modems
Ο Delay Distortion • Switching
52
BLOCK 2: Media Access Control and Data • Shortest Path Routing
Link Layer • Flooding
• Distance Vector Routing
Unit 1: Data Link Layer Fundamentals
• Link State Routing
• Framing • Hierarchical Routing
• Basics of Error Detection • Broadcast Routing
• Forward Error Correction • Multicast Routing
• Cyclic Redundancy Check codes for Error
Unit 3: Congestion Control Algorithms
Detection
• Flow Control • General Principles of Congestion Control
• Congestion Prevention Policies
Unit 2: Retransmission Strategies
• Congestion Control in Virtual Circuit
• Stop-&-Wait ARQ Subnets
• Go-Back-NARQ • Load Shedding
• Selective Repeat ARQ • Jitter Control
• Pipelining
Unit 4: Internetworking & Network Layer
Unit 3: Contention-based Media Access in the Internet
Protocols
• Tunneling
• The advantages of Multiple-Access Sharing • Internetworking Routing
of Channel Resource • Fragmentation
• Pure ALOHA • IP Protocol
• Slotted ALOHA • IP Addresses
• Carrier Sense Multiple Access (CSMA) • Internet Control Protocols
• CSMA with Collision Detection • OSPF – The Interior Gateway Routing
(CSMA/CD) Protocol
Unit 4: Polling-based Media Access • BGP – The Exterior Gateway Routing
Control Protocols Protocol
• Internet Multicasting
• Token Ring
• Mobile IP
• Token Bus
• IPv6
Unit 5: Media Access Control Protocols
for High Speed Networks BLOCK 4: Transport Layer and Application
Layer Services
• FDDI-I and FDDI-H
Unit 1: Transport Services and
• DQDB with Bandwidth Balancing for Fair
Mechanism
Access
• Asynchronous Transfer Mode (ATM) • 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
• Network Layer Design Issues Unit 2: TCP/UDP
Unit 2: Routing Algorithms • Introduction to UDP
53
• Remote procedure Call • TCP Timer Management
• The Real-Time Transport Protocol Unit 3: Network Security I
• Introduction to TCP
• TCP Service Model • Cryptography
• TCP Protocol • Symmetric Key Algorithms
• TCP Segment Header • Public Key Algorithms
• TCP Connection Establishment Unit 4: Network Security II
• TCP Connection Release
• Digital Signatures
• Modeling TCP Connection Management
• Management of Public Keys
• TCP Transmission Policy
• Communication Security
• TCP Congestion Control
• Web Security
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. 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
BLOCK 1: Database Design and • Representing specialization and
Implementation generalization in UML Class diagram.
Unit 1: Relational Database Design • UML based design tools
• Automated database design tools.
• Features of good database design
Unit 3: Advanced SQL
• Enhanced ER tools
o Subclasses, Super class, and • Assertion and views
Inheritance • Cursors, triggers and stored procedures
o Specialization and Generalization • Embedded SQL, dynamic SQL, SQLJ,
o Constraints and Characteristics of • Advanced Features of SQL
Specialization and Generalization • Examples of above in Oracle
• Converting EER diagram to tables
• Functional dependency theory and Unit 4: Database System Catalog
normalization
• Multi value dependency and 4NF • Catalogs for relational DBMS
• Join Dependency and 5NF • System Catalog in Oracle
• Inclusion Dependencies and Template • Data dictionary and data repository system
Dependency • Catalog in Distributed database and object
• PJNF/DKNF oriented database systems
• Modeling temporal data • Role of system catalog in administration
Unit 2: Database implementation and BLOCK 2: DBMS Advanced Features and

Tools Distributed Database
• Information system and organization
Unit 1: Query Processing and Evaluation
• Data Design and Implementation in an
Organization • Measures of Query Cost
• Use of UML and its support for database o Selection Operation,
design specifications o Sorting
o Join Operation
54
o other Operations • Limitations of Relational databases
• Evaluation of Expression • The need of Object oriented databases
• Transformation of Relational Expressions • Complex Data Types
• Role of Relational Algebra and Relational • Structured Types and Inheritance in SQL
Calculus in query optimisation • Table Inheritance
• Estimating Statistics of Expression • Data types (arrays, multi-set etc) and structure
• Choice of Evaluation Plans in Object oriented databases using SQL
• Views and query processing • Object-Identity and Reference Types in SQL
• Storage and query optimization • ODL and OQL
• Implementing O-R Features
Unit 2: Transaction Management and
Recovery • Persistent Programming Languages
• Object-Oriented versus Object-Relational
• Advanced feature of Transactions • An Example of Object oriented and object
• Enhanced Lock Based and timestamp based relational database implementation
Protocols
• Multiple Granularity Unit 2: Database and XML
• Multi-version Schemes • Structured Semi structure and unstructured
• Deadlock Handling data
• Weak Levels of Consistency • XML hierarchical tree data model
• Concurrency in Index Structures • Documents DTD and XML schema
• Recovery and Atomicity • XML Documents & Database
• Recovery with Concurrent Transaction • XML query and tranasformation
• Buffer Management • Storage of XML data
• Advanced Recovery Techniques • XML database applications
• Remote Backup Systems
Unit 3: Introduction to data warehousing
• Use of SQL in recovery
• Examples of e-transactions • What is Data Warehousing, DSS and EIS?
• Characteristics and functioning and
Unit 3: Database Security and
architecture of Data Warehousing
Authorization
• Data marts
• Levels of database security • Data warehousing Life Cycle
• Access control • Data modeling (Multidimensional Database)
• Multilevel security for data warehousing
• Statistical database security • Building of data warehouse
• Audit trails in the databases • OLAP, MOLAP, ROLAP
• Examples of e security • Data warehouse and views
Unit 4: Distributed Databases • Future open issue for data warehouse
• Centralised versus non centralized Databases Unit 4: Introduction to Data Mining

• Homogeneous and Heterogeneous DDBMS • What is data mining Technology and its
and their comparison relationship to Data warehousing
• Functions and Architecture • Association rules
• Distributed database design, query processing • Classification
in DDBMS • Clustering
• Distributed concurrency management, • Approaches to data mining problems
deadlock management • Applications of Data mining problem
• Distributed Commit Protocols: 2 PC and 3 PC • Commercial tools of data mining
• Concepts of replication servers • Knowledge Discovery
BLOCK 3: ENHANCED DATABASE BLOCK 4: Emerging Trends and Example
MODELS DBMS Architectures
Unit 1: Object Oriented Database
55
Unit 1: Emerging Database Models, • Important features and brief architecture
Technologies and Applications I • User Interfaces
• SQL Variations and Extensions
• Multimedia database
• Transaction Management
• Geography databases, Gnome databases
• Storage and Indexing
• Knowledge databases, deductive databases
and semantic databases • Query Processing and evaluation and
• Spatial database optimization
• Information visualization Unit 4: Oracle
Unit 2: Emerging Database Models, • Features and basic architecture
Technologies and Applications II
• Database Design and Querying Tools
• Mobile databases • SQL Variations and Extensions
• Web databases (JDBC, ODBC) • Storage and Indexing
• Personal databases • Query Processing, evaluation and
• Digital libraries Optimization
• Data grids • Concurrency Control and Recovery
• Wireless networks and databases • Distributed Oracle
Unit 3: PostgreSQL • Database administration and other advanced
tools
MCSP- 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 helps the student make ease and provides enough
experience to carry our the larger project in the sixth semester,
Syllabus
The mini project is of 4 credits and a student is expected to devote about 2 months in planning, analyzing,
designing, coding and implementing the project. The initiation of project should be with the project proposal
that is to be treated as an assignment. The synopsis approvals will be given by Project Counsellors. Project
Proposal should include the following:
• Title
• Objectives
• Input and Output
• Details of modules and process logic
• Limitations of the Project
• Tools/Platforms, Languages to be used
• Scope of Future Application.
MCSL-045 Lab (UNIX & Oracle) 2

Credits
4.1 Syllabus for CS- 60
CS-60 FOUNDATION COURSE IN MATHEMATICS IN COMPUTING
56
The students who haven’t studied Mathematics at 10+2 level are required to do CS-60 in the first
semester of MCA programme. You are advised to clear CS-60 along with the first year of MCA.
However, all students have to successfully complete the 1st and 2nd semester courses, as well as CS-
60 and CIC(wherever applicable) before reregistering for MCA 5th semester.
No assignments need to be submitted for CS-60. Also, no counselling sessions are offered for
CS-60 by the University. Students need to appear only for the Term End Examination for CS-60.
After completion of CS-60, they would not get any certificate / grade card as it in not a programme.
They will get only an intimation of the examination result.
Students need to secure at least 50% marks in the Term end examination for CS-60 to be
declared as successful. It does not add to the credits of MCA programme. The syllabus is shown
below:
Block 1 Elements of Differential Calculus
Unit 1 Real numbers and functions Block 5 Solutions of Polynomial Equations

Unit 2 Limits and Continuity
Unit 3 Differentiation Unit 1 Sets
Unit 4 Derivatiives of Trigonometirc Unit 2 Complex Numbers
Functions Unit 3 Cubic and Biquadratic Equations
Unit 5 Derivatives of Some Standard
Functions Block 6 Equations and Inequalities
Block 2 Drawing Curves Unit 1 System of Linear Equations

Unit 2 Cramer’s Rule
Unit 1 Higher order Derivatives Unit 3 Inequalities
Unit 2 The Ups And Downs
Unit 3 Geometrical Properties Of Curves Block 7 Conics
Unit 4 Curve Tracing
Unit 1 Preliminaries in Plane Geometry
Block 3 Integral Calculus Unit 2 The Standard Conics
Unit 3 General Theory Of Conics
Unit 1 Definite Integral
Unit 2 Methods of Integration Block 8 The Sphere, Cone And Cylinder
Unit 3 Reduction Formulas
Unit 4 Integration of Rational and Irrational Unit 1 Preliminaries in Three-Dimensional
Functions Geometry
Unit 2 The Sphere
Block 4 Application of Calculus Unit 3 Cones and Cylinders
Unit 1 Applications of Differential Calculus Block 9 Conicoids

Unit 2 Area under a Curve
Unit 3 Further Application of Integral Unit 1 General Theory of Conicoids
Calculus Unit 2 Central Conicoids
Unit3 Paraboloids
57
5. EVALUATION SCHEME
Completion of the programme requires successful completion of both assignment component and
the Term-end Examination component for each of the course’s 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 Asignments 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 the Computer Science is ever enhancing area, the students should make
an attempt and work with extra reading material easily available in the study centre / Regional
Centre libraries or through websites for working on the assignments. This will enhance your
58
learning capabilities. Mostly the assignments are designed in such a way as to help you concentrate
mainly on the printed course material, exploit their personal experiences and apply the knowledge
gained from various sources.
One Assignment in each Course:
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.
Credits
Seme- Course Course Title Continuous Term End Examination
ster Code Evaluation
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 50 3 100 50
Programming
MCS-012 Computer Organization 4 100 50 3 100 50
and Assembly language
Programming
MCS-013 Discrete Mathematics 2 100 50 2 50 25
MCS-014 Systems Analysis and 3 100 50 3 100 50

Design
MCS-015 Communication Skills 2 100 50 2 50 25
MCSL-016 Internet Concepts and 2 100 50 2 50 25

Web Design
MCSL-017 C and Assembly 2 100 50 2 50 25
Language Programming
Lab
II MCS-021 Data and File Structures 4 100 50 3 100 50
MCS-022 Operating System 4 100 50 3 100 50
Concepts and
Networking
Management
MCS-023 Introduction to Database 3 100 50 3 100 50
Management Systems
MCS-024 Object Oriented 3 100 50 3 100 50
Technologies and Java
Programming
MCSL-025 Lab (based on MCS- 4 100 50 3 100 50
021, 022, 023 & 024)
III MCS-031 Design and Analysis of 4 100 50 3 100 50
Algorithms
MCS-032 Object Oriented 3 100 50 3 100 50
Analysis and Design
MCS-033 Advanced Discrete 2 100 50 2 50 25
Mathematics
MCS-034 Software Engineering 3 100 50 3 100 50

MCS-035 Accountancy and 3 100 50 3 100 50
Financial Management
MCSL-036 Lab(based on MCS-032, 3 100 50 3 100 50
034 and 035)
IV MCS-041 Operating Systems 4 100 50 3 100 50
MCS-042 Data Communication 4 100 50 3 100 50

and Computer Networks
MCS-043 Advanced Database 4 100 50 3 100 50
Management Systems
MCS-044 Mini Project 4 100 50 100 50
MCSL-045 Lab(UNIX & Oracle) 2 100 50 2 50 25
V MCS-051 Advanced Internet 3 100 50 3 100 50
Technologies
MCS-052 Principles of 2 100 50 2 50 25
59
Management and
Information Sytems
MCS-053 Computer Graphics and 4 100 50 2 100 50
Multimedia
MCSL-054 Lab( based on MCS-051 2 100 50 3 50 25

& 053)
MCSE-001 Stream** Courses 9 100 50 2 100 50

TO 012
VI MCSP-060 Project 16 200*** 75 +25
* No practical examinations in the non-lab courses. Practical examination will be conducted in 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 to in order to declare it successful in the respective course.
** There will be 3 courses comprising in each stream each of 3 credits worth.
*** The Project consist of 2 components namely project report evaluation and viva. Project Report is evaluated for 150 marks and the Viva
voce is for 50 marks. Viva-voce is compulsory and forms part of evaluation. A student in order to be declared successful in the project
(MCSP-060) must secure 50% 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 which has not been attempted would be treated as having a score of zero marks. The
requirement for passing would be at least 50% in continuous evaluation and 50% in the term-
end examinations, with an overall average of 50% for a pass in the course.
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.
5.2 Instructions for Assignments
While answering Assignments, the following guidelines are required to be followed:

1. Tips for assignments
The word limit 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.
60
(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 : ...............................................
4. 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 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.
5. The students should write each assignment separately. All the assignments should not be
written in continuity.
6. The students should write the question number with each answer. Photocopy of the
submitted assignment is to be retained by the student for their own record and future
reference, if any.
7. 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.
8. 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.
9. The completed assignment response should be sent to the Coordinator of the Study
Centre. Under no circumstances should they be sent to the (SR&E) 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.
10. 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 change of Study Centre is effected by
the University.
61
5.3 Guidelines Regarding the Submission of Assignments
1. It is compulsory for the students to submit all the prescribed assignments. They will not be
allowed to appear for the term-end examination of a course if they do not submit the specified
number of assignments in time for that course.
2. 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. 1) 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.
8. As per the University norms, once the students 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 the correct score is forwarded by him
to the SR&E Division 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, SR&E
Division, 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.
62
5.4 General Guidelines Regarding the Term-End Examination
1. To be eligible to appear the Term-end Examination in any course, the students are required to
fulfil the following conditions:
(a) they should have paid the fee due for that semester
(b) they should have opted and pursued the prescribed course
(c) they should have submitted the examination form in time
(d) they should have submitted the required number of assignments within due dates before
taking the examination
(e) their registration for the programme should be valid.
2. The University conducts term-end examinations 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 date schedule indicating the date and time of examination for each course is sent
to all the study centres in advance. The same is also notified through IGNOU Newsletter from
time to time and also will be displayed on the IGNOU’s website also.
4. A specimen of Examination form (Form No. 3) is included in this Programme guide. Students
may make Photocopy of this form for their use. However, the same can also be obtained from
the concerned Regional Centre/Study Centre.
5. The dates for submitting filled in examination form are 1st February-31st March and 1st
August-30th September for June and December Term-end Examinations respectively.
6. Filled in examination form is to be sent only to the Registrar (SR&E), IGNOU, Maidan
Garhi, New Delhi – 110 068.
7. Examination form can be submitted with a late fee of Rs. 100/- up to 20th April for the June
Term-end Examination and up to 20th October for the December Term end examination. In
order to receive the acknowledgement, students are advised to attach a self-addressed post card
along with the form.
8. Students should carry their Identity Card and intimation slip (received from SR&E Division
indicating Centre & Date of Examination) to the Examination Centre.
9. In case a student fails to receive the intimation slip 15 days before the commencement of the
examination, they should get in touch with the Study Centre/Regional Centre/SR&E at
Headquarters indicating their enrolment no., name, address and programme.
10. The students will be entitled to appear for the examination only at the study centre OR 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.
11. All the Study Centres/Regional Centres concerned will get a copy of the term-end examination
result and also you can download it from our website under the “Student Support” Option.
12. 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.
13. The students can get their Term-end Examination result rechecked. They should apply in
prescribed form (Form No. 4). Fee at the rate of Rs. 100/- per course is charged for
rechecking of the result of Term-end Examination. This amount is refunded if there is a
mistake in checking of answer-book. Applications for this purpose will normally be
63
entertained within a period of 2 months of the declaration of result. There is, however, no
re-evaluation of the answer-books.
14. Duplicate Grade Card/marks sheet will be issued on a request from the students in prescribed
form (Form No. 5) against payment of Rs. 25/- by Demand Draft drawn on IGNOU, New
Delhi. The duplicate grade card will be sent by Post to the student.
15. A student will be deemed to have passed a course in which s/he has obtained the minimum
overall grade as specified in course curriculum.
16. 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. For completing re-
registration formalities students are advised to get in touch with the Regional Director
concerned or the Registrar,(SR&E) Division at the Headquarters.
6. OTHER USEFUL INFORMATION

6.1 Reservation of Seats
The University provides reservation of seats for Scheduled Castes, Scheduled Tribes and Physically
Handicapped students as per the Government of India rules.
6.2 Scholarships and Reimbursement of Fee
Reserved Categories, viz., Scheduled Castes, Scheduled Tribes and Physically Handicapped
students etc. have to pay the fee at the time of admission to the University along with other
students. Physically Handicapped students admitted to IGNOU are eligible for Government of
India scholarships. They are advised to collect scholarship forms from the respective State
Government Directorate of Social Welfare or Office of the Social Welfare Officer and submit the
filled-in forms to them through the Regional Director of IGNOU concerned.
Similarly, SC/ST students have to submit their scholarship forms to the respective State Directorate
of Social Welfare or Office of the Social Welfare Officer, through the Regional Director of
IGNOU concerned for suitable reimbursement.
6.3 Change / Correction of Address
There is a proforma (Form No. 6) 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 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 are acceded to subject to
availability of seats for the programme at the new centre asked for only on compelling grounds.
64
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 (SR & E), 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 (SR & E) and the student. The transfer will be permitted only if seats are available at the
new Study Centre.
6.5 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
i) Admission, Fees, Scholarships, The Registrar (SR&E)

Change of Course/Programme, Indira Gandhi
Assessment Sheets, Exam. Centres, National Open University
Results, Rechecking, Change of Address Maidan Garhi
and Study Centre, Discrepancies in New Delhi - 110 068
Result etc.
ii) Study Material and The Assistant Registrar

Assignments MPDD
Indira Gandhi
National Open University
Maidan Garhi
New Delhi - 110 068
iii) Purchase of Audio-Video tapes / CDs The Director

EMPC, Sanchar Kendra
IGNOU, Maidan Garhi
New Delhi - 110 068
iv) Academic Matters The MCA Programme Coordinator

SOCIS, Academic Complex, Block – C,
Indira Gandhi
National Open University
Maidan Garhi
New Delhi - 110 068
v) Administrative and The Co-ordinator of your

counselling related matters, Study centre / Regional
missing scores of Assignments Director of the RC concerned
Telephone numbers of the Divisions/ Schools are 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 www.ignou.ac.in
65
Some useful E-mail addresses
1. For all queries related to non-receipt and requisition of Course Material or Assignments , you can e-mail
to mpdd@ignou.ac.in.
2. For all queries related to Examinations, Evaluation, non-reflection of assignment marks in the grade
card, requisition for grade card, hall-ticket , examination forms, e-mail sred@ignou.ac.in.
3. All queries related to Change of Address / Study Center may be e-mailed to respective Regional Centre.
4. Academic queries and technical doubts (subject related) in Course material may be e-mailed to
mca@ignou.ac.in.
5. For any general assistance, you can e-mail ssc@ignou.ac.in.
8. MODEL QUESTION PAPERS
MCA
Term-End Examination
June, 2005
MCS-011: PROBLEM SOLVING AND
PROGRAMMING
Time: 3 hours Maximum Marks: 100

(Weightage 75%)
Note: Question no. 1 is compulsory. Answer any three from the rest.
1. (a) Write an algorithm and draw a corresponding flowchart to find the greatest number and its
position among the 6 given numbers. 10
(b) Write a program in C language to add, subtract, multiply and divide two complex, numbers.
(Use a Switch statement to select the operation) 10
(c) Design an algorithm, draw a corresponding flowchart and write a program in C to reverse a given
string and find whether it is a palindrome or not. 10
(d) Write a program in C, to multiply two matrices. 10
2. (a) Write the steps involved in the lop-down design process with the help of a diagram. 10
(b) Write a program in C (using files) to open the “file1”, read the content and copy the same into
“file2”. 10
3. (a) Mention any three advantages of use of pointers over arrays. Also, write a program (using
pointers) to insert and delete an element in an ordered list. 10
(b) Write a program to do the following without the use of any string functions like strcat and strlen:
(i) Concatenate two strings
(ii) To find the length of any given string 10
4. (a) What is a preprocessor directive? Write the syntax for the following preprocessor conditional
statements: 10
(i) # if def (ii) # if n def
(iii) # else (iv) # program
Also, mention an example for each.
66
(b) Design an algorithm and draw corresponding flowchart to convert a decimal number to its binary
equivalent. 10
5. (a) Mention the rules for using the Big-O Notation. 05
(b) What is a variable? What are the rules to be followed to name a variable in “C” ? Write the syntax
to declare the variables. Also, mention how to initialize a character variable with the help of an
example. 06
(c) Write a program to sort the given list of 10 numbers in ascending order. 09
MCA
June, 2005
MCS-012: COMPUTER ORGANIATION AND ASSEMBLY LANGUAGE

PROGRAMMING

(Weightage 75%)
Note: Questions number 1 is compulsory and carries 40 marks. Answer any three questions from the rest.
1. (a) Simplify the following Boolean function in SOP form using K-map:
F(A, B, C, D) = (0, 2, 4, 6, 8, 9, 10, 11, 12, 14) 5
(b) A memory chip (RAM) is shown below:
CSI
Data bus
CS2
WR 4096 X32
RD (RAM)
Address
Lines
AD
Give the answer of the following questions: 10
(i) How many address lines are there in this chip?

(ii) How many data lines are there in this chip?
(iii) What is the word size of RAM chip?
(iv) What is the capacity of RAM chip in bytes?
(c) An instruction is stored at location 300 with its address field at location 301.The address
field has the value 400. A processor register R1 contains the number 200. Evaluate the
67
effective address if the addressing mode of the instruction is:
(i) Direct
(ii) Register Indirect
(iii) Relative
(iv) Index with R1 as index register 6
(d) Find the range of a number for the following floating point representation:
Base is 2 5
Exponent - 8 bits, bias of 8 is used
Sign bit = 1
Significant = 23 bits
Assume the normalized mantissa representation
(e) Starting from the initial value of R = 11011101, determine the sequence of binary values in
R after a logic shift-left, followed by a circular shift-right, following by a logical shift-right
and a circular shift-left. 4
(f) What is a micro-instruction? Do we need all 2N combinations of control Signals for N-bit
micro-instruction? If no, then specify the reasons. Also, differentiate between uuencoded
and highly encoded micro-instruction. 10
2. (a) What is master-slave flip flop? Construct a master-slave flip flop using D flip flop and
explain its working. 5
(b) What is RAID? List three features of RAID level 2. In Raid technology, what are the
important performance considerations? Explain briefly. 5
(c) Give two reasons why a RISC processor is better than a CISC processor. 5
(d) What is the purpose of queue in the bus interface unit of 8086 micro-processor? Find out the
physical addresses for the following segment register: offset. 5
(i) SS : SP = 0100h : 0020h
(ii) DS : BX = 0200h : 0100h
(iii) CS : IP = 4200h : 0123h
3. (a) Explain content addressable memory with the help of block diagram. 5
(a) Show how the division of floating point numbers is done with the help of an example.
5
(b) Briefly explain the working of two-pass assembler. 5
(c) What is the difference between hand-wired control and micro-program control? What are
the advantages and disadvantages of each method? 5
4. (a) Draw the state table and logic circuit for a 2-bit binary counter using
D flip-flop. 5
(b) Give the difference between memory mapped I/O and isolated I/O. 5
(c) What is interrupt? Briefly explain the four-interrupt conditions. 5
(d) Write an assembly program for adding two five-byte numbers using arrays.
5
5. (a) How can the subtraction operation on binary numbers be achieved by the sequence of
addition operation? Draw block diagram and then explain. 5
68
(b) Explain the use of the following: 5
(i) Set-associative memory
(ii) SD RAM
(c) What is a register? Explain the need of registers in the instruction execution. 5
(d) What is instruction pipelining? Explain the working of instruction pipelining in a RISC
system. 5
MCA
Term- End Examination
June, 2005
MCS-013: DISCRETE MATHEMATICS
Note : There are five questions in this paper. Questions number 1 is compulsory. Attempt any three
questions from the rest.
1. (a) What is a conditional proposition? Give the truth table of such a statement. Further, give one
example each of a conditional statement and a statement which is not conditional.
4
(b) Using mathematical induction, show that 2n < n! for n ≥ 4. 4
(c) Find the Boolean expression, corresponding to the following circuit:
Also obtain the CNF of this expression. 4
(d) What is a Cartesian product? Give the geometric representation of the Cartesian product of
A and B, where A = {2, 3, 4} and B = {1, 4}.
4
3
(e) Give all partitions of 6 and find P 6 . 4
2. (a) Out of a set of 7 men and 6 women, a high level committee of four persons is to be formed
consisting of one President, two Vice Presidents and one Secretary. In how many ways can
this committee be formed in each of the following situations?
(i) At least one Vice President should be a woman.
(ii) Only one out of the President and the Secretary should be a man.
(iii) The president should be a woman.
5
(b) Explain the difference between a pair of mutually exclusive events and a pair of independent
events. Your explanation should include an example of each kind.
5
3. (a) For any two propositions p and q show that 2
~ (p ∨ q) ≡ ~ p ∧ ~ q
69
(b) Which of the following statements are true? Give reasons for your answer.
(i) {0, φ, IGNOU} is a set. 8
(ii) P (m + n, r) = P (m, r) + P (n, r) for m, n, r ε N.
(iii) The Pigeon-hole principle states that r + 1 objects can be placed in r boxes only.
(iv) The contrapositive of the statement “if Manju is unwell, she will not go to school”,
is “if Manju is well then she will go to school”.
4. (a) Prove or disprove that 11 is rational.
5
(b) What is duality principle? Find the dual of
(i) ~ (x ∧y) ∨ z; 5
(ii) (x ∨ y) ∧ (x ∨ z).
5. (a) Make a logic circuit of elementary gates corresponding to the Boolean expression:
( x ∨ y ∧ z )' ∧ (r ∨ z) ∨ x 3
(f) If there are 5 men and 4 women, how many circular arrangements are possible in which
women don’t sit adjacent to each other? 2
(g) In how many ways can 15 students of MCA and 10 students of BCA be grouped into 4
groups? 5
70
MCA
Term- End Examination
June, 2005
MCS-014: SYSTEM ANALYSIS AND DESIGN

(Weightage 75%)
Note: Questions number 1 is compulsory. Answer any three questions from the rest.
1. (a) Explain the role of System Analyst. Also mention what kind of qualities s(he) should
possess. 10
(b) Explain the two different types of finding the requirements of a system. 10
(c) Explain the process of designing the forms and reports. 10
(d) Explain at least five types of System testing. 10
2. (a) Define Modularity. Write at least goals of a good design. Also, write at least four guidelines
for achieving the goals mentioned. 10
(b) Define the term Record. Write at least five activities that will enable the queries to run
faster. Explain the process of Denormalisation of Tables. 10
3. (a) Write the formula for the computation of Degree of Security. Explain the Information
Security architecture with the help of a figure. 10
(b) Define an Expert system. Mention its characteristics. With the help of an example of expert
system, explain various components of it. 10
4. (a) Explain the five types of coupling with an example for each. 10
(b) Define SRS. Explain the seven characteristics of SRS. 10
5. (a) Explain the five steps of Database Design with the help of a figure. 10
(b) Explain at least four concurrent audit techniques.
10
71
MCA
June, 2005
MCS-015: COMMUNICATION SKILLS
Time: 2 hours Maximum Marks:

50
Note: Answer all questions
1. Read the following passage and answer the questions given after it:
If your desk is piled high with letters, faxes, forms, memos, reports, print-outs and sticky-
backed message slips, you might believe all this paperwork is a sign of how busy you are. But
according to Declan Treacy, cluttered desks lead to lost information, distractions, missed
opportunities, high stress and not a little procrastination. He founded and runs the Clear Your
Desk Organisation and organizes the annual International Clear Your Desk Day which this year is
being held on April 24.
His argument for uncluttered desks are strong. “We pile between 300 and 500 pieces of paper on the
desk at any time, a load equivalent to a 40-hour backlog of work. With 45 minutes a day wasted on
frustrating searches for lost paperwork on and around the desk, it is unfortunate that the cluttered
desk is the accepted norm in most organizations,” he says. Treacy holds seminars to help companies
organize their own Clear Your Desk days, when everyone from the senior managers to secretaries
learn how to tackle paperwork more effectively.
What you shouldn’t do is add to the pile of paper that’s already there, says Treacy: “Eighty per cent
of all paperwork is eventually discarded, but it causes an awful lot of trouble before that happens.
Unfortunately, most executives believe the myth that an empty desk is the sign of an unproductive
mind. How wrong can you be? Companies cannot afford to let people work from cluttered desks.
Hours of valuable time are wasted in searching for vital pieces of paper, and in being distracted by
the constant steam of faxes, memos and reports which land in our in-trays when we should be
devoting time to more important work.”
(i) A desk which is piled high with letters, reports, sticky-backed messages, etc. indicates how busy one
is. Do you agree or disagree with this statement? Give reasons from the passage. 4
(ii) In most businesses a/an ____________ desk is considered perfectly acceptable. 1

(a) cluttered
(b) untidy
(c) tidy
(d) clean
(Select the right choice)
(iii) How does paperwork cause loss of time? 2

(iv) What is the fate of most paperwork? 1
72
(v) International Clear Your Desk Day is held every ___________ 1
(vi) Give a suitable title to the passage. 1
2. Choose the word or phrase that best completes each sentence, from the options following each:
5
(i) There has been a ____________ in the sales of new houses since home loans are more difficult to
obtain.
(a) dive
(b) slump
(c) downfall
(d) crash
(ii) We can expect to treble our turnover once the July sales get into full ____________ .
(a) force
(b) flight
(c) speed
(d) swing
(iii) The government has spent Rs.1Crore on an advertising ________ to encourage energy conservation.
(a) campaign
(b) promotion
(c) operation
(d) enterprise
(iv) I advise you to take ____________ to ensure that all your property is adequately covered by
insurance.
(a) means
(b) actions
(c) steps
(d) dealings
(v) Have you thought what the ___________ might be if you don’t win your case in court?
(a) applications
(b) bearings
(c) implications
(d) connotations
3. Complete the customer’s part in the following dialogue: 10
Shopkeeper : Good morning, Madam, may I help you?

Customer : ________________________________ .
Shopkeeper : I see, well, what exactly is the problem?
Customer : ________________________________ .
Shopkeeper : Well, how long ago did you buy it?
73
Customer : _________________________________ .
Shopkeeper : Could you let me see your receipt, please?
Customer : _________________________________ .
Shopkeeper : Well I’m afraid you’ll have to produce it.
Customer : _________________________________ .
4. Change the voice in the following sentences from active to passive, mentioning the agent only if
necessary. 10
(i) He spends money for his children every month.

(ii) They inspect the factory every week.
(iii) The security man checks every visitor at the gate.
(iv) Droughts upset the economy of the country.
(v) She looked after the children well.
(vi) They are demolishing unauthorized buildings.
(vii) Will they declare Friday a holiday?
(viii) He has completed his assignments.
(ix) They are doing good work.
(x) Thieves broke into the house.
5. (a) You use 3,000 cellophane boxes a month and you need to order some more from your
supplier. You can buy enough boxes for several months at once if she/he gives you a large enough
discount. Find out what she/he is offering and attempt to negotiate a deal in a letter of about 200
words. 10
(b) Suppose you are applying for the job of a software engineer. Prepare your curriculum vitae.
5
74
MCA
Term-End Practical Examination
June, 2005
MCSL-016: INTERNET CONCEPTS AND WEB DESIGN
Time allowed: 2 hours Maximum Marks: 50
Note: There are two questions in this paper carrying 20 marks each 10 marks are for viva-voce.
1. Write an HTML code to develop a web page having two frames that divide the web page into two
equal rows and then divide the first row into two equal columns. Fill each frame with a different
background colour. Also create a button in the first column of the first frame and two text boxes in
the second and third columns. After clicking the button, texts should be displayed in the second
frame (second row). 20
2. Create a form in HTML containing the following fields and then perform the validation of each field
using JavaScript. 20
Name : textbox
Address : textbox
Date of birth : a combo box (one for each day, month and year)
e-mail : textbox
MCA
75
Term-End Practical Examination
June, 2005
MCSL-017: C AND ASSEMBLY LANGUAGE PROGRAMMING
Time allowed: 2 hours Maximum Marks: 50
Note: There are two parts (C Programming and Assembly Language Programming) in this paper. Each
part is for 1-hour duration. Attempt only that part(s) in which you are not successful as yet.
PART1
C Programming
Note: Answer the following question. It carries 20 marks and the viva-voce is for 5 marks.
1. Write an interactive program in C to count number of vowels, consonants and spaces in a given
string.
20
PART 1I
Assembly Language Programming
Note: Answer the following question. It carries 20 marks and the viva-voce is for 5 marks.
1. Write an assembly program, which will read two decimal numbers and performs the following
operations:
20
(i) Addition (ii) Subtraction (iv) Multiplication (iv) Division
9. FORMS AND ENCLOSURES
FORM NO. 1
76
ASSIGNMENTS REMITTANCE -CUM-ACKNOWLEDGEMENT
CARD
Enrol. No._________________________ Programme Title: _______________

Name : ___________________________ Medium : _____________________
Enrol. No._____________ Course Code: _____________________

For Office Use Only
Programme Title: ________________ S.No. Assignment No.
S.No. ___________________________
Name : __________________________________
For Office Use Only
Course Code: ______________Medium: Signature of the recevier ____________
_______ S .No. ___________
Date of Receipt: ____ Date : ____________
S.No.Assignment No. Name of Evaluator: _
Signature of the Student
Date : _____________ Date of despatch to
the Evaluator: Signature of the Student Seal
________________
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 ………………………………..
…………………………………..
…………………………………..
77
78
Please read the instructions overleaf before filling up this form: FORM NO. 2
Indira Gandhi National Open University

New Delhi
REQUISITION FOR FRESH SET OF ASSIGNMENTS
Programme of Study
Enrolment Number Study Centre Code
Write in BLOCK CAPITAL LETTERS only.

Name: Shri/Smt./Kum
Please indicate course code, assignment code and course title for which you need the assignments in the
following columns. The assignments of the course which you have already passed should not be mentioned.
Sl. Course Assignmen Course Title Medium

No. Code t Code
1.
2.
3.
4.
5.
6.
7.
8.
REASONS FOR REQUEST FOR FRESH SET OF ASSIGNMENTS: (Tick (√) whichever is
applicable)
1. Assignments not received at all earlier.

2. Assignments were received after the due dates prescribed for their submission.
3. Assignments submitted but could not secure minimum qualifying score.
4. Assignments submitted earlier but misplaced at Study Centre/Post/HQ.
5. Assignments responses submitted after due dates were rejected by the Study Centre.
6. Failed to secure over-all qualifying grade in course(s) mentioned above and wish to improve over-all
qualifying grade only by attempting one assignment.
Complete Address ..................................................................... ... Signature ......................... .............

.............................................................................. ........................ Date ..................... .........................
.............................................................................. ........................
Pin. Code : ............................................................................. ......
For Office Use Only:

Date of Despatch of Assignments to the student: ......................................
79
INSTRUCTIONS FOR DOING ASSIGNMENTS
1. Read instructions for submission of assignments given in your Programme guide carefully.
2. Assignments should be demanded only, if your registration for that course (Subject) is valid.
3. Please ensure that you have mentioned your correct Enrolment No. (it consists of 9 digits), Name, Course Code/
Title, Name of semester/year, wherever applicable and Study Centre Code on your assignment responses before
submitting it to concerned authorities.
4. Submission of assignments within due dates is prerequisite for appearing in the term-end examination. You are,
therefore, advised to submit your ASSIGNMENTS at your Study Centre within the prescribed dates.
Assignment received after due dates will be summarily rejected.
5. You can appear in term-end examination or submit only minimum required number of assignments if you fail to
secure over-all qualifying grade in the course (subject).
6. Assignments should not be demanded to improve your score if you have secured minimum qualifying score in a
course (subject).
7. Please do not submit your assignment responses twice either at the same Study Centre or at different Study
Centres for evaluation.
Please mail this form to:
The Registrar
MPPD
Maidan Garhi
NEW DELHI- 110 068
Please retain a photocopy of any matter that you submit to the

University.
80
81
Form No. 4
82
Maidan Garhi, New Delhi-110 068
Application Form for Re-checking of Result of Term-end Examination
Name ......................................................................... ....
Enrolment No.
Address ......................................................................... ....

......................................................................... ....
......................................................................... ....
Pin Code:
Programme ............................ .... Month and Year of the Exam ..........................

Name of Exam. Centre ..................................
Centre Code .............................................. ......
Course(s) in which Course Code Name of the Course

Re-checking of the
Term-end-Exam Result ......................... .......... .......................................... ......
is sought ......................... .......... .......................................... ......
(Rs. 100 per course/paper) ......................... .......... .......................................... ......
......................... .......... .......................................... ......
Total amount paid: Rs. ............................................................ .....

Bank DD No. .......................................................................... .....
Dated.................................................... ...........................or Bank
Challan dated ........................................................................ ...... ......................... ..........
Date : Signature
Note : There is no provision for re-evaluation. Checking is done with reference to the grade/marks given
in the Answerbook and the Award list. If there is any mistake on the part of the University. Re-
checking fee at the rate of Rs. 100/- paid by the candidate will be refunded. Application form for
this purpose will normally be entertained within a period of 2 months of the declaration of result.
The filled in form with the requisite fee is to be sent to:

The Asst. Registrar (Exam II)
Maidan Garhi
New Delhi - 110 068.
83
84
Form No. 5

Maidan Garhi, New Delhi-110 068
Application Form for obtaining Duplicate Grade Card/Mark-sheet
Name of the Candidate .................................................. ...............
Enrolment No.
Address ......................................................................... ....

......................................................................... ....
......................................................................... ....
Pin Code :
Programme .................................................................. ................
Month and Year of the Exam ......................................... ..............

Centre from where
appeared at the last
examination: ..................................................................... ...........
Bank Draft/IPO No. ........................................... dated ................... for Rs. 25/- in favour of IGNOU,
New Delhi
.............................................................
Date: ............................... Signature
Note: Fee for duplicate, grade card is Rs. 25/-. The duplicate grade card/mark list will be sent by
Registered Post.
The filled in form with the requisite fee is to be sent to:

The Registrar (S R & E)
Block 12, Maidan Garhi
New Delhi -110 068.
85
86
Form No.6
(For Change of Address, send it duly filled-in to the concerned Regional Director, who will forward it to the
Director (SR&ED), Maidan Garhi, New Delhi after verification )
Application for Change of Address

Date: __________
To
The Registrar, SR&ED
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_________________________
__________________________
87
Form No.7

School of Computer & Information Sciences
Re-Registration Form for MCA
1. Programme Code (Please tick) MCA
III IV V VI
2. Semesters for which registration is required (Please tick)
3. Name
4. Enrolment No.
5. Address
Pin Code
Telephone No.
E-mail
6. Details of fee paid:
DD No. DD Date DD Amount Bank Name

(In Rs.)
I do hereby solemnly affirm & state that above details are correct.
Note:
1. Post this form along with the Demand Draft in the name of IGNOU payable at the city where the
Regional Centre concerned is located and to be sent to the Regional Centre concerned.
2. Superscribe the envelope with “RE-REGISTRATION FORM OFMCA” along with above mentioned
address.
88

Mcaprogramme Guide2006

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mcaprogramme Guide2006

Uploaded by

Copyright:

Available Formats

PROGRAMME GUIDE

MASTER OF COMPUTER APPLICATIONS

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

2.1 Print Material 7

3. Browsing IGNOU’s Website 18

6. Other Useful Information 64

6.1 Reservation of Seats 64

7. Some Useful Addresses 65

8. Model Question Papers 66

9. Forms and Enclosures 77

MESSAGE FROM THE PROGRAMME CO-ORDINATORS

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

Akshay Kumar V.V. Subrahmanyam

1.2 Duration of the Programme

1.3 Medium of Instruction

1.3 Credit System

1.6 MCA Programme Structure

MCS-015 Communication Skills 2 MCSL-025 Lab (based on MCS-021, 022, 4

MCS-034 Software Engineering 3 MCS-044 Mini Project 4

MCSL- Lab (based on MCS-051

1.7 Constraint for Moving to MCA 3rd year

1.4 Student Support Services

1.10 How to contact the MCA Programme Coordinator?

self-instructional printed material

2.1 Print Material

2.2 Audio-Video Material and CDs

2.3 Counselling Sessions

2.3.1 Theory Sessions

Before attending the counselling session for each course, please

2.3.2 Practical Sessions and Compulsory Attendance

2.3.3 Counselling Schedule

MCSL- Lab (based on

Semesters and the Number of Sessions:

Total Computer time = Practical time + Assignment implementation time

MCA 1st Semester Schedule

MCS-011: Problem Solving and Programming

S. No. Counselling Sessions Number of Sessions Comments

Sessions Session Block to be Topics to be covered

MCS-012: Computer Organisation and Assembly Language Programming

S. No. Counselling Sessions Number of Sessions Comments

Session Type Session Block to be Topics to be covered

MCS-013: Discrete Mathematics

S. No. Counselling Sessions Number of Sessions Comments

Sessions Session Block to be Topics to be covered

MCS-014: Systems Analysis and Design

S. No. Counselling Sessions Number of Sessions Comments

Sessions Session Block to be Topics to be covered

MCS-015: Communication Skills

MCSL-016: Internet Concepts and Web Design

MCSL-017: C and Assembly Language Programming

Sessions Number of Sessions Comments

Practical Sessions 10 Digital Logic Circuits and Assembly

Sessions Session Block to be Topics to be covered

MCA 2nd Semester Schedule

MCS-021: Data and File Structures

S. No. Counselling Sessions Number of Sessions Comments

Sessions Session Block to be Topics to be covered

MCS-022: Operating System Concepts and Networking Management

Session Type Session Block to be Topics to be covered

MCS-023: Introduction to Database Management Systems

S. No. Counselling Sessions Number of Sessions Comments

Session Type Session Block to be Topics to be covered