Scribd
Upload
20 views5 pages

Basics of CSC Venite University

csc 101 venite university

Uploaded by

ogunjobiniyiola906
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views5 pages

Basics of CSC Venite University

csc 101 venite university

Uploaded by

ogunjobiniyiola906
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Definition of an Algorithm: A sequence of activities to be processed

for getting desired output from a given input.

Properties of algorithm

Donald Ervin Knuth has given a list of five properties for a, algorithm, these

properties are:

1) Finiteness: An algorithm must always terminate after a finite number of steps.

It means after every step one reach closer to solution of the problem and after

a finite number of steps algorithm reaches to an end point.

2) Definiteness: Each step of an algorithm must be precisely defined. It is done by

well thought actions to be performed at each step of the algorithm. Also the actions

are defined unambiguously for each activity in the algorithm.

3) Input: Any operation you perform need some beginning value/quantities

associated with different activities in the operation. So the value/quantities are

given to the algorithm before it begins.

4) Output: One always expects output/result (expected value/quantities) in terms of

output from an algorithm. The result may be obtained at different stages of the

algorithm. If some result is from the intermediate stage of the operation then it is

known as intermediate result and result obtained at the end of algorithm is known

as end result. The output is expected value/quantities always have a specified

relation to the inputs


5) Effectiveness: Algorithms to be developed/written using basic operations.

Actually operations should be basic, so that even they can in principle be done

exactly and in a finite amount of time by a person, by using paper and pencil only.

Definition of a Flowchart

The flowchart is a diagram which visually presents the flow of data through

processing systems.

Flowchart Symbols

There are 6 basic symbols commonly used in flowcharting of assembly language

Programs: 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 used most often in the structure of Assembly language programming.


General Rules for flowcharting

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 other

entry points. The exit point for all flowchart symbols is on the bottom except for the

Decision symbol.

3. The Decision symbol has two exit points; these can be on the sides or the bottom

and one side.


4. Generally a flowchart will flow from top to bottom. However, an upward flow can

be shown as long as it does not exceed 3 symbols.

5. Connectors are used to connect breaks in the flowchart. Examples are:

• From one page to another page.

• From the bottom of the page to the top of the same page.

• An upward flow of more then 3 symbols

6. Subroutines and Interrupt programs have their own and independent flowcharts.

7. All flow charts start with a Terminal or Predefined Process (for interrupt programs

or subroutines) symbol.

8. All flowcharts end with a terminal or a contentious loop. Flowcharting uses

symbols that have been in use for a number of years to represent the type of

operations and/or processes being performed. The standardised format provides a

common method for people to visualize problems together in the same manner. The

use of standardised symbols makes the flow charts easier to interpret, however,

standardizing symbols is not as important as the sequence of activities that make

up the process.

Advantages of using Flowcharts

1) Communication: A Flowchart can be used as a better way of communication of

the logic of a system and steps involve in the solution, to all concerned particularly

to the client of system.


2) Effective analysis: A flowchart of a problem can be used for effective analysis of

the problem.

3) Documentation of Program/System: Program flowcharts are a vital part of a good

program documentation. Program document is used for various purposes like

knowing the components in the program, complexity of the program etc.

4) Efficient Program Maintenance: Once a program is developed and becomes

operational it needs time to time maintenance. With help of flowchart maintenance

become easier.

5) Coding of the Program: Any design of solution of a problem is finally converted

into computer program. Writing code referring the flowchart of the solution become

easy.

You might also like