Vocabulary (Matching)Questions
the Following Is a List of Terms from the Chapter

Short Answer

Vocabulary (Matching)Questions
The following is a list of terms from the chapter along with descriptive phrases that can be used to produce questions (depending on the topics covered in your course)in which the students are ask to match phrases and terms.An example would be a question of the form,"In the blank next to each phrase,write the term from the following list that is best described by the phrase."


$\begin{array}{ll}\text { Term } & \text { Descriptive Phrase } \\ \text { algorithm } & \text { The fundamental concept in computer science } \\ \text { pseudocode } & \text { An informal notation for representing algorithms } \\ \text { assignment statement } & \text { A means of saving the result of a computation for future use } \\ \text { if-else statement } & \text { A means of producing different actions depending on a condition } \\ \text { stepwise refinement } & \text { A divide and conquer approach to problem solving } \\ \text { loop invariant } & \text { A statement that is true each time a specific point in a repetitive } \\ & \text { process is reached } \\ \text { function } & \text { A program segment isolated as a unit } \\ \text { recursion } & \text { The technique of applying a program segment within itself } \\ \text { pretest loop } & \text { Looks before it leaps } \\ \text { proof of correctness } & \text { A formal means of verifying software } \\ \text { sequential search } & \text { Less efficient than the binary method } \\ \text { primitive } & \text { A basic building block }\end{array}$