Flashcards
comp sci test
Cards in this deck (14)
- 1pseudocodeused to represent algorithms but cannot be used in computer language
- 2varibalea named storage location that can hold data
- 3algorithmstep by step set of instructions that unambiguously solves a problem in a finite amount of time
- 4Inputinformation from the outside world that it may use in later instruction
- 5OutputInformation that is sent from the computing agent to the outside world
- 6Conditional statmentsthe "question asking" operations of an algorithm
- 7continuation conditioninstructions that determine if a statement is true or false
- 8EfficiencyThe correctness, ease of understanding, and elegance of an algorithm
- 9BenchmarkingUsed for rating one machine against another, and rating how sensitive and algorithm is
- 10Iterative statementsLooping statements
- 113 basic Algorithm statementsSequential, Conditional, Iterative
- 12Sequential Statementmost basic of all algorithms, used to solve a single block of code
- 13What is the least efficient order of magnitude?Exponential (2^n)
- 14What is the most efficient order of magnitude?Logrithmic (log n)
Information
- Description
- Flashcards on comp sci test , created by jordan.edwards29 on 01/10/2015.
- Created by
- jordan.edwards29 · Oct 2015
- Updated
- Feb 19, 2016
- Views
- 0
- Rating