1.a. What are the major activities of an Operating system with regard to file management and memory management?

1.b. Compare and contrast stateless and stateful service with the help of an example.

2.a. Explain with the help of an example, which of the following scheduling algorithms could result in starvation?

a. First-come, first-served

b. Shortest job first

c. Round robin

d. Priority

2.b. What resources are used when a thread is created? How do they differ from those used when a process is created?

3.a. Show that, if the wait () and signal () semaphore operations are not executed atomically, then mutual exclusion may be violated.

3.b. Consider the following snapshot of a system:

-	Allocation	Max	Available
	ABCD	ABCD	ABCD
p0	0012	0012	1520
p1	1000	1750
p2	1354	2356
p3	0632	0652
p4	0014	0656

Answer the following questions using the banker's algorithm:

a. What is the content of the matrix Need?

b. Is the system in a safe state?

c. If a request from process Pl arrives for $(0,4,2,0),$ can the request be granted immediately?

4.a. With the help of a neat labeled diagram, explain the hardware support with TLB for paging.

4.b. Consider the following page reference string:

$1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6$ . How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, and seven frames?

Remember that all frames are initially empty, so your first unique pages will cost one fault each.

$\bullet$LRU replacement

$\bullet$ FIFO replacement

$\bullet$ Optimal replacement

5.a. Justify the statement: Demand paging can significantly affect the performance of computer system.

5.b. Compare and contrast given allocation methods: Contiguous allocation, Linked allocation, Indexed allocation.

6.a. Just-in-time compiler.

6.b. Memory segmentation

6.c. Deadlock avoidance in distributed system.

6.d. Operating System Schedulers

6.e. File system organization

6.f. Two-phase locking protocol