Difficult Computing Flashcards
1
Q
O(2n) or O(n!) or O(nn) is referred to as what type of complexity?
A
Exponential Complexity or Hard
2
Q
O(n) or O(n2) or O(n3) is referred to as what type of complexity?
A
Polynomial Complexity or Easy (or P)
3
Q
The time complexity of a linear search is….
A
The time complexity is of the Order of n
4
Q
Define Time Complexity and Space Complexity
A
How long it takes to run vs how much memory it takes up
5
Q
What is an Algorithm?
A
A method of solution for a problem (steps to be followed)
6
Q
What is the Fibonacci Sequence?
A
Adding together 2 terms to find the next term
7
Q
What is NP-complete?
A
A class of equivalent ‘harder’ problems
