Code: DC-14 Subject: SYSTEM SOFTWARE & OPERATING SYSTEM
Time: 3 Hours Max. Marks: 100
NOTE: There are 11 Questions in all.
Question 1 is compulsory and carries 16 marks.
Answer to Q. 1. must be written in the space provided for it in the answer book
supplied and nowhere else.
Answer any THREE Questions each from Part I and Part
II. Each of these questions carries 14 marks.
Any required data not explicitly given, may be
suitably assumed and stated.
Q.1 Choose the correct or best alternative in the following: (2
8)
a. Loader is also known as
(A) Linkage editor. (B) Software processor.
(C) Translator. (D) Linker.
b. An action to be performed during execution of the assembled program is called
(A) Imperative statement. (B) Declarative statement.
(C) Assembler directive statement. (D) Compiler statement.
c. MNT stands for
(A) Micro Name Table. (B) Macro Name Table.
(C) Mini Name Table. (D) Macro Number Table.
d. A program which can itself perform the relocation of its address sensitive portions is known as
(A) relocatable program. (B) self relocating program.
(C) non-relocatable program. (D) compiler program.
e. The term used to describe concurrent execution of several programs in computer memory is known as :
(A) Multiprogramming. (B) Multiprocessing.
(C) Real time processing. (D) On line processing.
f. Number of jobs done in specified time period is called
(A) throughput. (B) turnaround time.
(C) dispatch. (D) schedular.
g. Movement of processes to eliminate small partitions is known as
(A) binding. (B) compaction.
(C) swapping. (D) fragmentation.
h. Breaking of program into its logical segments is known as
(A) fragmentation. (B) segmentation.
(C) physical address. (D) logical address.
PART I
Answer any THREE Questions. Each question carries 14 marks.
Q.2 a. Discuss Language Processor Development tools used for system software. (7)
b. Differentiate between the following:
(i)
Search Data Structures.
(ii)
Allocation Data Structures. (7)
Q.3 a. Explain the
following terms:
(i)
Assembler.
(ii)
Compiler.
(iii)
Interpreter. (6)
b. Describe
design of a two-pass assembler. (8)
Q.4 a. Discuss Macro definition and its usage. (6)
b. Give
classification of grammars and ambiguity in grammatic specification. (8)
Q.5 a. Define the following terms:
(i) Loading.
(ii) Linking.
(iii) Relocation. (6)
b. Give the difference between Top down parsing & Bottom up parsing? (8)
Q.6 Write short notes on following:
(i) Line and Stream Editors.
(ii) Debug Monitor.
(iii) Dynamic Linking.
(iv) System Software. (3.5 x 4 = 14)
PART II
Answer any THREE Questions. Each question carries 14 marks.
Q.7 a. Differentiate between Time Sharing Systems
& Real Time Systems. (6)
b. What are the differences in the degree to
which the following scheduling algorithms discriminate in favour of short
processes:
(i) FCFS.
(ii) RR.
(iii) Multilevel feedback queues. (8)
Q.8 a. Describe the FIFO algorithm for selecting
jobs. (6)
b. Consider the following snapshot of a system
|
|
Allocation |
Max |
Available |
|
|
ABCD |
ABCD |
ABCD |
|
P0 |
0012 |
0012 |
1520 |
|
P1 |
1000 |
1750 |
|
|
P2 |
1354 |
2356 |
|
|
P3 |
0632 |
0652 |
|
|
P4 |
0014 |
0656 |
|
Answer the following questions using the bankers algorithm:
(i) What is the content of the matrix Need?
(ii) Is the system in a safe state?
(iii) If a request from process P1 arrives for (0, 4, 2, 0), can the request be granted immediately? (8)
Q.9 a. Define semaphores and types of semaphores in detail? (7)
b. What is busy waiting? What
other kinds of waiting are there? Can
busy waiting be avoided altogether? (7)
Q.10 a. Differentiate between the following :
(i) Logical address & Physical address.
(ii) Internal & external fragmentation. (6)
b. What
are deadlocks and how can they be avoided? (8)