AP Computer Science Principles - Unit 5: Lists, Loops

AP Computer Science Principles - Unit 5: Lists, Loops

9th - 12th Grade

10 Qs

quiz-placeholder

Similar activities

GCSE - 2.3 Producing Robust Programs

GCSE - 2.3 Producing Robust Programs

9th - 11th Grade

15 Qs

Java Data Structures

Java Data Structures

6th - 10th Grade

15 Qs

Java Basic Data Structures

Java Basic Data Structures

6th - 10th Grade

15 Qs

Understanding Linear Search Algorithm

Understanding Linear Search Algorithm

12th Grade

11 Qs

Introduction to Programming

Introduction to Programming

2nd - 10th Grade

10 Qs

Review of python

Review of python

12th Grade

10 Qs

Python Lists

Python Lists

10th Grade

14 Qs

Java Arrays Basic

Java Arrays Basic

10th - 12th Grade

15 Qs

AP Computer Science Principles - Unit 5: Lists, Loops

AP Computer Science Principles - Unit 5: Lists, Loops

Assessment

Quiz

Computers

9th - 12th Grade

Medium

Created by

Mister Swagner

Used 50+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What was the first computing machine capable of basic arithmetic called?

iPhone 1

Robot

TI Calculator

Babbage Machine

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an individual value in a list that is assigned a unique index called?
Pointer
Reference
Address
Element

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a common method for referencing the elements in a list or string using numbers?
Hashing
Sorting
Indexing
Searching

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met called?
Condition
Loop
Iteration
Recursion

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What occurs when the ending condition will never evaluate to true in a loop?
Logical error
Runtime error
Syntax error
Infinite loop

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the process of accessing each item in a list one at a time called?

Traversing

Sorting

Indexing

Searching

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a technique that manages complexity in programs by giving a collection of data a name without referencing the specific details of the representation called?
Data encapsulation
Data hiding
Data abstraction
Data serialization

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?