Answered: Because all file systems suffer from… | bartleby

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter7: File Handling And Applications

Section: Chapter Questions

Problem 3PE

See similar textbooks

Related questions

Question

Because all file systems suffer from internal
fragmentation, the following relation is true:
A. the larger block size, the greater the internal
fragmentation
B. the smaller block size, the greater the internal
fragmentation
C. the larger block size, the smaller internal
fragmentation
D. there is no relation between block size and
internal fragmentation

What pointer is used for writing a file?
A. memory pointer
B. seek pointer
C. shared--file pointer
D. current-file-position pointer

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

1:34 b a 2. Different operating systems use different file allocation techniques to store files in the secondary storage device such as HDD. One of the techniques is "Linked allocation". In this technique, each file is divided into several data blocks of same size. Each data block has a link to its next block like a singly linked list. So, the data blocks are scattered on the disk. The directory contains a pointer to the starting and the ending data block of a file. The diagram below depicts a sample linked allocation system of a file Abc.txt: Directory entry File Start End Abc.txt 100 900 Data 900 Data Data block 1 block 2 Data block 3 block N Write a Java program to implement the linked allocation of a given text file Assgn1_2.txt (uploaded with the assignment) who's each block will contain maximum 50 characters. Read the content of the given file and store it in data blocks (maximum 50 characters per block). Now show a menu that will ask the user to i) add new content at the end of…
Which example uses the SOLID SRP principle correctly and does not violate it? (A or B) A. public class DatabaseParser { ParseDirectoryMapFile(); // parse directory map fileParsePasswordFile(); // parse user fileParseReviewDataFile(); // parse review data fileParseTeamFile(); // parse team CalculateGrade(); CalulateRelativeGrade(); } B public class DatabaseParser { ParseDirectoryMapFile(); // parse directory map fileParsePasswordFile(); // parse user fileParseReviewDataFile(); // parse review data fileParseTeamFile(); // parse team file} // seperately with the following: public class Calculator{ CalculateGrade(); CalulateRelativeGrade(); }
Part 2: Encryption Objective: Develop a program that encrypts a plaintext file by XORing 128-bit blocks of the file with a key repeatedly until the entire file is encrypted. Details: • The plaintext file will be a book from Project Gutenberg. • The encryption method should use the XOR operation on the file, 128 bits at a time, with the key. • Each 128-bit block is XORed with the same key. • The program should work from the command line and accept three parameters: o The name of the key file o The name of the plaintext file o The desired name of the resulting ciphertext file Note: This encryption method is not supposed to be secure. Usage: $ ./bad_streamcipher_enc kf pt ct
With linked allocation, each file is a linked list of disk blocks; the disk blocks may be scattered anywhereon the disk. The directory contains a pointer to the first and last blocks of the file. Each block contains a pointerto the next block. Refer to the illustration below. Need help to fill in the codes in void main() --- #include<stdio.h>#include<stdlib.h>#define TOTAL_DISK_BLOCKS 32#define TOTAL_DISK_INODES 8int blockStatus[TOTAL_DISK_BLOCKS]; // free = 0int blockList[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES]; // list of blocks of a filestruct file_table {char fileName[20];int fileSize;struct block *sb;};struct file_table fileTable[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES];struct block {int blockNumber;struct block *next;};int AllocateBlocks(int Size) {---}void main(){int i = 0, j = 0, numFiles = 0, nextBlock= 0, ret = 1;char s[20]; struct block *temp;---for(i = 0; i < numFiles; i++) {---ret = AllocateBlocks(fileTable[i].fileSize);---}---//Seed the pseudo-random number…
A sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes; size of the primary key field = 13 bytes; size of block pointer = 7 bytes; block size = 2048 bytes. For this file, we need to build a multi-level index on the primary key. The number of blocks in the first level index file is
1. Given that F is a direct file with n = 2000 records and that the records are stored in orderof their keys. Determine how any record reads it would take to locate a particular record using:a. Sequential search (average case)b. Binary search (worst case)c. (open) hashing with 200 buckets (average case)d. (open) hashing with 400 buckets (average case) 2. Write the declarations to create a data type called: DICTIONARY that represents an openhashing scheme with 20 buckets
* Using the following access matrix tell if the asked operations is allowed or denied. P1 which runs in D1 domain attempts to read F3 P1 which runs in D1 domain attempts to print using laser printer P1 which runs in D1 domain attempts to execute F3 object laser F3 printer D2 D3 D4 domain read read switch D2 print switch switch D3 read execute D4 read write read write switch
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
1. In indexed file allocation method, assuming that the block can only store 8 pointers as shown in the figure (see attached file) , what happens if the file needs 10 pointers? Give the advantages and disadvantages of this method. 2. What could be the advantage/s and disadvantage/s of using the following free space management schemes: a. Grouping b. Counting
HMM Viterbi MLS Calcucation Write a program named hmm_viterbi that takes two command-line arguments: a model file name and a text file name that contains a single untagged sentence. This program should load the given model, then use the viterbi algorithm to find the most likely POS tag sequence for the given sentence.
2 Hashing for URL Retrieval: Given 10,000 URL visit records, design a hashing-based method so that we can quickly retrieve URLS that are most frequently visited. Describe your design concerns in a txt file. Like how you would design the data structure and how you plan to process input and generate output. For instance, your input is a file containing 10,000 rows, where each row contains: URLaddress,visit_timestamp Note that one URLaddress can be visited multiple times.
You are required to propose FOUR functions to develop a complete student record management system. The function are insert, delete, search, update. In addition, you need to use linked list to complete the system development. Write a program by extending the code from the lab. Think and implement 4 more functions in the program (compulsory function is sorting and searching) Your must build on top of the following code. //FileName: Student.cpp //This program illustrates attributes of class Student using simple data structure #include <iostream.h> class Student { private: struct Data { char Name[25]; char Course[30]; int Result; } stdata; public: void SetData(); void GetData(); };//class Student void Student::SetData() { cout <<”Enter student name:”; cin>> stdata.Name; cout<< “Enter student course: “; cin>> stdata.Course; cout<< “Enter student result:”; cin>> stdata.Result; };//method SetData void Student::GetData() { cout<< “\n…

SEE MORE QUESTIONS

Recommended textbooks for you

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

Programming Logic & Design Comprehensive

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

SEE MORE TEXTBOOKS