1
Q
What is an algorithm?
A
A step-by-step procedure for solving a problem, which is more general than a defined program
2
Q
What is a data structure?
A
A way of organising information
3
Q
How would we compare algorithms? (2)
A
- How speed relates to the size of the inputs
* How space relates to the size of the inputs
4
Q
What is an abstract data type?
A
Data types which you interact with at a higher level, and not dealing with low level implementation
5
Q
Why should we use ADT’s?
A
We can change implementations to suit specific circumstances
6
Q
Why is it important to choose good algorithms and data structures? (2)
A
- Important for clarity
* Important for efficiency
CS2001
flashcards
Decks in class (7)
# Cards
