IST238: Algorithms.

1. Introduction
2. Sorting methods
   • Selection sort
   • Bubble sort
   • Insertion sort
   • Shell sort
   • Merge sort
   • Quick sort
   • Heap sort
   • Sorting other types of data
3. Recursion
4. Dynamic Programming
5. Greedy approach
6. Huffman code
7. Bitwise operators
8. Dictinaries and hash functions
9. Random nnumber generator

1. Program examples
2. Projects.
   1. Insertion sort algorithm
   2. Different sequences in the Shell sort algorithm
   3. Comparison of merge, quick, and heap sorting methods
   4. Dijkstra shortest path algorithm
   5. Huffman code
3. Homework assignments.
   1. Selection sort
   2. Bubble sort
   3. Shell sort
   4. Merge sort
   5. Quick sort
   6. Binomail coefficients
   7. Floyd's shortest path algorithm
   8. Knapsack problem - dynamic approach
   9. Sieve of Eratosthenes
   10. Modify the Huffman coding by using binary I/O
   11. Test the different hash functions
   12. Test the different versions of the random number generators
4. Midterm exam !!! is due by 11:59pm Tuesday, October 21, 2003