TEE – Dec. 2002

Question Paper of CS-02 Introduction to Software of Dec 2002 from IGNOU

Note: Question one is compulsory. Answer any three from the rest.

1. (a) Design an algorithm to multiply two matrices and verify the correctness by tracing.
(b) Write a shell program to search for a number in the given list of numbers.
(c) Explain how the GUI is supported in X-WINDOWS. How does it vary from other GUIs?
2. (a) Explain the design and implementation of the Two-Pass Assembler.
(b) Explain the utility of LEX and YACC.

3. (a) Explain different types of process schedulers with respect to scheduling and relevant performance criteria.
(b) Explain the need for interposes synchronization. Discuss how semaphores allow interprocess communication and synchronization.

4. (a) Discuss why Round Robin scheduling algorithm is often regarded as a fair scheduling discipline. Illustrate the logic behind it.
(b) Write short notes and list significance of the following:
(i) Symbol Table
(ii) Macro Processor

5. (a) Explain the generic phases of Software Engineering.
(b) Illustrate, with the help of a diagram, the address translation scheme in segmented system.

6. (a) Explain the implementation of swapping and demand paging in UNIX operating system.
(b) Write the UNIX commands for the following:

(i) To display hard disk space used.
(ii) To display the contents of file1, file2 and file3 at a time.
(iii) Using /s -/ command display the date and time of creation of file1.
(iv) Transfer a file1 to file3 and append the file3 to file2.
(v) Kill a process with PID 1024.

Comments are closed.