D278 WGU SCRIPTING AND PROGRAMMING FOUNDATIONS EXAM ACTUAL EXAM WITH OVER 170 QUESTIONS WITH 100- VERIFIED CORRECT ANSWERS ALREADY GRADED A+BRAND NEW!!!

1| P a g e || || || ||




D278 WGU SCRIPTING AND PROGRAMMING || || || || ||




FOUNDATIONS EXAM|ACTUALEXAM WITH | | | | ||




OVER 170 QUESTIONS WITH 100% VERIFIED || || || || || ||




CORRECT ANSWERS ALREADY GRADED A+| || || | || ||




BRAND NEW!!! ||




What is the loop variable initialization inthe followingpseudocode?
|| || | || || | | | |




y= 0 || ||




s = 100.0
|| ||




while y < 10 || | ||




s = s + (s *5.0) y
|| | || | || | || ||




=y+1 || || ||




Ay= 0 || || ||




B y= y+ 1 || || || || ||




C s = 100.0 || || ||




D s = s + ( s * 5.0) - ANSWER: A
|| || || || || || || | || || ||




Order the steps needed to output the minimumof x and y from first (1) to last (4).
| || || || || || || | | | || || || || || || ||




Select your answers from the pull-down list. | | || | || ||




ADeclare variable min
| || ||




B Put min to output
|| || | ||




C min = x || | ||




D If y < min, set min = y - ANSWER: ACDB
|| | || || || || | || || || ||

,2| P a g e || || || ||




Order the steps needed to calculate speed in miles per hour given a start and end
| || || || || || || || || || || | || || || ||




location and time traveled in hours from first (1) to last (4). || || || || || || || || || || ||




Select your answers from the pull-down list. | | || | || ||




A Put speedMph to output
| || | ||




BDeclare variables distMiles and speedMph
| || | | |




C distMiles = endLocation - startLocation
|| || || || |




D speedMph = distMiles / timeHours - ANSWER: BCDA
| | || || | || | ||




Order the tasks needed to create a pyramid (large on bottom, small on top) on a table
|| || || || || || || || || | || | | || | || ||




from first (1) to last (4). || || || || ||




Select your answers from the pull-down list. | | || | || ||




APlace largest shape.
| || |




B Clear table
|| ||




C Place smallest shape.
| | |




D Place middle-sized shape. - ANSWER: BADC
| || | || | |




What does the following algorithmdetermine? if
| | || | | || ||




x == y
|| ||




z =1 | | ||




else
z=0 || ||




A Whether x and y are the same
| || | || | || ||

, 3| P a g e || || || ||




B Whether x and y are negative
| || | || | ||




C Whether x is 1
|| || || ||




D Whether x is 0 - ANSWER: A
|| || || || || || ||




What does the following algorithmaccomplish? | | || | |




x=Getnext input if
| | | | || ||




x == -1 || ||




Put "Goodbye"to output || | |




A Outputs -1 when user types any input
| || || || || || ||




B Outputs "x" when user types -1
| || | || || ||




C Outputs -1 when x is positive
|| || || || || ||




D Outputs Goodbye when user types -1 - ANSWER: D
|| || || | | || || || ||




What does an output of 1 indicate for the following algorithm running on a five-
|| || | || | || || || || | | | | || ||




element list of integers? || || ||




i= 0
| ||




x=0 || || ||




whilei<5 | | |




iflist[i]<0 x | | | || ||




=1 ||




i= i+ 1 | || || ||




Put x to output || | ||