NOTE: There are 9 Questions in all.
· Question 1 is compulsory and carries 20 marks. Answer to Q. 1. must be written in the space provided for it in the answer book supplied and nowhere else.
· Out of the remaining EIGHT Questions answer any FIVE Questions. Each question carries 16 marks.
· Any required data not explicitly given, may be suitably assumed and stated.
Q.1 Choose the correct or best alternative in the following: (2x10)
a. Translator for low level programming language were termed as
(A) Assembler (B) Compiler
(C) Linker (D) Loader
b. Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as
(A) Semantic analysis (B) Syntax analysis
(C) Regular analysis (D) General analysis
c. Load address for the first word of the program is called
(A) Linker address origin (B) load address origin
(C) phase library (D) absolute library
d. Symbolic names can be associated with
(A) information (B) data or instruction
(C) operand (D) mnemonic operation
e. The translator which perform macro expansion is called a
(A) Macro processor (B) Macro pre-processor
(C) micro preprocessor (D) assembler
f. Shell is the exclusive feature of
(A) UNIX (B) DOS
(C) System software (D) Application software
g. A program in execution is called
(A) Process (B) Instruction
(C) Procedure (D) Function
h. Interval between the time of submission and completion of the job is called
(A) Waiting time (B) Turnaround time
(C) Throughput (D) Response time
i. A scheduler which selects processes from secondary storage device is called
(A) Short term scheduler. (B) Long term scheduler.
(C) Medium term scheduler. (D) process scheduler.
j. the scheduling in which CPU is allocated to the process with least CPU-burst time is called
(A) Priority Scheduling (B) Shortest job first Scheduling
(C) Round Robin Scheduling (D) Multilevel Queue Scheduling
Answer any FIVE Questions out of EIGHT Questions.
Each question carries 16 marks.
Q.2 a. Can the operand expression in an ORG statement contain forward references? If so, outline how the statement can be processed in a two-pass assembly scheme. (9)
b. Discuss in detail Table management Techniques? (7)
Q.3 a. Define the following:
(i) Formal language Grammars.
(ii) Terminal symbols.
(iii) Alphabet and String. (9)
b. What is parsing? Write down the drawback of top down parsing of backtracking. (7)
Q.4 a. Give the Schematic of Interpretation of HLL program and execution of a machine language program by the CPU. (8)
b. What are the relocation requirements in segmented addressing? (8)
Q.5 a. Give the difference between multiprogramming and multiprocessing. (5)
b. Write down different system calls for performing different kinds of tasks. (4)
c. Explain analysis and synthesis phase of a compiler. (7)
Q.6 a. What are the different states in which a process can be in at a particular time? What factors can lead to the transition process states? (6)
b. Differentiate between preemptive and non-preemptive scheduling. (4)
c. CPU burst time indicates the time, the process needs the CPU. The following are the set of processes with their respective CPU burst time (in milliseconds).
Processes CPU-burst time
P2 5
P3 5
Calculate the average waiting time if the process arrived in the following order:
(i) P1, P2 & P3 (ii) P2, P3 & P1 (6)
Q.7 a. Explain the Peterson’s Algorithm to the solve the critical section problem. Justify that it meets all the requirements of the critical section problems solution. (6)
b. What is a semaphore? Explain busy waiting semaphores. (6)
c. What are the four necessary conditions of deadlock prevention. (4)
Q.8 a. Explain the concept of variable-partition contiguous storage allocation. (6)
b. Define the following:
(i) FIFO Page replacement algorithm.
(ii) LRU Page replacement algorithm. (6)
c. Define the free space management and its advantages. (4)
Q.9 a. What are methods for enforcement of protection mechanisms? (6)
b. Give an overview of windows NT Architecture. (4)
c. How is information management component of OS structured? (6)