Mcastarterkit 2004

STARTER KIT
FOR
MCA STUDENTS
Master in Computer Applications

JANUARY, 2004 (INTEGRATED MODE)
SCHOOL OF COMPUTER AND INFORMATION SCIENCES

INDIRA GANDHI NATIONAL OPEN UNIVERSITY
MAIDAN GARHI, NEW DELHI - 110 068.
www.ignou.ac.in
1 )
Page No.
CONTENTS
Message from the MCA Programme Coordinator 5
1. Basic information for MCA students 7

1.1 Introduction 7
1.2 PPC 7
1.3 Fee Structure 9
2. Brief Guidelines to browse IGNOU’s Website 9
2.1 Navigation from Home Page 9
2.2 Navigation from SOCIS Page 11
2.3 Procedure to browse through MCA pages 12
2.4 How to download the Course Material & Semester Assignments? 13
3. Programme Objectives, Structures and Contents 14
3.1 Objectives 14
3.2 Programme Structure 15
3.3 Contents 16
4. Evaluation 31
Assignments for first semester 32
5. Old Question Papers 40
6. Obtaining/Purchasing of Printed Booklets 44
6.1 Terms and Conditions for Sale of IGNOU’s Study Material 44
6.2 Retail Agents for Study Material 45
7. Forms and Enclosures 46
Application Form for Re-checking of Result of Term-end Examination
Application Form for obtaining Duplicate Grade Card/Mark-sheet
Change/Correction of Address/Medium of Study
Re-registration Form
Requisition for fresh set of Assignments
Re-admission Form
Examination form
8. Suggested Counselling Schedule 61
3
8181
MESSAGE FROM THE MCA PROGRAMME CO-ORDINATOR
Dear student,
Welcome to the IGNOU’s MCA Programme. It is a 3 year Master’s degree

programme which will cover a wide range of Computer Science topics. In integrated
mode, you will receive support from IGNOU through Internet as well as through the
network of our Regional and Study centers. You will be allotted a study centre, which
will offer Counselling sessions and Practical sessions.
A Student with the M.Sc. or B.Tech. (Non - Computer science) have to do CIC
concurrently with MCA Ist Year. For other disciplines (B.Com/B.A/B.Sc.) students
have to do CIC before becoming eligible for admission to MCA programme. However,
students holding Bachelor’s degree in Computer Science/ Applications are exempted
from doing CIC.
With the Starter Kit, you have received the entire course material for the first semester
and the assignments which comprises 3 courses: CS-02, CS-04 and CS-05. Each
subject contains two types of assignments: TMA (Tutor Marked Assignment) and
Project. Assignments are to be submitted at the study centre allocated to you by the
Regional centre.
Last date for submission of assignments for a particular course is mentioned in the
assignment. All assignments carry 25% weightage in the total MCA grading scheme.
There are 3 courses (CS-02, CS-03 and CS-04) in which there are term-end practical
examinations for which weightage is 15%.
A candidate who has not done Mathematics at 10+2 level is required to pursue PPC
concurrently with MCA First Year. Students do not require to submit any assignments
for PPC and are required to appear for the term-end examination only. A student
admitted to MCA programme who is required to pursue PPC also, must clear PPC
with first year of MCA.
Prof. Manohar Lal

Programme Coordinator
Email: mca@ignou.ac.in
3
8181
3
8181
1. BASIC INFORMATION FOR MCA STUDENTS
1.1 Introduction
The MCA programme comprises of the following courses:
FIRST YEAR
1. CS-01 Computer Fundamentals
2. CS-02 Introduction to Software
3. CS-03 File Structure and Programming in COBOL
4. CS-04 Data Structures through ‘C’ and ‘PASCAL’
5. CS-05 Elements of Systems Analysis and Design
6. CS-06 Data Base Management Systems
SECOND YEAR
7. CS-07 Discrete Mathematics
8. CS-08 Numerical and Statistical Computing
9. CS-09 Data Communications and Networks
10. CS-10 Software Engineering
11. CS-51 Operations Research
12. CS-54 Accounting & Finance on Computers
THIRD YEAR
13. CS-12 Computer Architecture
14. CS-13 Operating Systems
15. CS-14 Intelligent Systems
16. CS-15 Relational Database Management Systems
17. CS-16 Object Oriented Systems
18. CS-17 Project
1.2 Preparatory Programme in Computing (PPC)

PPC is not an independent programme. It is a bridge course. A candidate who has not studied
Mathematics as distinct subjects at the 10+2 or equivalent level will face difficulty while
undergoing the BCA/MCA programme. Such students, while pursuing BCA/MCA programme
will be required to complete the PPC programme concurrently with the first year of their BCA/
MCA as the case may be. No Assignments for PPC need to be submitted. They need to appear
only in Term End Examination for PPC. 50% is the pass percentage for Term End Examination.
After the completion of PPC, they would not get any certificate/grade card, as it is not an
independent programme. They will get only intimation of the examination result.
Fee : Rs. 600/- (including registration fee)

Medium : English
5
8181
5
8181
Programme Structure
The Preparatory Programme in Computing is divided into 5 blocks, each block has three to four
units.The break-up of the course is as follows:
Block Unit
Block 1 : Some Basic Concepts Unit 1: Relevance of Mathematics
Unit 2: Algebraic Expressions
Unit 3: Sets, Functions and Graphs
Block 2: Elementary Algebra Unit 4: Number Systems
Unit 5: Exponents and Logarithms
Unit 6: Sequences of Series
Unit 7: Permutations and Combinations
Block 3: Geometry and Trigonometry Unit 8: Plane Geometry
Unit 9: Mensuration
Unit 10: Trigonometry
Unit 11: Coordinate Geometry
Block 4: Equations and Matrices Unit 12: Linear Equations and Inequations
Unit 13: Matrices and Determinants
Unit 14: Quadratic Equations
Block 5: Calculus and Statistics Unit 15: Calculus
Unit 16: Probability
Unit 17: Statistics
There is no separate admission process for this programme. Students do not require to submit any
assignments for PPC and are required to appear for the term-end examination only. It is to be cleared
before reaching the second year of the BCA/MCA programme.
3
8181
1.3 Fee Structure
The programme fee is inclusive of examination fee and is to be paid semester-wise, as per the
details appended below:
Semester Amount (in Rs.) When to Pay
I Semester 5500/- Along with filled in Registration form
II Semester 5400/- Along with the Re-registration form for 2nd semester,
which will be sent to you by the university
III Semester 5400/- Along with the Re-registration form for 3rd semester,
which will be sent to you by the university
IV Semester 5400/- Along with the Re-registration form for 4th semester, which
will be sent to you by the university
V Semester 5400/- Along with the Re-registration form for 5th semester, which
VI Semester 5400/- Along with the Re-registration form for 6th semester, which
The programme fee is to be paid only by way of demand draft drawn in favour of IGNOU
payable at the city where the concerned Regional Centre is located. Xerox copy of the DD should
be retained with the student.
Please write your Name and Enrolment Number at the back of the Bank Draft to ensure credit to
your fee account.
Visit IGNOU’s website http: //www.ignou.ac.in
2. BRIEF GUIDELINES TO BROWSE IGNOU’S WEB

SITE
The IGNOU’s Web-Site 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 in 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, before taking the decision to register with IGNOU.
2.1 Navigation from Home Page

3
8181
The learners can have access to IGNOU’s web site 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
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 is which offers Computer

Programmes MCA, BCA, CIC, BIT and ADIT. The BIT and ADIT
Programmes are offered through Virtual Campus Initiative
5
8181
Figure 2
Brief Description of Menu at the bottom of the page on IGNOU’s website
Home Clicking this option allows students to view the Home Page
News This link provides access webpage displaying important news and events about
IGNOU. This page is continually updated for the latest events of the University.
Schools Clicking this option allows students to view the various Schools of IGNOU. Clicking
on a particular School allows students to jump on that School’s page.
Courses Clicking this option allows students to view the various courses within each school of
IGNOU. Clicking on a particular Course allows students to jump on that course page.
Divisions Clicking this option allows you to view the information about various Divisions in
IGNOU.
Feedback Clicking this option allows visitors of IGNOU site to send any feedback related to this
site. Users just need to fill in the feedback form and press the Submit Form button.
About Clicking this option, visitors to the site can get information related to IGNOU, like
Events, Systems, etc. Within this page a drop down list is available. Selecting the
required option and clicking Go button, user gets the required information.
2.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:
3
8181
Figure 3
By clicking on the option “Courses” you can view all the programmes on offer by SOCIS as
shown in the figure 4.
Figure 4
The respective Programmes can be selected by clicking on the links provided under the
Programmes offered:
MCA Master in Computer Applications

BCA Bachelor in Computer Applications
CIC Certificate in Computing
BIT Bachelor in Information Technology
ADIT Advanced Diploma in Information Technology
4
8181
On the basis of the Programme selected, respective page will be displayed. The BIT and ADIT
Programmes are offered through Virtual Campus Initiative
2.3 Procedure to browse through MCA pages

