Suppose that you have a very simple file system (VSFS) using i-node to manage disk data blocks, where the disk block size is 4096 bytes. Disk addresses and file block pointers take 32 bits (4 bytes), and the i-node contains 10 direct pointers, one single-indirect pointer and one double-indirect pointer. Assume an index block is the same size as a data block (both 4096 Bytes). If there is a file having 45,000 bytes of data and it has never been accessed, we only assume the file's i-node is in memory, but none of the rest of the file. If the user process wants to read the entire file into the memory, how many disk blocks (including both data blocks and index block(s)) would be brought into the main memory? O a. 11 O b. 10 O C. 12 O d. 1035 O e. 1034

Assuming 4K clustering for a 500-byte file, what is the size (in bytes) of the File Slack? O 12 bytes O 1536 bytes O 3584 bytes O 4096 bytes

Consider a file system that uses indexed allocation with a maximum of one index node per file. Suppose the index node occupies 4096 bytes, that each block pointer occupies 4 bytes. Ignore the metadata associated with the file that is usually contained in the index node. How large should a block be (in bytes) so that this scheme is able to completely access files on a 1 GB file system?

Given the following data file: STUDENT(ID, SNAME, ADDRESS, LEVEL, GPA, …) Suppose that: record size R = 200 bytes block size B = 512 bytes r = 2000 records            Then, Find out: Blocking factor(Bfr)   Bfr=B/R  Number of file blocks(b)   b=r/bfr

Write a C program Producer – Consumer as a classical problem of synchronizationStep 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);

Task: 1. Write a C program to simulate the sequential file allocation in a very simple file system. 2. Assume a disk of 32 blocks, each block is of 1 KB size 3. First 8 blocks (0 to 7) are allocated to the “iNodes” and can’t be used by the file system. Hence blocks available for allocation are from block 8 to block 31. 4. Minimum file size is 1 KB. Hence the file system can have minimum of one file of size 24 KB or maximum of 24 files. 5. At the start, it is assumed that the file system has no files. 6. The program shall ask the user to input the number of files to allocate and their respective names and file sizes. 7. The program shall randomly (set a seed with srand(seed) to replicate the randomness) select any free block as a start block. Check that the start block and the required contiguous blocks are free. If free, allocate those blocks to the file. If not free, find next available contiguous blocks. 8. After allocating blocks for all the files, the program shall print file name,…

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.

1. Suppose you have designed a Register File. Let say this file contains 64 registers, and each register can store 18-bit data. Then, you have designed an n bit ALU with 4 operations. From the information given above, what will be the value of RS RT RD and n Why?