This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Week 0: Review of Interfaces First review the definitions of the title of this course: data structures and algorithms . A Data Type is a set of possible values. Examples: integer and real numbers characters and strings booleans and references A Data Structure is an aggregate (collection) of data types. Examples: arrays record (collection of fields, such as a student record) An algorithm is a set of instructions. Examples: input-process-output with for loop last record check with prime read sequential search bubble sort Structure Theorem Sequence, choice (if) and repetition (while) are enough for solutions to algorithms on a Turing Machine. Task 1: Read page 1 for a good summary of the course. Two types of method outputs : void invoked as a statement mutator method set (setters) valued invoked in an expression (valid for the type) accessor method get (getters) Task 2: Do question #3 on page 9, then # 4-7 on page 11 and check your answers in the appendix....
View Full Document