CSCI 235
This schedule will give you an idea of the order of topics and chapters that will be covered. It may change during the semester depending on how quickly we cover the various topics. Week Chapter Topic 1 1,2 Introduction, Asymptotic analysis 2 2,3 Asymptotic analysis, Functions 3 4 Recurrences 4 5 Probability, Elementary Sorts 5 6 Heap Sort 6 7, 8 Quick Sort, Linear Sorts 7 9, 12 Order Statistics, Binary Search Trees 8 12, 13 Binary Search Trees, Red-Black Trees 9 15 Dynamic Programming 10 15, 16 Dynamic Programming, Greedy Algorithms 11 16, 22 Greedy Algorithms, Graphs 12 22 Graphs 13 22, 34 Graph Algorithms, Computational Complexity 14 Non-computable functions |