Mangalore University 2007 B.C.A Computer Application OPERATING SYSTEM - Question Paper

Credit Based 3rd Semester B.C.A Degree exam
October/November
(New Syllabus)
MODEL ques. PAPER
SUB: OPERATING SYSTEM BCA 302
Time: three Hours Max. Marks: 80

PART-A

Note: ans any Ten ques. (2x10=20)

1. a. What is Operating System? provide for multitasking Operating System?
b. describe Thread. provide examples of a lang. That supports Multithreading
c. What is dispatcher?
d. What is PCB? List any 4 contents of PCB.
e. Distinguish ranging from Process and Program.
f. Draw a resource allocation graph with a cycle and no deadlock.
g. What is logical and physical address space?
h. Difference ranging from paging and segmentation.
i. What is thrashing?
j. What is a semaphore? How is it various from binary semaphore?
k. What is race condition?
l. List the different operations that can be performed on a directory?
PART –B
Unit – 1

2.
a. provide a short note on (6)
i) Batch processing system
ii) Multiprogrammed system
iii) Real time system

b. discuss direct Access Method of files (4)
c. discuss Tree structured directory (5)
Or

a. discuss the services of Operating System. (6)
b. discuss Indexed file allocation method. (5)
c. discuss any 2 free space management techniques. (4)

Unit – 2
3.
a. discuss three various kinds of schedulers in Operating System. (6)
b. elaborate the critiria's for CPU scheduling? (5)
c. How preemptive scheduling algorithm differs from Non Preemptive? (4)

Or

a. With a neat diagram discuss process state. (5)
b. discuss Co-operative Process. (4)
c.
Time Process CPU Time (6)

0 P0 4
1 P1 2
2 P2 1
3 P3 3

Schedule the process under SJF Algorithm both in preemptive mode and non preemptive mode and also compare the avg. waiting time.

Unit – 3
4.
a. List out the necessary and sufficient conditions for a Dead Lock. (6)
b. What is a Critical part Problem? elaborate the requirements for a solutions to
Critical part problem? (6)
c. Write a note on Resource Allocation Graph. (3)

Or

a. Consider the subsequent snapshot of a system (6)

Allocation Max Available
ABCD ABCD ABCD

P0 0012 0012 1520

P1 1000 1750

P2 1354 2356

P3 0632 0652

P4 0014 0656

If a request from P1 arrives for (0420), can the request be granted immediately?



b. What is a semaphore? discuss primitive operations on semaphores? (5)
c. discuss wait for graph with an example. (4)

Unit – 4

5.
a. What is 'Fragmentation Problem'? discuss (6)
b. discuss the paging concept with a neat diagram. (6)
c. Write a note on frame allocation. (3)
Or


a. What is a Virtual Memory Concept? (4)
b. Write a note on dynamic allocation issue. (5)
c. For the subsequent page reference, How the page replacement algo under (6)
FIFO, Optimal and LRU Algorithms and compare them with three frames.
1,2,3,4,1,2,5,1,2,3,4,5

Earning:   Approval pending.