9. Computer Programming with flowcharting Technique (page 9)

Flowchart 4C = Flowchart 4D writing only of line number differed, but result of its (output) the same.

8. Computer Programming with flowcharting Technique (page 8)

Example problem 4
You are asked to makes program to present the biggest number from INPUT three level unequal numbers.

Solution
For example the number K, L and M
Firstly compares K with L. There are two possibilities.

First possibility:
If K > L hence continuing compares K with M.
If simply of course K > M means K the biggest number since have already won K at the next and first step wins M also.
If no (M larger ones) hence M is the biggest number since have already won K which has give L. In this case no more require M compares with L.

Second possibility
If no (K < L) hence comparing L with M
If simply L > M hence L is the biggest number because winning K and M.
If no (M > L) hence M is the biggest number because has won L larger ones from K

Description:
The problem of this is beginning of from logic which must be mastered truly.

Program Listing
10 CLS
15 PRINT “PROG04A”
20 INPUT K
30 INPUT L
40 INPUT M
50 IF K > L THEN 90
60 IF L > M THEN 120
70 PRINT M
80 END
90 IF K > M THEN 110
100 PRINT M
105 GOTO 80
110 PRINT K
115 GOTO 80
120 PRINT L
125 GOTO 80

Description
1. At Flowchart 4 A. After statement PRINT must be figured in GOTO
Except line number 70
(May also be added 75 GOTO 80 although unnecessary)
Command (statement) this GOTO often is forgotten. As a result there will be mistake at the time of in RUN
2. If paid attention simply there is two PRINT M.
Its logic is of course that way. Please compare to flowchart 4 B and 4 C.
At flowchart 4 B and 4 C obtained to be each two PRINT K, L, and M
Flowchart 4 A, 4 B and 4 C when in RUN will yield output which are same.
3. Writing of line number can be done like at flowchart 4 B or 4 C
4. Choice Y (Yes) and N (NO) at Decision Symbol towards right can and downward or on the contrary. Under this example of if Y (Yes) downward and N(NO) towards right.
5. Hereinafter is all content of this book Y (Yes) in right and N (NO) direction downward Decision Symbol. This for uniformity and amenity only

DATA TEST:
Firstly: INPUT K is filled by number 1, INPUT L Number 2, INPUT M number 3
Second: INPUT K is filled by number 1, INPUT L Number 3, INPUT M number 2
Third: INPUT K is filled by number 2, INPUT L Number 1, INPUT M number 3
Fourth: INPUT K is filled by number 2, INPUT L Number 3, INPUT M number 1
Fifth: INPUT K is filled by number 3, INPUT L Number 1, INPUT M number 2
Sixth: INPUT K is filled [by] number 3, INPUT L Number 2, INPUT M number 1
OUTPUT is number 3 (the biggest number out of the three data)
Hereinafter your input can have kinds of number.

7. Computer Programming with flowcharting Technique (page 7)

5.4. B With data INPUT

5.4.1. Find the biggest number

Example:problem 3
You are asked to find the biggest number from two unequal numbers
For example first number of A (numeric) and second number of B (numeric)

Solution:
Applies INPUT A for first number and INPUT B for second number.
If A > B hence printed (PRINT) be A. The statement is PRINT A
If B > A hence printed (PRINT) be B. The statement is PRINT B
In the problem of this answer may not be other.

At this flowchart simply statement END (line number 60) be not in end number.
No problem, because of course it is the logic.

When this program implemented (executed = in RUN) hence will come up ? (input A asks filled by number). Types is just for example number 9 then press ENTER
Came up again? Fills in value B for example 127 then ENTER
Hence will come the result is number 127 as biggest number.
Program can be implemented by input other number.
Save (this program record by the name "SOAL3")

TEST DATA:
First: INPUT A is filled by number 1, and INPUT B is filled by number 2
Second: INPUT A is filled by number 2, and INPUT B is filled by number 1
OUTPUT is number 2 (the biggest number from two the data)
Hereinafter you can input with any number.