As soon as the student selects the course from SOCIS page, a page introducing the MCA
programme is displayed as shown in the figure 5.
Figure 5
On the right side of that page you will find the Student’s login. In order to access the details of
the Course, students need to enter Enrolment Number and Password (same as Enrolment
No.) provided to them by the University at the time of admission and press LOGIN. Students
reach Student’s Lounge page. This page provides all the details related to the selected MCA
programme as shown in the figure 6.
Figure 6
4
8181
Various links are provided to get information related to the course. Students need to click on
these to get the related information. These are explained as below:
Essential Info This briefly explains the structure of the selected course and how to
navigate through the course material. It explains the purpose of the
buttons displayed, while browsing through the course.
Course Route This guides the student through the complete Course. It allows the student
to view the complete course through the browser. Here the course is
divided into Blocks and within it units and then Sections. Students are
required to click the Unit within the desired Block and then the Section to
get information available on the screen.
Download This provides access to the current semester’s assignment. Students can
download these on their computer system. Student first needs to select the
related semester assignment and subsequently click Download button.
This allows to save the assignment within the desired folder on the
Computer’s Hard disk/Floppy. The procedure to download a file is
explained further.
2.4 How to download the Starter Kit & Semester’s

Assignments?
The Semester’s Assignments can be downloaded from the Website by clicking the Download
link. The procedure for downloading the Assignments is:
1. Click the Download link. As shown in the figure 7, a screen appears.
Figure 7
2. Select the assignments by clicking on the links of the respective assignments.
3
8181
3. PROGRAMME OBJECTIVES, STRUCTURE AND
CONTENTS
3.1 Objectives
In view of the fact that the learning needs of graduates would be very diverse, this programme
has been designed with a semester approach in mind. By offering such a range of courses in the
distance education mode, it is possible to cater to the needs of not only the fresh graduates and
upcoming computer professionals but to provide a technical update to an existing practitioner
who while having acquired some skills and knowledge did not have a formal certification of the
same.
The first two semesters of the MCA programme provides understanding related to the use of
computers and a competence in designing and programming a variety of applications. The
programme also enables appreciation of the concepts and underlying issues in the technology of
computers and provides knowledge of programming languages, databases and software
application development methodology. On of the most important computer of the first year
programme is CS-04: Data Structure Through ‘C’ & Pascal. It is a backbone for Software
Development in a larger environment in optimised way.
In the third and fourth semesters of the programme, students are exposed to mathematical
courses namely Discrete Mathematics, Numerical and Statistical Computing. On application side
the emergent areas of Data Communication and Networking, and Software Engineering are
covered so that the students could relate to the emerging opportunities in the software field.
Since a significant part of the software development takes place in the context of working
managers which put information to their use, an input of management oriented topics was
considered useful while formulating the programme at this stage. Accordingly, two-courses viz.,
Operations Research (CS-51) and Accounting and Finance on Computers (CS-54) have been
included in the 3rd and 4th semesters of the MCA programme.
Although the course title, for these two courses are similar to
corresponding courses in the MBA programme of the University, there
would be a distinct set of assignment and question paper for the CS
courses. Emphasis on solving problems on computers using tools learnt
earlier would be a major component. The exam. schedules are also
different.
It is felt that at this stage the students would thus be well equipped to take part in large projects,
working in administration and get a flavour for the current challenges in software development
and implementation.
Upon successful completion of the fourth semester of the MCA programme the students apart
from having possibilities of employment would be in a position to pursue the 5th and 6th (final)
semester courses which deal with some of the advanced and emerging aspects in information
systems, such as Computer Architecture, Operating Systems, Intelligent Systems, Relational
Database Systems, Object Oriented Systems etc.
3.2 Programme Structure
5
8181
The programme has been divided into two semesters per year, i.e. January to June and July to
December. Consequently, there will be two examinations every year - one in June for the first
semester courses and the other in December. The students are at liberty to appear at any of the
examinations conducted by the University during the year subject to completing the minimum
time framework prescribed for the programme.
If a student misses any Term-end Examination of a course for any reason, S/he may appear for
any of them or all the papers in the subsequent Term-end Examination.
Course offering for the MCA Programme

I - SEMESTER II - SEMESTER
Course Course Title Credits Course Course Title Credits
CS-02 Introduction to Software 6 CS-01 Computer Fundamentals 6
CS-04 Data Structures through ‘C’ 6 CS-03 File Structure and 4
and ‘PASCAL’ Programming in COBOL
CS-05 Elements of Systems Analysis 6 CS-06 Database Management 4
and Design Systems
Ill - SEMESTER IV - SEMESTER
CS-08 Numerical and Statistical 6 CS-07 Discrete Mathematics 6
Computing
CS-09 Data Communications and 6 CS-10 Software Engineering 6
Networks
CS-51 Operations Research 4 CS-54 Accounting and Finance on 4
Computers
V - SEMESTER VI - SEMESTER
CS-12 Computer Architecture 4 CS-13 Operating Systems 4
CS-16 Object Oriented Systems 4 CS-14 Intelligent Systems 4
CS-15 Relational Database 4
Management Systems
CS-17 Project 8 CS-17 Project 4
3.3 Contents
Description of the individual courses is given below:
CS-01: Computer Fundamentals
The basic objective of this course is to introduce the student to the computer and its terminology,
and to guide him/her through the functioning of the black box termed as Computer. Therefore,
this course covers some introductory topics such as history of computers, data representation,
Boolean algebra, etc. and gradually guides the students to the computer architectural aspects.
This course also covers details on the microprocessors. This course not only introduces you to
these topics but takes you further down to the concept of recent most popular architectures such
as Parallel Processing and Reduced Instruction Set Computers.
The practicals in this course are mainly focused on logical organisation of computers and
Assembly language. The approximate time needed for these practicals will be in the range of 30-
60 hours. Two video programs support the course: History of Computers and Introduction to
Computers. This course contains 4 printed blocks only.
3
8181
CS-02: Introduction to Software
Software is an important component of a computer system. The objective of this course is to
introduce the various aspects of computer software. It covers wide range of software related
topics, which include programming language concepts, system software tools such as Assembler,
Compiler, Linkers, Loaders and Operating System. Software Engineering is an emerging
discipline, which deals with several approaches to reliable software development. It has 5
blocks, Block-1 deals with introduction of algorithm, basic components of programming
languages, types of software an introduction to compilers and assemblers and graphic user
interface. Block-2 introduces principles of operating system, i.e., process management memory
management, and file system. Block-3 and 4 deals with the philosophy of UNIX Operating
System, Shell Programming, System Administration, Vi-editor and other command level details
of UNIX, Block-5 deals with the principles of software engineering, software development,
analysis and maintenance and introduction to a CASE tool.
CS-03: File Structure and Programming in COBOL

As the course title indicates, this course deals with the programming language COBOL in detail.
COBOL is a powerful language especially in business applications. It offers a lot of facilities in
cases of business-oriented problems. There exist different versions of COBOL. Considering this
particular problem, the writing of materials of this course is done with all possible flexibility of
options in command/ clauses/phrases, etc. so that the learners do not face problems with their
compilers during execution of COBOL programs. The course consists of two written blocks.
These blocks contain the theory part of COBOL. An advanced concept of COBOL is presented
including structured programming concept. The important topics of this course include practical
problems of Data processing, Table handling, Sequential files, Sorting and Merging of files,
Character handling, Report writer, Subroutines, Segmentation and Library facilities.
CS-04: Data Structures through ‘C’ and ‘PASCAL’

The objective of the course is to introduce the basic concepts of data structure and discuss
important features of using two popular high level programming languages ‘C’ and ‘PASCAL’.
Since data structure is an essential component in the development of software, the intention is to
provide a wide range of topics on this subject with appropriate examples. The course is
organised in the following manner:
Block 1 introduces the essential features of PASCAL programming languages, data types,
looping statements bit-wise operations, recursion and string processing pointers, etc.
Block 2 and 3 cover the essential and advance features of C, including its various construct, bit-
wise operations, functions, macros etc.
Block 4 discussions on advanced Data Structures component such as Arrays, Lists, Stacks,
Queues Graphs and their uses.
Block 5 is a discussion on advanced Data Structures, such as Binary Tree, B-Tree, AVL-Tree
etc., and File Organisation. Students should also read topics on Threaded Binary Tree, Binary
Tree representation, Inorder and Preorder from reference literatures given in the block.
Block 6 presents simple and advanced searching and sorting techniques such as quick sort and
Heap sort.
Reference: Fundamentals of Data Structures, Horowitz and Sahni.
Students are requested to refer to the prescribed reference material. Some questions are asked
from books also.
3
8181
CS-05: Elements of Systems Analysis and Design
This course deals with the analysis, design, development, implementation and maintenance of
computer based information systems. The earlier courses would have made the learner familiar
with basic computer hardware and software concepts as well as with some of the programming
languages. The programming experience acquired is complemented in this course with concrete
systems experience. This would enable the learner to cope with the number of components in a
systems development approach and enmesh them correctly to result in a successful project. The
first 3 blocks of the course are a run through the basic stages of a system development life cycle.
The recent trend of acquiring computer systems is often with a view to provide management with
relevant information. A block in the course is, therefore, exclusively devoted to MIS. In order to
strike a balance between the theoretical and applied aspects of systems analysis, a number of case
studies have been included in a special block so that they can serve as a vehicle for applying
systems concepts. While working on the case study, a student would have an opportunity to put
into practical context, the tools of analysis and design learned during the course and also in some
cases modify the cases and suggest strategies for system improvements. The cases are drawn
from actual real life situations and reflect practical problems that would neatly integrate into the
learning process. There is a final block on the emerging trends, as development of systems
moves from an art form to an industry. Some exposure is given in this block to organisational
issues arising out of induction of computer systems, and the new capabilities that the systems
analysts of tomorrow must have, when software would be in the form of multimedia and hyper-
media with greater emphasis on visuals and sound as means of communication.
CS-06: Data Base Management Systems

This is an introductory course to a subject which has recently gained a lot of importance. Apart
from discussing the conventional databases (Hierarchical, Network and Relational Database),we
have also touched upon the emerging trends in DBMS which includes object oriented database,
distributed databases, client server databases and knowledge database.
Another important feature of this course is discussion on file organisations of conventional

