Computer Science 161
Exam #3 Review
Disclaimer: I have attempted to be comprehensive in the following,
but important items may have been omitted by mistake. If you see
such an omission, please let me know. You are responsible for all of
the lecture material to date.
The third hour exam will be on Friday, November 17, and will cover
- Arrays
- Be able to specify, read, write, add up, find largest and smallest,
print in forward or reverse order
the elements of arrays.
- Be able to specify and read an array of objects (Student, Employee,
etc.)
- Be able to fill up an array with random numbers.
- Be able to sort an array. For this exam, I will ask you to
use any sorting algorithm you chose, but to name it. For the
final exam, I may specify the sorting algorithm to use. Be
able to define and specify loop invariants for sorts.
- Searching: Be able to search an array using sequential and
binary search techniques
- Chapters 5.10 through Chapter 10. Be able to
- Discuss unit
testing and the roles of testing in the software engineering process.
- Be
able to define, describe, and discuss coupling, cohesion, and encapsulation.
-
Be able to describe the relationship between subclasses and superclasses,
discuss how over-riding (redefinition) works, and be able to write simple
code for these ideas (including, for example, declaration of a subclass of a
class, the protected clause, how to write a constructor for a subclass ...)
-
Be able to describe what abstract classes and interfaces do, and how they
differ from superclasses and subclasses.
I think that's it, but watch this space for any further details. Many
thanks!