Exam 18: Limitations of Computing

The process of _______________ is an attempt to prove that a program meets its requirements.

Big-O notation indicates how long a solution will take to run on a hypothetical machine.

The limits on computing all stem from a computer's finite representation of numbers.

Alan Turing developed the concept of a theoretical computing machine in the 1930s.

The root cause of errors in software is complexity.

The fable of the King and the Corn demonstrates _______________ complexity.

Which of the following is used to detect that an error has occurred between the storing and retrieving of a byte or the sending and receiving of a byte?

Which of the following occurs when the results of a calculation are too small to represent in the computer?

The _______________ of a computer refers to the maximum number of digits that it can represent.

Most large software projects are designed by a team of designers and then given to a single person to implement.