Test Papers / Previous Question Papers of IGNOU CS02 Introduction to Software December 2005

PGDCA / MCA (I Yr) / BCA
Term-End Examination

December, 2005

CS02 : Introduction to Software

Time: 2 hours
Maximum Marks: 60

1. (a) Design an algorithm and draw a flowchart to find the sum of the following series : (7)
1! + 2! + 3! + . . . + n!, where n > 0.

(b) Construct a grammar for an a arithmetic expression and generate a parse tree for the expression (a * b + c / d) based on that grammar. (7)

(c) Consider the following set of processes with CPU times : (7)

Process           CPU Time
     P1               20
     P2               15
     P3               09
     P4               12

Draw Gantt charts for SJF and Round Robin scheduling algorithms (time quantum = 2 units). Also calculate the average waiting time for both the algorithms. (8)

(d) What is the basic purpose of project control ? List all the project control systems, and explain any two with the help of an example of each. (8)

2. (a) Write UNIX commands for the following :
(i) Change all characters of a file to uppercase.
(ii) Compare the two files.
(iii) To sort a file, XYZ, in alphabetical order.
(iv) To stop background processes.
(v) Print a file in 4 column format with the width being 132 characters.

(b) What is a deadlock ? Describe the conditions that characterise a deadlock. (5)

3. (a) Write a UNX shell program that prints out a list of every unique word contained in a file, in alphabetical order. (4)

(b) Differentiate between paging and segmentation. Explain with the help of a diagram, the address translation scheme for segmentation. (6)

4. (a) Write down the important tasks performed by a two pass assembler. (4)

(b) What are the major components of NeXTSTEP ? How do these elements function ? How are applications written in a NeXTSTEP environment ? (6)

5. (a) What are CASE Tools ? List any six benefits of it. (4)

(b) Explain the UNIX File System with the help of necessary diagrams. (6)