Write a program that asks the user for names of two files

Assignment Help Basic Computer Science
Reference no: EM13306557

write a program that asks the user for the names of two files. the first file should be opened for reading and the second file should be opened for writing . the program should read the contents of the first file, change all characters to uppercase, and store the results in the second file. the second file will be a copy of the first file, except that all the characters will be uppercase. use notepad or another text editor to create a simple file that can be used to test the program.
Detailed explanation: NO
Specific requirements:
we are suppose to use the following on the assingment

Frankie owned a
ferocious feline named
Freddy as a pet.
Freddy was funny and
furry.
His fur is bright red
with black stripes.

 

Reference no: EM13306557

Recommend a fault tolerance method

Managers want to be able to print schedules on any printer at any restaurant even if traveling and in a motel with a laptop. Please explain what you would have to do to allo

Explain elements of enterprise information security policy

Write and explain briefly the three kinds of information security policy as described by NIST SP 800-14. Write and explain briefly four elements that must be present in Enter

Explain traffic control devices to alert drivers

Are all intersections located safely with respect to horizontal and vertical alignment? Where intersections happen at end of high-speed environments (e.g., at approaches to

List the vertices in the order in which each traversal visit

Use both the depth-first strategy and the breadth-first strategy to traverse the graph in Figure 20-33 , beginning with vertex 0, and the graph in Figure 20-36, beginning wi

The wda wireless device application business models

Write a 5 page paper comparing the WDA wireless device application business models used by Sprint, Verizon, and AT&T Wireless. Within your paper, compare the business mode

Discuss the dynamic progrraming for the following problem

Suppose that a network G contains no negative cycle. Let dn + I(i, j) denote the node pair distances at the end of the Floyd-Warshall algorithm. Show that min{dn+l[i, i] : 1 ≤

What is intermodulation distortion

What is intermodulation distortion? What sorts of signals are susceptible to this form of distortion?  In addition, identify two situations in which error-free transmission is

What three groups of people at the law firm

The law firm of Dewey, Cheatham, & Howe is considering the implementation of a new information system. To that end, they have hired your firm to perform the Systems Analysis

Reviews

Write a Review

 
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd