CS Python Fundamentals 8.8 Lesson Quiz

Match the following algorithms to the problems they help to solve.

• Compression Algorithms

• Checkers

• Route Finding Algorithms

• Pixar character coloring

• Optimization & Scheduling Algorithms

• NASA space shuttle solar panels

• Rendering Algorithms

• Google Maps

• Minimax Algorithms

• Google Hangouts

The two attributes of a good algorithm are ​ (a)   and ​ (b)   (answers should be in alphabetical order)

• correctness
• efficiency
• readability
• program size

The two types of searches mentioned in the "guessing game" (in the order that they are mentioned) are ​ (a)   and ​ (b)  

• linear
• binary
• bubble
• hashing

What type of search is described in the list of steps shown here?

The position of an element in an array is known as its _________.

Which term describes a mix of English with features that you see in programming languages?

• machine learning

• pseudocode

• integrated development environment

• open source

For a 1,000 element array (list), a binary search would require at most how many guesses?

• 10

• 100

• 500

• 1000

In 2013, there were 193 member states in the United Nations. If the names of these states were sorted alphabetically in an array, about how many names would binary search examine to locate a particular name in the array, in the worst case?

• 4

• 8

• 64

• 193

How many playing cards are in the sorting activity warmup?

• 10

• 11

• 20

• 52

What type of sort is described in the final activity of lesson 8.8?

• insertion sort

• merge sort

• heap sort

• selection sort