6. Computer Programming with flowcharting Technique (page 6)

Example: problem 2
You are asked to makes program to print number 1 up to 100 with difference 3

Solution
First number which will be printed is number 1
End number which will be printed is number 100
Iteration formula X = X + 3
Determines initial value = initial number (= 1) in PRINT X formerly
Check is value printed >( 100)
So X(0) = 1 and X(last) > 100
Determine terminal value. Maximum terminal values 100 written X > 100

FIG.5
Solution
First number which will be printed is number 1
End number which will be printed is maximum number 100
Iteration formula X = X + 3
Determines initial value = initial number (1) lessened difference ( 3) = 1 - 3 = - 2.
So X(0) = - 2
Determines the terminal value. Maximum terminal value 100 written by X > 100
After in check that X has not > 100, hence done by printing (PRINT X)

FIG.6
When in RUN, result is written by number: 1, 4, 7, 10, - - - and so on
Record (saves = save) program by the name: "SOAL2" or " PROG002"

Description:
If kept by the name "SOAL1" or "PROG001" hence stripper program ("SOAL1") or "PROG001" will be vanished ( overlapped) by new program which the same name. These are often done by new participant. Program vanished cannot be called (LOAD) again.

Statement File Open "SOAL1" or File Open "PROG001" will present as your first program

At program BASICA command is LOAD "Soal1" or LOAD "PROG001"

5. Computer Programming with flowcharting Technique (page 5)

5. Flowchart: Compiles flowchart
A. Without data , Data formulated in program
B. data INPUT. Data in input when execution
C. READ data. Data and program is written together by one files.
D. FILING SYSTEM. Data is recorded separated from program .

5.1 A Without data
Example Of The problem of 1
You are asked to makes program to print number 1 up to 100 with difference 1

Solution The problem of 1
First number which will be printed is number 1
End number which will be printed is maximum 100
Iteration formula X = X + 1

5.1.1. Determines initial value
Initial number (1) lessened difference (1) = 1 - 1 = 0.
So X(0) = 0

5.1.2. Determines terminal value.
Maximum terminal value 100 written by X > 100
FIG. 4
Description

Every start process is started with Start at Terminal symbol
Command ( statement) written in uppercase.

Number 10
Terminal symbol , starts computing process
CLS abbreviation from CLear Screen = cleans [screen]
Statement governed the just for language BASICA
At other programming language governed the others statement

Line number 15
Governs to print article PROG001

Number 20
Preparation symbol (to write initial value)
Initial Value X = 0 (Determined by programmer: X(0) = 0 )

Number 30
Processing symbol ( to write formula )
Iteration formula is written at processing phonetic symbol.

Number 40
Decision symbol ( to take choice )
Statement always IF - - - followed THEN - - - IF X > 100 THEN 60
If statement correctness (Yes) (X value bigger than number 100) hence process is continued towards number process 60
Otherwise (NO) (value X is not more big from number 100) hence process is continued by number process 50
Important to remember that line number for wrong condition (NO) must always is prioritized (the number is smaller) from condition of correctness ( Yes)

Number 50
Data input-output phonetic symbol
PRINT X: governs to print value X in vertical (from the top downward).
For example: 1
2
3
4
5
6
7

PRINT X; governs to print value X nearby.
For example: 1 2 3 4 5 6 7
PRINT X, is governing to print value X in 5 column for every line
For example
1 2 3 4 5
6 7 8 9 10
11 12 etc.

Number 55
GOTO 30 is command for continuing to number process 30

Number 60
Symbol terminal : END terminates computing process

When program is executed, hence will be written number 1 2 3 4 - - - 100
Executes = implements ( RUN ) program

5.2. Program record ( Save )
Save program by the name "SOAL1" ( set solid) or "PROG001"

Doesn't write name " THE PROBLEM OF 1" or " PROG 001" ( there are spaces), because will be refused by computer on trespassing programming language order BASICA

