In this chapter you will learn: To use basic problem-solving techniques; to develop algorithms through the process of top-down, stepwise refinement; to use the if and if else selection statements to choose among alternative actions; to use the while repetition statement to execute statements in a program repeatedly; to use counter-controlled repetition and sentinel-controlled repetition; to use the assignment, increment and decrement operators; the primitive data types. | 4 Control Statements: Part 1 Let’s all move one place on. Lewis Carroll The wheel is come full circle. William Shakespeare How many apples fell on Newton’s head before he took the hint! Robert Frost All the evolution we know of proceeds from the vague to the definite. Charles Sanders Peirce OBJECTIVES In this chapter you will learn: To use basic problem-solving techniques. To develop algorithms through the process of top-down, stepwise refinement. To use the if and if else selection statements to choose among alternative actions. To use the while repetition statement to execute statements in a program repeatedly. To use counter-controlled repetition and sentinel-controlled repetition. To use the assignment, increment and decrement operators. The primitive data types. Introduction Algorithms Pseudocode Control Structures if Single-Selection Statement if else Double-Selection Statement while Repetition Statement Formulating . | 4 Control Statements: Part 1 Let’s all move one place on. Lewis Carroll The wheel is come full circle. William Shakespeare How many apples fell on Newton’s head before he took the hint! Robert Frost All the evolution we know of proceeds from the vague to the definite. Charles Sanders Peirce OBJECTIVES In this chapter you will learn: To use basic problem-solving techniques. To develop algorithms through the process of top-down, stepwise refinement. To use the if and if else selection statements to choose among alternative actions. To use the while repetition statement to execute statements in a program repeatedly. To use counter-controlled repetition and sentinel-controlled repetition. To use the assignment, increment and decrement operators. The primitive data types. Introduction Algorithms Pseudocode Control Structures if Single-Selection Statement if else Double-Selection Statement while Repetition Statement Formulating Algorithms: Counter-Controlled Repetition Formulating Algorithms: Sentinel-Controlled Repetition Formulating Algorithms: Nested Control Statements Compound Assignment Operators Increment and Decrement Operators Primitive Types (Optional) GUI and Graphics Case Study: Creating Simple Drawings (Optional) Software Engineering Case Study: Identifying Class Attributes Wrap-Up Algorithms Algorithms The actions to execute The order in which these actions execute Program control Specifies the order in which actions execute in a program Pseudocode Pseudocode An informal language similar to English Helps programmers develop algorithms Does not run on computers Should contain input, output and calculation actions Should not contain variable declarations Control Structures Sequential execution Statements are normally executed one after the other in the order in which they are written Transfer of control Specifying the .
