Write a C program Producer – Consumer as a classical problem of synchronization Step 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation. *program to write: produce -consumer problem to produce and consume the alphabet. //Shared data: semaphore full, empty, mutex; //pool of n buffers, each can hold one item //mutex provides mutual exclusion to the buffer pool //empty and full count the number of empty and full buffers //Initially: full = 0, empty = n, mutex = 1 //Producer thread do { … produce next item … wait(empty); wait(mutex); … add the item to buffer … signal(mutex); signal(full); } while (1); //Consumer thread do { wait(full) wait(mutex); … remove next item from buffer … signal(mutex); signal(empty); … consume the item } while (1);

Please write code n C. and use the alphabet  Producer – Consumer as a classical problem of synchronization Step 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation. *program to write: produce -consumer problem to produce and consume the alphabet. //Shared data: semaphore full, empty, mutex; //pool of n buffers, each can hold one item //mutex provides mutual exclusion to the buffer pool //empty and full count the number of empty and full buffers //Initially: full = 0, empty = n, mutex = 1 //Producer thread do { ... produce next item ... wait(empty); wait(mutex); ... add the item to buffer ... signal(mutex); signal(full); } while (1); //Consumer thread do { wait(full) wait(mutex); ... remove next item from buffer ... signal(mutex); signal(empty); ... consume the item ... } while (1);

Write a C program to Implement the Indexed allocation strategy.

Consider a system where free space is kept in a free-space list. a. Suppose that the pointer to the free-space list is lost. Can the system reconstruct the free-space list? Explain your answer. b. Consider a file system similar to the one used by UNIX with indexed allocation. How many disk 1/0 operations might be required to read the contents of a small local file at /a/b/c? Assume that none of the disk blocks is currently being cached. c. Suggest a scheme to ensure that the pointer is never lost as a result of memory failure.