Académique Documents
Professionnel Documents
Culture Documents
FOR
MCA STUDENTS
www.ignou.ac.in
1 )
Page No.
CONTENTS
3
8181
MESSAGE FROM THE MCA PROGRAMME CO-ORDINATOR
Dear student,
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.
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
Block Unit
Unit 9: Mensuration
Block 4: Equations and Matrices Unit 12: Linear Equations and Inequations
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:
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
will be sent to you by the university
VI Semester 5400/- Along with the Re-registration form for 6th semester, which
will be sent to you by the university
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.
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.
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.
5
8181
Figure 2
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.
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:
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
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.
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.
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.
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.
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.
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.
• Mathematical Logic
• Set Theory and Functions including Fuzzy Sets
• Lattices and Boolean Algebra
• Application of Graph Theory to Computer Science
3
8181
Statistical concepts and developing programmes to obtain required parameters for statistical
analysis.
4
8181
References : [1] Computer Networks, Andrew S. Tanenbaum, PHI.
[2] Data and Computer Communication, William Stalling, PHI.
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 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:
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
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.
Emerging Topics
References: [1] Operating Systems, Milan Milankovic, 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:
Reference: Introduction to AI & Expert System, D.W. Patterson; Prentice Hall of India.
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.
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.
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.
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.
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
17
8181
4. EVALUATION
NOTE : A student has to secure minimum qualifying marks in every component of the
assignment.
(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.
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
:
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
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:
19
8181
(Master in Computer Applications, Ist 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
Course Assignment No. Assignment Type Last date of Submission Page No.
Code
20
8181
CS-04 MCA(1)-04/Project/04 Project 30th April, 2004 38
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 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.
(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.
Note: This is a Project. Answer all the questions. Each question carries equal
weightage.
You may use illustrations and diagrams to enhance explanations.
23
8181
24
8181
Course Code : CS-4
Course Title : Data Structures through C and Pascal
Assignment Number : MCA(1)-04/TMA/04
Maximum Marks : 10
Last date of Submission : 15th April, 2004
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
Assignment Number : MCA(1)-04/Project/04
Maximum Marks : 15
Last date of Submission : 30th April, 2004
This is a Project Assignment. Answer the following question. You may use
illustrations and diagrams to enhance explanations.
26
8181
Course Code : CS-05
Course Title : Elements of System Analysis and Design
Assignment Number : MCA(1)-05/TMA/04
Maximum Marks : 10
Last date of Submission : 15th April, 2004
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?
27
8181
Course Code : CS-05
Course Title : Elements of System Analysis and Design
Assignment Number : MCA(1)-05/Project/04
Maximum Marks : 15
Last date of Submission : 30th April, 2004
This is a Project Assignment. Answer the following question. You may use
illustrations and diagrams to enhance explanations.
28
8181
5. OLD QUESTION PAPERS
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
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
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
Term-End Examination Paper
CS-04 : Data Structures Through 'C' & Pascal
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
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
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
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?
32
8181
Term-End Examination Paper
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.
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
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.
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
37
8181
7. FORMS AND ENCLOSURES
38
8181
Indira Gandhi National Open University
Name
Enrolment No
Address
Pin Code :
Programme................
...................................
.....Month and Year of
the Exam ..................
..................................
..................................
..................................
........Name of Exam.
Centre .....................
...................................
.....................................
.....................................
................Centre Code
.....................................
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.
40
8181
Control No. : ...............
Name of the
Enrolment No.
Address
Pin Code :
Programme
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.
42
8181
43
8181
Dr./Mr./Smt./.... Name
CHANGE/CORRECTION OF ADDRESS
AND STUDY CENTRE
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
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
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
Indira Gandhi National Open University
Maidan Garhi
New Delhi-110068
4. Enrolment No.
5. Address
Pin Code
Telephone No.
E-mail
45
8181
6. Details of fee paid:
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:
Programme of Study
REASONS FOR REQUEST FOR FRESH SET OF ASSIGNMENTS: (Tick (✔) whichever
is applicable)
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.
Director
Material Production and Distribution Division (MPPD)
Indira Gandhi National Open University
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
Block 2 : 2 Sessions Project 5
CS-06 6 Block 1 : 2 Sessions 4 MS-Access 4
Block 2 : 2 Sessions
Block 3 : 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
Block 3 : 2 Sessions
Block 4 : 4 Sessions
CS-16 10 Block 1 : 2 Sessions 20 C++ Language 10
Block 2 : 3 Sessions Project 10
Block 3 : 3 Sessions
Block 4 : 2 Sessions
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
Block 3 : 3 Sessions Project 8
Block 4 : 3 Sessions
CS-15 10 Block 1 : 2 Sessions 12 ORACLE / Ingres 12
Block 2 : 1 Sessions
Block 3 : 3 Sessions
Block 4 : 4 Sessions
(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).
51
8181