Final Exam

• Tuesday, December 22nd

• 2:00 - 3:50pm

• room 102 Warren Weaver Hall

Material Covered• Linked Lists• Stacks• Queues• Trees

– Expression Trees– Binary Search Tree– No AVL trees– Heap– B-trees

• Huffman coding

Material Covered (cont)• Sorts

– Selection

– Insertion

– Bubble

– Merge

– Quick

– No Heap (only binary heap)

• Hashing– Separate Chaining

– Linear probing

– No quadratic probing or double hashing

Types of Questions

• Programming questions– Lists, Stacks, Queues– Binary Search Tree

• No programming AVL trees

– No Heap– No Sort

Types of Questions (cont)

• Show results of operations– Items from programming plus

• B Tree

• Huffman Coding

• Hashing

• Sort

• Heap

• Short answer– Everything listed in programming and "show results" plus

• Big Oh

• No Java Collections