COMP 3 - Unit 1 - Problem Solving

?
  • Created by: DWhite97
  • Created on: 22-10-15 14:49
Abstraction
representation that is arrived at by removing unnecessary details
1 of 6
Time complexity of an Algorithm
how fast an algorithm runs
2 of 6
Order of Complexity
the big O complexity of a problem
3 of 6
Exponential Growth
growth of the form K^n
4 of 6
Halting State
a state that has no outgoing transition
5 of 6
Decision Problem
A yes/no algorithmic problem
6 of 6

Other cards in this set

Card 2

Front

how fast an algorithm runs

Back

Time complexity of an Algorithm

Card 3

Front

the big O complexity of a problem

Back

Preview of the back of card 3

Card 4

Front

growth of the form K^n

Back

Preview of the back of card 4

Card 5

Front

a state that has no outgoing transition

Back

Preview of the back of card 5
View more cards

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Problem Solving resources »