Basic algorithm analysis:
Simpler analysis with respect to the resource needs of algorithms in the form of time and memory.
-
Fundamental algorithms:
- Simple numerical algorithms
- Sequential and binary search algorithms
- Depth first search and Width first search.
-
Sorting algorithms:
- Selection sorting, insertion sorting, Quicksort, heapsort, mergesort.
-
Fundamental data structures:
- linear lists, stacks, queues, hash tables, binary tree, heaps, binary search trees and problem trees.
-
Program Design:
- Design and implementation of programmes that use basic algorithms and data structures to solve computer science problems.