|
|
|
Spring 2009
-
Data Structures - Recitation
- Recitation 1: Stacks - applications to palindrome testing and balanced parentheses testing.
- Recitation 2: Linked lists - implementing stacks with linked lists and application
to conversion from decimal to binary representation and Tower of Hanoi solver.
- Recitation 3: Queues - implementing queues with arrays and linked lists and application
of queues for a simple messaging system.
- Recitation 4: Collections and Iterators - application to a simple dictionary system.
- Recitation 5: GUI and HW2 - review of basic GUI components and action events.
Description of Homework #2.
- Recitation 6: Midterm exam and Threads - review of the midterm exam and notes on
how to use Threads with Buttons in Java (required for HW2)
- Recitation 7: Intro to Binary Trees and Huffman coding
- Recitation 8: Trees and HW3 - More on Trees and Tree traversals.
Description of Homework #3 draft 1.
- Recitation 9: Heaps and HW3 - Heap priority queue and Heap-Sort.
Description of Homework #3 draft 2.
- Recitation 10: Binary Search Trees and preparation for 2nd midterm (review of Trees and Heaps).
- Recitation 11: MargeSort and QuickSort.
- Recitation 12: Hash Tables.
- Recitation 13: Final review.
|
|
|
Copyright © 2010 Giuseppe Narzisi
|
