Description, properties, and storage allocation functions of data structures including balanced binary trees, B-Trees, hash tables, skiplists, tries, kd-Trees and quadtrees. Algorithms for manipulating structures. Applications from areas such as string processing, computer graphics, information retrieval, computer networks, computer vision, and operating systems.
|Dave Mount||Instructoremail@example.com, IRB 4162|
|Hong-Min Chu||Graduate TAfirstname.lastname@example.org|
|Andrew Frock||Undergrad TAemail@example.com|
|Hunter Klamut||Undergrad TAfirstname.lastname@example.org|
|Abhishek Kumar||Graduate TAemail@example.com|
|Shuhao Tan||Graduate TAfirstname.lastname@example.org|
|Joseph Wobus||Undergrad TAemail@example.com|
If you cannot make the scheduled office hours, please feel free to contact any of us by email to set up a time. We all allocate one hour per week for unscheduled office hours.
Hunter will be holding his office hours online using Google hangout. To get yourself on the online office-hour queue, email Hunter at some point during the week about participating in online office hours, and he will add you the queue. The queue can be viewed in this Google Doc.
At 6pm on Monday and Wednesday, Hunter will initiate a Google Hangout with the first person in the queue. The available time will be divided evenly among the people who have signed up.
Important class announcements will be made through Piazza. Once class has started, I'll send invitations to join the system.