Chapter 15 Topics Meaning of Recursion Base case and general case in recursive Function Definitions o Writing Recursive Functions with Simple Type Parameters

Chapter 13 Topics Meaning of a list Insertion and Deletion of List Elements Selection sort of list elements Insertion and Deletion using a Sorted List Binary Search in a Sorted list Order of Magnitude of a Function

Chapter 11 Topics o Meaning of a Structured Data Type Declaring and Using a struct Data Type & C++ union Data Type s Meaning of an Abstract Data Type Declaring and Using a class Data Type Using Separate Specification and Implementation Files

Chapter 9 Topics Switch Statement for Multi-way Branching Do-While Statement for Looping For Statement for Looping Using break and continue Statements

Chapter 7 Topics Writing a Program Using Functional Decomposition Writing a Void Function for a Task Using Function Arguments and Parameters correctly

Programming in C+ Chapter 5 Topics Data Type bool Using Relational and Logical Operators to Construct and Evaluate Logical Expressions XIf-Then-Else Statements

Chapter 3 Topics Constants of Type int and float Evaluating Arithmetic Expressions Declaration for Numeric Types s Implicit Type Coercion and Explicit Type Conversion

Chapter 1 Topics Computer Programming Programming Life-Cycle Phases Creating an Algorithm Machine Language vs. High Level Languages

(1) Input There are zero or more quantities that are externally supplied. (2) Output At least one quantity is produced. (3) Definiteness Each instruction is clear and unambiguous. (4) Finiteness If we trace out the instructions of an algorithm, then for all cases, the algorithm terminates after finite number of steps. (5) Effectiveness Every instruction must be basic enough to be carried out, in principle, by a person using only pencil and paper. It is not enough that each operation be definite as in(3); it also must be feasible

Text 1 Match the following words with their proper Chinese meanings.(中英文搭配)