databases. There is a complete unit, which discusses large number of file organisation techniques
such as sequential file organisation, index sequential file organisation, random file organisation,
multi-key file organisation. This course contains only 3 blocks.
CS-07: Discrete Mathematics

Discrete Mathematics is a second semester course in the MCA (2nd year) programme. The basic
objective of this course is to discuss —
• Mathematical Logic
• Set Theory and Functions including Fuzzy Sets
• Lattices and Boolean Algebra
• Application of Graph Theory to Computer Science
CS-08: Numerical & Statistical Computing

The objective of the course is to discuss the followings:
• Features of FORTRAN 77 and FORTRAN 90 programming languages

• Numerical Computations which will cover:
• Numerical Interpolation
• Differentiation and Integration
• Linear, Non-linear and Ordinary Differential Equations.
3
8181
Statistical concepts and developing programmes to obtain required parameters for statistical
analysis.
CS-09: Data Communications and Networks

The main purpose of the course is to provide the broad coverage of data communications and
computer networks related topics. The course uses the OSI (Open System Interconnection)
reference model as a framework for presentation of topics. The course explores large numbers of
concepts, techniques, design applications and finally standards.
The course structure is as follows:
Block 1: Introduction to Data ➢ Satellite Microwave

Communication and Computer ➢ Radio
Network Concepts
Unit 3: Data Encoding &
Unit 1: Introduction to Computer
Communication Technique
Networks
 Pulse Code Modulation (PCM)
 What is Computer Network
 Amplitude Modulation
 Network Goals / Motivation
 Frequency and Phase
 Application of Networks
Modulation
 Point to Point or Switched
 Asynchronous Transmission
Networks
 Synchronous Transmission
➢ Circuit Switched Networks
 Error Detection Techniques
➢ Packet-Switched Networks
➢ Parity Checks
 Broadcast Networks
➢ Cyclic Redundancy Checks
➢ Packet Radio Networks
➢ Forward Error Correction
➢ Satellite Networks
 Interfacing
➢ Local Area Networks
➢ RS-232-C
 Network Protocols
➢ X.21 Digital Interface
 OSI Reference Models
 Examples of Some Networks
Unit 4: Multiplexing and
 Concept of Delays
Communication Hardware
 How to Reduce Delays
 Frequency Division
Unit 2: Data Transmission Multiplexing
 Synchronous Time Division
 Transmission Terminology
Multiplexing
➢ Simplex, Half duplex & full
 Statistical Time Division
duplex spectrum and
Multiplexing
Bandwidth, frequency
 Modems
 Analog and Digital Data
 Multiplexers / Demultiplexers
Transmission
➢ Concentrators
 Transmission Impairments
➢ Front-end Processes
➢ Attenuation and Distortion
Block 2: Media Access Control and Data
➢ Delay Distortion
Link Layer
➢ Noise
 Transmission Media and its Unit 1: Data Link Layer Fundamentals
Characteristics
 Framing
➢ Twisted Pair
 Basics of Error Detection
➢ Coaxial Cable
 Forward Error Correction
➢ Optical Fiber
➢ Terrestrial Microwave
3
8181
 Cyclic Redundancy Check Unit 2: Routing
Codes for Error Detection
Unit 3: Congestion Control Algorithms
Unit 2: Retransmission Strategies Unit 4: Internet Protocol (IP)
 Stop-&-Wait ARQ  Adding Routing
 Go-Back-NARQ  Fragmentation and Assembly
 Selective Repeat ARQ
 Pipelining Unit 5: Internetworking
 Bridges (Spanning Tree and
Unit 3: Contention-based Media Access
Source Routing)
Protocols
 X.75
 The advantages of Multiple-  Gateways (Connection
Access Sharing of Channel Oriented & Connectionless)
Resource
 Pure ALOHA Block 4: Transport Layer and
 Slotted ALOHA Application Layer Services
 Carrier Sense Multiple Access
Unit 1: Transport Services and
(CSMA)
Mechanism
 CSMA with Collision
Detection (CSMA/CD)  Type of Services
 Quality of Services
Unit 4: Polling-based Media Access  Data Transfer
Control Protocols  Connection Management
Transport Control Mechanism
 Token Ring
 Addressing
 Token Bus
 Multiplexing
 Flow Control and Buffering
Unit 5: Media Access Control Protocols
 Connection Establishment
for High Speed Networks
 Crash Recovery
 FDDI-I and FDDI-H
 DQDB with Bandwidth Unit 2: TCP/UDP
Balancing for Fair Access
 Standards, Definitions
 Asynchronous Transfer Mode
 Specification of Header
(ATM)
 Fields in Header
Block 3: Network Layer
Unit 3: Remote Procedure Call (RPC)
Unit 1: Introduction to Layer
 Client-Server Model in
Functionality
General
 Connection Oriented Vs  Implementation of RPC
Connectionless Services  XTR (Presentation Layer
 Addressing Problem)
 Concept of Congestion
 Routing Unit 4 & 5: Applications
 Network layer in ATM
 FTP
Networks
 Telnet
 IP
 E-mail
 X.400, X. 500 (may be)
 WWW
 DNS
4
8181
References : [1] Computer Networks, Andrew S. Tanenbaum, PHI.
[2] Data and Computer Communication, William Stalling, PHI.
CS-10: Software Engineering

Software engineering is a discipline that integrates methods, tools and procedures for the
development of computer software. A number of different paradigms for software engineering
have been proposed each exhibiting strength and weakness but all having a series of generic
phases in common. The very issues taken up in the course are software project management,
requirement analysis and specification, Object Oriented Analysis and Data modelling.
Philosophy and Overview ➢ Data-oriented analysis

 Verification and validation of
 Definitions and Taxonomy
the analysis
➢ What is Software; What is
 How the notions of V and V
Engineering; What is
lead to CASE tools
Software Engineering; Aims
 Introduction to CASE tool,
of Software Engineering;
CASE tools and their utility in
The Software Scene; The
analysis and representation
Software Crisis; Software
➢ When do we stop analysing
Metrics
or how much to analyze
 Software Development
(related to software project
Paradigms
management and estimation)
➢ Water-fall Model
 CASE-based example
➢ Prototyping; iterative
enhancement
➢ Spiral model Detailed Design and Implementation
➢ 4GL Techniques
 Design strategies
➢ Top down
 CASE Methodology
➢ Bottom up
➢ Tools and Environment
 Design tools and diagramming
➢ Comparison of different
aids
products
 Design concepts
➢ Abstraction
Requirement Analysis and Specifications
➢ Refinement
➢ Data hiding
 Functional requirements
 How design concepts should
analysis and collections
result in modular products
 Qualitative requirements
Relationship of modularity to
➢ Software project
 Principles of analysis (broad
management (Relating it to
guidelines on how to do
project management)
analysis) with small examples
➢ Software testing and
 Prototyping as an analysis tool
(Relating it to the testing
or method
phase)
 Representation schemes and
➢ Software maintenance
specifying the results of
(Relating it to the
analysis
maintenance phase)
 Different analytical frameworks
 Design metrics for evaluating a
and their applicability
design
➢ Structured analysis
➢ Object-oriented analysis
5
8181
 The relationship between Project Scheduling
analysis and design and how to Estimating efforts and lines scales
make the transition Algorithmic cost modelling
 High level or architectural The COCOMO model
design
 Guidelines and heuristics for Software Quality
design
Criteria for Software Quality
 Dataflow-oriented design
Software Reliability
 Object-oriented design
Software Standards
 Data-oriented design
Software Metrics
 User Interface Design
Software validation
 Real Time Design
Testing Techniques and Strategies
 Comparison of different design
Software Maintenance
methods
Software Configuration
 CASE tools and system design
Management
 Verifying and validating the
product design (Related to
CASE Tools & Environment
design metrics)
Project Management Tools
Software Project Management Documentation Tools
Analysis and Design Tools
Software Management Activities
Programming Tools
Software Management Structures
Integration and Testing Tools
Programmer Productivity
Projecting Tools
Option Analysis
Maintenance Tools
Project Milestones
Integrated CASE Environment
Work definition, allocation and
assignments
References : [1] Software Engineering, A Practitioner’s Approach, Pressman, McGraw

Hill.
[2] Fundamentals of Software Engineering, Ghezzi, Jazayeri &
Mandriolli, PIU.
CS-51: Operations Research

It is a four credit course, which introduces to Operations Research, its overview, the
programming techniques-linear programming, and its methods and further applications.
Inventory control-deterministic probabilistic models as well as queuing models are discussed at
length. Due emphasis is laid on competitive situations and simulations. Students are required to
solve problems on a computer.
CS-54: Accounting & Finance on Computers

A 4 credit course discusses the accounting framework, cost management, financial and
investment analysis, financial decisions, understanding financial statements etc. All these
concepts are to be assimilated with development and use of appropriate software.
CS 12: Computer Architecture

This course is aimed at providing architecture and programming related details about parallel
processing. This course consist of four blocks covering theory, technology, architecture, and
software aspects of parallel and vector computers.
6
8181
It presents basic principles of parallel processing. These include parallel computer models,
scalability analysis, theory of parallelism, data dependencies and program flow mechanisms.
This block lays the foundations for the subsequent blocks.
This is devoted to the study of advanced processors, cache and other memory technologies, and
pipelining techniques. The topics covered in this block include RISC, CISC, superscalar,
superpipelining, and VLIW architectures. Shared memory, cache architecture, and coherence
protocols are also discussed. The pipelining is extensively studied for, instruction execution,
scalar, superscalar, and vector arithmetic operations.
It provides aspects relating to shared-memory multiprocessors, vector and SIMD