Additional description:
Line number 10, 20, 30 and so on can be eliminated at this program
Writing of the line number better is done to facilitate studies program making,
This line number can be written with number 1, 2, 3 or 100, 200, 300 and so. But shall not be filled number set of 1, 2, 3 , because if required by inset, hence number inserted to in the form of fraction, for example number 2½ . At number tens of can be inserted number 31, 32, 35, 39 and so. Writing of this line number doesn't influence computing process.

Description: If using software Basica,
PRINT X will print number 1 up to 100 successive downward(in one column)
PRINT X; prints successive of righteous (at a line)
PRINT X, prints at a line with distance 1 column (maximum of 5 column)
PRINT TAB(1);TAB(3);TAB(5);TAB(7); prints in column 1, 3 , 5, and 7

4. Computer Programming with flowcharting Technique (page 4)

2. Programming base logic
Line passed by process to can be in the form of successive line ( sequence), ramification ( branching) and loop ( looping). Program is built by using the lines

2.1. Sequence = successive

Fig.1
Originally process A is continued [by] process B then C, D and successive E

2.2. Branching = ramification

Fig .2
After doing process A and B then process C. At C happened process decision (determination test of choice). By seeing condition of result of data processing, program will choose distribute to D or H.

For example: at program has been determined if data value = 0, hence process distribute to process D, E, F, and G and so.

If data value not = 0, hence process distribute to process H, I, and towards to process G and so.

2.3. Looping = loop

Fig.3

When at process branching ( ramification) direction of process after decision towards to the next process ( forwards) hence at process looping after decision ( F) computing process can be distribute to the next process is processing G or returns towards process C to pass process H, I

3. Programming Language BASICA
Basica is programming language basis for studies Visual Basic and VBasicNet which the existing popular. Hereinafter all content of this book applies Bahasa Basica of the DOS 6.

3.1 Simple data types.
To learn base logic, enough to know simple data that is string and numeric

3.1.1. Data string ( $) be data to [him] cannot be done mathematics process

3.1.2. Data numeric always can be processed in mathematics.

Example: A$ ( A string)="17". B$ = "08" and C$= "1945"

If summed up: A$ + B$ + C$ result is "17081945" (Indonesian Independence day).

For data numeric, for example K=17, L=08, M=1945.

If summed up: K + L+ M hence result is 1970.

3.2. Changes data string to become numeric and conversely
Convertible string data become numeric by order of VAL (Value).

A= val(A$) = val(“17”) = 17
B= val(B$)= val(“08”) = 8
C= val(C$) =val(“1945”) = 1945
A + B + C = 1970

Data numeric earns also is altered to become data string by order of STR$

K$= STR$(K) = STR$(17) = “17”
L$ = STR$(L) = STR$(08)=”08”
M$ = STR$(M) = STR$(1945) = “1945”
K$ + L$ + M$ = “170845”

4. Iteration Process
Process looping the always yields new value change called as iteration.

Iteration is formulated in the form of X = X + A which A is a numeric one

4.1. Iteration formula X = X + A (A = numeric)
The first X is the new value.
The second X is the old value

For example: iteration formula P = P + 3

For example as initial value is determined by P(0)=5

At First step P(1) = P(0) + 3 = 5 + 3 = 8

At second step P(2) = P(1) + 3 = 8 + 3 = 11

At third step P(3) = P(2) + 3 = 11 + 3 = 14

That way further the iteration process will continue until reached certain condition which has been programmed.

3. Computer Programming with flowcharting Technique (page 3)

1. Introduction

1. 1 Computers work principle
Computers fundamental component are electronic circuit which can be occupied bit 0 and bit 1.
Bit 0 is named condition of OFF while 1 condition of ON.
Computers process or computing done by controlling bit 0 and bit 1 at the electronic network.
The operation procedure is written in the form of COMPUTER PROGRAM.
COMPUTER PROGRAM will process INPUT (DATA) becomes OUTPUT (INFORMATION)
COMPUTER PROGRAM contains computer data processing process sequence.
COMPUTER PROGRAM written in programming language.
Result of data processing process called as INFORMATION
Simply, DATA is processed to apply PROGRAM to be INFORMATION or with computer term:

