Introduction to C Programming

Slides:



Advertisements
Similar presentations
CS 101 Introductory Programming - Lecture 7: Loops In C & Good Coding Practices Presenter: Ankur Chattopadhyay.
Advertisements

Introduction to Flowcharting
Introduction to Flowcharting
Creating Flowcharts Principles Of Engineering
Introduction to Flowcharting
Introduction to Flowcharting A Supplement to Starting Out with C++, 4th Edition by Tony Gaddis Published by Addison-Wesley.
The art of drawing a road map
Prime Factorization Section 2.5. Objectives Find the prime factorization of a counting number by repeated division Find the prime factorization of a counting.
Tutorial #7 Flowcharts (reprise) Program Design. Introduction We mentioned it already, that if we thing of an analyst as being analogous to an architect,
Flow Charting Damian Gordon. Introduction We mentioned it already, that if we thing of an analyst as being analogous to an architect, and a developer.
1 CSI 101 Elements of Computing Fall 2009 Lecture #4 Using Flowcharts Monday February 2nd, 2009.
The Program Design Phases
(C)opyright 2003 Scott/Jones Publishers Introduction to Flowcharting A Supplement to Starting Out with C++, 4th Edition by Tony Gaddis Scott/Jones Publishers.
Algorithm & Flowchart.
An introduction to Binary. Binary is the language used by computers. It uses 0 and 1 to represent different numbers.
Number systems Converting numbers between binary, octal, decimal, hexadecimal (the easy way)
Advanced Decisions and Loops Chapter Some Simple Schoolroom Statistics.
Box and Whisker Plots. Order numbers 3, 5, 4, 2, 1, 6, 8, 11, 14, 13, 6, 9, 10, 7 First, order your numbers from least to greatest: 1, 2, 3, 4, 5, 6,
Divisors and Factors Section 2.3. Objectives Write a counting number as the product of two factors in all possible ways List all of the factors (divisors)
CSC103: Introduction to Computer and Programming
Place value and ordering
Flowchart IDT. What is a flowchart? Visual representation of a flow of data Outline of process or a solution to a problem Outline the basic logic behind.
Flowcharting An Introduction
Design the program Create a detailed description of program –Use charts or ordinary language (pseudocode) Identify algorithms needed –Algorithm: a step-by-step.
Introduction to Robo Pro
1 Introduction to Flowcharting. 2 Writing a program Defining the problem –Write down what the program will do Planning –Write down the steps, draw a flowchart.
Chapter Two Creating a First Project in Visual Basic.
ALGORITHM List of instructions for carrying out some process step by step. A sequence of instructions which has a clear meaning and can performed with.
Program Planning and Design. What is Program Planning and Design? Program planning and design is simply knowing what you want to do and how you want to.
Program Design BUILDING A HOUSE. Steps to Designing a Program 1. Define the Output 2. Develop the logic to get that output 3. Write the program.
Flowcharting An Introduction. Definition A flowchart is a schematic representation of an algorithm or a process.
(C)opyright 2000 Scott/Jones Publishers Introduction to Flowcharting.
Branching ACO101: Introduction to Computer Science.
Introduction to Computing Dr. Nadeem A Khan. Lecture 2.
Sequencing The most simple type of program uses sequencing, a set of instructions carried out one after another. Start End Display “Computer” Display “Science”
Lec. 7 Introduction to Assembly Programming Dr. Tamer Samy Gaafar Microprocessors.
1 Introduction to Flowcharting Computer Science Principles ASFA.
Flowcharts. Learning Objectives To learn how to break down tasks How to create a flowchart.
Multiplying Decimals 6.NS.3 Fluently add, subtract, multiply and divide multi digit decimals using algorithms for each operation.
ICS124 Session 9 Flowcharting 1. By the end of this section the student will be able to:  Name the three structures of the Structure Theorem  Identify.
Essential Question: Why, oh why, didn’t I take the blue pill?
Flow Charts. Flow charts A flowchart is a schematic (idea of doing something) representation of a process. They are commonly used in Computer Science.
Perimeter & Area. Today’s Objectives:  Learn what it means to find perimeter and area.  Practice finding or estimating the perimeter and area.
Creating Flowcharts Principles of Engineering
Creating a Flowchart Computer Integrated Manufacturing
ALGORITHMS AND FLOWCHARTS
Creating Flowcharts Name of PowerPoint CIM Name of Lesson
Introduction to Flowcharting
Introduction to Computing
Programming Flowcharts
Introduction to Flowcharting
Introduction To Flowcharting
Numbering System TODAY AND TOMORROW 11th Edition
Creating Flowcharts Principles of Engineering
Creating Flowcharts AIM:
Parallel Lines Discovery Activity
Creating Flowcharts Principles of Engineering
Creating Flowcharts Name of PowerPoint CIM Name of Lesson
An Introduction to VEX IQ Programming with Modkit
Parallel Lines Discovery Activity
Faculty of Computer Science & Information System
Box and Whisker Plots.
Creating Flowcharts Name of PowerPoint CIM Name of Lesson
mediation and duplation
Creating Flowcharts Principles of Engineering
Box and Whisker Plots Dittamo Lewis Notes 2012.
Number systems Converting numbers between binary, octal, decimal, hexadecimal (the easy way)
Creating Flowcharts Principles Of Engineering
Creating Flowcharts Name of PowerPoint CIM Name of Lesson
(Type Answer Here) (Type Answer Here) (Type Answer Here)
Presentation transcript:

Introduction to C Programming ET2560 Introduction to C Programming Introduction to C Programming Unit 1, Part 2 Unit 1 Presentations

Flowchart Elements Unit 1: Algorithms

Begin and End Shapes These shapes are used to begin and end a flowchart The beginning shape has the algorithm name as its label The end shape contains the word “End”

Rectangle Shape – Actions Rectangle has one entry and one exit The text in the rectangle is pseudo-code corresponding to one step in the algorithm

Diamond Shape – Decision Point One entry, two exits (one for “yes”, the other for “no”) Contains one question, with yes/no answer

Selection Shape Selection is an extension of the decision point Instead of a question, the diamond contains a value The value selects which branch to take One “other” branch is used for all other values that don’t have a branch

Connector Shape – On-page Use for a connection on same page Shape shows connection from one point to another Left shape can be used multiple times Right shape, used once, shows the destination of connection

Connector Shape – Off-page Use for a flowchart larger than one page Shape shows connection from one page to another Left shape can be used multiple times Right shape, used once, shows the destination of connection Visio automatically creates a new page when this shape used

Shapes Combine to Create Structures Straight-line structure Single-sided branch Double-sided branch Selection structure Until loop While loop Do-while loop

Straight-line Structure

Single-sided Branch

Double-sided Branch

Selection Structure Selection structure is an extension of the branch All branches must converge together at the end

“Do-While” Loop

“While” Loop

“Until” Loop

Flowchart Examples Unit 1: Algorithms

Flowchart Example – Count to 9 Here is an algorithm, in pseudo code, to output 1-9: Output “List of Numbers less than 10” Put 1 in number Output number Add 1 to number If number is less than 10, go back to step 3 End

Flowchart Created from Algorithm

Flowchart Example – Odd #s < 10 Output “List of Odd Numbers less than 10” Put 1 in number If number divided by 2 has remainder 0, go to step 5 Output number Add 1 to number If number is less than 10, go back to step 3 End

Flowchart for Odd Numbers < 10