BCA Operating System

bcasemester 4

This course includes the topics that help students understand operating system and it's functionality along with its types.

Chapter Wise Notes Question Banks Syllabus Chapter Wise Questions Viva Practical

Faculty of Humanities and Social Sciences

2026

Bachelor of Computer Application

Operating System

CACS251

Full Marks: 60

Pass Marks: 24

Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.

"Group B"

Attempt any SIX questions.

[6×5 = 30]

What is a monolithic kernel? How is it different from microkernel? Explain.

[1+4]

What is multithreading? Explain different types of threads.

[1+4]

Explain the different process states in detail.

[5]

What are the necessary conditions for the deadlock? How deadlock is different from starvation?

[4+1]

What is segmentation? How can it be used for the memory management?

[1+4]

What are different page replacement algorithms? Explain.

[5]

List some security problems in operating system. Explain the role of clock synchronization in distributed system.

[2+3]

"Group C"

Attempt any TWO questions.

[2×10 = 20]

What is producer consumer problem? Explain the solutions of producer consumer problem using sleep and wakeup and compare it with the solution using semaphores.

[1+4+5]

Consider the following resource allocation state:

	Allocation	Max	Available
	A B C D	A B C D	A B C D
\(P_0\)	0 0 1 2	0 0 1 2	1 5 2 0
\(P_1\)	1 0 0 0	1 7 5 0
\(P_2\)	1 3 5 4	2 3 5 6
\(P_3\)	0 6 3 2	0 6 5 2
\(P_4\)	0 0 1 4	0 6 5 6

Find the need matrix. Using Bankers algorithm, check whether the system is in safe state or not? If yes, find the execution order of the processes.

[10]

What are seek time and disk access time? Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:

2069, 1212, 2296, 2800, 544, 1618, 356, 1523, 4965, 3681

Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms?

a) FCFS

b) SSTF

c) C-SCAN

d) C-LOOK

[2+8]

BCA Operating System

BCA Semester 4 Operating System Question Paper 2026 (TU) – Solved

Faculty of Humanities and Social Sciences