Code.org 7

Front

Which code segment results in "true" being returned if a number is even? Replace "MISSING CONDITION" with the correct code segment: num % 2 == 0; num % 0 == 2; num % 1 == 0; num % 1 == 2; isEven(num)

Back

num % 2 == 0;

Front

Options: [2, 5, 3, 1, 6], [1, 4, -1, 0, 1], [0, 3, 6, -1, 9], [5, 2, 6, 3, 9], [5, 1, 7, -1, 9]

Back

[0, 3, 6, -1, 9]

Front

Which function calls would provide the most helpful test of this function? Remember: With tests, you are attempting to figure out all the possible ways the function could be broken. Options: findMin(-1, 0), findMin(2,4), findMin(5,10), findMin(5,3), findMin(7,2), findMin(5,1), findMin(1,1), findMin(-2,2), findMin(0,3), findMin(-1,1), findMin(1,-1), findMin(1,1)

Back

findMin(-1,1), findMin(1,-1), findMin(1,1)

Front

listAverage() returns the average number in a list. Which of these functions does this correctly?

Back

Front

What is printed to the console?
console.log(15 % 4);

Back

3

Front

Which term refers to a solution to a large problem that is based on the solutions of smaller subproblems?

Back

procedural abstraction

Front

Where should return false; be written in the code?

Back

OPTION C

Front

This function finds the minimum number in a list. What should <MISSING CODE SEGMENT> be replaced with in order for this function to operate as expected? Options: numList[i] = min; min = numList[i]; min = numList; numList = min; maxList = max;

Back

min = numList[i];

Front

Algorithms can be created in all the following ways EXCEPT: creating from an idea, combining existing algorithms, eliminating sequencing, selection, and iteration from an algorithm, modifying existing algorithms, by combining selection and iteration

Back

eliminating sequencing, selection, and iteration from an algorithm

Front

Using existing algorithms as building blocks for new algorithms has all the following benefits EXCEPT: reduces development time, reduces testing, simplifies debugging, builds on optimized code

Back

removes procedural abstraction