1. Be able to write algorithms using flow charts, pseudocode and program code
2. Understand how a binary search works and be able to perform a binary search on a set of data
3. Be able to read, trace and write code to perform a binary search
4. Understand how a linear search works and be able to perform a linear search on a set of data
5. Be able to read, trace and write code to perform a linear search
6. Understand how a bubble sort and an insertion works and be able to perform a bubble sort and insertion sort on a set of data
7. Be able to read, trace and write code to perform bubble sort and insertion sort
8. Understand how a merge sort works and be able to perform a merge sort on a set of data
9. Be able to read, trace and write code to perform a merge sort
10. Understand how a quick sort works and be able to perform a quick sort on a set of data
11. Be able to read, trace and write code to perform a quick sort
12. Understand how a Dijkstra's algorithm works and be able to perform it on a set of data
13. Understand how a A* algorithm works and be able to perform it on a set of data
Please log in to save your self-assessments.