PROGRAM DESIGN TOOLS. Algorithms, Flow Charts, Pseudo codes and Decision Tables. Designed by Parul Khurana, LIECA.
|
|
- Agnes Stevenson
- 6 years ago
- Views:
Transcription
1 PROGRAM DESIGN TOOLS Algorithms, Flow Charts, Pseudo codes and Decision Tables
2 Pseudo-Code Pseudo-code is another programming tool that is used for planning the program. The word pseudo means imitation or false and the word code refers to the instruction written in a programming language. Pseudo-code, therefore is an imitation of actual computer instructions. These pseudo instructions are phrases written in English like statements.
3 Pseudo-Code Instead of using symbols to describe the logic of the program, as in flowcharts, pseudo-code uses a structure that resembles computer instructions. Because, it emphasizes the design of the program, pseudo-code is also called Program Design Language ( PDL ).
4 Pseudo-Code Pseudo-code is made up of the following basic logic structures that have been proved to be sufficient for writing any computer program» Sequence» Selection (If then Endif, If then Else Endif)» Iteration (For Endfor, While Endwhile, Do While)
5 Pseudo-Code - Sequence Sequence logic is used for performing instructions one after another in sequence. Thus, for sequence logic, pseudo-code instructions are written in the sequence in which they are to be executed. The flow of logic is from top to bottom. instruction -1 instruction -2 instruction -3 Instruction -1 Instruction -2 Instruction -3
6 Pseudo-Code - Selection Selection logic, also known as decision logic, is used for making decision. It is used for selecting a proper path out of the alternative paths in the programming logic. Decision logic is depicted as either if then Endif or an If then Else Endif structure.
7 Pseudo-Code - Selection if then Endif selection structure If ( expression ) then statement Endif expression false true statement
8 Pseudo-Code - Selection if then Else Endif selection structure If ( expression ) then statement -1 Else statement -2 Endif false Statement-2 expression true Statement-1
9 Pseudo-Code - Iterative Iterative logic, is used to produce loops when one or more instructions are to be executed several times depending on some expressions. It uses three loop structures called For Endfor, While Endwhile and Do While.
10 Pseudo-Code - Iterative For Endfor iterative structure For k=r to s by t do Endfor statement It uses an index variable k to control the loop. Here r is called the initial value, s is called the For k=r to s by t do statement final value and t is called the step size, which may be positive (increment) or negative Designed ( decrement by Parul Khurana, LIECA. ). k
11 Pseudo-Code - Iterative While Endwhile iterative structure While ( expression ) do statement Endwhile expression true statement false
12 Pseudo-Code - Iterative Do While iterative structure Do statement While ( expression ) true statement expression false
13 Pseudo-Code - Description The format for the formal presentation of the pseudo-code consists of two parts The first part, which is optional, describes the input data, the purpose of the algorithm and identifies the variables used in the pseudo-code. The second part is composed of sequence of instructions that lead to the solution of the problem.
14 Pseudo-Code - Example Pseudo-code to display the nature of roots of a quadratic equation of the type ax 2 + bx + c = 0 provided a 0
15 Pseudo-Code - Example Begin Read a, b, c Set disc = b 2-4ac If ( disc < 0 ) then Print roots are imaginary Else If ( disc > 0) then Print roots are real and distinct Else Print roots are real and equal Endif Endif End
16 Decision-Table A decision table is another program development tool that is used as a supplement along with flowcharts. This tool is particularly useful in problems which involve complex decision making.
17 Decision-Table A decision table shown in Figure, is a special table that is divided into four parts by a pair of horizontal and vertical lines. R 1 R 2 R 3... R n Condition Stub C 1 C 2. Condition Row Condition Entries. C k A 1 Action Stub A 2. Action Row Action Entries. A m
18 Decision-Table The part above horizontal double lines pertains to the conditions being listed, i.e., questions being asked and, the outcomes of these tests, i.e., the answers to these questions. The part of the left of vertical double lines in the top portion, i.e., above horizontal double lines, lists the conditions (C is ) is known as the Condition Stub.
19 Decision-Table The part of the right of vertical double lines in the top portion lists the answers to these questions, namely Yes or No ( which are usually abbreviated as Y and N), and is known as Conditions Entries. Each row in the top half of the table listing a question and its answer is known as Condition Row. The bottom half of the decision table, i.e., the part below the pair of horizontal lines, lists the actions to be performed.
20 Decision-Table The left part of the bottom portion is known as Action Stub, and in it the actions (A is ) to be carried out are listed. The right part of the bottom portion has crosses X and dashes - to be carried out are listed. A cross indicates that the action in that row is to be performed and a dash indicates that the action is not to be performed. These are called Action Entries. Each row in the lower portion is called an Action Row. The columns to the right of the vertical pair of double lines are called Rules (R is ).
21 Types of Decision-Tables Decision tables are of the following types Limited Entry Decision Tables A decision table in which question is written in the condition stub and their answers in the condition entry part, is called limited entry decision table. Extended Entry Decision Tables There are number of problems in which a question can have multiple answers, then it can be expressed more precisely if the question is extended into the condition entry part of the decision table. Such a decision table in which a question is written in the condition stub and their answers in the condition entry part, is called extended entry decision table. Mixed Entry Decision Tables A decision table in which some questions are extended into the condition entry part and others are limited to the condition stub, is called mixed entry decision table.
22 Example- Decision-Table A commercial bank uses the following rules to classify new accounts If the depositor s age is 21 or above and if the deposit is Rs. 1000/- or more, classify the account as account A. If the depositor s age is under 21 and if the deposit is Rs. 1000/- or more, classify the account as account B. If the depositor s age is 21 or above and if the deposit is below Rs. 1000/-, classify the account as account C. If the depositor s age is under 21 and if the deposit is below Rs. 1000/-, do not open the account. Construct a limited entry decision table corresponding to the verbal statement given above to classify a new account.
23 Example- Decision-Table - Solution In order to obtain a decision table, first separate, from each sentence, parts that specify conditions, and another part that specify a specific actions that are to be performed based on the results obtained by testing these conditions. For the above problem, the relevant condition clauses and actions are separated and marked as shown below Rule 1 If the depositor s age is 21 or above (Condition 1) and if the deposit is Rs. 1000/- or more (Condition 2), classify the account as account A (Action 1). Rule 2 If the depositor s age is under 21 (Condition 3) and if the deposit is Rs. 1000/- or more (Condition 2), classify the account as account B(Action 2).
24 Example- Decision-Table - Solution Rule 3 If the depositor s age is 21 or above (Condition 1) and if the deposit is below Rs. 1000/- (Condition 4), classify the account as account C (Action 3). Rule 4 If the depositor s age is under 21 (Condition 3) and if the deposit is below Rs. 1000/- (Condition 4), do not open the account(action 4).
25 Example- Decision-Table - Solution The total conditions tested and actions to be taken are isolated and rewritten below in the concise form Condition 1 Depositor s age 21 Condition 2 Deposit Rs. 1000/- Condition 3 Depositor s age < 21 Condition 4 Deposit < Rs. 1000/- Action 1 Classify the account as account A. Action 2 Classify the account as account B. Action 3 Classify the account as account C. Action 4 Do not open account. Observe that the condition-1 and condition-3 are not independent, rather they are complementary, i.e., if the answer to the question Is depositor s age 21? is NO, the answer to the question Is depositor s age < 21? is Yes, and vice versa. Similarly, condition 2 and condition-4 are complementary.
26 Example- Decision-Table - Solution The purpose of this illustration is that, there is no need to include the complementary conditions. Therefore, instead of testing four conditions, the problem can be solved by testing just following two conditions Condition 1 Depositor s age 21 Condition 2 Deposit Rs. 1000/- Using this, rules can be expressed in limited entry decision table as shown below R 1 R 2 R 3 R 4 C 1 Depositor s age 21? Yes No Yes No C 2 Deposit 1000? Yes Yes No No A 1 Classify account as account A X A 2 Classify account as account B - X - - A 3 Classify account as account C - - X - A 4 Do not open account X
27 Practice Questions Generate the pseudo-code to compute sum and average of 5 values. Generate the pseudo-code to determine whether the number is positive or negative or zero. Write the pseudo-code to find the largest of three numbers. Write the pseudo-code to check if the given number is prime or not. Write the pseudo-code to check if the given number is even or odd; without using 2 anywhere in the code.
28 Practice Questions Sweet Corporation Ltd. markets chocolates and candies to stores, wholesalers and government agencies, with the following discount policies- If the order is from a store for amount up to Rs. 5000/-, the discount is 5%, otherwise 7.5%. If the order is from wholesalers for amount up to Rs /-, the discount is 7.5%, otherwise 12%. The discount is 6% for government agencies irrespective of the amount of order. On chocolates, a flat discount of 5% is given irrespective order amount and customer type. Construct limited, extended and mixed entry decision tables corresponding to this.
PROGRAM DESIGN TOOLS. Algorithms, Flow Charts, Pseudo codes and Decision Tables. Designed by Parul Khurana, LIECA.
PROGRAM DESIGN TOOLS Algorithms, Flow Charts, Pseudo codes and Decision Tables Introduction The various tools collectively referred to as program design tools, that helps in planning the program are:-
More informationPSEUDOCODE AND FLOWCHARTS. Introduction to Programming
PSEUDOCODE AND FLOWCHARTS Introduction to Programming What s Pseudocode? Artificial and Informal language Helps programmers to plan an algorithm Similar to everyday English Not an actual programming language
More informationThe Further Mathematics Support Programme
The Further Mathematics Support Programme Algorithms An algorithm is a precise set of instructions which is used to accomplish a specific process. We come across algorithms in every-day life, for example:
More informationUNDERSTANDING PROBLEMS AND HOW TO SOLVE THEM BY USING COMPUTERS
UNDERSTANDING PROBLEMS AND HOW TO SOLVE THEM BY USING COMPUTERS INTRODUCTION TO PROBLEM SOLVING Introduction to Problem Solving Understanding problems Data processing Writing an algorithm CONTINUE.. Tool
More informationALGORITHMS AND FLOWCHARTS
ALGORITHMS AND FLOWCHARTS ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence of steps that describe solution of problem
More informationPROCESS SPECIFICATION
MODULE 6 PROCESS SPECIFICATIO OBJECTIVE QUESTIOS There are 4 alternative answers to each question. One of them is correct. Pick the correct answer. Do not guess. A key is given at the end of the module
More informationCSC 121 Spring 2017 Howard Rosenthal
CSC 121 Spring 2017 Howard Rosenthal Agenda To be able to define computer program, algorithm, and highlevel programming language. To be able to list the basic stages involved in writing a computer program.
More informationExamples for Algorithm,Pseduocode,Flowchart
1 Examples for,pseduocode,flowchart Example: Finding the area of a circle Step2: Read the value of r Step3: Calculate area = 3.14*r*r Step4: Print area Step5: Stop Set area READ the r COMPUTE area=3.14*r*r
More informationCS 199 Computer Programming. Spring 2018 Lecture 2 Problem Solving
CS 199 Computer Programming Spring 2018 Lecture 2 Problem Solving ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING DEPARTMENT OF CSE Presented By Thillaiarasu.N SCRAMBLE 2 Solution 3 What is Pseudocode? 4 Consists of: Short Readable Formally styled English language Used for: Explaining the
More informationSystems Development and Documentation Techniques. Lecture 2. (Chapter 3)
Systems Development and Documentation Techniques Lecture 2 (Chapter 3) Introduction This chapter explains the most common systems documentation tools and techniques. 1 Data flow diagrams 2 Document flowcharts
More informationChapter 1: Number and Operations
Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply
More informationPDS Lab Section 16 Autumn Tutorial 3. C Programming Constructs
PDS Lab Section 16 Autumn-2017 Tutorial 3 C Programming Constructs This flowchart shows how to find the roots of a Quadratic equation Ax 2 +Bx+C = 0 Start Input A,B,C x B 2 4AC False x If 0 True B x 2A
More informationUnit-II Programming and Problem Solving (BE1/4 CSE-2)
Unit-II Programming and Problem Solving (BE1/4 CSE-2) Problem Solving: Algorithm: It is a part of the plan for the computer program. An algorithm is an effective procedure for solving a problem in a finite
More informationAlgorithm. Building blocks of algorithm
UNIT I ALGORITHMIC PROBLEM SOLVING 9 Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudo code, flow chart, programming language), algorithmic problem
More informationPseudocode. ARITHMETIC OPERATORS: In pseudocode arithmetic operators are used to perform arithmetic operations. These operators are listed below:
Pseudocode There are 3 programming/pseudocode constructs: 1. Sequence: It refers that instructions should be executed one after another. 2. Selection: This construct is used to make a decision in choosing
More informationMore About Factoring Trinomials
Section 6.3 More About Factoring Trinomials 239 83. x 2 17x 70 x 7 x 10 Width of rectangle: Length of rectangle: x 7 x 10 Width of shaded region: 7 Length of shaded region: x 10 x 10 Area of shaded region:
More informationProgramming Logic and Design Sixth Edition
Objectives Programming Logic and Design Sixth Edition Chapter 4 Making Decisions In this chapter, you will learn about: Evaluating Boolean expressions to make comparisons The relational comparison operators
More informationSNS COLLEGE OF ENGINEERING,
SNS COLLEGE OF ENGINEERING, COIMBATORE Department of Computer Science and Engineering QUESTION BANK(PART A) GE8151 - PROBLEM SOLVING AND PYTHON PROGRAMMING TWO MARKS UNIT-I 1. What is computer? Computers
More informationAdd Binary Numbers What is the largest decimal number you can represent using 3 bits?
1 2 Quiz1 Question Add Binary Numbers 1 0 1 1 a) 1 0 1 0 1 0 +1 0 0 0 b) 0 1 0 0 1 1 1 0 0 1 1 c) 0 1 0 0 0 1 d) 0 1 0 1 1 1 e) none 001011 001000 010011 Quiz1 question What is the largest decimal number
More informationUnit 3, Lesson 3.1 Creating and Graphing Equations Using Standard Form
Unit 3, Lesson 3.1 Creating and Graphing Equations Using Standard Form Imagine the path of a basketball as it leaves a player s hand and swooshes through the net. Or, imagine the path of an Olympic diver
More informationPROBLEM SOLVING AND PYTHON PROGRAMMING
ALGORITHM UNIT-1 It is defined as a sequence of instructions that describe a method for solving a problem. In other words it is a step by step procedure for solving a problem. Properties of Algorithms
More informationUNIVERSITY OF ENGINEERING & MANAGEMENT, KOLKATA C ASSIGNMENTS
UNIVERSITY OF ENGINEERING & MANAGEMENT, KOLKATA C ASSIGNMENTS All programs need to be submitted on 7th Oct 206 by writing in hand written format in A4 sheet. Flowcharts, algorithms, source codes and outputs
More informationCHAPTER 2 PROBLEM SOLVING TECHNIQUES. Mr Mohd Hatta Bin Hj Mohamed Ali Computer Programming BFC2042
CHAPTER 2 PROBLEM SOLVING TECHNIQUES Mr Mohd Hatta Bin Hj Mohamed Ali Computer Programming BFC2042 Software Engineering vs Problem Solving Software Engineering - A branch of Computer Science & provides
More informationECOR Come to the PASS workshop with your mock exam complete. During the workshop you can work with other students to review your work.
It is most beneficial to you to write this mock midterm UNDER EXAM CONDITIONS. This means: Complete the midterm in 1.5 hour(s). Work on your own. Keep your notes and textbook closed. Attempt every question.
More informationPseudocode Structure 5th October 2018
Pseudocode Structure 5 th October 2018 Unit 1 Objective To apply language set of rules in writing Algorithm Learning outcome Students are expected to apply symbols to write algorithm in flowchart diagram
More information1 Information system An information system is the combination of technology(computers) and people that enable an organization to collect data, store them, and transform them into information Data Data
More informationComputer System and programming in C
Approaches to Problem Solving Concept of algorithm and flow charts ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence
More informationFUNDAMENTALS OF COMPUTING & COMPUTER PROGRAMMING UNIT III. 2 Marks PROBLEM SOLVING AND OFFICE AUTOMATION
FUNDAMENTALS OF COMPUTING & COMPUTER PROGRAMMING UNIT III 2 Marks PROBLEM SOLVING AND OFFICE AUTOMATION Planning the Computer Program Purpose Algorithm Flow Charts Pseudocode -Application Software Packages-
More informationCHAPTER 9: Quadratic Equations and Functions
Notes # CHAPTER : Quadratic Equations and Functions -: Exploring Quadratic Graphs A. Intro to Graphs of Quadratic Equations: = ax + bx + c A is a function that can be written in the form = ax + bx + c
More informationAlignment to the Texas Essential Knowledge and Skills Standards
Alignment to the Texas Essential Knowledge and Skills Standards Contents Kindergarten... 2 Level 1... 4 Level 2... 6 Level 3... 8 Level 4... 10 Level 5... 13 Level 6... 16 Level 7... 19 Level 8... 22 High
More informationQUADRATIC FUNCTIONS TEST REVIEW NAME: SECTION 1: FACTORING Factor each expression completely. 1. 3x p 2 16p. 3. 6x 2 13x 5 4.
QUADRATIC FUNCTIONS TEST REVIEW NAME: SECTION 1: FACTORING Factor each expression completely. 1. 3x 2 48 2. 25p 2 16p 3. 6x 2 13x 5 4. 9x 2 30x + 25 5. 4x 2 + 81 6. 6x 2 14x + 4 7. 4x 2 + 20x 24 8. 4x
More informationSuggestive List of C++ Programs
Suggestive List of C++ Programs 1. Write a C++ program to display Hello World! on the output screen. 2. Write a program to display Multiplication Table of a number inputted by the user. 3. Write a program
More informationFLOW CHART AND PSEUDO CODE
FLOW CHART AND PSEUDO CODE Flowchart A Flowchart is a pictorial representation of an algorithm. The First flowchart is made by John Von Newman in 1945. It is a symbolic diagram of operation sequence, dataflow,
More informationAlgorithms, Part 2 of 3. Topics Problem Solving Examples Pseudocode Control Structures
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode Control Structures 1 Problem Solving Decode this sentence: Pdeo eo pda yknnayp wjosan. We have just come up with a specific solution to
More informationLAB 1 Perl I. To get the lab approved, send your code to:
LAB 1 Perl I To get the lab approved, send your code to: david.sundell@plantphys.umu.se Installation OBS: On the course computers these programs are already installed! ActivePerl: http://www.activestate.com/activeperl
More informationA-SSE.1.1, A-SSE.1.2-
Putnam County Schools Curriculum Map Algebra 1 2016-2017 Module: 4 Quadratic and Exponential Functions Instructional Window: January 9-February 17 Assessment Window: February 20 March 3 MAFS Standards
More informationTABLE OF CONTENTS 2 CHAPTER 1 3 CHAPTER 2 4 CHAPTER 3 5 CHAPTER 4. Algorithm Design & Problem Solving. Data Representation.
2 CHAPTER 1 Algorithm Design & Problem Solving 3 CHAPTER 2 Data Representation 4 CHAPTER 3 Programming 5 CHAPTER 4 Software Development TABLE OF CONTENTS 1. ALGORITHM DESIGN & PROBLEM-SOLVING Algorithm:
More informationSECTION 1.3: BASIC GRAPHS and SYMMETRY
(Section.3: Basic Graphs and Symmetry).3. SECTION.3: BASIC GRAPHS and SYMMETRY LEARNING OBJECTIVES Know how to graph basic functions. Organize categories of basic graphs and recognize common properties,
More informationPITSCO Math Individualized Prescriptive Lessons (IPLs)
Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define
More informationIteration. # a and b are now equal # a and b are no longer equal Multiple assignment
Iteration 6.1. Multiple assignment As you may have discovered, it is legal to make more than one assignment to the same variable. A new assignment makes an existing variable refer to a new value (and stop
More informationSecond Term ( ) Department of Computer Science Foundation Year Program Umm Al Qura University, Makkah
COMPUTER PROGRAMMING SKILLS (4800153-3) CHAPTER 5: REPETITION STRUCTURE Second Term (1437-1438) Department of Computer Science Foundation Year Program Umm Al Qura University, Makkah Table of Contents Objectives
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationNumber System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value
1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural
More informationAQA Decision 1 Algorithms. Section 1: Communicating an algorithm
AQA Decision 1 Algorithms Section 1: Communicating an algorithm Notes and Examples These notes contain subsections on Flow charts Pseudo code Loops in algorithms Programs for the TI-83 graphical calculator
More informationFoundations for Functions Knowledge and Skills: Foundations for Functions Knowledge and Skills:
Texas University Interscholastic League Contest Event: Mathematics The 40-minute, 60-question contest is designed to test knowledge and understanding in the areas of algebra I and II, geometry, trigonometry,
More informationAlgebra II: Strand 3. Quadratic Functions; Topic 2. Digging Deeper; Task 3.2.1
1 TASK 3..1: PUTTING IT TOGETHER Solutions 1. Each of the following quadratic functions is given in standard form ( y = ax + bx + c ). For each function: Transform the function to the form y = a(x h) +
More informationChapter 4 C Program Control
1 Chapter 4 C Program Control Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 2 Chapter 4 C Program Control Outline 4.1 Introduction 4.2 The Essentials of Repetition
More informationPROGRAMMING IN C AND C++:
PROGRAMMING IN C AND C++: Week 1 1. Introductions 2. Using Dos commands, make a directory: C:\users\YearOfJoining\Sectionx\USERNAME\CS101 3. Getting started with Visual C++. 4. Write a program to print
More informationMODULE 6 PROCESS SPECIFICATION
MODULE 6 PROCESS SPECIFICATION Learning Units 6.1 Structured English specification 6.2 Decision table based specifications 6.3 Detecting -Incompleteness -Ambiguity -Contradictions -Redundancy in decision
More informationCollege Readiness (597 topics) Course Name: College Prep Math Spring 2014 Course Code: ARTD4-3N6XJ
Course Name: College Prep Math Spring 2014 Course Code: ARTD4-3N6XJ ALEKS Course: Math for College Readiness Instructor: Ms. Dalton Course Dates: Begin: 01/19/2015 End: 06/18/2015 Course Content: 606 Topics
More informationIllinois Math Assessment Framework, Grade 7. correlated to
Illinois Math Assessment Framework, Grade 7 correlated to Grade 7 correlated to Chapter 1 Variables, Expressions, and Integers (pp. 1 61) Lesson 1.1 (pp. 5 9) Expressions and Variables Evaluate and write
More informationChapter Two: Program Design Process and Logic
Chapter Two: Program Design Process and Logic 2.1 Chapter objectives Describe the steps involved in the programming process Understand how to use flowchart symbols and pseudocode statements Use a sentinel,
More informationComputer Fundamentals: Pradeep K. Sinha & Priti Sinha
Computer Fundamentals Pradeep K. Sinha Priti Sinha Chapter 11 Planning the Chapter 11: Planning Computer the Program Program Slide 1/50 Learning Objectives In this chapter you will learn about: Programs
More informationAlgebra II Quadratic Functions
1 Algebra II Quadratic Functions 2014-10-14 www.njctl.org 2 Ta b le o f C o n te n t Key Terms click on the topic to go to that section Explain Characteristics of Quadratic Functions Combining Transformations
More informationQUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY. 7.1 Minimum/Maximum, Recall: Completing the square
CHAPTER 7 QUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY 7.1 Minimum/Maximum, Recall: Completing the square The completing the square method uses the formula x + y) = x + xy + y and forces
More informationUnit 1 Lesson 4. Introduction to Control Statements
Unit 1 Lesson 4 Introduction to Control Statements Essential Question: How are control loops used to alter the execution flow of a program? Lesson 4: Introduction to Control Statements Objectives: Use
More informationLecture_Module3 Prof Saroj Kaushik, IIT Delhi
Lecture_Module3 Problem definition Method (how to solve it) Algorithm Data structure Verification for correctness Analysis for efficiency Coding in given programming language Understanding of computer
More informationUnit 1 Quadratic Functions
Unit 1 Quadratic Functions This unit extends the study of quadratic functions to include in-depth analysis of general quadratic functions in both the standard form f ( x) = ax + bx + c and in the vertex
More informationTable of Contents. Unit 5: Quadratic Functions. Answer Key...AK-1. Introduction... v
These materials may not be reproduced for any purpose. The reproduction of any part for an entire school or school system is strictly prohibited. No part of this publication may be transmitted, stored,
More informationPROBLEM SOLVING AND PROGRAM. Looping statements Executing steps many times
PROBLEM SOLVING AND PROGRAM Looping statements Executing steps many times LOOPING What if there are a number of steps that must be done several times, would you re-write those steps for each time you needed
More informationEECS1012. Net-centric Introduction to Computing. Lecture 7 Computational Thinking. Fall 2018, EECS York University. M.S. Brown and Amir H.
EECS1012 Net-centric Introduction to Computing Lecture 7 Computational hinking all 2018, EECS York University M.S. Brown and Amir H. Chinaei overview computational thinking the thought process involved
More informationChapter 1. Linear Equations and Straight Lines. 2 of 71. Copyright 2014, 2010, 2007 Pearson Education, Inc.
Chapter 1 Linear Equations and Straight Lines 2 of 71 Outline 1.1 Coordinate Systems and Graphs 1.4 The Slope of a Straight Line 1.3 The Intersection Point of a Pair of Lines 1.2 Linear Inequalities 1.5
More informationCMPE Experiment 3 Selective Structures
Page1 CMPE 108 - Experiment 3 Selective Structures OBJECTIVES: Understand how to edit, compile and execute C computer codes. Understand C programming: sequential and selective structures NOTES: You should
More information2.2 (a) Statement, subroutine, procedure, function, parameter, loop
Chapter 2.2: The structure of procedural programs 2.2 (a) Statement, subroutine, procedure, function, parameter, loop Procedural programs are ones in which instructions are executed in the order defined
More informationCS111: PROGRAMMING LANGUAGE1. Lecture 2: Algorithmic Problem Solving
CS111: PROGRAMMING LANGUAGE1 Lecture 2: Algorithmic Problem Solving Agenda 2 Problem Solving Techniques Pseudocode Algorithm Flow charts Examples How People Solve Problems 3 A Problem exists when what
More informationCommon Core Vocabulary and Representations
Vocabulary Description Representation 2-Column Table A two-column table shows the relationship between two values. 5 Group Columns 5 group columns represent 5 more or 5 less. a ten represented as a 5-group
More informationAlgorithm Discovery and Design. Why are Algorithms Important? Representing Algorithms. Chapter 2 Topics: What language to use?
Algorithm Discovery and Design Chapter 2 Topics: Representing Algorithms Algorithmic Problem Solving CMPUT101 Introduction to Computing (c) Yngvi Bjornsson & Jia You 1 Why are Algorithms Important? If
More informationMiddle School Math Course 2
Middle School Math Course 2 Correlation of the ALEKS course Middle School Math Course 2 to the Indiana Academic Standards for Mathematics Grade 7 (2014) 1: NUMBER SENSE = ALEKS course topic that addresses
More informationSection 1.1 Patterns in Division
Section 1.1 Patterns in Division Divisibility refers to whether or not a number is divisible by another number. If a number divides evenly into another number (no remainder), then it is divisible by that
More informationAbacus 5 and 6: Autumn term 1st half UNIT TOPIC ABACUS 5 UNITS ABACUS 6 UNITS 1 Place-value, ordering and rounding
Abacus 5 and 6: Autumn term 1st half 1 Place-value, ordering and rounding N2 Place-value To round any number up to 10 000 to the nearest ten, hundred or thousand N1 Place-value To rehearse rounding a number
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationControl Structures II. Repetition (Loops)
Control Structures II Repetition (Loops) Why Is Repetition Needed? How can you solve the following problem: What is the sum of all the numbers from 1 to 100 The answer will be 1 + 2 + 3 + 4 + 5 + 6 + +
More informationDepartment Curriculum Map (new GCSE)
Department Curriculum Map 2014-15 (new GCSE) Department Mathematics required in Year 11 Foundation 1. Structure and calculation: N1 to N9 Fractions, decimals and percentages: N10 to N12 Measure and accuracy:
More informationProcedural Programming
Procedural Programming Lecture 2 - Summer Semester 2016 Control Structures Flow Charts Faculty of Engineering Institute of Computer Engineering What we know so far... Programming is only one step in program
More informationMiddle School Math Course 3 Correlation of the ALEKS course Middle School Math 3 to the Illinois Assessment Framework for Grade 8
Middle School Math Course 3 Correlation of the ALEKS course Middle School Math 3 to the Illinois Assessment Framework for Grade 8 State Goal 6: Number Sense 6.8.01: 6.8.02: 6.8.03: 6.8.04: 6.8.05: = ALEKS
More informationProgramming Logic & Pseudocode. Python Bootcamp, Day 1 Anna Rosen
Programming Logic & Pseudocode Python Bootcamp, Day 1 Anna Rosen Programming 101 Computer programming involves having the user formulate commands that the computer can run for a specific purpose. The computer
More informationProcedural Programming
Procedural Programming Lecture 2 - Summer Semester 2017 Control Structures Flow Charts Faculty of Engineering Institute of Computer Engineering Practical Training REGISTRATION ends tomorrow Wednesday (26
More informationIntroduction to Algorithms and Programming (COMP151)
Introduction to Algorithms and Programming (COMP151) A Student's Manual for Practice Exercises Dr. Mohamed Aissa m.issa@unizwa.edu.om 11i13 Summer 2014 Practice Exercises #1 Introduction Page 2 Practice
More informationChapter 4 Introduction to Control Statements
Introduction to Control Statements Fundamentals of Java: AP Computer Science Essentials, 4th Edition 1 Objectives 2 How do you use the increment and decrement operators? What are the standard math methods?
More informationM4.1-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH C LANGUAGE
M4.1-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be
More informationUnit 1. Word Definition Picture. The number s distance from 0 on the number line. The symbol that means a number is greater than the second number.
Unit 1 Word Definition Picture Absolute Value The number s distance from 0 on the number line. -3 =3 Greater Than The symbol that means a number is greater than the second number. > Greatest to Least To
More informationWits Maths Connect Secondary Project Card-sorting Activities
Project Card-sorting Activities This pack consists of card-sorting activities which focus on working with different representations. Activities and focus on points while Activity focuses on the linear
More informationMAT 090 Brian Killough s Instructor Notes Strayer University
MAT 090 Brian Killough s Instructor Notes Strayer University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample
More informationLab Manual. Program Design and File Structures (P): IT-219
Lab Manual Program Design and File Structures (P): IT-219 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical / program Lab
More informationProgramming for Engineers Iteration
Programming for Engineers Iteration ICEN 200 Spring 2018 Prof. Dola Saha 1 Data type conversions Grade average example,-./0 class average = 23450-67 893/0298 Grade and number of students can be integers
More informationPROBLEM SOLVING WITH LOOPS. Chapter 7
PROBLEM SOLVING WITH LOOPS Chapter 7 Concept of Repetition Structure Logic It is a computer task, that is used for Repeating a series of instructions many times. Ex. The Process of calculating the Total
More informationName Date. FINAL EXAM STUDY GUIDE Pre-Algebra Course 3
Name Date FINAL EXAM STUDY GUIDE Pre-Algebra Course 3 The following is an outline of key elements that should have been mastered during the course of the year (Grade 8 Green Book Course 3). Use it wisely
More informationSoftware Testing. 1. Testing is the process of demonstrating that errors are not present.
What is Testing? Software Testing Many people understand many definitions of testing :. Testing is the process of demonstrating that errors are not present.. The purpose of testing is to show that a program
More informationEngineering 12 - Spring, 1999
Engineering 12 - Spring, 1999 1. (18 points) A portion of a C program is given below. Fill in the missing code to calculate and display a table of n vs n 3, as shown below: 1 1 2 8 3 27 4 64 5 125 6 216
More informationAlgorithms, Part 2 of 3. Problem Solving. Problem Solving (con t) Topics Problem Solving Examples Pseudocode Control Structures
Algorithms, Part 2 of 3 Topics Problem Solving Examples Pseudocode Control Structures Reading Section 3.3-3.10 (don t worry about understanding the C code, just the pseudocode) Problem Solving Decode this
More informationPROBLEM SOLVING AND OFFICE AUTOMATION. A Program consists of a series of instruction that a computer processes to perform the required operation.
UNIT III PROBLEM SOLVING AND OFFICE AUTOMATION Planning the Computer Program Purpose Algorithm Flow Charts Pseudo code -Application Software Packages- Introduction to Office Packages (not detailed commands
More informationAP Computer Science Homework Set 1 Fundamentals
AP Computer Science Homework Set 1 Fundamentals P1A. Using MyFirstApp.java as a model, write a similar program, MySecondApp.java, that prints your favorites. Your program should do the following: a. create
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationProgramming Basics and Practice GEDB029 Decision Making, Branching and Looping. Prof. Dr. Mannan Saeed Muhammad bit.ly/gedb029
Programming Basics and Practice GEDB029 Decision Making, Branching and Looping Prof. Dr. Mannan Saeed Muhammad bit.ly/gedb029 Decision Making and Branching C language possesses such decision-making capabilities
More informationChapter 4: Control structures. Repetition
Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition
More informationLoops / Repetition Statements
Loops / Repetition Statements Repetition statements allow us to execute a statement multiple times Often they are referred to as loops C has three kinds of repetition statements: the while loop the for
More informationChapter 4 C Program Control
Chapter C Program Control 1 Introduction 2 he Essentials of Repetition 3 Counter-Controlled Repetition he for Repetition Statement 5 he for Statement: Notes and Observations 6 Examples Using the for Statement
More informationClass 8 ALGORITHMS AND FLOWCHARTS. The City School
Class 8 ALGORITHMS AND FLOWCHARTS ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence of steps that describe solution
More informationAlgebra 2 Semester 1 (#2221)
Instructional Materials for WCSD Math Common Finals The Instructional Materials are for student and teacher use and are aligned to the 2016-2017 Course Guides for the following course: Algebra 2 Semester
More information