Course Name: Data Structures and Algorithms of Java. This course mainly uses mathematic knowledge to explain concepts, so it will be better if tutor can have great mathematical base. Course Content: I. Algorithm Analysis (Mathematical background, Recursions, Big-o notations, Running time calculation) II. Abstract Data Types (Lists, Stacks, Queues) III. Trees (Tree traversals, Binary trees and binary search trees, AVL trees, B-trees) IV. Hashing (Hash function, Separate chaining, Open addressing, Rehashing) V. Priority Queues (Heaps) {Binary heaps, Applications of priority queues, D-heaps} VI. Sorting (Insertion sort, Shell sort, Heap sort, Merge sort, Quick sort, Bucket sort, External sorting) VII. Graph Algorithms (Topological sort, Shortest-path algorithms, Minimum-span tree)