NOTE: Unit 19: Computational thinking and Problem-solving is examinable for both Paper 3 and Paper 4. Click here to go to paper 4 and purchase the chapters.
19.1 Algorithms
1 Show understanding of linear and binary searching methods
2 Show understanding of insertion sort and bubble sort methods
3 Show understanding of and use Abstract Data Types (ADT)
-stack, queue, linked list, binary tree, graph
4 Show how it is possible for ADTs to be implemented from another ADT
5 Show understanding that different algorithms which perform the same task can be compared by using criteria (e.g. time taken to complete the task and memory used)
19.2 Recursion
1 Show understanding of recursion
2 Show awareness of what a compiler has to do to translate recursive programming code
Discover more from Lesson Computer
Subscribe to get the latest posts sent to your email.
Reviews
There are no reviews yet.