CS-02 : INTRODUCTION TO SOFTWARE
Dec. 2003

1(a) Design an algorithm to compute 1/n! for a given n.

(b) Write a shell program to generate the first n terms of the following sequence without using multiplication:
1 2 4 8 16 32 ....

(c) Consider the following set of processes which arrive in the ready queue at the same time:

Consider the following scheduling algorithms: FCFS, SJF and Round Robin (quantum = 1).
(i) What is the turnaround time of each process for each of the above scheduling algorithm?
(ii) What is the waiting time of each process for each of the above algorithms?

(d) What is 4GL? How do 4GLs help to solve problems? Mention the merits and demerits of the usage of 4GLs in applications development.

Q 2. What is a flow chart? Describe the flow chart symbols. Write an algorithm and draw a flow chart to find the largest number among the 3 numbers given as input.

Q. 3(a) Discuss the implementation of a two-pass assembler.

(b) Explain the following loader schemes:
(i) Direct linking loader (ii) Dynamic loading

Q. 4(a) Discuss the two different schemes of non-contiguous disk allocation methods. Also mention their advantages and disadvantages.

(b) Explain with the help of a neat sketch, the address mapping in a Segmented system.
(i) Paging system (ii) Segmented system

5(a) Explain the need of Interprocess communication and synchronization with the help of an example.

(b) Discuss the hardware support for Mutual Exclusion.

6(a) Explain the concept of changing permission modes of files and directories in UNIX with examples.

(b) List the UNIX commands for the following:
(i) To display the contents of 2 files file 1 and file 2.
(ii) To copy file 1 with another name file 2 in the same directory.
(iii) To sort the numbers in ascending order in a data file.
(iv) To display the calendar for year 2002.
(v) To kill a process with process identification number 4066.

Previous Paper

UNIVERSAL TEACHER PUBLICATIONS
Web: www.universalteacherpublications.com, www.universalteacher.com