DATA ----- PROCESS ----- INFORMATION or
INPUT ----- PROGRAM ----- OUTPUT


Like making bread, DATA is raw material that is: wheat, sugar, butter, egg and others. The raw material then is processed. The processing through some steps: originally wheat is given by water. Swirled scrambled. Then is decanted sugar, other egg, butter and mixture. Hereinafter is swirled until flattening. The next is cooking in oven.
Result (OUTPUT) after cooking to become bread ready for consumed.

1.2. Programming languageData processing computer pass certain phases and step. These phases and steps are written down sequentially in the form of program. So program are commands in successive lists written in programming language to process data. The command written in programming language which is not English although many command written in English like.

There are two programming language types that are:1. Low-level language orienting at machine language (Machine Language and Assembly Language) relates to operation hardware computer.
2. High level language orienting at man language (BASIC = Beginner All purpose Symbolical Instruction Code), applied for the application of public for example for calculation and business, Fortran = Formula Translator for calculation mathematics. Cobol (Common Business Oriented Language) for business applications. In the next development are Pascal language, C, and continued with visual program for example vBasic, Delphi, Visual C and then VBNet (VBASICNET). Now there is plenty of programming language software in marketing.

1.3. Algorithm and flowchart
Flowchart facilitates programmer to get visual picture from ALGORITMA. Algorithm is computing process sequence written to water down programmer makes program. So make program in advance is made algorithm visualizing in the form of flowchart. Experienced programmer makes program without flowchart, even without making algorithm in advance. Junior Programmer suggested mastering technique flowcharting in advance. Programming logic is visualization in the form of flowchart. To learn Assembly, absolute flowchart is required.

1.4. Computer system.
Some computer programs integrated to become one unities of so-called system software. Software system can be supposed like lake to contain water with peace surface. When people drops as of item big stone, hence water level in that lake would be surging and would be calm again after same elsewhere water level height. So also when small gravel is dropped, happened small ripples is of all water level until height of all the same water level. And so do at software system, Big transaction happened at data input will cause change at journal and general ledger later on influences balance. Small scale transaction also same its influence. There are not differentiated between small and big transactions. Flowchart for software system called as SYSTEM FLOWCHART while for computer program called as PROGRAM FLOWCHART.