supercomputers, and scalable or multithreaded architectures. IEEE Futurebus + standards has
also been discussed. Massive parallelism is addressed in message-passing systems as well as in
synchronous SIMD computers. Shared virtual memory and multithreaded architectures are the
other important topics covered in this block.
It deals with parallel programming models, multiprocessor UNIX, software environments, and
compiler development for parallel / vector computers. Both shared variables and message-
passing schemes are discussed for inter-processor communications. Languages, compilers, and
software tools for program and benchmark development and performance monitoring are also
discussed. The detailed course structure is given below:
Theory of Parallelism ➢ Hardware and Software

Parallelism
The State of Computing
➢ The Role of Compilers
➢ Computer Development
Program Partitioning and
Milestones
Scheduling
➢ Elements of Modern
➢ Grain Sizes and Latency
Computers
➢ Grain Packing and
➢ Evolution of Computer
Scheduling
Architecture
➢ Static Multiprocessor
➢ System Attributes to
Scheduling
Performance
Program Flow Mechanisms
Multiprocessors and
➢ Control Flow Versus Data
Multicomputers
Flow
➢ Shared-Memory
➢ Demand-Driven
Multiprocessors
Mechanisms
➢ Distributed-Memory
➢ Comparison of Flow
Multicomputers
Mechanisms
➢ A Taxonomy of MIMD
System Interconnect Architectures
Computers
➢ Network Properties and
Multivector and SIMD Computers
Routing
➢ Vector Supercomputers
➢ Static Connection Networks
➢ SIMD Supercomputers
➢ Dynamic Connection
Architectural Development Tracks
Networks
➢ Multiple-Processor Tracks
➢ Standard Performance
➢ Multivector and SIMD
Measures
Tracks
➢ Massive parallelism for
➢ Multithreaded and Dataflow
Grand Challenges
Tracks
Scalability Analysis and
Conditions of Parallelism
Approaches
➢ Data and Resource
Dependencies
7
8181
➢ Scalability Metrics and ➢ Clocking and Timing
Goals Control
➢ Evolution of Scalable ➢ Speedup, Efficiency, and
Computers Throughput
➢ Reservation and Latency
Analysis
Hardware Technologies
Instruction Pipeline Design
Advanced Processor Technology ➢ Instruction Execution Phases
➢ Design Space of Processors ➢ Mechanisms for Instruction
➢ Instruction-Set Architectures Pipelining
➢ CISC Scalar Processors ➢ Dynamic Instruction
➢ RISC Scalar Processors Scheduling
Superscalar and Vector Processors ➢ Branch Handling
➢ Superscalar Processors Techniques
➢ The VLIW Architecture Arithmetic Pipeline Design
➢ Vector and Symbolic ➢ Computer Arithmetic
Processors Principles
Memory Hierarchy Technology ➢ Static Arithmetic Pipelines
➢ Hierarchical Memory ➢ Multifunctional Arithmetic
Technology Pipelines
➢ Inclusion, Coherence, and Superscalar and Superpipeline
Locality Design
➢ Memory Capacity Planning ➢ Superscalar Pipeline Design
Virtual Memory Technology ➢ Superpipelined Design
➢ Virtual Memory Models ➢ Supersymmetry and Design
➢ TLB, Paging and Tradeoffs
Segmentation
➢ Memory Replacement Parallel and Scalable Architectures
Policies
Multiprocessor System
Backplane Bus Systems
Interconnects
➢ Backplane Bus Specification
➢ Hierarchical Bus Systems
➢ Addressing and Timing
➢ Crossbar Switch and
Protocols
Multiport Memory
➢ Arbitration, Transaction, and
➢ Multistage and Combining
Interrupt
Networks
➢ The IEEE Futurebus +
Cache Coherence and
Standards
Synchronization Mechanisms
Cache Memory Organizations
➢ The Cache Coherence
➢ Cache Addressing Models
Problem
➢ Direct Mapping and
➢ Snoopy Bus Protocols
Associative Caches
➢ Directory-Based Protocols
➢ Set-Associative and Sector
➢ Hardware Synchronization
Caches
Mechanisms
➢ Cache Performance Issues
Vector Processing Principles
Shared-memory Organizations
➢ Vector Instruction Types
➢ Interleaved Memory
➢ Vector-Access Memory
Organization
Schemes
➢ Bandwidth and Fault
➢ Past and Present
Tolerance
Supercomputers
➢ Memory Allocation
Multivector Multiprocessors
Schemes
➢ Performance-Directed
Linear Pipeline Processors
Design Rules
➢ Asynchronous and
➢ Cray Y-MP, C-90 and NTP
Synchronous Models
8
8181
➢ Fujitsu VP2000 and VPP ➢ Code Generation and
500 Scheduling
➢ Mainframes and Minisuper- ➢ Trace Scheduling
computers Compilation
SIMD Computer Organization Loop Parallelization and Pipelining
➢ Implementation Models ➢ Loop Transformation
➢ The CM-2 Architecture Theory
➢ The MasPar MP-1 ➢ Parallelization and
Architecture Wavefronting
Principles of Multithreading ➢ Tiling and Localization
➢ Multithreading Issues and ➢ Software Pipelining
Solutions Parallel Programming Environment
➢ Multiple-Context Processors ➢ Software Tools and
➢ Multidimensional Environments
Architectures ➢ Y-MP, Paragon and CM-5
Dataflow and Hybrid Architectures Environments
➢ The Evolution of Dataflow ➢ Visualization and
Computers Performance Tuning
➢ The ETL / EM-4 in Japan ➢ Synchronization and
➢ The MIT / Motorola *T Multiprocessing Modes
Prototype ➢ Principles of
Synchronization
Software for Parallel Programming ➢ Multiprocessor Execution
Modes
Parallel Programming Models
➢ Multitasking on Cray
➢ Shared-Variable Model
Multiprocessors
➢ Message-Passing Model
Shared-Variable Program Structures
➢ Data-Parallel Model
➢ Locks for Protected Access
➢ Object-Oriented Model
➢ Semaphores and
➢ Functional and Logic
Applications
Models
➢ Monitors and Applications
Parallel Languages and Compilers
Message-Passing Program
➢ Language Features for
Development
Parallelism
➢ Distributing the
➢ Parallel Language
Computation
Constructs
➢ Synchronous Message
➢ Optimizing Compilers for
Passing
Parallelism
➢ Asynchronous Message
Dependence Analysis of Data
Passing
Arrays
Mapping Programs onto
➢ Iteration Space and
Multicomputers
Dependence Analysis
➢ Domain Decomposition
➢ Subscript Separability and
Techniques
Partitioning
➢ Control Decomposition
➢ Categorized Dependence
Techniques
Tests
➢ Heterogeneous Processing
Code Optimization and Scheduling
Multiprocessor UNIX Design Goals
➢ Scalar Optimization with
➢ Conventional UNIX
Basic Blocks
Limitations
➢ Local and Global
➢ Compatibility and
Optimizations
Portability
➢ Vectorization and
➢ Address Space and Load
Parallelization Methods
Balancing
9
8181
➢ Parallel I/0 and Network Multicomputer UNIX Extensions
Services ➢ Message-Passing OS Models
Master-Slave and Multithreaded ➢ Cosmic Environment and
UNIX Reactive Kernel
➢ Master-Slave Kernels ➢ Intel NX / 2 Kernel and
➢ Floating-Executive Kernels Extensions
➢ Multithreaded UNIX Kernel
References : [1] Advanced Computer Architecture, Kai Hwang, McGraw Hill,

International Edition.
[2] Computer Architecture, Michael, J. Flynn, Narosa.
[3] Computer Organisation, HAMACHER, V. Carl et al McGraw Hill,

International Edition.
[4] Computer Organisation and Architecture, Designing for

Performance, Stallings W, Prentice Hall of India.
CS-13: Operating Systems

The course structure discusses fundamental concepts that are applicable to a variety of operating
systems, and as such does not concentrate on any particular operating system or Hardware. It,
however, presents a large number of examples that pertain to UNIX and other popular operating
systems.
Important topics which have been included in the course are the concept of process, CPU
scheduling process synchronization, deadlock memory management, virtual memory, file system
implementation, protection and security multiprocessor systems, parallel programming,
algorithms and implementation of distributed operating system.
The course structure is designed as follows:
Process Management and Synchronisation

 Multiprocessor system
 Overview  Parallel Programming
 Process  Distributed operating system
Management  Algorithms and Implementation
 Interprocess
Synchronisation
Security, Protection and Case Studies
 Interprocess Communication
and Synchronisation  Security and Protection
 Case Studies: Windows NT,
Memory Management and File Manager UNIX
Emerging Topics
References: [1] Operating Systems, Milan Milankovic, McGraw Hill.
[2] Operating System Concepts, Silberschatz and Galvin Addison Wesley.
[3] Operating Systems, Achyut S. Godbole, Tata McGraw Hill.
10
8181
CS-14 Intelligent Systems
The course addresses comprehensively the important aspects of AI and expert systems. It
discusses knowledge and knowledge representation schemes. The key features of the course
structure are Programming Languages (LISP & Prolog), Object oriented representation of
knowledge, knowledge organization and manipulation. The detailed course structure is given
below:
Introduction to AI Representation Using Rules

