Computers and Technology, 16.10.2020 14:01 bodisontbernard
The file below contains first and last names and the radii of circles. You'll need to cut and paste the data into a text file. Write a program to read the file and store the last names and the radii in two arrays. You'll need an array of type string and another array of some numeric type. The arrays should each hold 14 elements. Then, print out the last names and the circled areas, each in a column of width 12. Make sure you match the implied output format and that you check for a successful file open. Include a function to calculate the circle area using the formula:
Area = PI * radius * radius
For PI, use a named constant equal to 3.14159265
Input data - copy to a text file and make sure there is a newline at the end of the last line in the file.
LoriBeth Allen 79
Chachi Arcola 125
Richie Cunningham 171
Howard Cunningham 255
Marion Cunningham 252
Joanie Cunningham 234
Al Delvecchio 122
Arthur Fonzarelli 255
Ralph Malph 165
Ashley Pfister 19
Roger Phillips 61
Jenny Piccalo 55
Mitsumo Takahashi 26
Potsie Weber 210
The Output should look the same as bellow so instead of first name last name appears like bellow.
Allen 19606.680
Arcola 49087.385
Cunningham 91863.311
Cunningham 204282.062
Cunningham 199503.700
Cunningham 172021.047
Delvecchio 46759.465
Answers: 3
Computers and Technology, 22.06.2019 19:00
If your accelerator suddenly gets stuck what should you do
Answers: 2
Computers and Technology, 24.06.2019 13:00
Which one of the following functions is not available on the autosum tool? sum average if max
Answers: 3
Computers and Technology, 24.06.2019 18:30
Is a type of bullying that takes place when a person intentionally posts negative information about another person that is not true.
Answers: 2
Computers and Technology, 25.06.2019 12:30
In many applications, only a small percentage of the points in a given set p of n points are extreme. in such a case, the convex hull of p has less than n vertices. this can actually make our algorithm convexhull run faster than θ(nlogn). assume, for instance, that the expected number of extreme points in a random sample of p of size r is o(rα ), for some constant α < 1. (this is true when the set p has been created by picking points uniformly at random in a ball.) prove that under this condition, the running time of the algorithm is o(n).
Answers: 3
The file below contains first and last names and the radii of circles. You'll need to cut and paste...
Mathematics, 07.07.2019 16:30
History, 07.07.2019 16:30
Social Studies, 07.07.2019 16:30
Mathematics, 07.07.2019 16:30
History, 07.07.2019 16:30
Social Studies, 07.07.2019 16:30
Mathematics, 07.07.2019 16:30
Physics, 07.07.2019 16:30
Social Studies, 07.07.2019 16:30
Mathematics, 07.07.2019 16:30