Introductory Concepts Flashcards
(5 cards)
1
Q
What is the definition of an algorithm?
A
A finite set of sequential instructions that solves some problem, then terminates
2
Q
What is pseudocode?
A
An abstraction of an algorithm that represents a set of instructions written in English
3
Q
What is meant by Big-O, or Asymptotic Notation?
A
The upper bound (or, worst case scenario) of an algorithm’s time or space complexity
4
Q
Ω, Θ and O are complexity symbols that represent […], […] and […] of an algorithm respectively.
A
The lower bound, the exact representation and the upper bound
5
Q
What is space and time complexity?
A
The quantity of space and time taken by an algorithm
