Pattern matching can only be applied to graphics and pictures.

Memory locations are stored in row major order.

Algorithms are exclusive to the field of computer science.

Given a sorted list, the sequential search algorithm is more efficient than the binary search.

The instructions that can be decoded and executed by the control unit of a computer are represented in machine language.

Complex mapping is the process of assigning a printable letter in our alphabet a unique number.

The first electronic programmable computer, ENIAC, was built during World War I.

The branch of computer science that studies computers in terms of their major functional units and how they work is known as computer organization.

Mechanical devices for performing complex calculations existed prior to the 20th century.

If an Θ(n²) algorithm and an Θ(n) algorithm exist for the same task, then for large enough n, the Θ(n²) algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

In a two-level memory hierarchy, when the computer needs a piece of information, it looks in RAM first, then cache memory.

Java and C++ are examples of pseudocode languages.

The sum-of-products algorithm always produces an optimal circuit.

The selection sort algorithm can recognize whether or not the list is already sorted at the beginning.

One of the most powerful features of a computer is its ability to handle loops.

A strictly black/white image has greater storage requirements than an image represented using a gray scale.

The sequential search and selection sort algorithms are different methods to get the same thing done.

An unstructured, “free-flowing” writing style should be used for writing algorithms.

The properties that make better algorithms are very similar to the properties we look for when purchasing a car.

The evolution of computer science began before the development of the first computer system.

All conceivable problems can be solved algorithmically.