III Semester B.C.A.Degree Examination,Nov/Dec 2010
Y2K8 Scheme
COMPUTER SCIENCE
BCA 304 : OPERATING SYSTEM
TIME:3HOURS Max.marsk:90
SECTION-A
Answer any ten questions. 10X2=20
1.Write any two difference between multi programming and time sharing.
2.what is Internal fragmentaions.
3.what is the type of fragmentation associated with chained list allocation and indexed allocation
policies if any?
4.Write the differences between the idle and blocked state of process.
5.put the following in the chronological order in the context of the brith of process
executes :Ready, suspended, execute, tereminate, create.
6.What is thread?
7.What is pre-emptive Scheduling?
8.What is the need of virtual memory?
9.What is dead lock? Give one example.
10.Differentiate between policy and mechanism.
11.list the different file types.
12.What are overlays ?
SECTION-B
Answer any five quesiton 5X5=25
13.Briefly explain FCFS Scheduling.
14.Explain the role of Semaphore and its types.
15.What are possible Common Errors in critical - Section? Explain.
16.Explain sharing a segmented system.
17.What is resource allocation graph?Explain with an examples?
18.What is demand paging ? How do you measure the performance of demand paging?
19.Explain dead lock detection algorithm for multiple instance resource type.
20.Briefly explain SJF scheduling algorithm.
SECTION-C
Answer any three questions 15X3=45
21.a) Define page fault. Explain the procedure for handling page fault with the help of a diagram. 10
b)What are the different free space management techniques? 5marks
22.a)what is an operating sytem ? Explain the funcitons and services provided by the
operating system. 10marks
b)Explain any two file allocation methods. 5marks
23.a)Explain Banker''s algorithm 9marks
b)What are the advantages and dis-advantages of disk segmentation? 6marks
24.a)Explain RR Scheduling with an example. 9marks
b)Explain any six basic file operations. 6marks
25.a)When do you run deadlock detection algorithm ?Explainwith an example. 9marks
b)Explain the terms. First - fit,Best-fit and worst-fit. 6marks
Y2K8 Scheme
COMPUTER SCIENCE
BCA 304 : OPERATING SYSTEM
TIME:3HOURS Max.marsk:90
SECTION-A
Answer any ten questions. 10X2=20
1.Write any two difference between multi programming and time sharing.
2.what is Internal fragmentaions.
3.what is the type of fragmentation associated with chained list allocation and indexed allocation
policies if any?
4.Write the differences between the idle and blocked state of process.
5.put the following in the chronological order in the context of the brith of process
executes :Ready, suspended, execute, tereminate, create.
6.What is thread?
7.What is pre-emptive Scheduling?
8.What is the need of virtual memory?
9.What is dead lock? Give one example.
10.Differentiate between policy and mechanism.
11.list the different file types.
12.What are overlays ?
SECTION-B
Answer any five quesiton 5X5=25
13.Briefly explain FCFS Scheduling.
14.Explain the role of Semaphore and its types.
15.What are possible Common Errors in critical - Section? Explain.
16.Explain sharing a segmented system.
17.What is resource allocation graph?Explain with an examples?
18.What is demand paging ? How do you measure the performance of demand paging?
19.Explain dead lock detection algorithm for multiple instance resource type.
20.Briefly explain SJF scheduling algorithm.
SECTION-C
Answer any three questions 15X3=45
21.a) Define page fault. Explain the procedure for handling page fault with the help of a diagram. 10
b)What are the different free space management techniques? 5marks
22.a)what is an operating sytem ? Explain the funcitons and services provided by the
operating system. 10marks
b)Explain any two file allocation methods. 5marks
23.a)Explain Banker''s algorithm 9marks
b)What are the advantages and dis-advantages of disk segmentation? 6marks
24.a)Explain RR Scheduling with an example. 9marks
b)Explain any six basic file operations. 6marks
25.a)When do you run deadlock detection algorithm ?Explainwith an example. 9marks
b)Explain the terms. First - fit,Best-fit and worst-fit. 6marks
No comments:
Post a Comment