Resources

Exam

• ADT Specification (Updated 27 Oct 2015)

Print these specifications and adhere to these instructions:

• The pages need to be stapled together.
• Your name should clearly appear on the first page
• No other changes to the document are allowed.
• If we find any other writing or any kind of markings on the pages it will be considered cheating and is punishable as such.
• Bring your copy to all your exams
• You are not allowed to borrow from another student

• ADT Specifications (Old)

Lectures

• Iterators Summary
• Tree ADTs
• Properties of Various ADTs

Code

• Bag (Interface – array implementation – linked implementation)
• List (Interface – array implementation – linked implementation – with iterator)
• Sorted List (Interface – array implementation – linked implementation)
• Stack  (Interface – array implementation – linked implementation)
• Queue  (Interface – array implementation – linked implementation)
• PriorityQueue  (Interface – heap implementation – linked implementation)
• Tree (Interface -BinarySearchTree-AVL)

Sample Exams

• Sample exams.
• Sample long programming problem.

External Resources

• Good simulation for BST + AVL
• Good Simulation for Hashing