Scribd
Upload
7 views

3 Rd Sem Bca Operating System Cbcs Scheme March April 2023

Uploaded by

lalithachowdari2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

3 Rd Sem Bca Operating System Cbcs Scheme March April 2023

Uploaded by

lalithachowdari2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Nagarjuna Degree College

38/36, Ramagondanahalli,
Yelahanka Hobli. 15323
Bengaturu -560 064.
Reg. No.

III Senester B.C.A. Degree Examination, March/April - 2023


COMPUTER APPLICATIONS
Operating System
(CBCS Scheme)
Paper : BCA 305 T

Time :3 Hours Maximum Marks : 100


Instructions to Candidates:
Answer allthe sections.
SECTION -A
Answer any Ten ofthe following. Each question carries 2 marks. (10×2=20)
Define operating system. Give twoexamples.
2 Define process.
3. What is a thread?
4. Define aging.
5. What is pre - emptive scheduling?
6 What is thrashing?
7. Mention any two functions of operating system.
8. Explain multi - programming system.
9. What is a system call?
10. Define Deadlock.
11. Mention the responsibilities of mcmory management?
12. Explain the terms swap in and swap out.
SECTION-B
I. Answer any Five of thefollowing. Each question carries 5marks. (5x5=25)
13. Explain services providedby the operating systems.
14. Explain process state with aneat diagrarm.
15. Discuss the functions of file management.
16. Explain the difference between localand globalallocations.
17. Explain steps involved in page replacement.
18. Explain the methods ofhandling deadlock.

|PT.O.
(2) 15323
19. What is paging? Explain page fault.
20. Write a short note on vitual machine.
SECTION -C
II. Answer anyThree of the following. Each question carries 15 marks. (3x15=45)
21. Explain types of operating system. Mention its advantages and services.
22. Explain the inter process communication in detail.
23. What is process synchronization? Explain producer consumer problem using
semaphores.
24. a) Explain Banker's algorithm. (10)
b) Briefly explain deadiock recovery. (5)
25. Explain the disk scheduling algorithms SCAN, Look and C-look with suitable graphs.
SECTION-D
IV. Answer any One of the following. Each question carries 10 marks. (1x10=10)
26. Consider the following set of processes with the length of the CPU burst time given
in MS.

Process Burst time Priority


P, 5 2

P, 1 4

P, 2 3

P4 6

P, 8 3

The process are assumed to have arrived in the order P,. P, P, P,and P, all at time 0
(zero).
i. Draw four Gantt chart illustrating the execution of these prOcesses using FCFS,
SJF, and non - pre - emptive priority.
11. What is the turnaround time and waiting time of each prOcess in the entire
scheduling algorithm mentioncd above.
27. Consider the reference string.
7.0.1.2.0.3.0,4.2.3,0.3,2, 1,2,0,1,7.
Find the page fault rate using FIFO page replacement algorithm.

You might also like