Computers and Technology, 21.06.2019 16:30 ian1588

# Sara is writing a program to input her monthly phone bills and output the month name and amount for the month with maximum amount. she has defined an array to hold the month names. complete the pseudocode program. [6] # program to output maximum month's phone bill monthname ["january", "february", "march", "april", "may", "june", "july", "august", "september", "october", "november", "december"] # define an array to hold the phone bills for each month

Answers: 1

Computers and Technology, 21.06.2019 23:30

4.11 painting a wall (1) prompt the user to input integers for a wall's height and width. calculate and output the wall's area (integer). note that in this case there is a new line after each prompt. (submit for 1 point). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet (2) extend to also calculate and output the amount of paint in gallons needed to paint the wall (floating point). assume a gallon of paint covers 350 square feet. store this value in a variable. output the amount of paint needed using the %f conversion specifier. (submit for 2 points, so 3 points total). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet paint needed: 0.471429 gallons (3) extend to also calculate and output the number of 1 gallon cans needed to paint the wall. hint: use a math function to round up to the nearest gallon. (submit for 2 points, so 5 points total). enter wall height (feet): 11 enter wall width (feet): 15 wall area: 165 square feet paint needed: 0.471429 gallons

Answers: 3

Computers and Technology, 22.06.2019 01:00

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u â’ ` â‰¤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u â’ ` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp â† a[u] 10: a[u] â† a[`] 11: a[`] â† temp 12: end if 13: else . 3 or more elements 14: size â† u â’ ` + 1 15: twothirds â† d(2 â— size)/3e 16: g-sort-recurse(a, `, ` + twothirds â’ 1) 17: g-sort-recurse(a, u â’ twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds â’ 1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Answers: 3

Computers and Technology, 22.06.2019 03:40

Hello my name is mihai and i need your : )i have to do a python project in computer science and i’m really busy with my mocks this period of time besides this i’m not good at coding so could someone pls pls pls sort me out ? i actually beg ; ))

Answers: 1

Computers and Technology, 23.06.2019 21:40

Simon says is a memory game where "simon" outputs a sequence of 10 characters (r, g, b, y) and the user must repeat the sequence. create a for loop that compares the two strings. for each match, add one point to user_score. upon a mismatch, end the game. sample output with inputs: 'rrgbryybgy' 'rrgbbrybgy'

Answers: 3

Sara is writing a program to input her monthly phone bills and output the month name and amount for...

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Chemistry, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Physics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50

Mathematics, 12.04.2021 17:50