Suppose that a disk unit has the following parameter: block size B = 1200 bytes Consider a STUDENT file with the following fields: NUMBER, 10 bytes; • LASTNAME, 20 bytes; FIRSTNAME, 20 bytes; BIRTHDATE, 10 bytes; The STUDENT file has r=10000 STUDENT records, fixed-length format, and unspanned blocking. Calculate the following values for the STUDENT file: (a) Calculate the record size R (b) Calculate the blocking factor bfr (c) Calculate the number of disk blocks b

Suppose that a disk unit has the following parameter: block size B = 1200 bytes Consider a STUDENT file with the following fields: NUMBER, 10 bytes; • LASTNAME, 20 bytes; FIRSTNAME, 20 bytes; BIRTHDATE, 10 bytes; The STUDENT file has r=10000 STUDENT records, fixed-length format, and unspanned blocking. Calculate the following values for the STUDENT file: (a) Calculate the record size R (b) Calculate the blocking factor bfr (c) Calculate the number of disk blocks b

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter7: File Handling And Applications

Section: Chapter Questions

Problem 1GZ

See similar textbooks

Similar questions

A file has r = 20, 000 STUDENT records of fixed length. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), ADRESS(40 bytes), PHONE(9 bytes), BIRTHDATE (8 bytes), SEX(1 byte), CLASSCODE( 4 bytes, integer) MAJORDEPTCODE(4 bytes), MINORDEPTCODE(4 bytes), and DEGREEPROGRAM( 3 bytes). An additional byte is used as a deletion marker. Block size B = 512 bytes. a) Calculate the blocking factor bfr (=floor(B/R), where R is the record size) and number of file blocks b, assuming unspanned organization (a record can’t be split across blocks). b) Suppose only 80% of the STUDENT records have a value for PHONE, 85% for MAJORDEPTCODE, 15% for MINORDEPTCODE, and 90% for DEGREEPROGRAM. We use a variable-length record file. Each record has a 1-byte field type for each field in the record, plus the 1-byte deletion marker and a 1-byte end-of-record marker. Suppose that we use a spanned record organization, where each block has a 5-byte pointer to the next block (this space is not used…
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…
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
In a contiguous allocation, if the file has n blocks long and starts at location b, the starting and last blocks being occupied by the file is ___ respectively. a. b and b + n - 1 b. n and b + n + 2 c. b and b + n d. n and n + b -1
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…
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.
A file has r=20000 STUDENT records of fixed-length. Each record has the following fields: NAME (30 bytes), SSN (10 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), MAJORDEPTCODE (4 bytes), MINORDEPTCODE (4 bytes), CLASSCODE (4 bytes, integer), and DEGREEPROGRAM (3 bytes). Suppose the block size is 512 bytes. (a) Calculate the record size R in bytes. (b) Calculate the blocking factor (number of tuples per block) and the number of blocks required. (c) Calculate the average block accesses it takes to find a record by doing a linear search on the file. (d) Assume the file is ordered by SSN; calculate the block accesses takes to search for a record given its SSN value by doing a binary search.
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…
This is the most effective file organization method in which one must handle all data records in a file named
A movie file has the following record structure:name ofthe movie producer director type productioncostAssume that the name of the movie is the primary key of the file. Thefield type refers to the type of the movie, for example, drama, sci-fi, horror, crimethriller, comedy and so forth. Input a sample set of records of your choice into themovie file.i) Implement a primary index-based ISAM file organization.ii) Implement secondary indexes on director, type and productioncost.
Structural in-dependence exists when it is possible to make changes in the file structure without affecting the application program's ability to access the data. Select one: True False
A FAT32 filesystem will not mount, but you have been able to view the data in Hexadecimal format. While recovering file system meta data, you find the creation date of a file in hex: 4519 In human readable format, this date is: