CS2102 (B12): Object-Oriented Design Concepts
Recap and Practice, Week 2

What Your Should Have Learned In Week 2

During week 2, you should have learned

• How and when to use abstract classes to share code
• What the extends keyword does in Java
• What an abstract data type is
• How the parts of an abstract data type map into Java code
• What Binary Search Trees and AVL Trees are
• The different performance guarantees for finding elements in lists, binary search trees, and AVL trees

What You Should Be Able to Do Now (Tests, etc)

• Create abstract classes and use them to share code
• Create class hierarchies using extends
• Define what makes a tree a binary search tree or an AVL tree
• Recognize when a given tree is a binary search tree or an AVL tree
• Know how the set operations work on binary search trees
• How to write methods without testing for types of objects explicitly

I know many of you are concerned that you wouldn't be able to write the BST code quickly on your own. You will not be asked to write code anywhere near that complexity under exam conditions. Focus on whether you could develop that code with the time given for a homework assignment instead.

Practice Problems

Still coming up with some manageable good examples here -- lab 3 will be designed to practice with the Java programming techniques from Friday and Monday lectures.