Skip to main content

Flow chart


A flowchart is a graphical representation of Algorithm. It was originated from computer science as a tool for representing algorithms and programming logic but had extended to use in all other kinds of processes. Nowadays, flowcharts play an extremely important role in displaying information and assisting reasoning. They help us visualize complex processes, or make explicit the structure of problems and tasks. A flowchart can also be used to define a process or project to be implemented.

 

Flowchart Symbols

Different flowchart shapes have different conventional meanings. The meanings of some of the more common shapes are as follows:

Terminator

The terminator symbol represents the starting or ending point of the system.

Process
A box indicates some particular operation.

Decision

A diamond represents a decision or branching point. Lines coming out from the diamond indicates different possible situations, leading to different sub-processes.

Data

It represents information entering or leaving the system. An input might be an order from a customer. Output can be a product to be delivered.


Loop

This symbol represents a looping point. Lines coming out from the Symbol indicates different possible situations.
 

Flow

Lines represent the flow of the sequence and direction of a process.

Example:





Comments

  1. DillanLegrosSeptember 16, 2021 at 7:56 PM

    Pretty section of content. I just stumbled upon your blog and in accession capital to assert that I get in fact enjoyed account your blog posts. Any way I’ll be subscribing to your augment and even I achievement you access consistently quickly. webprogrammierung berlin


    ReplyDelete

Post a Comment

Popular posts from this blog

Characteristics of computers

    Characteristics:        All computers have similar characteristics, which tells how computers are efficient to perform task. Computers have some Limitations also. Speed:     Computer can work very fast. It takes only few seconds for calculations on very large amount of data. Computer can perform millions (1,000,000) of instructions per second.      We measure the speed of computer in terms of microsecond (10-6 part of a second) or nanosecond (10 to the power -9 part of a second).   Accuracy:        The degree of accuracy of computer is very high and every calculation is performed with the same accuracy.  The errors in computer are due to human and inaccurate data.       The calculation done by computer are 100% error free, If we provide accurate input. Diligence:        A computer is free from tiredness, lack of concentration...
18 comments
Read more

Block diagram of computer

    The basic architecture of computer explained in Blocks is called Block Diagram of computer. This basic architecture of computer finally given by John V on Neumann. Thus it is also called  V on Neumann  architecture. It  is a theoretical design for computer that serves as the basis for almost all modern computers. Input Unit:      We need to input (fed) the data and instructions into the computers to process any task. The input unit consists of one or more input devices.      Keyboard is the one of the most commonly used input device. Other commonly used input devices are the mouse. Output Unit:     The output unit of a computer provides the information and results of a computation to outside world.        Printers, Visual Display Unit (VDU) are the commonly used output devices.   Storage Unit:      The storage unit of the computer holds data and in...
2 comments
Read more

DS LAB FOR II YEAR

1.SINGLE LINKED LIST Procedure for creation of single linked list: STEP-1 : Declaring a variable named as “item”.Ie the element what we place in the linkedlist of the new node.         STEP-2 : Read the value   in “item”. Set first=last=null and next=null. STEP-3: Create a new node named as temp and assign the variable item to data part andassign Address of the node temp to null.       temp.data=item;       temp.next=null; STEP-4: Check   the address part of the first node Check if first=null Then assign first=last=temp Other wise Then assign the new node tolast.next=temp          last=temp STEP-6 : Repeat STEP-3 until you read required nodes. Procedure for display the linked list: STEP-1 : Check whether the list having nodes or not i.e Check if first=null        ...
26 comments
Read more