Savitch ch 03
•
2 likes•542 views
This document discusses various flow control statements in C++ like if-else statements, while loops, for loops, and switch statements. It covers topics like boolean expressions, precedence of operators, short-circuit evaluation, nested if statements, and multi-way branches that can be implemented using if-else-else statements or switch statements. Examples are provided to illustrate concepts like precedence rules, nested statements, enumerations, and a program to calculate state income tax using if-else statements.
Report
Share
Report
Share
Recommended
Savitch Ch 03
This document summarizes Chapter 3 of a textbook on C++ programming. It discusses various flow control structures in C++ like boolean expressions, if/else statements, switch statements, loops, and more. Key topics covered include boolean logic, precedence rules for expressions, short-circuit evaluation, nested if/else statements, the switch statement syntax, break and default in switch, scope rules for blocks, and while vs do-while loops.
ICP - Lecture 7 and 8
The document discusses decision control instructions in C programming using if, if-else and conditional operators. It explains the syntax and usage of if, if-else-else statements with examples. Logical operators like &&, || and ! are described along with their usage in combining conditions. The conditional operator ?: is introduced with examples. Different methods to solve problems using decision control structures like nested if-else, logical operators and else-if are presented with examples.
Introduction to writing algorithms
This document provides an introduction and overview of the basic steps for creating algorithms in MINC (CMIX) for algorithmic composition. It outlines Christopher Bailey's 8-step process for developing algorithms, including: 1) exploring the musical idea through drawings and diagrams, 2) dividing the task into loops, 3) setting up basic parameters, 4) outlining loops, 5) writing action statements, 6) determining how parameters are calculated, 7) initializing variables, and 8) testing and modifying the algorithm. The document walks through these steps using a sample algorithm as an example.
1 1 number theory
The document provides an overview of topics in number theory including:
- Number systems such as natural numbers, integers, and real numbers
- Properties of real numbers like closure, commutativity, associativity, identity, and inverse properties
- Rational and irrational numbers
- Order of operations
- Absolute value
- Intervals on the number line
- Finite and repeating decimals
- Converting between fractions and decimals
Solving Inequalities (Algebra 2)
The document discusses various methods for solving inequalities, including:
- Properties for adding, subtracting, multiplying, and dividing terms within an inequality
- Using set-builder and interval notation to describe the solution set of an inequality
- Graphical representations using open and closed circles to indicate whether a number is or isn't part of the solution set
The document provides examples of applying these different techniques to solve specific inequalities.
Linear algebra in the dirac notation
1. The document introduces Dirac notation to represent quantum states as kets (vectors) in a Hilbert space H. Kets can be added and multiplied by scalars, obeying certain rules.
2. An inner product assigns a complex number to pairs of kets, satisfying properties like linearity and producing a positive real number when a ket is taken with itself.
3. Linear functionals (bras) map kets to complex numbers in a linear way. Bras form the dual space H† of H. Operators map elements of H to other elements of H in a linear way.
Lar calc10 ch03_sec5
This document discusses limits at infinity and horizontal asymptotes of functions. It defines limits at infinity as the value a function approaches as the input variable increases or decreases without bound. Rational functions always have the same horizontal asymptote as x approaches positive or negative infinity, determined by dividing the highest-order terms of the numerator and denominator. Other functions may have different horizontal asymptotes on the left and right. Examples show how to evaluate finite and infinite limits at infinity and determine any horizontal asymptotes graphically.
MA3696 Lecture 7
This document discusses using logic and error checking in VBA code. It provides examples of Select Case statements, If-Then statements, and If-Then-Else statements to run specific code based on conditions. It also covers checking for errors, such as ensuring a number within a valid range is entered and is an integer. The document demonstrates how to test for correct values and provide error messages if invalid entries are made.
Recommended
Savitch Ch 03
This document summarizes Chapter 3 of a textbook on C++ programming. It discusses various flow control structures in C++ like boolean expressions, if/else statements, switch statements, loops, and more. Key topics covered include boolean logic, precedence rules for expressions, short-circuit evaluation, nested if/else statements, the switch statement syntax, break and default in switch, scope rules for blocks, and while vs do-while loops.
ICP - Lecture 7 and 8
The document discusses decision control instructions in C programming using if, if-else and conditional operators. It explains the syntax and usage of if, if-else-else statements with examples. Logical operators like &&, || and ! are described along with their usage in combining conditions. The conditional operator ?: is introduced with examples. Different methods to solve problems using decision control structures like nested if-else, logical operators and else-if are presented with examples.
Introduction to writing algorithms
This document provides an introduction and overview of the basic steps for creating algorithms in MINC (CMIX) for algorithmic composition. It outlines Christopher Bailey's 8-step process for developing algorithms, including: 1) exploring the musical idea through drawings and diagrams, 2) dividing the task into loops, 3) setting up basic parameters, 4) outlining loops, 5) writing action statements, 6) determining how parameters are calculated, 7) initializing variables, and 8) testing and modifying the algorithm. The document walks through these steps using a sample algorithm as an example.
1 1 number theory
The document provides an overview of topics in number theory including:
- Number systems such as natural numbers, integers, and real numbers
- Properties of real numbers like closure, commutativity, associativity, identity, and inverse properties
- Rational and irrational numbers
- Order of operations
- Absolute value
- Intervals on the number line
- Finite and repeating decimals
- Converting between fractions and decimals
Solving Inequalities (Algebra 2)
The document discusses various methods for solving inequalities, including:
- Properties for adding, subtracting, multiplying, and dividing terms within an inequality
- Using set-builder and interval notation to describe the solution set of an inequality
- Graphical representations using open and closed circles to indicate whether a number is or isn't part of the solution set
The document provides examples of applying these different techniques to solve specific inequalities.
Linear algebra in the dirac notation
1. The document introduces Dirac notation to represent quantum states as kets (vectors) in a Hilbert space H. Kets can be added and multiplied by scalars, obeying certain rules.
2. An inner product assigns a complex number to pairs of kets, satisfying properties like linearity and producing a positive real number when a ket is taken with itself.
3. Linear functionals (bras) map kets to complex numbers in a linear way. Bras form the dual space H† of H. Operators map elements of H to other elements of H in a linear way.
Lar calc10 ch03_sec5
This document discusses limits at infinity and horizontal asymptotes of functions. It defines limits at infinity as the value a function approaches as the input variable increases or decreases without bound. Rational functions always have the same horizontal asymptote as x approaches positive or negative infinity, determined by dividing the highest-order terms of the numerator and denominator. Other functions may have different horizontal asymptotes on the left and right. Examples show how to evaluate finite and infinite limits at infinity and determine any horizontal asymptotes graphically.
MA3696 Lecture 7
This document discusses using logic and error checking in VBA code. It provides examples of Select Case statements, If-Then statements, and If-Then-Else statements to run specific code based on conditions. It also covers checking for errors, such as ensuring a number within a valid range is entered and is an integer. The document demonstrates how to test for correct values and provide error messages if invalid entries are made.
Numerical approximation
The document discusses numerical approximation and significant figures. It begins by explaining what significant figures are and how they are used to determine the accuracy of measurements. It then provides examples of measurements with different numbers of significant figures. The main points are that numerical methods provide approximate results, and significant figures are used to specify the accuracy of those results in terms of the number of figures that can be reliably used.
Line Search Techniques by Fibonacci Search
ABSTRACT: We shall consider useful iterative techniques for solving first unconstrained nonlinear problems. These techniques usually require many iterations of rather tedious computations. As a result such techniques usually require the use of a high speed computer. A large number of these techniques exists and we shall be contended with examining some of the important ones here. A so called best general purpose algorithm suitable for solving all types of nonlinear programmes has not been devised so far. The search for one such algorithm continues. Throughout, emphasis is placed on the computational aspects of the techniques. Less attention is paid to the theoretical development and economy(rate of convergence, stability etc.) of various methods. For highly specialized problems of large systems required careful theoretical considerations. Nevertheless, many problems not possessing such a specialized structure can be satisfactorily solved using iterative techniques.
Math 7 inequalities and intervals
This document provides an introduction to inequalities and intervals. It defines inequalities as ranges of values rather than single numbers, showing that a quantity is greater than or less than another. Symbols for inequalities like <, >, ≤, ≥ are introduced. Compound inequalities representing values between two numbers are explained. Interval notation is defined using brackets and parentheses to indicate whether endpoints are included or not. Examples of writing inequalities as intervals and graphing intervals on number lines are provided.
Bisection Method
The document presents the bisection method for finding the root of a continuous function within a given interval. It explains that the bisection method systematically narrows the interval by calculating the midpoint and determining if the root lies in the upper or lower half. It provides pseudocode for implementing the bisection method to find the square root of a number by iteratively calculating the midpoint of the interval until the difference is within a tolerance value.
Lar calc10 ch03_sec3
The document discusses how to determine if a function is increasing or decreasing on an interval using the first derivative test. It provides examples of finding intervals where a function is increasing or decreasing and applying the first derivative test to locate relative extrema. The steps are to take the derivative of the function, find critical numbers where the derivative is zero, and test the sign of the derivative on intervals between critical numbers to determine if the function is increasing or decreasing.
Chapter 3 branching v4
By the end of this chapter, students will be able to:
Explain the operation of if, else if and else
Explain the operation of relational and logical operators
Analyze programs that use branching
Write programs that use branching to solve problems
Lar calc10 ch01_sec3
This document discusses various techniques for evaluating limits of functions analytically, including:
1) Direct substitution for polynomial, rational, and trigonometric functions whose limits exist.
2) The dividing out technique which involves dividing common factors in the numerator and denominator.
3) The rationalizing technique which rationalizes the numerator of a fraction by multiplying the numerator and denominator by the conjugate.
4) The squeeze theorem, which can be used to find a limit when a function is between two other functions with the same limit.
Examples are provided to demonstrate applying each technique to evaluate specific limits.
Matlab intro notes
This document provides an introduction to computational finance using MATLAB. It discusses MATLAB basics like matrices, vectors, solving linear equations, and generating random numbers. Key points covered include:
- MATLAB is well-suited for numerical linear algebra operations on matrices and vectors.
- Functions like rand and randn are used to generate uniformly distributed and Gaussian/normal distributed random numbers, which are important in finance.
- Histograms can be used to visualize the distributions of random numbers and converge to the probability density function as the number of samples increases.
[ITP - Lecture 09] Conditional Operator in C/C++
The conditional operators ? and : are sometimes called ternary operators since they take three arguments. They provide a shorthand way to write if-then-else statements in one line. The general form is expression 1 ? expression 2 : expression 3, which will return expression 2 if expression 1 is true, and expression 3 if expression 1 is false. Examples show how conditional operators can be used to assign values based on boolean expressions or character ranges. Nested conditional operators and limitations where only one statement is allowed after ? or : are also discussed.
Boolean algebra
George Boole developed Boolean algebra between 1815-1864 as an algebra of logic to represent logical statements as algebraic expressions. Boolean algebra uses two values, True and False (represented by 1 and 0 respectively) and logical operators like AND, OR, and NOT to represent logical statements and perform operations on them. Boolean algebra finds application in digital circuits where it is used to perform logical operations. Canonical forms and Karnaugh maps are techniques used to simplify Boolean expressions into their minimal forms.
Assignment Poblems
This is one of the topic covered here to give a flavour of the Operations Research(OR) topics covered in the CD ROM.This ebook will be available by the end of September 2014 on snapdeal website.The OR topics covered are simplified through a number of solved illustrations and will be useful to BMS,MMS.MBA and CA students.
Assignment Chapter - Q & A Compilation by Niraj Thapa
My name is Niraj Thapa. I have compiled Assignment Chapter including SM, PM & Exam Questions of AMA.
You feedback on this will be valuable inputs for me to proceed further.
Quantitative Math
The document discusses three methods for allocating goods in transportation problems: the North-West Corner method, Least-Cost method, and Vogel's Approximation Method. It also discusses the Assignment Method for solving assignment problems. The North-West Corner method allocates goods starting from the upper-left corner based on row and column totals. The Least-Cost method allocates goods to the lowest cost cell without exceeding supply/demand. Vogel's Approximation Method considers cost differences and allocates to the highest difference cell. The Assignment Method solves assignment problems by subtracting costs and covering entries to find the optimal assignment.
[ITP - Lecture 06] Operators, Arithmetic Expression and Order of Precedence
The document discusses arithmetic operators and order of precedence in C++. It defines the basic arithmetic operators (+, -, *, /, %) and their usage. It also explains the rules for integer and float conversions during arithmetic operations. Finally, it describes the order of precedence followed in C++, with multiplication and division having higher precedence than addition and subtraction, and operations in parentheses being evaluated first. Examples are provided to demonstrate how expressions are evaluated based on these rules.
Applications of boolean algebra minterm and maxterm expansions
This chapter discusses applications of Boolean algebra including converting English sentences to Boolean equations, using truth tables to design combinational logic, and minterm and maxterm expansions. It provides examples of translating sentences like "The alarm will ring if the alarm switch is on and the door is open, or it is after 6pm and the window is open" into Boolean equations. It also demonstrates designing a combinational logic circuit using a truth table and deriving the minterm and maxterm expansions from the truth table. Minterms and maxterms are defined as products and sums of literals, where each variable appears once. General minterm and maxterm expansions are provided for functions with n variables.
Boolean variables r010
1. In Boolean algebra, a variable represents a logical quantity that can have a value of 1 or 0. Operations like addition and multiplication represent logical OR and AND operations.
2. Karnaugh maps are used to simplify Boolean expressions by grouping variables and eliminating variables that change between adjacent cells. This groups variables to find the minimum logic expression.
3. Hardware description languages like VHDL and Verilog allow digital designs to be described and implemented using code. VHDL uses entities to describe inputs and outputs, and architectures to describe logic, while Verilog uses modules.
Stewart calc7e 01_08
The document discusses continuity of functions. It defines a continuous function as one where the limit of the function as x approaches a number a equals the value of the function at a. A function is discontinuous if this is not true. Continuous functions have graphs that can be drawn without lifting the pen, while discontinuous functions have breaks. The intermediate value theorem states that a continuous function takes on all intermediate values between two function values.
Lar calc10 ch01_sec4
This document discusses continuity and one-sided limits of functions. It defines continuity at a point and on an open interval. Functions can have removable or nonremovable discontinuities. One-sided limits are used to investigate continuity on closed intervals. The intermediate value theorem guarantees that a continuous function takes on all intermediate values between its values at the endpoints of a closed interval. Examples demonstrate determining continuity and applying properties of continuity and the intermediate value theorem.
AMA_Assignment Theory notes
The document provides information on operations research and the assignment problem. It discusses the steps to solve an assignment problem, which include: (1) writing the problem in a matrix form, (2) obtaining a reduced cost matrix through row and column operations, and (3) making assignments on a one-to-one basis by considering zeros in rows and columns. It also addresses issues like unbalanced matrices, maximization problems, and infeasible assignments.
C Sharp Jn (2)
The document discusses various operators in C# programming including unary, binary, and ternary operators. It explains operators such as increment, comparison, bitwise, logical, assignment, and escape sequence operators. It also covers Math class methods for common mathematical operations.
Savitch Ch 03
This document summarizes Chapter 3 of a textbook on C++ flow control. It discusses using boolean expressions, multiway branches using if/else statements, and loop statements. Boolean expressions use relational and logical operators to evaluate to true or false. If/else statements can be nested to create multiway branches. Loops like for and while are also covered.
Control All
The document discusses various control flow statements in C# including conditional statements like if-else and switch statements. It explains the syntax and usage of if-else, else if, logical and relational operators, switch statement, nested if statements, short-circuit evaluation, and the dangling else problem. It also introduces repetition statements like while to repeatedly execute a block of code as long as a condition is true.
More Related Content
What's hot
Numerical approximation
The document discusses numerical approximation and significant figures. It begins by explaining what significant figures are and how they are used to determine the accuracy of measurements. It then provides examples of measurements with different numbers of significant figures. The main points are that numerical methods provide approximate results, and significant figures are used to specify the accuracy of those results in terms of the number of figures that can be reliably used.
Line Search Techniques by Fibonacci Search
ABSTRACT: We shall consider useful iterative techniques for solving first unconstrained nonlinear problems. These techniques usually require many iterations of rather tedious computations. As a result such techniques usually require the use of a high speed computer. A large number of these techniques exists and we shall be contended with examining some of the important ones here. A so called best general purpose algorithm suitable for solving all types of nonlinear programmes has not been devised so far. The search for one such algorithm continues. Throughout, emphasis is placed on the computational aspects of the techniques. Less attention is paid to the theoretical development and economy(rate of convergence, stability etc.) of various methods. For highly specialized problems of large systems required careful theoretical considerations. Nevertheless, many problems not possessing such a specialized structure can be satisfactorily solved using iterative techniques.
Math 7 inequalities and intervals
This document provides an introduction to inequalities and intervals. It defines inequalities as ranges of values rather than single numbers, showing that a quantity is greater than or less than another. Symbols for inequalities like <, >, ≤, ≥ are introduced. Compound inequalities representing values between two numbers are explained. Interval notation is defined using brackets and parentheses to indicate whether endpoints are included or not. Examples of writing inequalities as intervals and graphing intervals on number lines are provided.
Bisection Method
The document presents the bisection method for finding the root of a continuous function within a given interval. It explains that the bisection method systematically narrows the interval by calculating the midpoint and determining if the root lies in the upper or lower half. It provides pseudocode for implementing the bisection method to find the square root of a number by iteratively calculating the midpoint of the interval until the difference is within a tolerance value.
Lar calc10 ch03_sec3
The document discusses how to determine if a function is increasing or decreasing on an interval using the first derivative test. It provides examples of finding intervals where a function is increasing or decreasing and applying the first derivative test to locate relative extrema. The steps are to take the derivative of the function, find critical numbers where the derivative is zero, and test the sign of the derivative on intervals between critical numbers to determine if the function is increasing or decreasing.
Chapter 3 branching v4
By the end of this chapter, students will be able to:
Explain the operation of if, else if and else
Explain the operation of relational and logical operators
Analyze programs that use branching
Write programs that use branching to solve problems
Lar calc10 ch01_sec3
This document discusses various techniques for evaluating limits of functions analytically, including:
1) Direct substitution for polynomial, rational, and trigonometric functions whose limits exist.
2) The dividing out technique which involves dividing common factors in the numerator and denominator.
3) The rationalizing technique which rationalizes the numerator of a fraction by multiplying the numerator and denominator by the conjugate.
4) The squeeze theorem, which can be used to find a limit when a function is between two other functions with the same limit.
Examples are provided to demonstrate applying each technique to evaluate specific limits.
Matlab intro notes
This document provides an introduction to computational finance using MATLAB. It discusses MATLAB basics like matrices, vectors, solving linear equations, and generating random numbers. Key points covered include:
- MATLAB is well-suited for numerical linear algebra operations on matrices and vectors.
- Functions like rand and randn are used to generate uniformly distributed and Gaussian/normal distributed random numbers, which are important in finance.
- Histograms can be used to visualize the distributions of random numbers and converge to the probability density function as the number of samples increases.
[ITP - Lecture 09] Conditional Operator in C/C++
The conditional operators ? and : are sometimes called ternary operators since they take three arguments. They provide a shorthand way to write if-then-else statements in one line. The general form is expression 1 ? expression 2 : expression 3, which will return expression 2 if expression 1 is true, and expression 3 if expression 1 is false. Examples show how conditional operators can be used to assign values based on boolean expressions or character ranges. Nested conditional operators and limitations where only one statement is allowed after ? or : are also discussed.
Boolean algebra
George Boole developed Boolean algebra between 1815-1864 as an algebra of logic to represent logical statements as algebraic expressions. Boolean algebra uses two values, True and False (represented by 1 and 0 respectively) and logical operators like AND, OR, and NOT to represent logical statements and perform operations on them. Boolean algebra finds application in digital circuits where it is used to perform logical operations. Canonical forms and Karnaugh maps are techniques used to simplify Boolean expressions into their minimal forms.
Assignment Poblems
This is one of the topic covered here to give a flavour of the Operations Research(OR) topics covered in the CD ROM.This ebook will be available by the end of September 2014 on snapdeal website.The OR topics covered are simplified through a number of solved illustrations and will be useful to BMS,MMS.MBA and CA students.
Assignment Chapter - Q & A Compilation by Niraj Thapa
My name is Niraj Thapa. I have compiled Assignment Chapter including SM, PM & Exam Questions of AMA.
You feedback on this will be valuable inputs for me to proceed further.
Quantitative Math
The document discusses three methods for allocating goods in transportation problems: the North-West Corner method, Least-Cost method, and Vogel's Approximation Method. It also discusses the Assignment Method for solving assignment problems. The North-West Corner method allocates goods starting from the upper-left corner based on row and column totals. The Least-Cost method allocates goods to the lowest cost cell without exceeding supply/demand. Vogel's Approximation Method considers cost differences and allocates to the highest difference cell. The Assignment Method solves assignment problems by subtracting costs and covering entries to find the optimal assignment.
[ITP - Lecture 06] Operators, Arithmetic Expression and Order of Precedence
The document discusses arithmetic operators and order of precedence in C++. It defines the basic arithmetic operators (+, -, *, /, %) and their usage. It also explains the rules for integer and float conversions during arithmetic operations. Finally, it describes the order of precedence followed in C++, with multiplication and division having higher precedence than addition and subtraction, and operations in parentheses being evaluated first. Examples are provided to demonstrate how expressions are evaluated based on these rules.
Applications of boolean algebra minterm and maxterm expansions
This chapter discusses applications of Boolean algebra including converting English sentences to Boolean equations, using truth tables to design combinational logic, and minterm and maxterm expansions. It provides examples of translating sentences like "The alarm will ring if the alarm switch is on and the door is open, or it is after 6pm and the window is open" into Boolean equations. It also demonstrates designing a combinational logic circuit using a truth table and deriving the minterm and maxterm expansions from the truth table. Minterms and maxterms are defined as products and sums of literals, where each variable appears once. General minterm and maxterm expansions are provided for functions with n variables.
Boolean variables r010
1. In Boolean algebra, a variable represents a logical quantity that can have a value of 1 or 0. Operations like addition and multiplication represent logical OR and AND operations.
2. Karnaugh maps are used to simplify Boolean expressions by grouping variables and eliminating variables that change between adjacent cells. This groups variables to find the minimum logic expression.
3. Hardware description languages like VHDL and Verilog allow digital designs to be described and implemented using code. VHDL uses entities to describe inputs and outputs, and architectures to describe logic, while Verilog uses modules.
Stewart calc7e 01_08
The document discusses continuity of functions. It defines a continuous function as one where the limit of the function as x approaches a number a equals the value of the function at a. A function is discontinuous if this is not true. Continuous functions have graphs that can be drawn without lifting the pen, while discontinuous functions have breaks. The intermediate value theorem states that a continuous function takes on all intermediate values between two function values.
Lar calc10 ch01_sec4
This document discusses continuity and one-sided limits of functions. It defines continuity at a point and on an open interval. Functions can have removable or nonremovable discontinuities. One-sided limits are used to investigate continuity on closed intervals. The intermediate value theorem guarantees that a continuous function takes on all intermediate values between its values at the endpoints of a closed interval. Examples demonstrate determining continuity and applying properties of continuity and the intermediate value theorem.
AMA_Assignment Theory notes
The document provides information on operations research and the assignment problem. It discusses the steps to solve an assignment problem, which include: (1) writing the problem in a matrix form, (2) obtaining a reduced cost matrix through row and column operations, and (3) making assignments on a one-to-one basis by considering zeros in rows and columns. It also addresses issues like unbalanced matrices, maximization problems, and infeasible assignments.
C Sharp Jn (2)
The document discusses various operators in C# programming including unary, binary, and ternary operators. It explains operators such as increment, comparison, bitwise, logical, assignment, and escape sequence operators. It also covers Math class methods for common mathematical operations.
What's hot (20)
Assignment Chapter - Q & A Compilation by Niraj Thapa
Assignment Chapter - Q & A Compilation by Niraj Thapa
[ITP - Lecture 06] Operators, Arithmetic Expression and Order of Precedence
[ITP - Lecture 06] Operators, Arithmetic Expression and Order of Precedence
Applications of boolean algebra minterm and maxterm expansions
Applications of boolean algebra minterm and maxterm expansions
Similar to Savitch ch 03
Savitch Ch 03
This document summarizes Chapter 3 of a textbook on C++ flow control. It discusses using boolean expressions, multiway branches using if/else statements, and loop statements. Boolean expressions use relational and logical operators to evaluate to true or false. If/else statements can be nested to create multiway branches. Loops like for and while are also covered.
Control All
The document discusses various control flow statements in C# including conditional statements like if-else and switch statements. It explains the syntax and usage of if-else, else if, logical and relational operators, switch statement, nested if statements, short-circuit evaluation, and the dangling else problem. It also introduces repetition statements like while to repeatedly execute a block of code as long as a condition is true.
Conditional Statements
This document discusses conditional statements in Python. It introduces if, if-else, and if-elif-else constructs for decision making. Logical operators like and and or are also covered. The ternary operator provides another way to write conditional expressions. The get construct allows implementing conditional logic similar to a switch statement using dictionaries. Examples demonstrate taking input from the user and validating it, finding the greatest of three numbers, and conditionally executing code based on dictionary lookups. Proper indentation is emphasized as it determines code blocks in Python.
Lecture 3
The document discusses various arithmetic, relational, and logical operators in C++. It provides examples of using operators like addition, subtraction, multiplication, division, modulus, comparison, logical AND, logical OR, and logical NOT. It explains concepts like operator precedence and associativity. Code samples are provided to demonstrate the use of various operators in C++ programs.
Savitch_ch_03.ppt
C++ Chapter 3
3.1 Using Boolean Expressions
3.2 Multiway Branches
3.3 More about C++ Loop Statements
3.4 Designing Loops
Java căn bản - Chapter6
This chapter discusses different types of repetition statements in Java including while, do-while, for, and nested loops. It covers implementing repetition using these statements, choosing the appropriate one for a given task, and avoiding common pitfalls like off-by-one errors and infinite loops. Examples are provided to demonstrate generating tables with nested for loops and formatting output using the Formatter class.
Code Tuning
This document discusses various techniques for tuning code performance, including logical approaches like short-circuit evaluation and lookup tables, loop tuning techniques like unswitching and jamming, transforming data to use fewer arrays or integers instead of floats, tuning expressions through algebraic identities and compile-time initialization, and other techniques like inlining, buffer I/O, and handling special cases separately. It emphasizes that tuning code can improve or reduce performance depending on the situation and that measurement is needed to evaluate effects.
[C++][a] tutorial 2
C++ provides various programming constructs including variables, operators, conditionals, and functions. The document outlines the basic program structure in C++ and describes several key elements. It explains that a C++ program contains a main function and optionally additional functions, and source code can be split across multiple files. It then discusses operators like arithmetic, logical, and assignment operators and how they are evaluated based on precedence. Several conditional statements like if-else, for, while, do-while, switch, break and continue are also covered along with examples. Finally, it briefly introduces variable types in C++.
Java căn bản - Chapter5
This document discusses selection statements in Java including if, if-else, nested if, and switch statements. It provides examples of syntax and usage for each statement type. Key topics covered include boolean expressions, relational operators, short-circuit evaluation, operator precedence, comparing objects, and the semantics of == versus equals().
Ecs 10 programming assignment 4 loopapalooza
This document provides instructions for Programming Assignment 4, which involves writing Python functions to solve 6 problems using while loops. The problems involve summing odd numbers, calculating products of powers of 2, printing patterns of asterisks and triangles, and calculating sums and averages involving user-entered numbers. Students are instructed to write the functions in a file called "prog4.py" and submit it on SmartSite.
Algorithm and flowchart
It is CPU subject;s programming Basic thing..it is require for anytype of programs. it makes easy to make program
C programming session 02
This document discusses operators, loops, and formatted input/output functions in C. It covers various categories of operators, how they work, and precedence rules. Loops like for, while and do-while are explained along with break and continue. Formatted I/O functions printf() and scanf() are described, including their syntax and use of format specifiers for input and output of different data types.
C Programing Arithmetic Operators.ppt
The document discusses arithmetic operators in C including addition, subtraction, multiplication, division, and modulus. It provides examples of each operator and notes that division by zero is undefined. It also covers operator precedence and using parentheses to change the order of evaluation. The document recommends developing programs incrementally by adding small pieces of functionality at a time rather than trying to code the whole program at once.
C++ programming
The document discusses various C++ programming concepts including variables, data types, input/output streams, and expressions. It defines variables as memory locations that can store values, and describes different data types like int, double, char. It also covers input with cin, output with cout, and formatting output values.
UNIT 1.pptx
The document provides an overview of computational thinking and problem solving. It discusses key concepts like algorithms, the building blocks of algorithms including statements, state, control flow, functions. It also covers different notations for representing algorithms - pseudocode, flowcharts, programming languages. Some key aspects covered include the definition of an algorithm, properties and qualities of a good algorithm. Examples are provided for different algorithm concepts like finding the minimum/maximum value, sorting cards etc.
Vb.Net 01 To 03 Summary Upload
This document provides an outline and overview of topics covered in VB.NET lessons 1-3, including coding conventions, variables, operators, input/output, conditional statements like If/Then and Select Case, and common math functions. It discusses declaring and assigning variables, arithmetic operators, comparison operators, and examples of getting input from users and using conditional logic. Key concepts around classes, local variables, and short-circuit evaluation are also summarized.
Python unit 2 M.sc cs
This document provides information on Python code structures, including if/else statements, loops (while and for), functions, and arguments. It explains the basic syntax and usage of these structures. Key points covered include:
- How to write if/else statements and the use of conditions like ==, !=, <, >, etc.
- The syntax of while and for loops, and how to use break, continue, else blocks
- What functions are in Python and how to define them with def, pass arguments, and return values
- The basics of calling functions, optional arguments, and nested structures like if/else in loops
Pseudocode
Pseudocode is an outline of a program written in a way that can be easily converted to a programming language. It uses natural language and programming constructs like expressions, methods, decision structures, loops, and array indexing. The three essential programming constructs are selection (if/else), repetition (while loops), and sequence. Pseudocode also uses relational, logical, and arithmetic operators and follows rules like using meaningful names and indenting code blocks.
Daa unit 1
This document provides an introduction to algorithms and their design and analysis. It discusses what algorithms are, their key characteristics, and the steps to develop an algorithm to solve a problem. These steps include defining the problem, developing a model, specifying and designing the algorithm, checking correctness, analyzing efficiency, implementing, testing, and documenting. Common algorithm design techniques like top-down design and recursion are explained. Factors that impact algorithm efficiency like use of loops, initial conditions, invariants, and termination conditions are covered. Finally, common control structures for algorithms like if/else, loops, and branching are defined.
Control statments in c
The document discusses control statements in C programming. It covers various selection statements like if, if-else, switch as well as iteration statements like for, while, do-while loops. Nested loops and special control statements like break, continue and goto are also explained. Operators used in control statements like relational, logical, assignment operators are defined along with examples. The different types of loops and their usages to control program flow are demonstrated.
Similar to Savitch ch 03 (20)
More from Terry Yoast
9781305078444 ppt ch12
This chapter introduces jQuery, a commonly used JavaScript library. It allows developers to select elements, traverse the DOM, manipulate elements, and handle events with minimal code. The chapter covers including the jQuery library, selecting elements with CSS selectors, DOM traversal methods, manipulation methods, specifying event handlers, and animation methods.
9781305078444 ppt ch11
This chapter discusses updating web pages with Ajax. It introduces the XMLHttpRequest object, which allows asynchronous JavaScript requests and responses between a client and server without reloading the page. It covers the steps to make HTTP requests and process responses, including opening and sending requests, receiving data, and handling synchronous vs asynchronous requests. It also discusses techniques for making cross-domain requests, such as using JSON-P or CORS.
9781305078444 ppt ch10
This chapter discusses programming for touchscreens and mobile devices in JavaScript. It covers using touch, pointer, and geolocation events to integrate mouse and touch interactions. It also provides ways to optimize mobile web apps, such as minimizing file sizes and loading scripts responsively. The chapter aims to help developers make their apps accessible and functional across different mobile platforms and input types.
9781305078444 ppt ch09
This chapter discusses managing state information and security in JavaScript. It covers saving state with query strings, hidden form fields, and cookies. Cookies are small pieces of information stored by the web server on the user's computer. The chapter also discusses JavaScript security issues and the same origin policy, which restricts how scripts can access other domains. Web storage is introduced as an alternative to cookies that is easier to use but has less browser support.
9781305078444 ppt ch08
This chapter discusses manipulating data in strings and arrays in JavaScript. It covers string and array properties and methods for parsing, formatting, searching, extracting, replacing, sorting, and combining strings and array elements. The chapter also covers defining and using regular expressions to validate user input.
9781305078444 ppt ch07
This chapter discusses object-oriented programming concepts in JavaScript like encapsulation and interfaces. It covers built-in JavaScript classes like Date, Number, and Math that can be used to manipulate dates, numbers, and perform math functions. The chapter also explains how to define custom JavaScript objects using object literals and constructor functions, and how to add methods and properties to objects.
9781305078444 ppt ch06
This chapter discusses enhancing and validating forms with JavaScript. It covers customizing browser-based validation, implementing custom validation functions to check for errors, and displaying error messages. Some key points covered include validating required fields, dependent fields, and content type with custom functions. It also discusses improving form usability with techniques like removing default selections and dynamically updating fields based on user inputs.
9781305078444 ppt ch05
This document provides an overview of working with the Document Object Model (DOM) and Dynamic HTML (DHTML) in JavaScript. It discusses the browser object model and DOM tree, and how to access and manipulate DOM elements using methods like getElementById(), getElementsByTagName(), and querySelectorAll(). It also covers adding, removing, and cloning DOM nodes. Finally, it discusses the Window, History, Location, and Screen objects and their properties and methods for manipulating the browser window and navigating between pages.
9781305078444 ppt ch04
This chapter discusses debugging and error handling in JavaScript. It covers recognizing different types of errors like syntax errors and logic errors. It also discusses various debugging techniques like using error messages, comments, alerts, console.log(), breakpoints, and the debugger tools in browsers to trace errors. Handling exceptions gracefully with try/catch blocks and implementing custom error handling is also covered.
9781305078444 ppt ch03
This chapter discusses arrays, loops, and conditional statements in JavaScript. It covers how to store data in arrays, access and modify array elements, and determine an array's length. The chapter also explains while, do/while, and for loops for repeatedly executing code. It describes if, if/else, and switch conditional statements for making decisions, including nesting statements and else if constructions.
9781305078444 ppt ch02
This chapter discusses functions, data types, and operators in JavaScript. It covers defining and calling functions, variable scope, built-in and custom functions, primitive and non-primitive data types including strings, numbers, Booleans, and null/undefined. The chapter also explains arithmetic, assignment, comparison, logical, and special operators as well as operator precedence.
9781305078444 ppt ch01
The document discusses the history and components of the World Wide Web and HTML. It introduces JavaScript as a client-side scripting language that allows for interactive web pages. Key points covered include the difference between client-side and server-side scripting, adding JavaScript to web pages using the <script> element, and structuring JavaScript code by placing it in the document body or an external .js file. The document also addresses writing valid JavaScript code that can be validated as XHTML.
9781337102087 ppt ch13
This document discusses overloading and templates in C++. It covers operator overloading, including restrictions and syntax for overloading operators as member and nonmember functions. It also discusses function templates and class templates, explaining that templates allow writing generic code for related functions and classes. Function templates simplify function overloading, while class templates create parameterized types. The document provides examples of overloading operators and creating function and class templates.
9781337102087 ppt ch18
This chapter discusses stacks and queues as data structures. It describes stack operations like push and pop and how to implement stacks as arrays and linked lists. It also covers queue operations and implementations as well as using stacks and queues to solve problems involving infix expressions, recursion removal, and simulations.
9781337102087 ppt ch17
This document discusses linked lists and their implementation in C++. It covers the basic properties of linked lists, including how they are composed of nodes that contain data and a pointer to the next node. The key operations of linked lists are described, such as traversing the list, inserting and deleting nodes, and building the list in both the forward and backward directions. Implementing linked lists as an abstract data type is also covered, including defining iterator classes to iterate through the list.
9781337102087 ppt ch16
This chapter discusses searching, sorting algorithms, and the vector type in C++. It covers sequential search, bubble sort, insertion sort, and binary search algorithms. It also introduces the vector type, which implements a dynamic list that can grow and shrink in size during program execution. Some key operations on vectors include accessing elements, inserting/deleting, and iterating through elements using a range-based for loop.
9781337102087 ppt ch15
The document discusses recursion, including recursive definitions, algorithms, and functions. It defines recursion as solving a problem by reducing it to smaller instances of itself. A recursive definition has a base case that directly solves the simplest problem, and a general case that reduces the problem to a smaller instance. Recursive algorithms are implemented using recursive functions, which call themselves directly or indirectly. The document also compares recursion to iteration and discusses factors like efficiency to consider when choosing an approach.
9781337102087 ppt ch14
The document discusses exception handling in C++. It covers try/catch blocks for handling exceptions, throwing exceptions, and creating custom exception classes. The key aspects are using try/catch blocks to handle exceptions, throwing exceptions within try blocks, and creating exception classes that inherit from the base exception class. Catch blocks specify the exception type and contain handling code. Exceptions not caught will terminate the program through stack unwinding.
9781337102087 ppt ch12
This chapter covers pointers, classes, virtual functions, and abstract classes in C++. It discusses pointer variables and how to declare and manipulate them. It covers using pointers with classes and structs, as well as dynamic variables created with new and delete. The chapter also explores pointers with inheritance and polymorphism through virtual functions and abstract classes. It addresses issues like shallow vs deep copying when using pointers with classes.
9781337102087 ppt ch11
This document provides an overview of inheritance and composition in C++. It discusses key concepts such as derived classes inheriting properties from base classes, redefining member functions of base classes in derived classes, how constructors and destructors work in inheritance hierarchies, and the differences between inheritance, aggregation, and composition relationships between classes. The document also covers stream class hierarchies and the three main types of inheritance: public, protected, and private.
More from Terry Yoast (20)
Recently uploaded
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
THE SACRIFICE HOW PRO-PALESTINE PROTESTS STUDENTS ARE SACRIFICING TO CHANGE T...
The recent surge in pro-Palestine student activism has prompted significant responses from universities, ranging from negotiations and divestment commitments to increased transparency about investments in companies supporting the war on Gaza. This activism has led to the cessation of student encampments but also highlighted the substantial sacrifices made by students, including academic disruptions and personal risks. The primary drivers of these protests are poor university administration, lack of transparency, and inadequate communication between officials and students. This study examines the profound emotional, psychological, and professional impacts on students engaged in pro-Palestine protests, focusing on Generation Z's (Gen-Z) activism dynamics. This paper explores the significant sacrifices made by these students and even the professors supporting the pro-Palestine movement, with a focus on recent global movements. Through an in-depth analysis of printed and electronic media, the study examines the impacts of these sacrifices on the academic and personal lives of those involved. The paper highlights examples from various universities, demonstrating student activism's long-term and short-term effects, including disciplinary actions, social backlash, and career implications. The researchers also explore the broader implications of student sacrifices. The findings reveal that these sacrifices are driven by a profound commitment to justice and human rights, and are influenced by the increasing availability of information, peer interactions, and personal convictions. The study also discusses the broader implications of this activism, comparing it to historical precedents and assessing its potential to influence policy and public opinion. The emotional and psychological toll on student activists is significant, but their sense of purpose and community support mitigates some of these challenges. However, the researchers call for acknowledging the broader Impact of these sacrifices on the future global movement of FreePalestine.
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdaneA Visual Guide to 1 Samuel | A Tale of Two Hearts
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Wound healing PPT
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...Nguyen Thanh Tu Collection
https://app.box.com/s/qhtvq32h4ybf9t49ku85x0n3xl4jhr15Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...
Andreas Schleicher, Director of Education and Skills at the OECD presents at the launch of PISA 2022 Volume III - Creative Minds, Creative Schools on 18 June 2024.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
Recently uploaded (20)
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
THE SACRIFICE HOW PRO-PALESTINE PROTESTS STUDENTS ARE SACRIFICING TO CHANGE T...
THE SACRIFICE HOW PRO-PALESTINE PROTESTS STUDENTS ARE SACRIFICING TO CHANGE T...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...
Andreas Schleicher presents PISA 2022 Volume III - Creative Thinking - 18 Jun...
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Savitch ch 03
- 2. Chapter 3 More Flow of Control
- 5. 3.1 Using Boolean Expressions
- 46. 3.3 More About C++ Loop Statements
- 97. Chapter 3 -- End Slide 3-
- 98. Display 3.1 Slide 3- Back Next
- 99. Display 3.2 Slide 3- Back Next
- 100. Display 3.3 Slide 3- Back Next
- 101. Display 3.4 Slide 3- Back Next
- 102. Display 3.5 (1/2) Slide 3- Back Next
- 103. Display 3.5 (2/2) Slide 3- Back Next
- 104. Display 3.6 (1/2) Slide 3- Back Next
- 105. Display 3.6 (2/2) Slide 3- Back Next
- 106. Display 3.7 (1/2) Slide 3- Back Next
- 107. Display 3.7 (2/2) Slide 3- Back Next
- 108. Display 3.8 (1/2) Slide 3- Next Back
- 109. Display 3.8 (2/2) Slide 3- Back Next
- 110. Display 3.9 Slide 3- Back Next
- 111. Display 3.10 Slide 3- Next Back
- 112. Display 3.11 Slide 3- Back Next
- 113. Display 3.12 Slide 3- Back Next
- 114. Display 3.13 Slide 3- Back Next
- 115. Display 3.14 Slide 3- Back Next
- 116. Display 3.15 Slide 3- Next Back