Give explanations, diagrams, disk inode tables, and data blocks like those shown in the PDF to solve the question. (There is no need of coding.) Write an extended version of File System Implementation. You will add content to 40.2 - 40.4 that corresponds to an example file system.  The chapter can be found at https://pages.cs.wisc.edu/%7Eremzi/OSTEP/file-implementation.pdf After each section 40.2-40.4 you are  going to add an example that shows the following file structures: In 40.1, you will introduce the example, and discuss the files from the perspective of the user. In 40.2-40.4 you will discuss the aspects of that 3 files (and the directories to support them). -rwxr-xr-x /users//stuff.sh -rw-r--r-- /users//stuff.txt -rw-r--r-- /users//stuff/stuff.txt With the following content: stuff.sh #!/bin/bash ls -la stuff.txt (1)  There is stuff here stuff.txt (2)  There is also stuff here

a. Implement the following function in Python. Do not copy the docstring into answer. def get_record (fh, n): 111111 Find the n-th record in a comma-delimited sequential file. Records are numbered starting with 0. Use: record = get_record (fh, n) Parameters: fh - file to search (file - open for reading) n - the number of the record to return (int > 0) Returns: #1 #111 record - a list of the fields of the n-th record if it exists, an empty list otherwise (list) Paragraph b- Write a testing program to test the function from part a. The program should ask the user for a fil V 8⁰ BI Uv Αγ + v MacB

Write a complete program that prints out the list of files in the current directory, along with their file sizes and last modified datetime stamps. Any sub-directories are ignored. At the end, print the total file size. It accepts two optional command-line arguments: Sort field (single sort key only) “name" for filename, "size" for file size, 1 "date" for last modified datetime stamp, default is “name". "asc" for ascending, "desc" for descending, 2 Sort order default is “asc". A sample execution of the program with both command line arguments provided is shown below. $ python q3a.py date desc Filename Size Last Modified fileSorter.py / 1461 / Sat Jan 30 01:40:48 2021 optimized_fib.py / 273 / Fri Jan 29 10:53:45 2021 tic-tac-toe-bot-master.zip / 37180 / Thu Jan 28 15:12:03 2021 tictactoe.py / 8157 / Thu Jan 28 14:59:45 2021 getComputerMove.py / 1131 / Thu Jan 28 14:55:22 2021 Total file size: 48203 Research how you access the file system using the functions in the os module. You may use…

can you please double-check this code? thank you!

For this question assume that the file death.txt is in the same folder you are running your code. We want to read the file and have an idea about the number of words we have in the file. The code below is supposed to do that but it is missing one line. fhand = open("death.txt","r") ### line missing print(len(file)) what code should we write in the missing line? Answer:

Modify the findmax.s file to find the minimum value in the list.REQUIRED SPECIFICATIONS: Create your own list of 10 values. Use the byte data type rather than the int (hint: you will need to use the smallest sized register and move over by a byte for reading next value) Adjust suffixes to match register destination size Below is the findmax.s file. The hashmarks reprsent notes taken. This is assembly language on Ubuntu Linix. data_items: #These are the data items .int 3,67,34,222,45,75,54,34,44,33,22,11,66,0 .section .text .globl _start _start: movq $0, %rdi # move 0 into the index register movl data_items(,%rdi,4), %eax                 # load the first byte of data movl %eax, %ebx # since this is the first item, %rax is # the biggest start_loop: # start loop cmpl $0, %eax # check to see if we’ve hit the end je loop_exit incq %rdi # load next value movl data_items(,%rdi,4), %eax cmpl %ebx, %eax # compare values jle start_loop # jump to loop beginning if the new # one isn’t bigger…

Please answer as soon as possible using python as the programming language.

HW1 Instructions: Your homework must have a cover page contains homework number, your name and student id. Submit the code on word file or pdf file. Write your name and student id as comment in the code (see the example). 回HW1 * HW1.Program B// Name: Your name // ID : Your university ID Busing System; using System.Collections. Generic; using System. Linq; using System. Text; using System.Threading. Tasks; 6. 7. 8. 10 Bnamespace HW1 11 O references class Program { 12 13 re static void Main(string[] args) Submit screenshot after running the code for each part (The screenshot must have your name and ID, see the example). ON CAWINDOWS\system32\cmd.exe Name: Your name ID : Your university ID MENU 1. Show grades 2. Show average 3. Max grade 4. Min grade 5. Modify a grade 6. Search by ID 0. Exit Please enter your choice: Write a menu program in C# that manages students grades for one class. The program lets the user select from a list of options, and if the input is not one of the options,…

Write a program that reads movie data from a CSV (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the CSV file and outputs the contents according to the following requirements: Each row contains the title, rating, and all showtimes of a unique movie. A space is placed before and after each vertical separator ('|') in each row. Column 1 displays the movie titles and is left justified with a minimum of 44 characters. If the movie title has more than 44 characters, output the first 44 characters only. Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the CSV file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Hints: Use the find() function to find the index of a comma in each row of…

This table shows a page reference string 1, 2, 3, 1, 4, 5, 3, 6, 7, 2, 2, 1, 7, 6, 5, 7, 4, 7, 1 and the corresponding frame allocations. Use this for questions 10,11,12,13. There are 4 frames of memory. Please copy and complete the allocations. For each frame which maintains the same page as in the previous step please enter"=" The first 5 columns have been filled in. 1|2|31|4|5|36|7 221765 7 4 7 1 1. 1 2. 2 3 4 Show the table if the page replacement algorithm is FIFO - First In First Out. Show the table if the page replacement algorithm is optimal.