Loading…
0 of 5 objectives have lessons · 0 studied · 0 secure
Lessons for this topic haven’t been written yet. The objectives below show exactly what the syllabus expects, so you can plan with them in the meantime.
What Cambridge says you should be able to do, in our words. Codes are the topic number plus the objective’s position.
Understand linear and binary searching methods.
Write an algorithm to implement a linear search. Write an algorithm to implement a binary search. The conditions necessary for the use of a binary search. How the performance of a binary search varies according to the number of data items.
No lesson yet
Understand insertion sort and bubble sort methods.
Write an algorithm to implement an insertion sort. Write an algorithm to implement a bubble sort. The performance of a sorting routine may depend on the initial order of the data and the number of data items.
No lesson yet
Understand and use Abstract Data Types (ADT).
Write algorithms to find an item in each of: linked list, binary tree. Write algorithms to insert an item into each of: stack, queue, linked list, binary tree. Write algorithms to delete an item from each of: stack, queue, linked list. Understand that a graph is an example of an ADT; describe the key features of a graph and justify its use for a given situation. Candidates will not be required to write code for a graph structure.
No lesson yet
Show how it is possible for ADTs to be implemented from another ADT.
Describe the following ADTs and demonstrate how they can be implemented from appropriate built-in types or other ADTs: stack, queue, linked list, dictionary, binary tree.
No lesson yet
Understand that different algorithms that perform the same task can be compared using criteria (e.g. the time taken to complete the task and the memory used).
Including the use of Big O notation to specify time and space complexity.
No lesson yet