Suppose a file is on a filesystem using a 1K block size. This file is maintained on the disk using i-nodes as is typical on many UNIX filesystems (as described on pages 286-287 and 789-790 of your text). Suppose there are seven direct pointers, and then a pointer to one singly direct block, a pointer to a doubly indirect block, and a pointer to a triply indirect block. Suppose a program creates and opens a file in this filesystem, and then seeks to the following positions, writes a character, and then exits. Identify how many disk blocks, (both data and indirect blocks) must be allocated to store the data for the file. (Note that a-c each represent a different file.) a. Seek to 9000 b. Seek to 300000 c. Seek to 67,000,000 How big would a file need to be to require the triply indirect pointer?

Suppose a file is on a filesystem using a 1K block size. This file is maintained on the disk using i-nodes as is typical on many UNIX filesystems (as described on pages 286-287 and 789-790 of your text). Suppose there are seven direct pointers, and then a pointer to one singly direct block, a pointer to a doubly indirect block, and a pointer to a triply indirect block. Suppose a program creates and opens a file in this filesystem, and then seeks to the following positions, writes a character, and then exits. Identify how many disk blocks, (both data and indirect blocks) must be allocated to store the data for the file. (Note that a-c each represent a different file.) a. Seek to 9000 b. Seek to 300000 c. Seek to 67,000,000 How big would a file need to be to require the triply indirect pointer?

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter7: File Handling And Applications

Section: Chapter Questions

Problem 15RQ

See similar textbooks

Similar questions

In an executable object file that is in executable and linkable format (ELF), which section defines the addresses of the stack and the heap? A. The data section B. The .text section C. These addresses are not defined in the executable object file. Instead, they are assigned by the operating system when the program is loaded in to me D. These addresses are not defined in the executable object file. Instead, they are assigned by the user when the program is running in memory. Reset Selection
92. In external hashing for files of disk, the pointers which contain record position and block address within the block are classified as a. position pointers b. address pointers c. block pointers d. record pointers
Project 1-UNIX Shell Design a C program that copy the file "input.txt" to "out.txt" using Ubuntu (Linux) system calls. The program will create the directory (~/OS-Project) to store the file "out.txt" inside it. The program will skip m letters at a time. The process of reading will start from the letter of index i. The values of m and i must be provided by the user.
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);
using C language Write a program that creates an array of size 10000, then creates two threads.should requests entrance to the critical section that is controlled through semaphores, reads the values written in the array, and writes it to the screen with the following format: "Consumer consumed item number - from position - with the value -" And to a file named Consumer activity, then exits the critical section, and repeats till the producer finishes production
Language: Python Goal: implement decryption in the attached code block import argparse import os import time import sys import string # Handle command-line arguments parser = argparse.ArgumentParser() parser.add_argument("-d", "--decrypt", help='Decrypt a file', required=False) parser.add_argument("-e", "--encrypt", help='Encrypt a file', required=False) parser.add_argument("-o", "--outfile", help='Output file', required=False) args = parser.parse_args() encrypting = True try: ciphertext = open(args.decrypt, "rb").read() try: plaintext = open(args.encrypt, "rb").read() print("You can't specify both -e and -d") exit(1) except Exception: encrypting = False except Exception: try: plaintext = open(args.encrypt, "rb").read() except Exception: print("Input file error (did you specify -e or -d?)") exit(1) def lrot(n, d): return ((n << d) & 0xff) | (n >> (8 - d)) if encrypting: #…
using C language Write a program that creates an array of length 10, then creates 8 threads. should request entrance to their critical sections that is controlled through semaphores, read the values written in the array, and write it to the screen with the following format: "Consumer number - consumed item number-with the value-" And to a file named "Consumer activity", then exit the critical section, and repeat till the producers stop production. The total number of elements generated by the producer and consumed by the consumers should be 10,000,000 number
Computer Science Write a C/C++ program, call it findExt, to find all files in a directory hierarchy, whose extensions are in the extension list provided as arguments to the program. Your program should print the whole pathnames of the found files. Synopsis: findExt <extension-list> [-t target-directory] When target-directory is missing, the working directory (./) will be the target directory Some sample runs: $ findExt txt pdf That is, find all files whose extensions are either txt or pdf in the directory hierarchy ./ $ findExt jpg -t $HOME //target directory is home directory That is, find all files whose extensions is jpg in the directory hierarchy $HOME Requirement: - You must use the system call nftw() that allows you to walk across a file tree. This system call will do all the recursive walk and each time it visits a file or a directory, it will call your own function (a function that you pass as a parameter).
Program this in java the state and variable display must be:Unsorted Partition Reference Index: 0, Traversing Index: 7, Current Traversing Index Value: mango, Next Index Value: plum, Swapping Condition: FalseCurrent Array: ['apple', 'avocado', 'orange', 'banana', 'strawberry', 'pineapple', 'plum', 'mango'] The input:["apple", "avocado", "orange", "banana", "strawberry", "pineapple", "plum", "mango"]Note:The sorted partition is on the left side. Then, the order is increasing based on the number of vowels of a string.the output must be like this:['plum', 'apple', 'strawberry', 'mango', 'orange', 'banana', 'avocado', 'pineapple']
Bella is a psychology student who is carrying out an experiment in which she repeatedly asks people to "think of an object, any object". Bella wants to see what objects people think of under this situation. She enters each object into a text file, one object per line. Help Bella analyse the data by writing a function make_dictionary (filename) that reads the named file and returns a dictionary mapping from object names to occurrence counts (the number of times the particular object was guessed). For example, given a file data.txt containing the following dog triceratops persian cat dog persian cat large white fluffy thing persian cat the function would return the dictionary {'dog': 2, 'triceratops': 1, 'persian cat': 3, 'large white fluffy thing': 1} Notes: • You may assume the given file exists, but it may be empty (i.e., containing no lines). Keys must be inserted into the dictionary in the order in which they appear in the input file. • In some of the tests we display the keys in…
PYTHON-Assume you have a file that has two columns separated by a comma. The first column contains gene accession numbers, and the second column contain their nucleotide sequence. For example: ABC123, AAGTCTTCCCTAAGCCC... KHJ456, TTCGGTCATACTATTC... NMG789, GCTACTCGATGCTA.... .... The file can contain any number of rows. Write a program that reads in this file (you can create one to test your code with, use TextEdit or Notepad) and creates a dictionary, where the keys are the accession numbers and the values are the sequences. Print out to the screen the dictionary pairs that you created.
write a program for I/O system calls. ALGORITHM:1. Start the program.2. open a file for O_RDWR for R/W,O_CREATE for creating a file , O_TRUNC fortruncate a file3. Using getchar(), read the character and stored in the string[] array4. The string [] array is write into a file close it.5. Then the first is opened for read only mode and read the characters and displayed It andclose the file6. Stop the program