CS-63 INTRODUCTION TO SYSTEM SOFTWARE QUESTION PAPERS

IGNOU BCA CS-63 INTRODUCTION TO SYSTEM SOFTWARE - DECEMBER 2002 QUESTION PAPER

---

BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
December, 2002
CS-63: INTRODUCTION TO SYSTEM SOFTWARE

Time : 2 Hours

Max. Marks : 60

---

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

---

1. (a) Design an algorithm to reverse and sum the digits of a 5-digit number. Trace the algorithm on a sample data set. [8]
(b) Write a shell program to test whether a given year is a leap year or not. [8]
(c) Draw a parse tree for the following arithmetic expression : a + b * c - d/e - f + g. [7]
(d) Compare and contrast the different types of process schedulers. [7]

2. Describe and list functions of the following : [10]
(i) Two Pass Assembler
(ii) Macro Processor
(iii) Functions of a loader
(iv) Boot strapping compiler

3. (a) Differentiate between pre-emptive scheduling and non pre-emptive scheduling. [5]
(b) Explain the need for interprocess synchronization. Discuss how message passing allows interprocess communication and synchronization. [5]
4. (a) Illustrate and discuss with a diagram, the address mappings in a paging system and segmented system. [5]
(b) Explain the following : [5]
(i) Virtual memory
(ii) Access list file protection mechanism.

5. (a) Compare and contrast Line editors with Screen oriented editors. [5]
(b) Explain the philosophy of X-Windows. How is it different from other GUIs? [5]

6. (a) Discuss the following features as implemented in UNIX O/S : [5]
(i) CPU scheduling
(ii) Memory management

(b) Write the UNIX commands for the following : [5]
(i) To print the last 20 lines of a file.
(ii) To count no. of words in a file.
(iii) To stop a particular process with PID ® 1142.
(iv) To know the line number in the file on which the given pattern matches.
(v) To display the line number of the first position where the two files differ when compared.