Chapter 10 - Homework 10
Order by
12 terms
Terms | Definitions |
|---|---|
 algorithm | An explicit set of precise instructions is a(n) ____. |
| capability, language, context | To write a precise algorithm, we need to pay attention to 3 points. These are ____, ____, and ____. |
| formal | High-level programming languages are called ____ languages and are designed to express algorithms. |
| natural | The language we speak is called a ____ language and is not good for expressing precise information. |
| program | A ____ is an algorithm that has been customized to solve a specific task under a specific set of circumstances in a specific language. |
| loop | A ____ is a programming control structure that allows for certain statements in a program to be repeated. |
| test | Loops are controlled by a ___ which determines if the statements should be repeated or not. |
| exchange | The Alphabetize CD or Alpha/Beta sort illustrates a standard sorting algorithm called an _____ sort. |
| variable | A word that can apply to many different values during the running of a program is called a ____. |
| array | The rack used in the Alpha/Beta sort is an example of a data structure called a(n) ____. |
| abstraction | The ideas of the Alpha sweep and the Beta sweep and what they do as a whole is called an ____. |
| IODEF : Input specified Output specified Definiteness Effectiveness Finiteness | List the 5 essential properties of algorithms. |
First Time Here?
Welcome to Quizlet, a fun, free place to study. Try these flashcards, find others to study, or make your own.