Dr. Teofilo F. GonzalezOffice: 2119 Harold F. Frank Hall
Office hours: M: 1:00 - 2:00 PM and W 3:30 - 4:30 PM
Arvind Chitra Rajasekaran
Office: GSL in Trailer 936 (next to Phelps Hall on the opposite side of the wing where our classroom is located. See map.geog.ucsb.edu )
Office Hours: Tu: 1:00 PM - 2:00 PM and Th: 3:30 PM - 4:30 PM
The Course Schedule
Learn data structures and algorithms to solve problems efficiently. The data structures (for well-known ADTs) are: tries, heaps (and their variations), hash tables, height-balanced binary search trees, B-trees, reverse trees (union-find), etc. Basic graph algorithms are introduced. The complexity and performance of the resulting algorithm will be investigated theoretically and empirically. Discussion of sorting algorithms and their complexity, and lower bounds for sorting.
Discussion sessions will be on Wednesdays and the lectures will be on Mondays, Tuesdays and Thursday. Discussion sessions start this week (Wednesday June 24, 2015). It is very important that you attend all the Lectures and Discussion Sessions. It is very important that you attend all the Lectures and Discussion Sessions.
Topics covered so far:
Tentative list of topics to be covered: Introduction
Correctness, time and space complexity
Dictionary ADT (Insert, Delete, and Membership)
Hash Table Representation
Priority Queues ( Insert and Delete-Min ).
Partially ordered tree ( heaps )
Min-Max Heaps and other variations
Generalized Dictionaries ( Insert, Delete, Member and Min )
Binary Search Trees
Concatenation and Split operations.
Disjoint Set Union ( Union (Merge) and Find )
Representations and Algorithms
Reversed trees, weighted union and path compression.
Dictionaries in Auxiliary Storage
Quicksort, heapsort, merge sort, bin sort and radix sort.
Lower bound for sorting.
DFS and BFS traversals.
Under Construction DO NOT CLICK HERETotal number of visitors to this page, since 4/1/2003, is .