Overview of AI Associative Network, Frames and Object
Oriented Representation of Knowledge
Nature of Intelligence
Limitation of Computational Associative Networks
Abilities of Logical Devices Frame Structures
AI Techniques Conceptual Dependencies and
➢ Heuristic Techniques Scripts
➢ Search Techniques Overview of Object-Oriented
Domain AI Problems Systems
➢ Incompleteness Object, Classes Messages and
➢ Inconsistency Methods
➢ Uncertainities
Knowledge Representation Knowledge Organisation and
Mechanisms Manipulation
Basic List Manipulation Functions
Search and Control Strategies
in LISP
Functions, Predicates and Preliminary Concepts
Conditionals Examples of Search Problems
Input, Output and Local Variables Uniformed or Blind Search
Iteration and Recursion Informed Search
Property Lists and Arrays Searching And-Or Graphs
Introduction to Prolog
Matching Techniques
Knowledge Representation Schemes
Structures used in Matching
Proposition and Predicate Logic Measures for Matching
Matching like Patterns
Syntax and Semantics for
Partial Matching
Propositional Logic
The RETE Matching Algorithm
Syntax and Semantics for FOPL
Properties of Wffs
Knowledge Organisation and
Conversion to Clausal Form
Management
Inference. rules
The Resolution Principle Indexing and Retrieval Techniques
Integrating Knowledge in Memory
Nondeductive Inference Methods Memory Organisation Systems
Reference: Introduction to AI & Expert System, D.W. Patterson; Prentice Hall of India.
CS:15 Relational Database Management Systems

The key features of the course are in-depth coverage of the relational model. The essential
feature of other models: network, hierarchical E-R model as well advance models like
OODBMS, KDBMS, C/S DBMS and DDBMS were covered (in CS-06). In this course main
11
8181
focus is on the theory of relational database design. The topics of recovery, concurrency and
database security are also part of the course structure.
The detailed structure of the course is as follows:
Course Name: Relational Database Management Systems
Introduction to the Relational SQL and Calculus

Model SQL (including views)
An Overview of the Relational Model Relational Calculus
Tables as Simple Data Structure Tuple Oriented Relational Calculus
Simple Operations Domain Oriented Relational
SQL Support Calculus
View Mechanism
Physical Data Independence and
Logical Embedded Query Language
Data Independence Normalisation and Query

Ease of Application Development Processing
Translating E/R Diagram Functional Dependency
Referential Integrity Dependencies and Logical
Implications
Relational Algebra Operation Closure of a Set of Functional
Set Theoretical Operations Dependencies
Selection Testing if F = X ➔ Y: Algorithm to
Projection Compute a Closure
Join Testing if an FD is in a closure
Division Covers
Nonredundant and Minimum
Referential Integrity and Database Covers
Integrity Canonical Cover
Functional Dependencies and Keys
Foreign Key Rules
Benefits of Foreign Key Support Normalisation
Physical Design Principles
First Normal Form
Basic Data Structure Second Normal Form
Third Normal Form
Heaps and Sequential File Boyce Codd Normal Form
Indices Multivalued and Join Dependency
Locating Tuples with Tables
Dense and Sparse Indices MVD and Normalisation
Performance of Index Search Axioms for Functional and
Clustering Multivalued Dependencies
Hierarchical Structures of Indices Closure Under MVDS
B-Tree Fourth Normal Form
The ISAM Storage Structure Lossless Join Decomposition into
Hashing Fourth Normal Form
Storage Structure in ORACLE Join Dependencies
Project-Join Normal Form
12
8181
➢ Serializability Algorithm:
Query Processing Read before-Write Protocol
➢ Serializability Algorithm:
Query Representation
Read Only and Write-Only
General Processing Strategies
Protocols
Transformation into an Equivalent
Concurrency control
Expression
Locking Scheme
Expected Size of Relations in the
➢ Two-phase Locking
Response
➢ Granularity of Locking
➢ Selections
➢ Hierarchy of Locks and
➢ Projection
Intention-Mode Locking
➢ Join
➢ Tree-Locking Protocol
Statistics in Estimation
➢ DAG Database Storage
Query Improvement
Structure
Query Evaluation
Timestamp-Based Order.
➢ One-Variable Expressions
Optimistic Scheduling Multiversion
➢ Two-Variable Expressions
Techniques
➢ N-Variable Expressions
Deadlock and Its Resolution
➢ Access Plan
➢ Deadlock Detection and
Recovery
Recovery Concurrency Management ➢ Deadlock Avoidance
and Database Security
Integrity and Control Database Security, Integrity and Control
Recovery
Security and Integrity Threats
Reliability Defence Mechanisms
➢ Types of Failures ➢ Security Policies
➢ Types of Errors in Database ➢ Authorisation
Systems and Possible Detection ➢ Identification and
Schemes Authentication
➢ Audit Trails ➢ Views/Subschemes in
➢ Recovery Schemes Security Enforcement
➢ Transactions ➢ Distributed Systems
➢ States of a Transaction ➢ Cryptography and
➢ Properties of a Transaction Encryption
➢ Failure Anticipation and Integrity
Recovery ➢ Domain or Data-Item Value
Recovery in a Centralised DBMS Integrity Rules
Reflecting Updates to the Database ➢ Implicit and Data
and Recovery Dependency Constraints
Buffer Management, Virtual ➢ Violation of Integrity
Memory, and Recovery Constraints and Corrective
Disaster Recovery Action
➢ A General Model of
Concurrency Management Integrity
Lost Update Problem ➢ Expressing Integrity
Inconsistent Read Problem Constraints
The Phantom Phenomenon Statistical Databases
Semantics of Concurrent Auditing and control
Transactions
Serializability Practicals on ORACLE
➢ Precedence Graph
References: [1] Introduction to Database, Bipin C. Desai, Galgotia Publications.
13
8181
[2] Database System Concepts, Second Edition, Henery F.Korth & Abraham
Silberschetz McGraw Hill.
[3] Relational Database System, C.J.Date, Addision Wesley.
[4] Database Management System, Majumdar & Bhattacharya, Tata McGraw
Hill.
CS-16: Object Oriented System

This course classifies the basic concepts associated with object oriented system. The main object
oriented graphics and features of the course are object oriented programming languages,
introductory concepts of OODBMS, Object Oriented Analysis & Design. It presents a new
object oriented software development methodology—from analysis, design to implementation.
Object orientation is above all a programming style that allows better organization and
modularization of large application programs. The course emphasizes the concepts and ideas for
improving programming style, regardless of whether the programmer uses an object oriented
programming languages. Especially emphasis is given to C++ and to the newly emerging fields
of object oriented design.
The course structure is designed into four blocks. The first block gives a brief introduction to
object oriented concepts and modeling concepts. It introduces concepts related to abstract data-
types, inheritance, polymorphism, modeling concepts and object oriented programming
languages. It also provide details of inheritance and polymorphism, takes up issues related to
inheritance and subtyping, class inheritance, inheriting methods, metaclass, object inheritance
and multiple inheritance.
Other topics covered in the block include abstract data types, modularization through procedures,
class overloading, polymorphism and dynamic and functional modeling which covers
concurrency and advanced dynamic modeling concepts.
Block 2 presents the most popular object oriented programming language C++. One of the
central themes of the course is on analysis, design and implementation which, is covered in block
3. It also compares object oriented methodologies with other popular methodologies including
conventional approaches and information modeling notations from the database.
Block 4: Object Oriented System & Application

This block briefly touches upon various applications and introduces OODBMS and object
oriented GUI.
The detailed course structure and references are given below:
Course Name: Object Oriented Systems Course Code

: CS-16
Introduction to Object Oriented Concepts
Overview of Object Oriented System Object Oriented Programming

Languages
Abstract Data Types
Object Oriented Database
Inheritance
Object Oriented User Interface
Polymorphism
Object Identity
Abstract Data Types
Object Modeling Concepts
Object Oriented Design Data Types
14
8181
From Data types to Abstract Data Inheritance in Object-Oriented
Types Languages
The Object / Message Paradigm The Different Facets of Inheritance
Modularization through Inheritance and Subtyping
Procedures versus Objects Subtyping
➢ Modeling of the Real World ➢ Subsets as Subtypes
➢ Autonomy ➢ Subtyping of Structured
➢ Generation of Correct Types
Applications Contrasting Inheritance with
➢ Reusability Subtyping
Classes ➢ Implicit Subtyping versus
➢ Instance Values Explicit Inheritance
➢ Methods and Messages ➢ Subtyping and Dynamic
➢ Creating and Destroying Binding
‘Objects’ Class Inheritance
 Creating Objects in Inheriting Instance Variables
Object Oriented ➢ Redefining Instance
Languages Variables
 Destroying Objects and ➢ Hiding Instance Variables
Garbage Collection in Inheriting methods
Object Oriented ➢ Method Overriding
Languages ➢ Invoking Superclass
 Garbage Collection Methods
Strategies and ➢ Constrained Overriding
Algorithms ➢ Inheriting the Interface
Class Extensions ➢ Excluding Superclass
Overloading Methods
Dynamic Binding Metaclasses
Parametric Polymorphism or ➢ Explicit Support
Generosity ➢ Implicit or Hidden
Constraints Metaclasses
➢ Constraints on Object and ➢ Object-Oriented Languages
Instance Variables without Metaclasses
➢ Pre and Post conditions of Object Inheritance
Methods ➢ Prototype Systems and
Delegation
Inheritance ➢ Multiple Inheritance
Inheritance in Knowledge-Oriented
Representation
A sample dynamic Model, Functional model, Relation of functional to object and dynamic
models.
Overview of Object Oriented

