CS 14 Assignments

• Sorting Comparisons - Anytime, 20 points. Given a set of compiled sorting routines, experimentally determine the running time of them. Write a report detaling your experimental procedure and your findings.
  
  
• Anagrams I - 6/25, 20 points. Read in and store a dictionary of words from a text file. Read in a single word. Print out all the anagrams of that word found in the dictionary.
  
  
• Boggle - 6/28, 30 points. Implement the game Boggle.
  
  
• Sorted Lists - 7/2, 20 points. Implement an ADT Sorted List data structure.
  
  
• Stacks - 7/5, 20 points. Implement an ADT Stack data structure to check proper usage of parenthesis/braces in code.
  
  
• Radix Sort - 7/9, 20 points. Implement an O(n) sorting algorithm.
  
  
• Traffic Simulator - 7/12, 30 points. Simulate automobile traffic at a stoplight.
  
  
• Ternary Search Tree - 7/16, 30 points. Implement an advanced data structure for efficiently storing and searching text strings.
  
  
• List-Tree Recursion - 7/19, 30 points. Recursively transmute a binary search tree into a sorted, circular, doubly-linked list.
  
  
• Anagrams II - 7/23, 30 points. Using a hash-table, implement the anagrams program above to perform even faster in most conditions.