Intro to Algorithms

The specific steps used to complete a computation is called ___

• an algorithm

• algebra

• an equation

• a polymath

Some algorithms are better than others even if they ___

• have logical errors

• have syntax errors

• produce equal results

• produce different results

Generally, an algorithm is better if it takes ___

• more memory to compute

• longer to compute

• fewer steps to compute

• more steps to compute

The term algorithm comes from a Persian polymath who was one of the fathers of ___

• calculus

• algebra

• trigonometry

• geometry

One of the most storied algorithmic problems in all of computer science is ___

• counting

• sorting

• multiplication

• hangman

Computer Scientists have spent decades inventing algorithms for sorting, with cool names like ___

• Lather Sort and Fettuccine Sort

• Foam Sort and Ravioli Sort

• Froth Sort and Macaroni Sort

• Bubble Sort and Spaghetti Sort

A series of items of the same type, like airfare prices, is called ___

• a scalar

• an array

• a grid

• a table

The algorithm that sorted an array by repeatedly finding the smallest element was called ___

• Bubble Sort

• Spaghetti Sort

• Selection Sort

• Merge Sort

The relationship of input size to the number of steps the algorithm takes to run characterizes the ___

• simplicity of the algorithm

• complexity of the algorithm

• integrity of the algorithm

• clarity of the algorithm

Which notation is used in Computer Science to describe the performance or complexity of an algorithm?

• N-squared Notation

• Big O Notation

• Standard Notation

• Scientific Notation