c++ cpphtp4_PPT_02.pptVIP

Chapter 2 - Control Structures Chapter 2 - Control Structures 2.1 Introduction Before writing a program Have a thorough understanding of problem Carefully plan your approach for solving it While writing a program Know what “building blocks” are available Use good programming principles 2.2 Algorithms Computing problems Solved by executing a series of actions in a specific order Algorithm a procedure determining Actions to be executed Order to be executed Example: recipe Program control Specifies the order in which statements are executed 2.3 Pseudocode Pseudocode Artificial, informal language used to develop algorithms Similar to everyday English Not executed on computers Used to think out program before coding Easy to convert into C++ program Only executable statements No need to declare variables 2.4 Control Structures Sequential execution Statements executed in order Transfer of control Next statement executed not next one in sequence 3 control structures (Bohm and Jacopini) Sequence structure Programs executed sequentially by default Selection structures if, if/else, switch Repetition structures while, do/while, for 2.4 Control Structures C++ keywords Cannot be used as identifiers or variable names 2.4 Control Structures Flowchart Graphical representation of an algorithm Special-purpose symbols connected by arrows (flowlines) Rectangle symbol (action symbol) Any type of action Oval symbol Beginning or end of a program, or a section of code (circles) Single-entry/single-exit control structures Connect exit point of one to entry point of the next Control structure stacking 2.5 if Selection Structure Selection structure Choose among alternative courses of action Pseudocode example: If student’s grade is greater than or equal to 60 Print “Passed” If the condition is true Print statement executed, program continues to next statement If the condition is false Print statement ignored, program continues Indenting makes programs easier to read C++ ignores wh