Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 54CRP
Program Plan Intro
Sequential files:
- A sequential file is a file that has same order of organization of records in which they are entered.
- The order of records does not change in sequential file.
- The information is arranged in a row in sequential files.
- In a sequential file, we can write and read data in a sequence only.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Write a program that expands on the program below (i.e. reading data of each record in the file and storing it into data structure). The expansion involves writing all records to a file (use fprintf, call the name of the file csv). The displayed data must be accessed (and thus written) from data structure (i.e. array of structs). The format written to the file should be one line per record, with each field separated by a comma (‘,’)
program should then output the number of lines in the file.test the program by creating a text file with at least 10 lines of text (of any composition). Use notepad++ to create the data file.
#include<stdio.h>#include<stdlib.h>
//Structurestruct Person{ char name[10];int age;float wage; };
//Main int main (int argc, char **argv)
{ FILE* f; if (argc != 2)
{ printf("No filename in the argument"); return 1; } f = fopen(argv[1], "r"); if (f == NULL) { printf("The file cannot be opened successfully:…
While statements may start and stop anywhere in the flexible manner popularized by Algol60, most modern programming languages insist that statements finish with an end sign like a semicolon or colon. To the contrary, Python and a handful of other programming languages adhere to a set structure in which statements start in a certain column and stop at the end of a line of code unless continuation marks are provided for each statement. Discover how readability, writability, and security are affected by a file's fixed or free format in the following paragraphs.
I need help creating a Java program that is described in the given image and description below:
The attached text file contains record information from records with the following field format:first name,middle name,last name,city nameThe data was badly stored, using the Comma Separated Value (CSV) format, in such a way that the fields do not properly align with that record format. All of the information is there but the record boundaries are mis-aligned. Some, all, or more than a single proper record may exist in as a single record in this file.Example:LarsJame,Thompson,Clifton,JeniferMae,Jones,HenryRick,Luke,SimonsLincoln,Tim,Lee,Huag,BostonSally,Joe,Patton,New YorkHoward,Richard,Larson,Scramento,Samantha,Austin,Henry,St George,GeorgeHenry,Marcus,New Town
Your task is to write a program that will read the data from bad files and write new files with the data correctly stored in a new CSV format and in alphabetical order by last name, first name, middle name. The new format is:last…
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Similar questions
- 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.arrow_forwardIn Perl language Inserting data into a flat-file database and amounts to simply tacking the new data onto the end of the file For example, inserting a new megalith record into a colon-delimited file can be expressed ?|arrow_forwardConsider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectivelyarrow_forward
- Computer Science Write a python program that reads the data file https://archive.ics.uci.edu/ml/machine-learning-databases/eventdetection/CalIt2.data and finds the total count of outflow and the total count of inflow. The attributes in the file are as follows: 1. Flow ID: 7 is out flow, 9 is in flow 2. Date: MM/DD/YY 3. Time: HH:MM:SS 4. Count: Number of counts reported for the previous half hour Rows: Each half hour time slice is represented by 2 rows: one row for the out flow during that time period (ID=7) and one row for the in flow during that time period (ID=9) Hint: # Importing the dataset dataset = pd.read_csv('CalIt2.data') https://archive.ics.uci.edu/ml/machine-learning-databases/event-detection/CalIt2.data this link should work.arrow_forwardWrite a C program, which reads a list of student recordsfrom a file in batch mode. Each student recordcomprises a roll number and student name, and thestudent records are separate by commas.arrow_forwardSuppose a file with 65536 records is organized using multi-level indexing as the file is ordered on a non-key field. Each record is 48 bytes long and the size of its key field is 4 bytes. The indexing is built on the key field of the file. The size of the disk block is 2 KB, and the block pointer size is 12 bytes. The file organization is unspanned. How many blocks will be required for the inner and outer index respectively in a multi-level index? 512 and 2 b) 512 and 4 e) 1024 and 4 d) 1024 and 8arrow_forward
- Compute total no of blocks} Consider a file of 8192 records. Each record is 16 bytes long and its key field Is of size 6 bytes. The file is ordered on a key field, and the file organization is unspanned. The file is stored in a file system with block size 512 bytes, and the size of a block pointer is 10 bytes. If the primary index is built on the key field of the file, and a multilevel index scheme is used to store the primary index, number of first-level and second level blocks in the multilovel index are the respectively 16 and 1 b. 32 and 1 16 and 2 8 and 1 c. d.arrow_forwardDesign and implement a simple interactive Book database for library users. Use the attached library.txt file as the book catalog. In addition to building the base, the program should be able to search a particular book title from the database. If a book is not available, users should receive a meaningful message.arrow_forwardCreate the programme shuffleSort. It initially checks to determine if the data is correct. If they are, the sort is complete. If not, the data is jumbled and the procedure is repeated. What is the longest possible run time? Is there a maximum running time? What is your reasoning? Would your answer alter if the data were shuffled every time and organised in a never-before-seen configuration?arrow_forward
- Write a C program to Implement a system of three processes which read and write numbers to a file. Each of the three processes P1, P2, and P3 must obtain an integer from the file (these instructions must be executed 200 times). The file only holds one integer at any given time. Given a file F, containing a single integer N, each process must perform the following steps 1. Fork two processes For 200 times: 2. Open F 3. Read the integer N from the file 4. Close F 5. Output N and the process' PID (On the screen) 6. Increment N by 1 7. Open F 8. Write N to F (overwriting the current value in F) 9. Close F b) Briefly describe why the processes P1, P2, and P3 obtain/read duplicates of numbers (why does a particular integer x appear in the output of more than one process)? Suggest a solution (you do not need to implement it) to guarantee that no duplicate numbers are ever obtained by the processes. In other words, each time the file is read by any process, that process reads a distinct…arrow_forwardAttributes associated with a file can be maintained in several places as discussed inthe course content:a. Within the set of open file descriptorsb. Within the system-wide file table entry for the filec. Within the ‘i-node’ (or ‘v-node’)These attributes can be associated with the actual file (e.g. the file size), or can be associatedwith an open instance of the file (e.g. whether the file is opened for reading or writing, whether thefile is opened for non-blocking I/O, etc.).What would be preferred location of the following attributes of a file and why? Discuss anytradeoffs if that attribute could be in more than one of the above.a. The owner of the file.b. The “read/write” pointer of the open file.c. Whether the file is opened for reading, writing, or both.arrow_forwardDesign and implement a C program to generate a computerized telephone directory for a cellular service consisting of name and cell phone number by using a linked list concept. Present the user with a menu that allows the user to search the directory for a specified record,insert a new record, delete an existing record, print the entire phone list,and sort an existing recond..arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage