Tilka Manjhi Bhagalpur University 2007 M.C.A cs22 operating system - Question Paper
Thursday, 31 January 2013 08:45Web
COPYRIGHT RESERVED MCA -CS (22)
2007
Time: three hours
Full Marks: 80
Candidates are needed to provide their ans in their own words as far as practicable.
The ques. are of equal value ans any 5 ques.
Group "A"
1.(a) What is meant by preemptive scheduling? How does it affect the system performance vis.-a-vis nonpreemptive scheduling?
(b) define the various kinds of scheduling policies with their merits and demerits.
2. What is fragmentation? elaborate its types? How does it occur? How can it be tackled?
3.(a)Discuss in detail FIFO Algorithm for page replacement and Belady's algorithm.
(b) What is contiguous and non-contiguous memory management scheme? Differentiate paging and segmentation.
4.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)Explain Long-term scheduler, Medium and short-term scheduler with a diagram.
Group "B"
6.What do you mean by loop optimization? Write various kinds of optimization technique.
7. Create DFA & NFA for the expression
(a) 01/10
(b) O(0/1)*0
(c) A(a/b*)ab
8. What in the use of parsing? Create a parse tree for the subsequent
(d) x>y or z>k and Not r
E ->E+E|E*E|-E/(E)|id
(f) Parse tree of if else statement
(g) Parse tree of whole statement
show how ambiguity current in parse tree
9.What are the various phases of compiler design?Write challanges area in compiler design.
10.Define the subsequent terms.
(h)Data environment
(i)Storage management
(j)Data structure
(k)Statement
in respect of compiler design
| Earning: Approval pending. |