Programming Languages
C++ Programming Language
SMALLTALK
ADA Overview of C++
EIFFEL Programming Paradigm
Support For Data Abstraction
Support for Object Oriented
Programming
15
8181
Declaration and Constants ➢ Public
Expression and Statement ➢ Protected
Function and Files Single inheritance
➢ Linkages ➢ Privately derived
➢ How to Make a Library ➢ Publicly derived
➢ Functions Making a protected member
➢ Macros inheritable
Access control to private and
Classes and Objects protected member by member
functions of a derived class
Definition of Class
Multilevel inheritance
Class Declaration : Data Members
Nesting of classes
➢ Data Members
➢ Member Functions
Streams, Templates and Design of
➢ Private and Public Members
Libraries
➢ Default labels
➢ Data Hiding and Output
Encapsulation Input
➢ Arrays within a class Formatting
Class Function Definition Files and Streams
Member Function definition inside C-I/0
the class declaration and outside Design of Libraries
the class declaration
Scope resolution operator (: :) Object Oriented Analysis &
Private and Public member function
Nesting of Member functions
Design
Creating Objects Object Oriented Development
Accessing Class data members System Design
Accessing member functions Object Design
Arrays of Objects Entity Relationship Model
Objects as function arguments Overview of Existing
➢ Pass by value Methodologies
Operator Overloading Semantic and Entity Relationship

Modeling
Operator Function
Contrasting Design for Databases
User Defined Type Conversion
and OOA / OOD
Literal
Large Objects
Overview of existing Methodologies
Assignments and Initialisation
Subscripting The OMT OOA and OOD
Function call Approach
Dereferencing ➢ Object-Oriented Analysis
Increment and Decrement ➢ Object-Oriented Design
A String Class ➢ Object Diagrams
Friends and Members ➢ Dynamic Model
➢ Functional Model
Inheritance through Extending C. Systems & Applications
Concept of inheritance OODBMS
Base Class OOGUI
Derived Class Defining derived Object Oriented Applications.
classes
Visibility modes
➢ Private
16
8181
References: [1] The C++ Programming Language, Bjarne Stroustrup; Addison
Wesley.
[2] Object Oriented Modeling and Designing, James Rumbugh and other
PHI, 1996.
[3] A C++ Primer, 2nd edition, Stanley B. Lippman, Addison-Wesley,
1993.
CS-17 Project
The project work constitute a major component in most of the professional programs and it is to
be organised with due care and executed with seriousness by the candidate. The objective of the
project is to help the students develop ability to apply theoretical and practical tools/techniques to
solve real life problems related to industry, academic institutions and Research Laboratories. For
doing the project the students have to find out topic and guide under whom the work has to be
carried out. Students have to submit their project proposals along with the bio-data of the guide
to the Project Co-ordinator (MCA), School of Computer and Information Science, IGNOU,
Maidan Garhi, New Delhi – 110 068. Viva-voce is the compulsory part of the project.
Visit IGNOU’s website http: //www.ignou.ac.in
17
8181
4. EVALUATION
(1) Evaluation for each course covers two aspects:
(a) Continuous evaluation through assignments with a weightage of 25%.
(b) Term-end examination having a weightage of 75%.
NOTE : A student has to secure minimum qualifying marks in every component of the
assignment.
(2) The components of the continuous assessment methodology would be a mix of

TMA, a practical assignment and project. The actual mix of these components is
different for each course.
(3) 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 40% in
continuous evaluation and 40% in the term-end examinations, with an overall
average of 50% for a pass in the course.
(4) 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.
The University has adopted, a letter grading system on a five point scale for reporting the
students performances in a programme. The letter grades and their qualitative levels are as under
:
Letter Grade Qualitative Level Point Grade % of Raw Marks

A Excellent 5 75% and above
B Very Good 4 60% but less than 75%
C Good 3 50% but less than 60%
D Satisfactory 2 40% but less than 50%
E Unsatisfactory 1 Below 40%
Depending on the percentage of marks secured by a candidate who has passed, the divisions will
be awarded as follows:
18
8181
First Division — 75% and above
with Distinction
First Division — 60% or more but less than 75%
Second Division — 50% or more but less than 60%
Unsuccessful — Less than 50%.
4.1 Assignments
The main purpose of assignments is to test students' comprehension of learning the materials they
receive from the University and also to help them get through the courses by providing feed-back
to them. The information given in the printed course materials should be sufficient for answering
the assignments. The students should not worry about the non-availability of extra reading
material for working on the assignments. However, if they have easy access to other books, they
may make use of them. But the assignments are designed in such a way as to help them
concentrate mainly on the printed course material and exploit their personal experience.
There are three types of assignments for this program. These are:
(a) Tutor Marked Assignments (TMA): These consist of descriptive essay-type

questions. The answers are required to be submitted to the Study Centres within
the specified dates. These are assessed locally at the Study Centre.
(b) Practical Assignments: These comprise of a certain number of designated practical

assignments to be done while performing the hand-on work, and are to be conducted
at the study centre. The results would be forwarded to the Student Registration &
Evaluation Division of this University by the Co-ordinator of the study centre.
These assignments will be conducted at the respective study centres. Counsellor

will intimate the dates of practical assignments. Depending on the local conditions,
the dates for practical assignments may vary slightly from the schedule as given in
the programme guide. The practical assignments will be of 3 hours duration, during
which a participant will be assigned certain tasks to be performed on the computer.
(c) Projects: The project is an assignment, which requires a combination of practical

work and the detailed work acquired in a TMA. In the final year of the MCA
programme the project is based on the entire course by itself. For the Ist year and
2nd year however, the project is relatively short, typically restricted to a report
of about 30 pages. Viva is compulsory for projects. However, the skills and
characteristics common to all projects are the capacity of formulating a problem,
working independently upon the problem in a somewhat open-ended manner and
summarising the results of the activities. The schematic of the number of TMAs
and distribution of assignments and the marks allocated to them as well as for the
Term-end Examination are indicated in the chart(s) given below:
Distribution of Assignments and the Marks

Total marks for each course is 100
19
8181
(Master in Computer Applications, Ist year)
Course Assignment(25 marks) Term-end Practical

No. of Marks No. of Marks Exam. Theory
TMAs Projects
CS-01 1 10 1 15 75 NA
CS-02 1 10 1 15 60 15
CS-03 1 10 1 15 60 15
CS-04 1 10 1 15 60 15
CS-05 1 10 1 15 75 NA
CS-06 1 10 1 15 75 NA
(Master in Computer Applications, IInd Year)
Course Assignment(25 marks) Term-end Practical

No. of Marks No. of Marks Exam. Theory
TMAs Projects
CS-07 1 10 1 15 75 NA
CS-08 1 10 1 15 75 NA
CS-09 1 10 1 15 75 NA
CS-10 1 10 1 15 75 NA
CS-51 1 10 1 15 75 NA
CS-54 1 10 1 15 75 NA
(Master in Computer Applications, IIIrd Year)
CS-12 1 10 1 15 75 NA
CS-13 1 10 1 15 75 NA
CS-14 1 10 1 15 75 NA
CS-15 1 10 1 15 75 NA
CS-16 1 10 1 15 75 NA
Assignments for January-June 2004
Course Assignment No. Assignment Type Last date of Submission Page No.
Code
CS-02 MCA(1)-02/TMA/04 TMA 15th April, 2004 35
CS-02 MCA(1)-02/Project/04 Project 30th April, 2004 36
20
8181
21
8181
Course Viva-voce
Code is compulsory
: for the project evaluation for which 6 marks are allocated.
CS-02
Course Title : Introduction to Software
Assignment Number : MCA(1)-02/TMA/04
Maximum Marks : 10
Last date of Submission : 15th April, 2004
This is a Tutor Marked Assignment. There are Four questions in the assignment.
Answer all questions. Each question carries equal weightage. You may use
illustrations and diagrams to enhance explanations.
Question 1: Write an algorithm/program that accepts an input a decimal number and

converts it into binary representation.
Question 2: Consider the following set of processes that arrive in the ready queue at
the same
time:
Process CPU time
JOB1 6
JOB2 8
JOB3 7
JOB4 1
JOB5 5
Consider the following scheduling algorithms:
First Come First Serve (FCFS), SJF (shortest job first) and Round Robin
(quantum = 1)
What is the turnaround time of each process for each of the above
scheduling
algorithms?
What is the waiting time of each process for each of the above scheduling
algorithms?
Question 3: Compare and contrast the features of UNIX and LINUX operating
systems.
Question 4: Write the UNIX commands for the following:
(a) Use the more command, and a pipe to send the contents of your
.profile and .shrc files to the screen.
(b) How could you use head and tail in a pipeline to display lines 25
through 75 of a file?
(c) To search the /etc/passwd file for the lines containing any input
string given by the user.
(d) To see the lines in /etc/passwd that begins with the character "a".
(e) List all the files in the /tmp directory owned by the user root.
(f) To see a complete listing of all the processes currently scheduled.
22
8181
(g) Use the ps command, and the grep command, in a pipeline to find
all the processes owned by you.
(h) To force termination of a job whose process ID is given.
(i) Sort the /etc/passwd file, place the results in a file called foo, and
trap any errors in a file called err with the command.
(j) To sort a file called foo, and place the results in a file called bar.
Course Code : CS-02

Course Title : Introduction to Software
Assignment Number : MCA(1)-02/Project/04
Maximum Marks : 15
Note: This is a Project. Answer all the questions. Each question carries equal
weightage.
You may use illustrations and diagrams to enhance explanations.
Question 1: Write a regular expression for the following statements of C language:

(a) Assignment
(b) For
(c) Switch (5 Marks)
Question 2: Write shell programs for the following:

