List of Topics for Presentation / Term Project

1. -Ant Colony Algorithms
   

2. -Algorithms in Complex Networks (finding communities, degree centrality, etc.)
   

3. -Tries and Digital Search Trees
   

4. -Maximum Flow & Min-Cut Problems
   

5. -Huffman Codes and Data Compression
   

6. -Voronoi Diagram and Delauney Triangulation
   

7. -B-, B+ and B* trees
   

8. -Tango Trees
   

9. -Routing algorithms (should include at least Distance Vector and Link State algorithms)
   

10. -Traveling Salesman Problem and Possible Solutions (at least two)
    

11. -Levy flight and Brownian motion
    

12. -Simplex algorithm
    

List of Lectures

1. -8/17/2009 (01-Intro.pdf)
   Class Planning
   

2. -8/19/2009 (02-Algorithms.pdf)
   Definition of Algorithms, GCD
   

3. -8/21/2009 (03-Connectivity.pdf)
   Connectivity Problem, Union-Find Algorithms
   

4. -8/24/2009 (04-BruteForce.pdf)
   Brute-Force Examples
   

5. -8/26/2009 (05-AnalysisAlgorithms.pdf)
   Analysis of Algorithms
   

6. -8/28/2009 (06-Notations.pdf)
   Worst-. Best-. and Average-case Analysis, Asymptotic Notations
   

7. -8/31/2009 (07-Recurrences.pdf)
   Recurrences
   

8. -9/2/2009 (08-Arrays.pdf)
   Classification of Data Structures, ADTs, Arrays
   

9. -9/4/2009 (09-SlinglyLists.pdf)
   Lists: Array Lists and Singly Linked List
   

10. -9/9/2009 (10-DoublyLists.pdf)
    Doubly Linked List, Implementation of Linked Lists based on Arrays
    

11. -9/14/2009 (11-Stacks.pdf)
    Circular Lists and Stacks
    

12. -9/16/2009
    Solving of Exam in Class
    

13. -9/18/2009 (12-Queues.pdf)
    Queues and Multilists
    

14. -9/21/2009 (13-ElementarySorting.pdf)
    Selection Sort and Bubble Sort
    

15. -9/23/2009 (14-InsertionSort.pdf)
    Insertion Sort
    

16. -9/25/2009 (15-QuickSort.pdf)
    Quicksort and Master Theorem for Divide-and-Conquer Algorithms
    

17. -9/28/2009
    Quicksort (see slides above)
    

18. -9/30/2009 (16-Mergesort.pdf)
    Mergesort
    

19. -10/2/2009 (17-Radixsort.pdf)
    Radix Sort
    

20. -10/5/2009 (18-CountingSort.pdf)
    Counting Sort
    

21. -10/7/2009 (19-Trees.pdf)
    Introduction to Trees
    

22. -10/14/2009 (20-TreeTraversals.pdf)
    Tree traversals and Representation of Trees Using Arrays
    

23. -10/16/2009 (21-BST.pdf)
    Binary Search Trees
    

24. -10/21/2009 (22-BalancedBinarySearchTrees.pdf)
    Balanced Trees, AVL Tress
    

25. -10/26/2009 (23-Heaps.pdf)
    Heaps
    

26. -10/28/2009 (24-HeapSort.pdf)
    Heapsort and PQ-Sort
    

27. -11/2/2009 (25-Hashing.pdf)
    Hashing
    

28. -11/4/2009 (26-BTrees1.pdf)
    B-Trees
    

29. -11/6/2009 (27-BTrees2.pdf)
    B-Trees
    

30. -11/9/2009 (28-Graphs.pdf)
    Introduction to Graphs
    

31. -11/13/2009 (29-GraphTraversals.pdf)
    BFS, DFS and Prim’s algorithm
    

32. -11/16/2009 (30-Dijkstra.pdf)
    Dijkstra’s Algorithm for Single Source Shortest Paths
    

33. -11/28/2009 (31-TopologicalSort.pdf)
    Topological Sort
    

List of Quizzes

1. -Quiz 1: 8/24/2009
   

2. -Quiz 2: 9/9/2009 (due at noon 9/10/2009)
   

3. -Quiz 3: 9/25/2009cs.fit.edu
   

4. -Quiz 4: 10/2/2009
   
   

List of Exams

1. -Exam 1: (9/11/2009)
   

2. -Exam 2 (10/9/2009)
   

3. -Exam 3 (11/20/2009)
   

Schedule for Student Presentations

1. -11/23/2009
   Group 1: Maximum Flow & Min-Cut Problems
   Eric Desormeaux, Stephanie Biegner, Kyle Rieder, Joan Aguilar
   Group 2: Algorithms in Complex Networks
   Daryle Serrant, Christian Battaglia, Donald Swade, Jonathan Abdo
   

2. -11/24/2009 (IN MY OFFICE)
   Group 3: Simplex Algorithm
   Bradley Watson, Derryck See, Pooja Biswas, John Rodgers
   Group 4: Ant Colony Algorithms
   Michael Carney, Christopher Groux, Lacey Osteen, Joel Bobosky
   

3. -11/30/2009
   Group 5: Traveling Salesman Problem and Possible Solutions
   Thomas Fitch, Erik Olsen, Kenneth Conway, Nicholas Zynko
   Group 6: Routing Algorithms
   Michael Cambata, Abdullah AlSalem, Abdullah Alsubait, Ronald Pekarchik
   

4. -12/2/2009
   Group 7: Levy flight and Brownian motion
   Shane Brumbley, Travarez Nixon, Ayuba Audu
   Group 8: Huffman Codes and Data Compression
   Joseph Kozlowski, Allen Goldberg, Charles Roller, Emile Paul
   

Sample of Past Exams & Quizzes

- Download all exams in one .zip file: Archive.zip

Useful Links

1. -Lab Website
   

2. -Academic Calendar
   

3. -Submit Server
   

4. -Emacs editor
   

5. -Citeseer: Scientific Literature Digital Library
   

6. -Google Scholar: Scientific Search Engine Service from Google
   

7. -The Collection of Computer Science Bibliographies
   

8. -IEEE Xplore
   

9. -ACM Digital Library
   

10. -Google scholar
    

11. -Rate your Professors (rate me!)