The free space bitmap looks like this: 1010 0000 0000 0000: The system always searches for free blocks starting at the lowest numbered block. Block size is 4 KiB. (Blocks that belong to the same le do not need to be contiguous.) Write down the bitmap after each of the following actions: (a) File A of size 22 KiB is written. (b) File B of size 10 KiB is written. (c) File A is deleted. (d) File C of size 29 KiB is written. (e) File B is deleted.

The free space bitmap looks like this: 1010 0000 0000 0000: The system always searches for free blocks starting at the lowest numbered block. Block size is 4 KiB. (Blocks that belong to the same le do not need to be contiguous.) Write down the bitmap after each of the following actions: (a) File A of size 22 KiB is written. (b) File B of size 10 KiB is written. (c) File A is deleted. (d) File C of size 29 KiB is written. (e) File B is deleted.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter8: I/o Streams And Data Files

Section8.3: Random File Access

Problem 6E

See similar textbooks

Similar questions

Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics: Parameter Value Rotational rate 15,000 RPMTavg seek 4 msAverage number of sectors/track 1,000Surfaces 8Sector size 512 bytes For each case below, suppose that a program reads the logical blocksof the file sequentially, one after the other, and that the time to positionthe head over the first block is Tavg seek + Tavg rotation .A. Best case: Estimate the optimal time (in ms) required to readthe file over all possible mappings of logical blocks to disksectors. B. Random case: Estimate the time (in ms) required to read thefile if blocks are mapped randomly to disk sectors.
2. Write a program that opens a file in read-only mode and maps the entire file into the virtual-memory address space using mmap. The program should search through the bytes in the mapped region, testing whether any of them is equal to the character X. As soon as an X is found, the program should print a success message and exit. If the entire file is searched without finding an X, the program should report failure. Time your program on files of varying size, some of which have an X at the beginning, while others have an X only at the end or not at all. Please write the program in C
Count how often each bit is set in all the bytes of the given binary file. Open the file with the given name as a binary file. Count how often each bit is set in all the bytes of the file. A byte value returned by infile.get outside the range from 0 to 255 indicates the end of the file. Once you have a byte, you can get the bits like this: for (int i = 0; i < 8; i++) { if (byte % 2 == 1) { // The i-th bit is set } byte = byte / 2; } CODE SHOWN BELOW: #include <iostream>#include <fstream>#include <string> using namespace std; int main(){int bit_counts[8];for (int i = 0; i < 8; i++) { bit_counts[i] = 0; }fstream infile;string filename;cin >> filename; /* Your code goes here */ int largest = 0;for (int i = 0; i < 8; i++){cout << i << ": " << bit_counts[i] << endl;}return 0;}
Instructions Your job is to write a program to encrypt outgoing messages and decrypt incoming messages using a Vigenere Cypher. In this assignment, you will parse a string of words from a file into tokens using the strtok_s command with pointers and then use the Vigenere Cypher algorithm to encrypt and decrypt the parsed words. Before you can perform any encryption/decryption activities, the first step is to read in messages from a file and parse the messages into individual words. The Program: Setting up classes and understanding tokenization The first step in encrypting/decrypting messages is to parse the messages into words before applying the encryption/decryption algorithms to them. This parsing process is called “tokenization.” Read the contents of a file into this array using the getline command. The objective of this assignment is to demonstrate the use of pointers in a program utilizing c-strings and tokenization. The use of pointers is foundational in C++. This…
This question concerns the use of a book cypher to encode a message.Write a program called ‘bookcypher.py’ that accepts:1. The file name for a Project Gutenberg book text.2. A message that is to be encoded.3. A file name for output of the encoded version of the message.The program will create an encoded version of the message by replacing its words with the locationsof words in the book.Say, for example, the message is ‘meet me at the usual time and place’, and the Gutenberg text is‘The Importance of Being Earnest’ by Oscar Wilde.• There is an occurrence of ‘meet’ as the 5th word on the 493rd line of the book text.• There is an occurrence of ‘me’ as the 9th word on the 190th line of the text.• There is an occurrence of ‘at’ as the 6th word on the 8th line of the text.• And so on.Representing a word position as a conjunction of the line number and the index of the word withinthe line, we can encode the message as 493-5, 190-9, 8-6, etc.Sample I/O (user input in bold):Enter the book…
A file whose file descriptor is fd contains the following sequence of bytes 3,1,4,1,5,9,2,6,5,3,5 Lseek (fd,3,SEEK_SET); read(fd,&buffer,4); Where the lseek call makes a seek to byte 3 of the file .what does buffer contain after the read has completed.
Files in C Language Assume that “GO.TXT” exists with a file size of 2KB. What is new file size of “GO.TXT” in bytes after executing the following code segment successfully? char s[ 255 ] = "SOCIAL DISTANCING"; // there is one space between SOCIAL and DISTANCINGfp = fopen("GO.TXT", "a"); fprintf(fp, "%s", s);fclose(fp);
18. In this instance, dirty reads are disallowed, while nonrepeatable reads and phantom reads are allowed. a. Read committed b. Read uncommitted c. Repeatable read d. Serializable
Computer Science Write a C++ language program that reads the file numbers.txt having 10,000 random integers ranging from 1-1,000,000. It takes an input argument num_jobs with a value between 1 and 8. E.g. if num_jobs is 3, it splits into 3 parallel processes using fork() function and each process then calculates prime numbers from a subset of the input data. Together these 3 jobs find prime numbers from all the 10,000 input integers. The overall parent process then combines the results from its children into a single file prime.txt. NOTE: The key part is to solve it with fork()
Contiguous Memory Allocation Algorithms The program will read size of free memory partitions and size of processes from a text file and then will try to allocate a memory partition for each process using the first-fit, best-fit and worst-fit allocation algorithms. The implementation completed in Python programming language. The first line of the input file should contain the size of free memory partitions (in order) while the second line contains the size of processes (in order). Sample input file is shown below: 300,600,350,200,750,125 115,500,358,200,375 The program should read the name input file as command line input and produce a text file named “output.txt” with the following example output: First-Fit Memory Allocation ----------------------------------------------------------------------------------------------- start => 300 600 350 200 750 125 115 => 115* 185 600 350 200 750 125 500 => 115* 185 500* 100 350 200 750 125 358…
A file has r=30,000 EMPLOYEE records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. a) Calculate the record size R in bytes. b) Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. c) Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr i.
Python- Write a script that uses the hashlib module to hash a user entered password and then write the hashed password to a file. Use the input function to prompt the user for the password Hash the password using the hashlib md5 function. Use utf-8 encoding. Include the new line (\n) character when you write the hashed password to the file.