Courses/CS 3113/Outcomes

   Be familiar with basic techniques of algorithm analysis
   Be familiar with writing recursive methods
   Be familiar with advanced data structures such as balanced search trees, hash tables, priority queues and the disjoint set union/find data structure
   Be familiar with several advanced sorting algorithms including quicksort, mergesort and heapsort
   Be familiar with some graph algorithms such as shortest path and minimum spanning tree
   Master analyzing problems and writing program solutions to problems using the above techniques