try: f-open("demofile.txt", "r" ) f.write("Lorum Ipsum") except: print("Something went wrong when writing to the file") finally: f.close() rue or false, this code will write "Lorum Ipsum" to demofile.txt True

try: f-open("demofile.txt", "r" ) f.write("Lorum Ipsum") except: print("Something went wrong when writing to the file") finally: f.close() rue or false, this code will write "Lorum Ipsum" to demofile.txt True

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

In Java please. Also, add comments as well. Thank you!
Create a text file of names, (3 names per line, 5 lines in total) followed by an age for each name. Go through the file and sum the ages. Create an output file with each persons name followed by age and then a line at the end of the output file that says “sum of all ages is: x”. Simple Java programming. Should include things like bufferedReader, fileReader, printWriter, fileWriter, file close, try-with-resources, Scanner, catch/try, etc. Include Java file and txt file. Thank you.
Download the text file, Random.txt, from the demo file folder on Canvas. This file contains a long list of random numbers. Copy the file to your hard drive (where the working directory of the IDE you use). Write a program that opens the file, reads all the numbers from the file, and calculates the following: 1. The number of numbers in the file 2. The sum of all the numbers in the file (a running total) 3. The average of all the numbers in the file Requirements: The program should display all numbers found in the file, and every twenty numbers in one line. Summarize the number of numbers found in the file, the sum of the numbers, and the average of the numbers in a table format. The average should be displayed in 2-digit in decimal. I mostly need help with the second part of requirements (1) It is C++
You are given a text file (Words.txt) containing 50 words that will be hard to make out because they have been littered with punctuation. Your task is to: • Create a new file called Words2.txt, from Words.txt, which contains all the strings from the previous file, with their position, but with all the punctuation removed. (You must create some sort of method that can loop through the words to do this, you are not allowed to use Regex Patterns) Hint: This might come in handy String punctuation = "!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~"; • You must find the first longest word that appears in the text file with their position retained as well as indicating the number of characters therein, the formatting for this can be seen in Table 1.
Write a program that will read the file text.txt which is provided and the encryptedmessage in there. Please write back the decrypted message into the output.txt file.When you see the message in the output.txt file, you need to submit the java codefile. You need to use Rot13 class for decrypting the message. Do not need to submit in the output.txt file. file example: public class FileExample { public static void main(String[]args){ try {//create file object for input.txtFile in_file = new File("src/input.txt");//create file object for output.txtFile out_file = new File("src/output.txt"); //read the input.txt file with ScannerScanner read = new Scanner(in_file);//write the output.txt file with PrintWriterPrintWriter w = new PrintWriter(out_file); while(read.hasNextLine()){w.write(read.nextLine());} //don't forget to closew.close(); // while(scan.hasNext()){// System.out.println(scan.next());// } }catch(Exception ex){ex.getStackTrace();}
.Write code for below problem. The input below is just an example and you should implement independent from the input. Please paste the link to the answer shared using pastebin, dotnetfiddle, jsfiddle, or any other similar web-site. You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *69 85*9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the…
d) Create a new Java file in Eclipse. Perform the following operations: Create a new StringBuilder from the String "Prepare for your knowledge". Check the capacity of the StringBuilder if it's empty. Find the index of the letter 'y'. Delete a substring from the starting index till this index (of ‘y’). Insert a string "Good luck on " at the beginning of the StringBuilder. Append '!' to it. Print your StringBuilder to Console. Attach the screenshot of code and output.
I am trying to figure out why the sum at the end of my Java code is not working correctly. It keeps showing as zero and I do not know what the issue is. Here is the program requirements Write a program in a single file that: Main: Creates 10 random doubles, all between 1 and 11, Calls a method that writes 10 random doubles to a text file, one number per line. Calls a method that reads the text file and displays all the doubles and their sum accurate to two decimal places. SAMPLE OUTPUT 10.62691196041722.7377903389094555.4279257388651281.37420580654725091.18587002624988364.1803912764852284.9109699989306755.7108582343439587.7908570073730523.1806714736219543 The total is 47.13 Here is my code: import java.util.*;import java.io.*; public class AssignmentTwo { public static void main(String[] args) {//main method double randNum [] = new double [10]; for(int i = 0; i< randNum.length; i++) { randNum[i] = (double)(Math.random()* (10) + 1);…
1. Use Notepad or Textpad to create a file called InputNumbers.txt. Your file should have the following positive integers. 35 45 50 13 24 29 91 47 69 45 78 56 35 68 79 90 80 30 37 58 99 You may create the file with 1 integer on each line or a few integers on each line as shown. 2. Write a Java program that will read the integers in the file until EOF is reached (hint: use a loop). The program should compute and print: the total sum of all the integers read the count of all the even integers read ⚫ the count of all the odd integers read ⚫ the average of all the numbers read 3. Send the output to a file called FileOut.txt 1. Make sure there is one line in the output file for each of output that is printed. In addition, format the average to have two digits of precision after the decimal point.Write a program that uses File I/O (input and output files). This is a Java program. Use a loop
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. Write code for below problem in C language
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. According to rules that you implemented what is the maximum sum of below input? It means please take this input (as file or constants directly inside the code) for your implementation and…
1. Write a Java program that reads the file "input.txt" and calculates and prints the average of all integer numbers in this file. SAMPLE OUTPUT: throws FileNotFoundException try/catch OUTPUT SAMPLE #1 for input.txt: 1 2 3 4 5 6 x x x 8 12 x x 34 x x 10 20 Please input the name of the file to be opened: input.tx --- File Not Found! OUTPUT SAMPLE #1 for input.txt: 1 2 OUTPUT SAMPLE #2 for input.txt: 1 2 3 4 5 6 x x x 8 12 x x 34 x x 10 20 Please input the name of the file to be opened: input.txt Number # 1 is: 1 Number # 2 is: 2 3 4 5 6 x x x 8 12 x x 34 x x 10 20 Number # 1 is: 1 Number # 2 is: 2 Number # 3 is: 3 Number # 4 is: 4 Number # 5 is: 5 Number # 6 is: 6 Number # 3 is: 3 Number # 4 is: 4 Number # 5 is: 5 Number # 7 is: 8 Number # 8 is: 12 Number # 9 is: 34 Number # 6 is: 6 Number # 10 is: 10 Number # 7 is: 8 Number # 11 is: 20 The average of 11 numbers/file = 9.55 Number # 8 is: 12 Number # 9 is: 34 Number # 10 is: 10 OUTPUT SAMPLE #2 for Number # 11 is: 20 The average of 11…