Search Header Logo
Computer Science Principles Unit 6 Review

Computer Science Principles Unit 6 Review

Assessment

Presentation

•

Computers

•

9th - 12th Grade

•

Practice Problem

•

Medium

Created by

Cory Bougher

Used 85+ times

FREE Resource

12 Slides • 12 Questions

1

Computer Science Principles Unit 6 Review

Algorithms

Slide image

2

Algorithms

  • specific instructions to complete a task

  • often built as functions

  • uses sequence and iteration to repeat

  • "Undecidable problems" can not use algorithms

Slide image

3

Slide image

4

Multiple Choice

Question image

The following algorithm is followed by someone to start a car and drive. Which concept does this algorithm best demonstrate?

1

sequencing

2

selection

3

iteration

4

execution

5

Slide image

6

Multiple Choice

Question image

Which of these algorithms will move the robot along the same path as the algorithm below?

1
2
3

7

Optimization

  • code is altered to use less memory, less power

  • same results with fewer operations

Slide image

8

Multiple Choice

A school is designing a new bus route and are deciding where to put the different bus stops. They want to pick the collection of locations that maximizes the amount of students at a pick up to at least 2 . What term best defines the kind of problem?

1

A decision problem

2

An undecidable problem

3

An optimization problem

4

An efficiency problem

9

Slide image

10

Multiple Choice

Question image

The algorithm below is used to find the largest element in a list of numbers. Which line checks if a number is to BIGGER than the target?

1

1

2

4

3

6

4

9

11

Slide image

12

Multiple Choice

Question image

Which of the following algorithms is the same as the flowchart shown below?

1
2

13

Efficiency

This graph shows the efficiencies of two different algorithms that solve the same problem. Line A is more consistent at returns than Line B (it is exponential).

Slide image

14

Heuristic Approaches

  • a practical method not guaranteed to be optimal or perfect

  • it can be considered a shortcut

15

Multiple Choice

Which situation will likely need a heuristic solution?

1

finding the lowest total of comparable grocery items

2

finding the best schedule for all airplanes

3

finding the average of neighborhood home prices

16

Linear vs. Binary

  • A linear search looks down a list, one item at a time, without jumping

  • binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for,

17

Fill in the Blanks

Which search type would be used to find a vehicle ID number in an unsorted stack?

Type answer...

18

Fill in the Blanks

Which search type would be used to find the earliest date in a timeline?

Type answer...

19

Multiple Choice

Question image

A computer is performing a binary search on the sorted list of 9 numbers below. What is the maximum number of iterations needed to find the item?

1

1

2

3

3

4

4

9

20

Distributed & Parallel Computing

  • Scalability with more processors in DC

  • Reliable because of redundancy in DC

  • Economical because high-bandwidth networks are now affordable

Slide image

21

Multiple Choice

What is a benefit of parallel computing over sequential computing?

1

cost

2

scalability

3

fewer computers

22

Sequential vs Parallel

S runs in order

P runs simultaneously to speed up overall completion time

Slide image

23

Multiple Choice

The impacts of running a parallel algorithm on a large number of computers includes:

1

less time to run but not more efficiency

2

less time to run and more efficiency

3

more time to run and more efficiency

24

Multiple Choice

If an algorithm speeds up completion, it is called:

1

modulo

2

secession

3

processing time

pattern-tertiary

Computer Science Principles Unit 6 Review

Algorithms

Slide image

Show answer

Auto Play

Slide 1 / 24

SLIDE