Tilka Manjhi Bhagalpur University 2007 M.C.A Operatin System
Thursday, 31 January 2013 06:15Web
COPYRIGHT RESERVED MCA – CS (22)
2007
Time : three hours
Full Marks : 80
Candidate are needed to provide their answers in
Their own words as far as possible.
The ques. are of equal value .
ans any 5 ques. in which
1. (a) What is meant by primitive scheduling ? How does it affect the system performance vis-à-vis non primitive scheduling ?
(b) define the various kinds of scheduling policies with their merits and demerits ?
2. What is fragmentation ? What are its kinds ? How does it occur ? How can it be
tackled ?
three (a) explain in detail FIFO Algorithm for page replacement and Belady’s algorithm ?
(b) What is contiguous and non – contagious memory management scheme ?
various paging and segmentation ?
four What is deadlock ? define the Deadlock handling strategies ?
5 (a) define Banker’s algorithms to avoid a deadlock . elaborate the issues in
its implementation ?
(b) discuss Long – term scheduler , Medium and short – term scheduler with
a diagram ?
Group - B
six what do you mean by loop optimization ? Write various kinds of optimization
technique
seven Create DFA & NFA for the expression
a. 01 / 10
b. O ( o / 1)* 0
c. A (a /b *) ab
8 What is the use of parsing ? Create a parse tree for the subsequent
a. x>y or z>k and Not r
c. E -> E + E| E * E | - E | (E) |id
d. Parse tree of if else statement
e. Parse tree of whole statement show how ambiguity current in parse tree
nine What are the various phases of compiler design ? Write challenging area in
Compiler design ?
10 Define the subsequent terms :
a. Data Environment
b. Storage management
c. Data structure
d. Statement
in respect of Compiler Design
| Earning: Approval pending. |
