Unit 1 - Quiz Questions Flashcards
In theoretical computer science, researchers study the logical and ___ of problems and their solutions.
Mathematical Properties
Designing programming languages and translating algorithms into these languages is known as ____ realization.
linguistic
An algorithm is essentially useless when __________________________________.
It takes too long to compute/execute
What is wrong with the following:
- Set x to be 1
- Increment x
- Print x
- If x>0, repeat from 2
X is never less than 0. The program doesnt halt to a stop.
The history of mathematics begins _____ years ago
3000 or more years ago
In Babbage’s analytical engine, a mill was used to __________.
Perform arithmetic operations.
______ is an example of a natural language
English
___________ operations provide the computing agent with data values from the outside world that it may then use in later instructions.
Input
A purely _______ algorithm is sometimes termed a straight-line algorithm.
Sequential
The _________ loop is an example of a posttest loop.
do/while
The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ___________ search.
Sequential
The selection of an algorithm to solve a problem is greatly influenced by the way the input ______________ for that problem are organized.
Data
_________ is the algorithmic equivalence of style.
Elegance
The study of the efficiency of algorithms is called the __________ of algorithms.
Analysis
In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the __________ value in the list.
First
Placing a list of items into alphabetical or numerical order is called ___________.
Sorting
The worst case in binary search occurs _______.
when the object to be searched for is not in the list
The ____ sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front.
a. selection
An _______ algorithm is called an exponential algorithm.
O(2^n)
Problems for which no known polynomial solution algorithm exists are sometimes approached via _________ algorithms.
Approximation
