420468 2512078.qx3zay7 Consider a comma-separated file that contains student names and scores such as the following: Jane Lee, 100, 98, 97, 100 Aaron X. Schmidt, 37, 42, 49, 54 Frank von Tardy, 2, 3, 10, 7 We can read the file one line at a time and use an istringstream object to process the scores. To get the position of the first comma, simply read words from the input stream until the word ends with a comma. Then, read and sum the numbers remaining on the line. Use get to remove the commas following each number. Rearrange the lines below to compute the total score for a single student. Assume that each student has at least one score. Mouse: Drag/drop Keyboard: Grab/release [Spacebar (or Enter). Move 100. Cancel Esc Unused total total + score; while (getline(in_file, line)) in.str(line); in >> word; char ch; in.get(ch); in >> word; while (word [word.size()-1] != ',') total = 0; while (in >> score) istringstream in; } } main.cpp #include #include #include using namespace std; int main() { ifstream in file; in_file.open("scores.txt"); string line; int total; int score; string word; Load default template... cout << "Total score: " << total << endl; } return 0;

420468 2512078.qx3zay7 Consider a comma-separated file that contains student names and scores such as the following: Jane Lee, 100, 98, 97, 100 Aaron X. Schmidt, 37, 42, 49, 54 Frank von Tardy, 2, 3, 10, 7 We can read the file one line at a time and use an istringstream object to process the scores. To get the position of the first comma, simply read words from the input stream until the word ends with a comma. Then, read and sum the numbers remaining on the line. Use get to remove the commas following each number. Rearrange the lines below to compute the total score for a single student. Assume that each student has at least one score. Mouse: Drag/drop Keyboard: Grab/release [Spacebar (or Enter). Move 100. Cancel Esc Unused total total + score; while (getline(in_file, line)) in.str(line); in >> word; char ch; in.get(ch); in >> word; while (word [word.size()-1] != ',') total = 0; while (in >> score) istringstream in; } } main.cpp #include #include #include using namespace std; int main() { ifstream in file; in_file.open("scores.txt"); string line; int total; int score; string word; Load default template... cout << "Total score: " << total << endl; } return 0;

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter13: File Input And Output

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a program that opens a specified text file then displays a list of all the unique words found in the file. Hint: Store each word as an element of a set. 5. Word Frequency Write a program that reads the contents of a text file. The program should create a dictio- nary in which the keys are the individual words found in the file and the values are the number of times each word appears. For example, if the word "the" appears 128 times, the dictionary would contain an element with 'the' as the key and 128 as the value. The
Each line of a hockey file contains a four-digit year, a team name, and a two-digit number of wins.Here is one such file, hockey.txt:2003maple leafs452020maple leafs351995senators181996maple leafs302000senators482012canadiens48The first line of the file, for example, says that in 2003 (year), the maple leafs (team name) had 45 wins.Write a function that takes an open hockey file and returns a list of tuples,where each tuple refers to a team name and that team's maximum number of wins in any year.Here is a sample call of the function on hockey.txt:>>> teams_and_most_wins(open('hockey.txt'))[('maple leafs', 45), ('senators', 48), ('canadiens', 48)]"""from typing import TextIOdef teams_and_most_wins(f: TextIO) -> list[tuple[str, int]]:'''f is an open hockey file.Each year has 4 digits and each number of wins has 2 digits.Return a list of tuples where each tuple storesa team name and that team's maximum number of wins in any year.Every team should appear in exactly one of the…
In Python Write a program that reads movie data from a CSV (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the CSV file and outputs the contents according to the following requirements: Each row contains the title, rating, and all showtimes of a unique movie. A space is placed before and after each vertical separator ('|') in each row. Column 1 displays the movie titles and is left justified with a minimum of 44 characters. If the movie title has more than 44 characters, output the first 44 characters only. Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the CSV file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Ex: If the input of the program is: movies.csv and the contents…
In this project, you will develop algorithms that find road routes through the bridges to travel between islands. The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character "X" in the file represents the water that means if a cell contains "X" then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character "0" in the file represents the road connected island. That means if a cell contains "0" then the traveler is allowed to occupy that cell as this car can drive on roads. The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left corner, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent…
In this project, you will develop algorithms that find road routes through the bridges to travel between islands. The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character "X" in the file represents the water that means if a cell contains "X" then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character "0" in the file represents the road connected island. That means if a cell contains "0" then the traveler is allowed to occupy that cell as this car can drive on roads. The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left corner, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent…
Create a file named minesweeper.py Create a function that takes a grid of # and -, where each hash (#) represents a mine and each dash (-) represents a mine-free spot. Return a grid, where each dash is replaced by a digit, indicating the number of mines immediately adjacent to the spot i.e. (horizontally, vertically, and diagonally). Example of an input: [ ["-", "-", "-", "#", "#"], ["-", "#", "-", "-", "-"], ["-", "-", "#", "-", "-"], ["-", "#", "#", "-", "-"], ["-",","-","-"-"]] Example of the expected output: [ ["1", "1", "2", "#", "#"], ["1", "#", "3", "3", "2"], ["2", "4", "#", "2", "0"], ["1", "#", "#", "2", "0"], ["1", "2", "2", "1", "0"] ] Use deep copy to copy your input grid to make your output grid look the same.
Frames Unlimited is a wholesaler that specializes in picture frames. The company stores its product information (each item’s number, name, size and price) in a sequential access file named pictureFrame.txt. You need to create a report using the pictureFrame.txt sequential access file. The report should contain a list of all picture frames with a size of 5×7. The report will be saved to another sequential access file named pictureFrame57.txt. Your first step is to ____. a. determine whether the pictureFrame.txt file exists b. declare a StreamReader variable for the input file c. open the pictureFrame.txt file for input using the OpenText method d. open the pictureFrame57.txt file for output using the CreateText method
IN JAVA ONLY PLEASE. POSITIVE REVIEW WILL BE LEFT FOR CORRECT LANGUAGE ONLY AND NOT COPY PASTE FROM INCORRECT ANSWER A photographer is organizing a photo collection about the national parks in the US and would like to annotate the information about each of the photos into a separate set of files. Write a program that reads the name of a text file containing a list of photo file names. The program then reads the photo file names from the text file, replaces the "_photo.jpg" portion of the file names with "_info.txt", and outputs the modified file names. Assume the unchanged portion of the photo file names contains only letters and numbers, and the text file stores one photo file name per line. If the text file is empty, the program produces no output. Ex: If the input of the program is: ParkPhotos.txt and the contents of ParkPhotos.txt are: Acadia2003_photo.jpg AmericanSamoa1989_photo.jpg BlackCanyonoftheGunnison1983_photo.jpg CarlsbadCaverns2010_photo.jpg CraterLake1996_photo.jpg…
Assignment: Use OOP to implement certain details and requirements for the assignment. The lab is about donkey kong characters and their statistics and information which is provided on a Monkey.txt file that must be read in. Some information of monkeys is below which will be used: Most species are arboreal, using all four limbs to leap from tree to tree. They can sit upright and stand erect. Most species run along branches rather than swinging arm over arm like apes. Monkeys are highly social omnivores, organized in clans as large as several hundred individuals headed by an old male. The underlines are at least behavior (member functions) that you are asked to add to your OOP program such as Leap(string, string), Sit(), Walk(), Swing()... Here are some descriptions of a monkey that must apply to your program. The information from the Monkey.txt file will be used along with the format below. Name Sit Walk Swing Leap Jump Banana Year…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a `map' of all the underground resources in the mine. This map comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is between zero and one hundred (inclusive). The file should be understood to represent a grid, n wide by n deep. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit the second row, and so on.…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a `map' of all the underground resources in the mine. This map comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is between zero and one hundred (inclusive). The file should be understood to represent a grid, n wide by n deep. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources).  The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit the second row, and so on.…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a `map' of all the underground resources in the mine. This map comes as a file. The file has n rows. Each row has n space-separated integers. Each integer is between zero and one hundred (inclusive). The file should be understood to represent a grid, n wide by n deep. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and n. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit the second row, and so on.…