AP CSP Unit 7: Parameters, Returns, and Libraries

Flashcard
•
Computers
•
9th - 12th Grade
•
Hard
Quizizz Content
FREE Resource
Student preview

20 questions
Show all answers
1.
FLASHCARD QUESTION
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. function findMin(num1, num2){ if(num1 < num2){ return num1; } else { return num2; }} 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)
2.
FLASHCARD QUESTION
Front
listAverage() returns the average number in a list. Which of these functions does this correctly?
Back
3.
FLASHCARD QUESTION
Front
What is printed to the console?
console.log(15 % 4);
Back
3
4.
FLASHCARD QUESTION
Front
Which of the following is NOT true about procedural abstraction? Procedural abstraction improves code readability, Procedural abstraction manages complexity by allowing for code reuse, Procedural abstraction improves the speed at which a program executes, Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems
Back
Procedural abstraction improves the speed at which a program executes
5.
FLASHCARD QUESTION
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? function min(numList){ var min = numList[0]; for(var i=0; i<numList.length; i++){ if(numList[i] < min){ <MISSING CODE SEGMENT> } } return min; }
Back
min = numList[i];
6.
FLASHCARD QUESTION
Front
Algorithms can be created in all the following ways EXCEPT: creating from an idea, combining existing algorithms, removing sequencing, selection, and iteration from an algorithm, modifying existing algorithms
Back
removing sequencing, selection, and iteration from an algorithm
7.
FLASHCARD QUESTION
Front
Using existing algorithms as building blocks for new algorithms has all the following benefits EXCEPT: reduces development time, reduces testing, simplifies debugging, removes procedural abstraction
Back
removes procedural abstraction
Create a free account and access millions of resources
Similar Resources on Wayground
15 questions
UNIT 4 TEST

Flashcard
•
9th - 12th Grade
12 questions
CSP Unit 1 - Lessons 1-6 Vocab Review

Flashcard
•
9th - 12th Grade
20 questions
Computer Science

Flashcard
•
9th - 12th Grade
21 questions
AP CSP Unit 7: Parameters, Returns, and Libraries

Flashcard
•
9th - 12th Grade
21 questions
AP CSP Unit 7 Review

Flashcard
•
11th Grade
17 questions
Vocab Homework 1st Week - 4th 9 Weeks

Flashcard
•
9th - 12th Grade
16 questions
CSP Unit 1 Review

Flashcard
•
9th - 12th Grade
15 questions
U4L6 - Exit Ticket - Memory and Memory Consolidation

Flashcard
•
9th - 12th Grade
Popular Resources on Wayground
18 questions
Writing Launch Day 1

Lesson
•
3rd Grade
11 questions
Hallway & Bathroom Expectations

Quiz
•
6th - 8th Grade
11 questions
Standard Response Protocol

Quiz
•
6th - 8th Grade
40 questions
Algebra Review Topics

Quiz
•
9th - 12th Grade
4 questions
Exit Ticket 7/29

Quiz
•
8th Grade
10 questions
Lab Safety Procedures and Guidelines

Interactive video
•
6th - 10th Grade
19 questions
Handbook Overview

Lesson
•
9th - 12th Grade
20 questions
Subject-Verb Agreement

Quiz
•
9th Grade
Discover more resources for Computers
40 questions
Algebra Review Topics

Quiz
•
9th - 12th Grade
10 questions
Lab Safety Procedures and Guidelines

Interactive video
•
6th - 10th Grade
19 questions
Handbook Overview

Lesson
•
9th - 12th Grade
20 questions
Subject-Verb Agreement

Quiz
•
9th Grade
40 questions
LSHS Student Handbook Review: Pages 7-9

Quiz
•
11th Grade
24 questions
Scientific method and variables review

Quiz
•
9th Grade
10 questions
Characteristics of Life

Quiz
•
9th - 10th Grade
19 questions
Mental Health Vocabulary Pre-test

Quiz
•
9th Grade