1.5. Program making phase
Makes program to differ from makes system program. When this if there are request makes program meant is make system program totally which is integrating from some programs. Remuneration program or common called as Payroll for example consisted of recording program of mains data, base salary tables, subsidy tables, overtime list and cutting list during one month, calculation program, output print program etcetera. So do not be consisted of one just programs but some programs is integrated to become one software system. In consequence its(the flowchart is also differs in like the one is mentioned to that is system flowchart and program flowchart. System flowchart lapped over from some programs flowchart.

1.6. Symbol SYSTEM FLOWCHART


1.7. Symbol PROGRAM FLOWCHART
This symbol applied to depict relationship between programs flowchart which has integrated

2. Computer Programming with flowcharting Technique (page 2)

TABLE OF CONTENTS
LEVEL 1:

1. Introduction

1.1 Computer work principles

1.2 Programming languages

1.3. Algorithm and flowchart

1.4. Computer system.

1.5. Program making phase

1.6. SYSTEM FLOWCHART Symbol

1.7. Program FLOWCHART Symbol

2. Programming base logic

2.1. Sequence = successive

2.2. Branching = ramification

2.3. Looping = loop

3. BASICA Programming Language

3.1. Simple data types.

3.1.1. Data String ($)

3.1.2. Data numeric

3.2. Changes data string to numeric and conversely

3.3. Access data string

3.3.1. LEN$

3.3.2. LEFT$

3.3.3. RIGHT$

3.3.4. MID$

4. Iteration Process

4.1. Iteration formula

4.2. Cummulating Process

5. Flowchart: How to make flowchart

5.1. A Without data

5.1.1. Determines initial value

5.1.2. Determines terminal value.

5.2. Program record (save )


5.3.



5.4. B With data INPUT

5.4.1. Print the biggest number

5.4.2. SORTING (Sequence) limited

6. Continuation of iteration : Looping

61. a. Single Looping

6.2. Looping and single looping

6.3. Looping in looping

7. Command looping

7.1. Single Looping

7.1.1. a. FOR - - - NEXT - - - STEP

7.1.2. b. DO [ ( WHILE) condition ] [block statement] . . . LOOP

7.1.3. c. DO [ ( UNTIL) condition ] [block statement] . . . LOOP

7.1.4. d. DO [block statement] . . . LOOP [ ( WHILE) condition ]

7.1.5. e. DO [block statement] . . . LOOP [ ( UNTIL) condition ]

7.1.6. f. WHILE . . . WEND

7.2. Looping and looping

7.2.1. a. FOR - - - NEXT - - STEP

7.2.2. b. DO [ ( WHILE) condition ] [block statement] . . . LOOP

7.2.3. c. DO [ ( UNTIL) condition ] [block statement] . . . LOOP

7.2.4. d. DO [block statement] . . . LOOP [ ( WHILE) condition ]

7.2.5. e. DO [block statement . . . LOOP [ ( UNTIL) condition ]

7.2.6. f. WHILE . . . WEND

7.3. Looping in looping

7.3.1. Formula FOR - - NEXT which is correct

7.3.2. Formula FOR - - NEXT which is wrong

7.4. Looping Continuation

7.4.1. a. FOR - - - NEXT - - STEP

7.4.2. b. DO [ ( WHILE) condition ] [block statement] . . . LOOP

7.4.3. c. DO [ ( UNTIL) condition ] [block statement k] . . . LOOP

7.4.4. d. DO [block statement] . . . LOOP [ ( WHILE) condition ]

7.4.5. e. DO [block statement] . . . LOOP [ ( UNTIL) condition ]

7.4.6. f. WHILE . . . WEND

75. Visualization of Writing

7.5.1. Example: 7.4.6. f. WHILE . . . WEND

7.6. Application

7.6.1. Siren

7.6.1.1. Tone Program 1

7.6.1.2. Tone Program 2

7.6.1.3. Tone Program 3

7.6.1.4. Tone Program 4

7.6.1.5. Determines gamut

7.6.1.6. Program A5

8. ELEMENTARY FLOWCHART

8.1. EXAMPLE: Problem 12

8.2. Solution

8.3. Logic

8.4. Programming steps

8.4.1. Elementary flowchart picture

8.4.2. Writes name of variable

8.4.3. Determines variable data input

8.4.4. Writes mathematics formula required

8.4.5. Print output when data has finished

8.4.6. Program Listing

8.4.7. Description

9. Preparation in making of program

91. Makes HEADER

9.1.1. Arranges header at monitor

10. The problem of programming logics

10.1. A. Problems which the data within a program

10.1.1. Extract Processing

10.1. 2. Summarize consisted of:

10.1. 2.1. i. Single Control Break

10.1. 2.2. ii. Multiple Control Break

10.1. 2.3. iii. Double Check.

10.2. B Problem which the data separated from program

10.2. C Problem in the application of accountancy system

11. EXTRACT theory

12. Composition of the EXTRACT Problem

12.1. Name of PROGRAM A1

12.2. Input Record

12.3. Output Record

12.4. Process

12.5. Output

13. Step in Problem Solving

13.1. Determines name of input variable

13.2. Create A1 data input

13.3. Determines name of output variable A1

13.4. Create output A1

13.5. Making of Flowchart Program

13.6. Writing of Program Listing

13.7. Description

13.8. Program listing after in modification

14. SUMMARIZE

14.1. Base Flowchart Summarize

14.1.1. Single Control Break

14.1.1.1. Example of problem 14 (Single Control Break)

14.1.1.2. Computing process logic

14.1.1.2.1. Early phase

14.1.1.2.2. The next phase

14.1.1.3. SUMMARIZE Process (Summary).

14.1.1.4. Two kinds of solution

14.1.1.4.1. Logic of SCB A

14.1.1.4.2. Logic of SCB B

14.1.1.5. The Problem Of SUMMARIZE

14.1.1.6. MULTI STATEMENT

14.1.1.6.1. Program Listing MULTI STATEMENT

14.1.1.6.2. It is not suggested to recap

14.1.2. Multiple Control Break

14.1.2.1. Computing in logic process

14.1.2.1.1. Early phase

14.1.2.1.2. The next phase

14.1.3. Double Check

14.1.3.1. Double Check computing process logic

14.1.3.1.1. Early phase

14.1.3.1.2. The next phase

14.1.3.1.3. Description

15. Header and Over Flow Test (OVL Test)

15.1. Header, Detail and Space

15.2. Programming logic of Header and OVL Test

15.3. Program listing Header & OVL test

15.4. Description

15.5. Main Program Listing

15.6. Complete Program listing


TABLE OF CONTENTS
LEVEL 2:

16.1. Filing System

16.2. ENTRY DATA PROGRAM

16.2.1. Data is recorded in the form of data string.

16.2.2. Recording in Sequential

16.2.2.1. Form Of SEQUENTIAL Record

16.2.2.2. FLOWCHART of ENTRY DATA BASE SEQUENTIAL

16.2.2.3. FLOWCHART of READ DATA BASE SEQUENTIAL

16.2.3. Recording in Random

16.2.3.1. Form of Recording LSET for A1$ and A2$

16.2.3.2. Form of Recording RSET for A1$ and A2$

16.2.3.3. Form of Recording LSET for A1$ and RSET for A2$

16.2.3.4. Flowchart Base of Filling System

16.2.3.5. Description

16.2.3.6. Flowchart of Data Base Recording (WRITE DATA)

16.2.3.7. Description

16.2.3.8. At recording process of random data:

16.2.4. PROGRAM READ DATA random

16.2.4.1. Base Flowchart of Filling System random

16.2.4.2. Base Flowchart of Data Read (READ DATA) random

16.2.4.3. Description

17. Data sequence Process (SORT PROCESSING)

17.1. Process BUBBLE SORT

17.2. Procedure

17.3. Data sequence program logic (BUBBLE SORT)

17.3.1. DIM

17.3.1.1. Dimension of 1

17.3.1.2. Dimension of 2

17.3.1.3. Dimension of 3

17.4. Continuation of data sequence program logic (SORT)

17.4.1. Program logic

18. Data sequence month in Process (SORT PROCESSING)

19. LOOK UP TABLE Process (looks for in tables)

19.1. The Look up Tables theory

19.2. Look up Tables Process

19.3. Procedure

19.3.1. ' PROCESS SAVES TABLES

19.3.2. ' STUDENT DATA READ PROCESS

19.3.3. ' RECORDING PROCESS COUNTER

19.3.4. ' SEARCHING PROCESS IN TABLES

19.3.5. ' DISPLAY PROCESS IN MONITOR AND OUTPUT RECORDING

19.4. Description:

20. Example of the problem of LOOK UP TABLE Process (looks for in tables)

21. The Problem of LOOK UP TABLES Process (to some tables)

22. LOOK UP TABLE Process (joined with Single Control Break process)

23. LOOK UP TABLE Process (joined with Multiple Control Break)

(With Header & test OVL)

24. MATCHING Process (checks off data between two / more files)

24.1. Theory

24.2. Process

24.3. THE BASE of MATCHING theory

24.4. FLOWCHART BASE MATCHING

24.5. Matching Program

ONE MASTER to MANY TRANSACTIONS

24.5.1. MATCHING Process: one opponents many

24.5.2. Analysis

24.5.3. Data criterion in this process

24.5.4. Example of Problem: Matching 1 Master to 2 transaction

25. Update Process (Repair / updating a data file)

25.1. Theory

25.2. Process

26. MERGE Process (Merger some data files)

26.1. The Merge theory

26.2. Merge Process

27. Example of application: