Group 10: Concluding Topics
This is our last group of topics.
It's a bit of a grab-bag of content, but all cool stuff.
Topics
When you have completed this part of the class, you will be able to
- Goal 10A: Heaps and Priority Queues:
- Recognize situations where a heap may be the most appropriate choice.
- Interpret small code examples that use a heap or priority-queue interface.
- Goal 10B: Inheritance and Subtype Polymorphism:
- Recognize code that creates derived classes from a base class, methods declared
virtualand code that creates an abstract base class. - Apply the rule for dynamic dispatch to determine which function will be called.
- Recognize code that creates derived classes from a base class, methods declared
- Goal 10C: User-defined Type Conversion:
- Recognize code that specifies (implicit or explicit) user-defined type conversion for a class.
- Differentiate between implicit and explicit type conversion.
- Goal 10D: Choosing Data Structures:
- Apply ideas learned throughout the course to suggest a rationale for choosing a particular data structure for a particular problem.
Need More Practice?
This group of goals are addressed in the following places:
- Week 11 Lesson 1 (Goal 10C)
- Week 13 Lesson 1 (Goal 10A)
- Week 13 Lesson 2 (Goal 10B)
- Week 14 Lesson 1 (Goal 10D)
- Note that 10D is a comprehensive goal that requires knowledge about all of the data structures we've studied.
- In Week 14 Lesson 1 we will specifically illustrate/practice choosing data structures for given problems.
(When logged in, completion status appears here.)