Presentation is loading. Please wait.

Presentation is loading. Please wait.

Selection—Making Decisions

Published byErin Sanders Modified over 5 years ago

Similar presentations

Presentation on theme: "Selection—Making Decisions"— Presentation transcript:

1 Selection—Making Decisions
Chapter 5 Selection—Making Decisions Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical operators: and, or, and not ❏ To understand how a C program evaluates a logical expression ❏ To write programs using logical and comparative operators ❏ To write programs that use two-way selection: if ... else statements ❏ To write programs that use multi-way selection: switch and else ...if ❏ To understand C’s classification of characters ❏ To write programs that use C’s character functions ❏ To be able to design a structure chart that specifies function selection Computer Science: A Structured Programming Approach Using C

2 Topics discussed in this section:
5-1 Logical Data and Operators A piece of data is called logical if it conveys the idea of true or false. In real life, logical data (true or false) are created in answer to a question that needs a yes–no answer. In computer science, we do not use yes or no, we use true or false. Topics discussed in this section: Logical Data in C Logical Operators Evaluating Logical Expressions Comparative Operators Computer Science: A Structured Programming Approach Using C

3 FIGURE 5-1 true and false on the Arithmetic Scale
Computer Science: A Structured Programming Approach Using C

4 FIGURE 5-2 Logical Operators Truth Table
Computer Science: A Structured Programming Approach Using C

5 FIGURE 5-3 Short-circuit Methods for and /or
Computer Science: A Structured Programming Approach Using C

6 PROGRAM 5-1 Logical Expressions
Computer Science: A Structured Programming Approach Using C

7 PROGRAM 5-1 Logical Expressions
Computer Science: A Structured Programming Approach Using C

8 FIGURE 5-4 Relational Operators
Computer Science: A Structured Programming Approach Using C

9 FIGURE 5-5 Comparative Operator Complements
Computer Science: A Structured Programming Approach Using C

10 Examples of Simplifying Operator Complements
Table 5-1 Examples of Simplifying Operator Complements Computer Science: A Structured Programming Approach Using C

11 Comparative Operators
PROGRAM 5-2 Comparative Operators Computer Science: A Structured Programming Approach Using C

12 Comparative Operators
PROGRAM 5-2 Comparative Operators Computer Science: A Structured Programming Approach Using C

Download ppt "Selection—Making Decisions"

Similar presentations

Decision Structures - If / Else If / Else. Decisions Often we need to make decisions based on information that we receive. Often we need to make decisions.

Decision Structures - If / Else If / Else. Decisions Often we need to make decisions based on information that we receive. Often we need to make decisions.
Chapter 4: Control Structures I (Selection)

Chapter 4: Control Structures I (Selection)
Copyright © 2002 Pearson Education, Inc. Slide 1.

Copyright © 2002 Pearson Education, Inc. Slide 1.
Chapter 2 Flow of Control. Copyright © 2006 Pearson Addison-Wesley. All rights reserved. 2-2 Learning Objectives Boolean Expressions Building, Evaluating.

Chapter 2 Flow of Control. Copyright © 2006 Pearson Addison-Wesley. All rights reserved. 2-2 Learning Objectives Boolean Expressions Building, Evaluating.
Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 13-2 Control Structures Conditional.

Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional.
Class 9.1 Chapter 4 Sections: 4.1, 4.2, 4.3

Class 9.1 Chapter 4 Sections: 4.1, 4.2, 4.3
Computer Science 101 Circuit Design Algorithm. Circuit Design - The Problem The problem is to design a circuit that accomplishes a specified task. The.

Computer Science 101 Circuit Design Algorithm. Circuit Design - The Problem The problem is to design a circuit that accomplishes a specified task. The.
Computer Science: A Structured Programming Approach Using C1 14-4 Masks In many programs, bits are used as binary flags: 0 is off, and 1 is on. To set.

Computer Science: A Structured Programming Approach Using C Masks In many programs, bits are used as binary flags: 0 is off, and 1 is on. To set.
Computer Science 101 The Boolean System. George Boole British mathematician (1815-1864) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.

Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
Think about the following expression If the number entered is greater than 15 but less than 25 or the number is 100 and the letter chosen is after p but.

Think about the following expression If the number entered is greater than 15 but less than 25 or the number is 100 and the letter chosen is after p but.
Apply Properties of Rational Exponents

Apply Properties of Rational Exponents
1 CSC 1401 S1 Computer Programming I Hamid Harroud School of Science and Engineering, Akhawayn University

1 CSC 1401 S1 Computer Programming I Hamid Harroud School of Science and Engineering, Akhawayn University
CS 101E – Exam 2 Review Spring 2007 Michele Co. Announcements Review Session Tonight, 7/7:30 p.m., OLS 009 Will be announced via email In-class Exam Wednesday.

CS 101E – Exam 2 Review Spring 2007 Michele Co. Announcements Review Session Tonight, 7/7:30 p.m., OLS 009 Will be announced via In-class Exam Wednesday.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.

Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
1 Week 2: Variables and Assignment Statements READING: 1.4 – 1.6 EECS 1541 -- Introduction to Computing for the Physical Sciences.

1 Week 2: Variables and Assignment Statements READING: 1.4 – 1.6 EECS Introduction to Computing for the Physical Sciences.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical.

Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical.
Computer Science: A Structured Programming Approach Using C1 5-3 Multiway Selection In addition to two-way selection, most programming languages provide.

Computer Science: A Structured Programming Approach Using C1 5-3 Multiway Selection In addition to two-way selection, most programming languages provide.
1 Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical operators: and, or, and not ❏ To understand how a C program.

1 Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical operators: and, or, and not ❏ To understand how a C program.
Computer Science: A Structured Programming Approach Using C1 5-2 Two-Way Selection The decision is described to the computer as a conditional statement.

Computer Science: A Structured Programming Approach Using C1 5-2 Two-Way Selection The decision is described to the computer as a conditional statement.

Similar presentations

Ads by Google