ii n t r o d u c t i o n pp r e t e s t dd e s i g n i n g a l g o r i t h m dd e s i g n i n g f l...

51
“DESIGNING ALGORITHM AND FLOW CHART” BY: Carlo Jan Bajalan

Upload: david-willis-harper

Post on 16-Dec-2015

215 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“DESIGNING

ALGORITHM

AND FLOW

CHART”BY: Carlo Jan Bajalan

Page 2: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

INTRODUCTION

PRE TEST

DESIGNING ALGORITHM

DESIGNING FLOWCHART

GENERAL RULES FOR

FLOWCHARTING

POST TEST

CREDITS/

ACKNOWLEDGEMENT

Table of contents

Page 3: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“INTRODUCTION”

Page 4: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

INTRODUCTIONDesigning the right algorithm for a given application is a difficult job. It requires a major creative act, taking a problem and pulling a solution out of the ether. The key to algorithm design is to proceed by asking yourself a sequence of questions to guide your thought process.

Page 5: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“PRE TEST”

Page 6: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

1.What is a diagram made up of boxes , diamonds and other shapes ?A. FLOW CHART

B. ALGORITHMC.

FLOW CHART SYMBOL

D. FLOWCHARTING

Page 7: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

2.What is a representation of a solution to a problem ?A. FLOW CHART B. ALGORITHMC.

FLOW CHART SYMBOL

D. FLOWCHARTING

Page 8: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

3.What is a tool developed in computer industry , for showing the steps involved in process ?A. FLOWCHART

B. ALGORITHMC.

FLOWCHART SYMBOLD. FLOWCHARTING

Page 9: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

4.What is a finite sequence of well defined instruction ?

A. FLOWCHART B. ALGORITHMC.

FLOWCHART SYMBOLD. PROCEDURE

Page 10: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“ALGORITHM”

Page 11: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

ALGORITHM

An algorithm is a representation of a solution to a problem. If a problem can be definedas a difference between a desired situation and the current situation in which one is, thena problem solution is a procedure, or method, for transforming the current situation to thedesired one.

Page 12: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

An algorithm is procedure consisting of a finite set of unambiguous rules (instructions)which specify a finite sequence of operations that provides the solution to a problem , or to a specific class of problems for any allowable set of input quantities ,In other word, an algorithm is a step-by-step procedure to solve a givenProblem.

Page 13: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“PROCEDURE”

Page 14: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

PROCEDURE

A procedure is a finite sequence of well-defined instructions, each of which can bemechanically carried out in a finite amount of time. The procedure must break up the problem solution into parts that the recipient party can understand and execute.

Page 15: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“FLOWCHART”

Page 16: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

FLOWCHART

A flowchart is a diagram made up of boxes, diamonds and othershapes, connected by arrows - each shape represents a step in the process, and the arrowsshow the order in which they occur. Flowcharting combines symbols and flow lines, toshow figuratively the operation of an algorithm.

Page 17: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“FLOWCHARTING”

Page 18: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

FLOWCHARTING

Flowcharting is a tool developed in the computer industry, for showing the stepsinvolved in a process. Process improvement starts with an understanding of the process, and flowcharting is thefirst step towards process understanding.

Page 19: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“FLOWCHART SYMBOLS”

Page 20: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

FLOWCHART SYMBOLS There are 6 basic symbols commonly used in flowcharting of assembly languageprograms: Terminal, Process, input/output, Decision, Connector and Predefined Process.This is not a complete list of all the possible flowcharting symbols, it is the ones usedMost often in the structure of Assembly language programming.

Page 21: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“GENERAL RULES FOR

FLOWCHARTING”

Page 22: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“POST TEST”

Page 23: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

1. All boxes of the flowchart are connected with Arrows. (Not lines)2. Flowchart symbols have an entry point on the top of the symbol with no otherentry points. The exit point for all flowchart symbols is on the bottom except forthe Decision symbol.3. The Decision symbol has two exit points; these can be on the sides or the bottomand one side.

Page 24: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

5.What is the ones used in the structure of assembly language programing ?

A. FLOWCHART B. ALGORITHMC.

FLOWCHART SYMBOLD. PROCEDURE

Page 25: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“ACKNOWLEGMENT”

Page 26: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

I WOULD LIKE TO THANK …

TO MY FAMILY … MY CLASSMATES … MY TEACHER IN TVE !! ‘‘AND ESPECIALLY … GOD

Page 27: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

“CREDITS”

Page 28: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

I WOULD LIKE TO THANK …

GOOGLE.COM WIKEPEDIA.org ALGORIST.COM ART HOUSE.org

Page 29: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

THAT’S ALL !!! THANK YOU ! :)

Page 30: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F
Page 31: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 32: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 33: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 34: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 35: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 36: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 37: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 38: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 39: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 40: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 41: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 42: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 43: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 44: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 45: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

IM SORRY !! ..TRY AGAIN !!

Page 46: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!

Page 47: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!

Page 48: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!

Page 49: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!

Page 50: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!

Page 51: II N T R O D U C T I O N PP R E T E S T DD E S I G N I N G A L G O R I T H M DD E S I G N I N G F L O W C H A R T GG E N E R A L R U L E S F

Correct !!!