(a) To find the smallest number among the 3 numbers given.
(b) To check whether the given string is a palindrome or not.
(c) To sort the given list of numbers in descending order.
(d) To check, how many times a given substring occurs in a given main
string.
(e) To find the factorial of a given number.
(10 Marks)
23
8181
24
8181
Course Code : CS-4
Course Title : Data Structures through C and Pascal
Maximum Marks : 10
This is a Tutor Marked Assignment. There are two questions in this assignment.
Answer all questions. Each carries 5 marks. You may use illustrations and
diagrams to enhance explanations.
Question 1: Write a program in ‘C’ language to merge the contents of two binary
search trees into one. What are the time and storage complexities of your
program?
Question 2: Write a program in ‘C’ language to count the number of internal nodes of a
tree.
25
8181
Course Code : CS-04
Course Title : Data Structures through C and Pascal
Maximum Marks : 15
This is a Project Assignment. Answer the following question. You may use
Question 1: Write a Program in ‘C’ language to evaluate an expression using a Queue.

You should not use the concept of Stack any where in your program.
26
8181
Course Code : CS-05
Course Title : Elements of System Analysis and Design
Maximum Marks : 10
This is a Tutor Marked Assignment. There are two questions in this assignment.
Answer all questions. You may use illustrations and diagrams to enhance
explanations. All questions carry equal weightage.
Question 1: What is the difference between Systems Analysis and Systems Design ?
How does the focus of Information Systems Analysis differ from that of
Information Systems Design?
Question 2 : What important question is addressed during the Preliminary

Investigation phase? How might the information systems building blocks
be used to identify the general level of understanding required for the
phase?
27
8181
Course Code : CS-05
Course Title : Elements of System Analysis and Design
Maximum Marks : 15
This is a Project Assignment. Answer the following question. You may use
Question 1: During the Preliminary Investigation and Problem Analysis phases, an

Analyst collected numerous samples, including documents, forms, and
reports. Explain how these samples will prove useful for Analyst at later
stages of System development.
28
8181
5. OLD QUESTION PAPERS
Term-End Examination Paper
CS-02 : Introduction to Software
Tinw : 2 Hours Max.

Marks : 60
Note : Question 1 is compulsory. Answer any three from the rest.
1. (a) Write an algorithm to remove from an ordered array all numbers dust occur more than
once. 8
(b) Explain the relevance of regular grammar to lexical analysis. 7
(c) Derive a regular grammar to describe the syntax of a conventional representation
of floating point numbers in a programming language. 7
(d) What features of Unix are specially useful from a S/W engineering standpoint? 8
2. (a) Discuss Unix system architecture. 4

(b) Discuss memory management scheme in Unix operating system. 6
3. Define the essential differences between the following types of operating systems in terms
of memory management. I/0 management and file management.
(a) Batch
(b) Interactive
(c) Time sharing
(d) Real time 10
4. (a) Define the difference between preemptive and nonpreemptive scheduling 3

(b) Explain the difference between external and internal fragmentation. 3
(c) Describe the Hardware support for paging. 4
5. (a) How is separate compilation facility supported in ADA?

(b) What are advantages and disadvantages of CASE Tools? 3
(c) What are the issues related to the selection of right methodologies? 3
6. (a) Discuss the relationship between S/W engineering and two important disciplines of
Computer Science such as Programming language and Database. 6
(b) Discuss the important qualities of S/W product and process 4
Reliability
Reusability
29
8181
CS-04 : Data Structures Through 'C' & Pascal
Time : 2 Hours Maximum Marks :

THIS PAPER ALSO CONTAINS PRACTICAL EXAMINATION
60
Note : There are 6 questions in this paper. Question 1 is compulsory. Answer any three
questions from the rest. All algorithms should be written nearer to C or Pascal
language.
1. (a) The order of nodes of a Binary tree in preorder and inorder traversal are as under
Preorder : A B D G H C E F I K J
Inorder: : B G H D A E C I K F J
Draw the corresponding Binary tree. 5
(b) A recursive function f is shown below. What is the value of f(5)?
int f(int x)
{
if (x < 2)
return (1);
else
return f(x - 1) + f(x - 2)
} 5
(c) Given array A (50 : 100, 50 : 75). What is the starting location of A(62, 56)? 2
(d) Write the following expression into postfix notation.

! (a & & | ((b < c) | | (c > d))) | | (c < e) 2
(e) Write a c function to insert a node at the front of a linked list 8
(f) The following keys are to be inserted in the order shown into an AVL tree.
A, Z, B, Y, C, X, D, W, E, V, F
Show how the tree appears after each insertion. 8
2. (a) How is a dequeue different from stack and queue? What are the different types of
dequeue? What are the different ways one can implement dequeue? 4
(b) Write an algorithm to implement queue through circular array. 6
3. (a) What is the number of nodes on the ith level of an almost binary tree with height K? 2
(b) What are the objectives of Binary Search tree? 2
(c) Write an algorithm to find the inorder successor of a node in a threaded Binary tree. 6
4. (a) Find a minimum spanning tree of the following graph using Kruskal algorithm.4
30
8181
231G
D
C
B
A
H
E
FI
31
8181
(b) write Kruskal algorithm. 6
5. Discuss the difference between the following file organization techniques

• Sequential file organisation
• Index sequential file organisarion
• Direct file organization.
Compare their storage and access efficiencies. To what type of applications each of the
techniques are suited?
10
6. (a) Write an algorithm (recursive) to implement quick-sort technique and discuss about its
efficiency.
(b) Given an example where postorder traversal is the most appropriate way to visit a tree.
Do the same for inorder and preorder traversal.
(c) What is the difference between external and internal sorting?
THIS PAPER ALSO CONTAINS PRACTICAL EXAMINATION
32
8181
CS-05 : Elements of System Analysis & Design
Time :3 Hour Max Maks :

75
Note : There are 6 questions in this paper Question no. 1 is compulsory and carries 30 marks
From the remaining questions, you may attempt any three. Each of these carries 15
marks.
1. Write brief notes on any five of the following:

30
(a) Ergonomics.
(b) Green P.C.
(c) Audit
(d) Hot sites
(e) Software quality
(f) OCR
(g) Prototype design model
(h) Decision table
2. Illustrate with suitable examples, the relative merits of system flowcharts, decision tables and
decision trees? Which of these do you find easiest to draw and understand?
15
3. Comment on the following models to bring out their contribution to defining controls:
15
(a) Data flow diagram
(b) Entity-relationship model
(c) Data dictionary
4. What- hardware and software would be required by an organisation contemplating use of

multi-media in its work? What are the ways in which a business organisation could benefit
by installing a multi-media machine in its premises? How would you distinguish between a
development and a delivery machine for multi-media?
15
5. What are the different forms in which software piracy is carried out? As an advisor to an
organisation that is moving towards purchase of new software, what would you suggest as
methods to prevent their efforts in inhouse software development from being stolen?
15
6. What fact finding techniques would you use in each of the following circumstances ?
15
(a) Deciding on the design of a new application form for IGNOU Courses.
(b) Deciding on the design of a ballot paper that can be automatically scanned for
counting votes.
33
8181
34
8181
6. OBTAINING/ PURCHASING OF PRINTED
BOOKLETS
The methodology of CD-ROMS and downloading through the Internet provides a very
convenient and efficient way of student access to the course material. However, many persons
may still want to have printed booklets containing the course contents that are available on the
CD-ROMS or on the Website.
For this purpose, they have to make use of the facilities provided by IGNOU for sale of its study
material through the Marketing Cell of the Material Production and Distribution Division. The
abstract of the terms and conditions for sale of IGNOU study material, list of retail agents
through which the material can be bought and a price list for the courses for which booklets are
available is given below. It may be noted that certain courses have been designed ab-initio for
the Internet and for those printed booklets may not be available.
6.1 Terms and Conditions for Sale of IGNOU’s Study Material

• The University has made arrangements for Spot Sale of its study material at Head
Quarters from Monday to Friday from 10.00 A.M. to 3.30 P.M. at Marketing Cell,
Warehouse, Maidan Garhi, New Delhi-110068. Telephone Nos. 26523858, 26850043,
26865923-32 Extn.2006, 2023, 2026. The study material can be bought by way of
presenting a Demand Draft/ Postal Order drawn in favour of “IGNOU, NewDelhi”, for
the study material value.
• Purchase order for IGNOU study material can also be placed on IGNOU, on receipt of
which a Proforma Invoice indicating the course details, price, quantity, etc. is sent
against which the advance payment is to be made through Bank/Demand Draft drawn in
favour of 'IGNOU, NEW DELHI'.
• While placing an order, each course title, course code, the price and the required quantity
should invariably be mentioned by the intending buyer.
• Prices of study material in Rupees do not include cost of postage including Sea Mail and
Air Freight, packing & forwarding, etc. which are to be borne by the buyers.
Consignments can be booked on request for outstation on 'TO PAY' basis. Delay in
taking delivery of the consignments and resultant loss of any kind shall be borne by the
consignee and IGNOU shall not be liable for such loss.
• Packing charges will be at a flat rate of Rs.25/- per Corrugated Box (approximately 20
kgs) which may contain approximately 100 blocks of our study material.
• Goods once supplied in accordance with the order, under no circumstances will be taken
back/exchanged.
• Any dispute shall be subject to the jurisdiction of Delhi Courts only.
For details please write to:
Material Production and Distribution Division
(Marketing Cell)
Indira Gandhi National Open University
Maidan Garhi
New Delhi-110 068.
35
8181
Telephone Nos. : 26855083 (Direct)
: 26962450 (Direct),
26865923-32, Extn. No.2001
: Extn. Nos. 2023 and 2026 (Marketing Cell)
Fax No. : 91-011-26855083
Email : ignoumkt@ignou.ac.in
36
8181
6.2 Retail Agents for Study Material
M/s New Century Book House (Pvt.) Ltd. M/s Raj Pustak Bhandar
41-B, Sidoo Industrial Estate 45, Central Market
Ambattur Lajpat Nagar
Chennai-600098. New Delhi-110024
Ph.: 28549563, 28550664 Ph.: 26832627, 26849198
M/s Vishal Book Depot M/s Selection Book Service

