CS-63 : Introduction To System Software-December,2005

  JHARKHAND BOARD You are here
December, 2005

CS-63 : INTRODUCTION TO SYSTEM SOFTWARE

Time: 2 hours

Maximum Marks: 60

------------------------------------------------------------------------------------------------

Note : Question number 1 is compulsory. Answer any three questions from the rest.

------------------------------------------------------------------------------------------------

Q.1. (a) Write an algorithm that will abbreviate the given name of any person.

(b) Explain the concept of Macro-Processor. With the help of an example explain how a Macro is defined.

(c) Define concurrent processes. How is mutual exclusion handled by operating system ? Also, write the mutual exclusion algorithm.

(d) Write the UNIX commands for the following :

(i) To display the type and nature of information that is held in a directory.

(ii) To remove a directory.

(iii) To print last 5 lines of a text file.

(iv) To sort the files tn alphabetical order of a directory.

(v) To kill a process using PID.

(vi) To print the status of all the processes.

Q.2. (a) Explain the functional the software tool the YACC, which is used for compiler development.

(b) Write a shell program to find the sum of squares of N natural numbers.

Q.3. (a) Construct context free grammar for (i) assignment statement of 'C' language, (ii) if-then-else statement of 'C' language.

(b) With the help of a diagram, explain the address translation scheme in a segmented system.

Q.4. (a) With the help of diagram, explain the process of parsing. What is the output generated after parsing process ?

(b) Explain salient features of UMX system architecture. Also write the functions performed in each layer.

Q.5. (a) What is a deadlock ? What are the essential conditions that characterise a deadlock ? How can the occurrence of a deadlock be avoided with various strategies ?

(b) Write a shell program to swap the values of two variables.

December, 2005

CS-63 (S) : INTRODUCTION TO SYSTEM SOFTWARE

Time: 2 hours

Maximum Marks: 60

Note : Question number 1 is compulsory. Answer any three questions from the rest.

1. (a) What is a loader ? Mention the functions performed by a loader. Explain the Dynamic loading scheme. (7)

(b) Write an algorithm and draw a corresponding flow chart to sort the given list of numbers in ascending order. (7)

(c) What is virtual memory ? What are its advantages ? How can a virtual memory be implemented using the demand paging scheme ? Explain with the help of a diagram. (10)

(d) Write UNIX commands for the following :(6)

(i) to direct the output to the file as well as to the screen

(ii) to send a message to the logged in user

(iii) to set command execution priority

(iv) to display information about the commands

(v) to print the calendar for any year and month

(vi) to run a process in background

2. (a) With the help of a diagram, explain the structure of an editor. (5)

(b) Generate the parse tree for expression F = 10 * 12 - 7 + 2, the grammar rules are given below:

List ? list + digits

List ? list - digits

List ? list * digits

List ? digits

digits ? 0/1/2/3/4/5/6/7/8/9 (5)

3. (a) With the help of an example for each, explain the linked list and bit map methods of disk space management. (6)

(b) How is CPU scheduling performed in UNIX operating system ? Explain. (4)

4. (a) How is a client server model different from the other two operating system structures ? List at least four advantages of client server model. (5)

(b) What is shell programming ? Write a shell program to print all the contents of an existing text file in upper case. (5)

5. (a) With the help of any GUI based operating system, explain the major components of its environment. (5)

(b) What is the fleed of file protection ? Explain the access list and access group methods of file protection. (5)