ap computer science principles finals review

ap computer science principles finals review

9th Grade - University

132 Qs

quiz-placeholder

Similar activities

A/P Computer Science Exam Review

A/P Computer Science Exam Review

9th Grade - University

132 Qs

AP Computer Science Principles Final

AP Computer Science Principles Final

9th Grade - University

132 Qs

Coding I Final Quiz 2024

Coding I Final Quiz 2024

9th - 12th Grade

128 Qs

EOY Y10

EOY Y10

9th Grade

130 Qs

chapter (1+2) by "<\Human>"

chapter (1+2) by "<\Human>"

University

133 Qs

MEGA OCR Computer Science Component 2 Quiz

MEGA OCR Computer Science Component 2 Quiz

10th - 11th Grade

130 Qs

N5 Computing Science: SDD + CS Exam Questions

N5 Computing Science: SDD + CS Exam Questions

10th Grade

131 Qs

ap computer science principles finals review

ap computer science principles finals review

Assessment

Quiz

Computers

9th Grade - University

Hard

Created by

Maha Hasen

Used 79+ times

FREE Resource

132 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Used in public key encryption, ____________________ Encryption is a scheme in which the key to encrypt data is different from the key to decrypt.

Private Key

Asymmetric

Public Key

Symmetric

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image
Media Image
Media Image
Media Image
Media Image

3.

FILL IN THE BLANK QUESTION

2 mins • 1 pt

Encode the message using a Caesar cipher with shift 9.

Is cereal a soup

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Different ____________ can be written to implement the same algorithm.

problems

algorithms

code

lines

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Different algorithms can be developed to solve the same problem.

True

False

6.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

An algorithm will be used to calculate the difference between the smallest and largest values in a list. For the list of [10, 3, 5, 6], it should calculate a difference of 7.

There are two proposals for the algorithm:

Algorithm 1:

Set minVal to the first value in the list and maxVal to the last value in the list.

Iterate through each number in the list.

If the number is greater than maxVal, store it in maxVal.

If the number is less than minVal, store it in minVal.

After loop, set maxDiff to the difference between maxVal and minVal.

Algorithm 2:

Set minVal to 1000 and maxVal to 0.

Iterate through each number in the list.

If the number is greater than maxVal, store it in maxVal.

If the number is less than minVal, store it in minVal.

After loop, set maxDiff to the difference between maxVal and minVal.

Which of these statements are true about these algorithms?

I. Algorithm 1 does not work on lists where the smallest value is at the start of the list or the largest value is at the end of the list.

II. Algorithm 2 does not work on lists that contain all negative numbers or all numbers over 1000.

I only

II only

I and II only

Neither I nor II

7.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

The flow chart above visualizes an algorithm to generate the "hailstone sequence", an interesting series of numbers.

If the variable n starts off as 5, what would be displayed as a result of executing this algorithm?

*MOD means the remainder

16 8 4 2 1

1

5 16 8 4 2

5 4 3 2

31

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?