1/48, Lajpat Nagar-I B-42, Christian Colony
New Delhi-110024 Main Road Patel Chest
Ph.: 26843324 Delhi University, Delhi-110007.
Ph.: 2238982
M/s Ritana Books

81, Defence Colony
Flyover Market
New Delhi-110024
Ph.: 24617278, 24643764, Fax: 011- 24636063
MARKETING AGENT FOR A/V CASSETTES’ SALE

The Director, EMPC
Sanchar Kendra
IGNOU
Maidan Garhi
NEW DELHI – 110068.
Tel : 26867079, 26868299
Fax No: 91-011-26868407
37
8181
7. FORMS AND ENCLOSURES
38
8181
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. ...............................................................................
39
8181
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:

Asst. Registrar (Exam II)
Maidan Garhi
NewDelhi-110068.
40
8181
Control No. : ...............

Maidan Garhi, New Delhi-110 068
Application Form for obtaining Duplicate Grade Card/Mark-sheet
Name of the
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
41
8181
................................................................
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:

Director (S R & E)
Block 12, Maidan Garhi
New Delhi-110 068
42
8181
43
8181
Dr./Mr./Smt./.... Name
CHANGE/CORRECTION OF ADDRESS
AND STUDY CENTRE
If you change your address please

complete the attached card, using
Block capitals and indicating:
Programme of Study
Enrolment Number
Medium of Study
Name
New or corrected address including Pin
New Study Centre Code
Choice of Medium of Study
Date of Change Programme of Study
The Card should then be signed, dated

and posted at the address printed
overleaf New Study Centre
Code
(See Code List 3)
44
8181
State Code
CHANGE / CORRECTION OF ADDRESS / STUDY CENTRE / MEDIUM
INDIRA GANDHI
OF STUDY NATIONAL OPEN UNIVERSITY
School of Computer
All correspondence to me be &
sent Information Sciences
at the following address and change of Study Centre be
recorded Date Change
Enrolment Effective From
Town Number
State Pin
Address
(See Code List 2 of Guide to Applicant)
Signature ________________ Date : ____________
Re-registration Form for MCA (1st , 2nd , 3rd , 4th , 5th & 6th)
Affix
Stamp
Here
1. Programme Code MCA
IV
III
VI
II
VI
2. Semester for which registration is required (Please tick)
To
The Director
SR&E Division
3. Name
Maidan Garhi
New Delhi-110068
4. Enrolment No.
5. Address
Pin Code
Telephone No.
E-mail
45
8181
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.
Signature of Student
Note:
1. Mail this form to the concerned regional center along with the Demand Draft in the name of IGNOU
payable at the city where the concerned Regional centre is located.
2. Superscribe the envelope with “RE-REGISTRATION FORM to MCA” along with above mentioned address
and send it to the concerned Regional centre.
46
8181
Please read the instructions overleaf before filling up this form:

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.
47
8181
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 : .....................................
48
8181
INSTRUCTIONS FOR DOING ASSIGNMENTS
1. Read instructions for submission of assignments given in your Starter Kit 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 TMA at your Study Centre and CMAs to
the Director (Evaluation). IGNOU, Maidan Garhi, New Delhi-68, 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:
Director
Material Production and Distribution Division (MPPD)
Maidan Garhi,
NFW DELHI- 110 068
49
8181
8. SUGGESTED COUNSELING SCHEDULE
MCA (lst year)
Course No. of Block/Topics to be No. of Topics to be covered
Code Theoretical covered and Number of Practical and number of Practical
counselling counselling sessions counselling counselling sessions
session sessions
CS-04 10 C-Language 3 22 C-Language 6
Data Structure 7 Data Structure 10
Project 6
CS-02 8 Assembler, Compiler 14 Unix Commands 8
& BNF Grammar 2 Shell Programming 6
Operating System 4
Unix 1
Software Engineering 1
CS-05 1 CS-05 Project Discussion — —
CS-01 10 Block 1 : 3 Sessions 10 Assembly
Block 2 : 2 Sessions Language Programming 6
Block 3 : 3 Sessions Project 4
Block 4 : 2 Sessions
CS-03 4 Block 1 : 2 Sessions 10 Cobol Programming 5
CS-06 6 Block 1 : 2 Sessions 4 MS-Access 4
MCA (IInd Year)

CS-08 10 Block 1 : 3 Sessions 17 Fortran Language 6
Block 2 : 3 Sessions Statistical &
Block 3 : 2 Sessions Numerical Techniques 6
CS-09 10 Block 1 : 2 Sessions 21 Novell Netware 6
Block 2 : 3 Sessions Network Project 15
CS-51 10 8 Assignment 4
Project 4
CS-07 10 Block 1 : 2 Sessions 8 Assignment 4
CS-10 10 Block 1 : 2 Sessions 6 CASE Tools 6
CS-54 10 Block 1 : 2 Sessions — —
50
8181
MCA (IIIrd Year)
Course Code No. of Block/Topics to be No. of Topics to be covered
Theoretical covered and Number of Practical and number of Practical
counselling counselling sessions counselling counselling sessions
session sessions
CS-12 10 Block 1 : 2 Sessions — —
Block 2. : 2 Sessions
CS-16 10 Block 1 : 2 Sessions 20 C++ Language 10
CS-13 10 An Overview: 1 Session 14 UNIX Operating 4
Process System Administration
Management &
Synchronization: 2 Sessions Project 10
Memory
Management &
File Management: 1 Session
Multiprocessor
System: 2 Sessions
Parallel
Programming: 1 Session
Distributed
Operating System: 2
Sessions
Security: 1 Session
CS-14 10 Block 1 : 2 Sessions 14 Lisp / Prolog
Block 2 : 2 Sessions Programming Language 6
CS-15 10 Block 1 : 2 Sessions 12 ORACLE / Ingres 12
(Note: The number of practical counselling sessions suggested in the schedule are the minimum
number of sessions on a topics. The total number of practical counselling sessions per year is 60).
The above schematic for counselling may be

rescheduled for operational reasons and in response
to local conditions
51
8181

Mcastarterkit 2004

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Mcastarterkit 2004

Transféré par

Droits d'auteur :

Formats disponibles

STARTER KIT

Master in Computer Applications

SCHOOL OF COMPUTER AND INFORMATION SCIENCES

Message from the MCA Programme Coordinator 5

1. Basic information for MCA students 7

8. Suggested Counselling Schedule 61

Welcome to the IGNOU’s MCA Programme. It is a 3 year Master’s degree

Prof. Manohar Lal

1.2 Preparatory Programme in Computing (PPC)

Fee : Rs. 600/- (including registration fee)

Block 1 : Some Basic Concepts Unit 1: Relevance of Mathematics

Unit 2: Algebraic Expressions

Unit 3: Sets, Functions and Graphs

Block 2: Elementary Algebra Unit 4: Number Systems

Unit 5: Exponents and Logarithms

Unit 6: Sequences of Series

Unit 7: Permutations and Combinations

Block 3: Geometry and Trigonometry Unit 8: Plane Geometry

Unit 10: Trigonometry

Unit 11: Coordinate Geometry

Unit 13: Matrices and Determinants

Unit 14: Quadratic Equations

Block 5: Calculus and Statistics Unit 15: Calculus

Unit 16: Probability

Unit 17: Statistics

Semester Amount (in Rs.) When to Pay

I Semester 5500/- Along with filled in Registration form

Visit IGNOU’s website http: //www.ignou.ac.in

2. BRIEF GUIDELINES TO BROWSE IGNOU’S WEB

2.1 Navigation from Home Page

SOCIS School of Computer and Information Sciences is which offers Computer

Brief Description of Menu at the bottom of the page on IGNOU’s website

2.2 Navigation from SOCIS Page

MCA Master in Computer Applications

2.3 Procedure to browse through MCA pages

2.4 How to download the Starter Kit & Semester’s

3.2 Programme Structure

Course offering for the MCA Programme

CS-03: File Structure and Programming in COBOL

CS-04: Data Structures through ‘C’ and ‘PASCAL’

Reference: Fundamentals of Data Structures, Horowitz and Sahni.

CS-06: Data Base Management Systems

Another important feature of this course is discussion on file organisations of conventional

CS-07: Discrete Mathematics

CS-08: Numerical & Statistical Computing

• Features of FORTRAN 77 and FORTRAN 90 programming languages

CS-09: Data Communications and Networks

The course structure is as follows:

Block 1: Introduction to Data ➢ Satellite Microwave

CS-10: Software Engineering

Philosophy and Overview ➢ Data-oriented analysis

References : [1] Software Engineering, A Practitioner’s Approach, Pressman, McGraw

CS-51: Operations Research

CS-54: Accounting & Finance on Computers

CS 12: Computer Architecture

It provides aspects relating to shared-memory multiprocessors, vector and SIMD

Theory of Parallelism ➢ Hardware and Software

References : [1] Advanced Computer Architecture, Kai Hwang, McGraw Hill,

[2] Computer Architecture, Michael, J. Flynn, Narosa.

[3] Computer Organisation, HAMACHER, V. Carl et al McGraw Hill,

[4] Computer Organisation and Architecture, Designing for

CS-13: Operating Systems