Test Papers / Previous Question Papers of Indira Gandhi National Open University CS02 Introduction to Software December 2006

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

CS02 : Introduction to Software

Time: 2 hours
Maximum Marks: 60

December 2006

PART A

1. (a) Design an algorithm and draw a corresponding flow chart to compute xⁿ / n! where 0 < n < = 10 (7)

(b) Write a shell program to generate the first "n" terms of the following sequence without using multiplication, 2, 4,8, 76, 32.. (7)

(c) Explain the different, categories of people involved in system investigation and their activities. (8)

(d) Define mutual exclusion. How does a semaphore solve the mutual exclusion problem ? Explain with the help of an example. What are drawbacks of semaphore ? (8)

2. (a) Write context free grammar (CFG) for if-then-else and assignmenst tatements of 'C' language. (5)

(b) Explain the following loader schemes : (5)
(i) Relocating loader
(ii) Dynamic linker

3. (a) Write UNIX commands for the following: (5)
(i) to print last 3 lines of a file.
(ii) to search a particular pattern in a given file.
(iii) to count the number of words in a given file.
(iv) to list all the files with extension .txt.
(v) to move the contents of one file to another file with a different name

(b) What is a Virtual Memory ? Explain its advantages and how it can be implemented. (5)

4. (a) Explain the file system used in UNIX. Also explain how do we mount the file system in UNIX o/S . (5)

(b) What is a feasibility study ? Explain any three types of feasibility studies in brief. (5)

5. (a) What is X-Windows system ? Explain the X-Windows library and X-Toolkit in detail. (5)

(b) How do we implement the macro facility within an assembler ? What are the issues related to the design of a macro pre-processor? Explain with an example. (5)