List of Topics for Presentation / Term Project
-
-Ant Colony Algorithms
-
-Algorithms in Complex Networks (finding communities, degree centrality, etc.)
-
-Tries and Digital Search Trees
-
-Maximum Flow & Min-Cut Problems
-
-Huffman Codes and Data Compression
-
-Voronoi Diagram and Delauney Triangulation
-
-B-, B+ and B* trees
-
-Tango Trees
-
-Routing algorithms (should include at least Distance Vector and Link State algorithms)
-
-Traveling Salesman Problem and Possible Solutions (at least two)
-
-Levy flight and Brownian motion
-
-Simplex algorithm
List of Lectures
-
-8/17/2009 (01-Intro.pdf)
Class Planning -
-8/19/2009 (02-Algorithms.pdf)
Definition of Algorithms, GCD -
-8/21/2009 (03-Connectivity.pdf)
Connectivity Problem, Union-Find Algorithms -
-8/24/2009 (04-BruteForce.pdf)
Brute-Force Examples -
-8/26/2009 (05-AnalysisAlgorithms.pdf)
Analysis of Algorithms -
-8/28/2009 (06-Notations.pdf)
Worst-. Best-. and Average-case Analysis, Asymptotic Notations -
-8/31/2009 (07-Recurrences.pdf)
Recurrences -
-9/2/2009 (08-Arrays.pdf)
Classification of Data Structures, ADTs, Arrays -
-9/4/2009 (09-SlinglyLists.pdf)
Lists: Array Lists and Singly Linked List -
-9/9/2009 (10-DoublyLists.pdf)
Doubly Linked List, Implementation of Linked Lists based on Arrays -
-9/14/2009 (11-Stacks.pdf)
Circular Lists and Stacks -
-9/16/2009
Solving of Exam in Class -
-9/18/2009 (12-Queues.pdf)
Queues and Multilists -
-9/21/2009 (13-ElementarySorting.pdf)
Selection Sort and Bubble Sort -
-9/23/2009 (14-InsertionSort.pdf)
Insertion Sort -
-9/25/2009 (15-QuickSort.pdf)
Quicksort and Master Theorem for Divide-and-Conquer Algorithms -
-9/28/2009
Quicksort (see slides above) -
-9/30/2009 (16-Mergesort.pdf)
Mergesort -
-10/2/2009 (17-Radixsort.pdf)
Radix Sort -
-10/5/2009 (18-CountingSort.pdf)
Counting Sort -
-10/7/2009 (19-Trees.pdf)
Introduction to Trees -
-10/14/2009 (20-TreeTraversals.pdf)
Tree traversals and Representation of Trees Using Arrays -
-10/16/2009 (21-BST.pdf)
Binary Search Trees -
-10/21/2009 (22-BalancedBinarySearchTrees.pdf)
Balanced Trees, AVL Tress -
-10/26/2009 (23-Heaps.pdf)
Heaps -
-10/28/2009 (24-HeapSort.pdf)
Heapsort and PQ-Sort -
-11/2/2009 (25-Hashing.pdf)
Hashing -
-11/4/2009 (26-BTrees1.pdf)
B-Trees -
-11/6/2009 (27-BTrees2.pdf)
B-Trees -
-11/9/2009 (28-Graphs.pdf)
Introduction to Graphs -
-11/13/2009 (29-GraphTraversals.pdf)
BFS, DFS and Prim’s algorithm -
-11/16/2009 (30-Dijkstra.pdf)
Dijkstra’s Algorithm for Single Source Shortest Paths -
-11/28/2009 (31-TopologicalSort.pdf)
Topological Sort
List of Quizzes
-
-Quiz 1: 8/24/2009
-
-Quiz 2: 9/9/2009 (due at noon 9/10/2009)
-
-Quiz 3: 9/25/2009cs.fit.edu
-
-Quiz 4: 10/2/2009
List of Exams
Schedule for Student Presentations
-
-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 -
-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 -
-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 -
-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
