• Analysis of Algorithms – worst case time and space complexity • Data Structures – stack, queue, linked list, tree, priority queue, heap, hash, and graph, • Searching algorithms – binary and AVL search trees; • Sorting algorithms – merge sort, quick sort, bucket sort and radix sort; (Reduce some contents) • Graph – data structure, depth first search and breadth first search. (add some interesting contents). • shortest path