Enter your email address:

    Delivered by FeedBurner

System Scheme


Software is an result execute (instruction) able to walk at computer, functioning with true, can serve all possibility of data manipulation and input, instruction and also abilities to conduct an specific function. Kind of software :
• Language Software of programming
• Application data bases Software ( database)
• Application Software of design web
• Graphical Application Software
• Application Software of multimedia

Making of software relate to developer, is software a software able to be used to develop program. Algorithm is logical steps sequence is solving of the problem of which is compiled systematically and is logical. Logical is fundamental matter in logical algorithm, definition is acceptable or sensible of mind and also can be determined by correctness or is wrong of him. Algorithm of programming is logical steps sequence to build a compiled program systematically. Making of software based on algorithm method of programming identified with existence of problem, value early wanted result and problem, process marking of Software good is :
• Good device (systematic and methodological)
• Can execute truly by computer
• Functioning truly according to device
• Can serve all possibility of input
• Interesting appearance
• Friendly User
• Easy in development and conservancy
Learn program is getting wise to strategy resolving of systematic way and problem, methodology resolving of read problem, then in notation agreed on with. Learning program have the character of the understanding of problem, analysis and syntax. Learn language programming its meaning learn to wear language software programming of procedure syntax’s, and certain standard order, shape exploit specific instruction in each language software of programming certain. Procedural according to Indonesian dictionary mean activity phases to finish an method or activity do step for the shake of step by exact in solving an problem. Algorithm of is including process of procedural. At programming of procedural, program differentiated by between part of data with part of instruction. Part of instruction consist of sequence (instruction sequence) to be executed one per one alternately. Groove execution of instruction can change if (there are) any ramification of conditional.
Data on file in manipulation memory by instruction by sequence (named by this procedural), this of programming procedural. Language of programming high level like language of Cobol, Basic, Pascal, C language, Fortran and of is included in language category programming of procedural.
Logical condition notation algorithm it is so easy implementation to language software of programming certain. Order writing of algorithm consist of three part, is :
  • Program title (header) : Program title is part of used as by algorithm text is place define the name of program. Name of program wearied by may not is equal to name of procedure, function and there may not be any dissociation use space.
  • Declaration (dictionary) : Declaration is part of algorithm text as place to define the name of type (type), constantan (variable and const) and also function definition place (procedure and function) (procedure). Comment is the part of algorithm notation which will not execute by comment program, condition is to reside in between parenthesis, example {comment}. Comment can be placed wherever in algorithm notation because especial function of comment is to water down or explain process a algorithm notation.
  • Algorithm : Part of algorithm is part of containing core of instructions or denominating of action which have been defined. Text algorithm component in programming of procedural can in the form of instruction, sequence (case sequence), analyze or restating (loop). Every algorithm step read the from the top of downwards because executing program also walk the from the top of downwards so that sequence writing of algorithm determine step sequence execute program.
Diagram emit a stream of program is picture explaining sequence read of decision data, take of data, processing data and presentation of data process result. Diagram emit a stream of functioning to explain sequence do programming step and as program documentation which it is to facilitate the understanding of to program. Way of designing simple data bases :
  • Collecting all entity in application which you wish to make, then determine also data items (field) in entity.
  • Specifying keys of index. Index is sequence list assess in one field for the entity of made an index to field to be referred as with field lock or index field. One other of vital importance is to specify primary key. Primary key is important so central in compilation of tables, because : given by field is primary index, will have the character of uniquely (may not twin), key required to specify relationship between tables, specifying relationship between tables.
There is three relationship type between tables, that is :
  • One To One : is most relationship of simple, which every data at a its it relationship with a data also at other tables.
  • One To Many : is relationship which at most show, which a data at one particular tables have relationship with many data at other tables.
  • Many To Many : is relationship which must avoid in scheme of bases of data. If relationship happened of this, so have to look for by its alternative by making the tables of medium between tables.


Software is an result execute (instruction) able to walk at computer, functioning with true, can serve all possibility of data manipulation and input, instruction and also abilities to conduct an specific function. Kind of software :
• Language Software of programming
• Application data bases Software ( database)
• Application Software of design web
• Graphical Application Software
• Application Software of multimedia

Making of software relate to developer, is software a software able to be used to develop program. Algorithm is logical steps sequence is solving of the problem of which is compiled systematically and is logical. Logical is fundamental matter in logical algorithm, definition is acceptable or sensible of mind and also can be determined by correctness or is wrong of him. Algorithm of programming is logical steps sequence to build a compiled program systematically. Making of software based on algorithm method of programming identified with existence of problem, value early wanted result and problem, process marking of Software good is :
• Good device (systematic and methodological)
• Can execute truly by computer
• Functioning truly according to device
• Can serve all possibility of input
• Interesting appearance
• Friendly User
• Easy in development and conservancy
Learn program is getting wise to strategy resolving of systematic way and problem, methodology resolving of read problem, then in notation agreed on with. Learning program have the character of the understanding of problem, analysis and syntax. Learn language programming its meaning learn to wear language software programming of procedure syntax’s, and certain standard order, shape exploit specific instruction in each language software of programming certain. Procedural according to Indonesian dictionary mean activity phases to finish an method or activity do step for the shake of step by exact in solving an problem. Algorithm of is including process of procedural. At programming of procedural, program differentiated by between part of data with part of instruction. Part of instruction consist of sequence (instruction sequence) to be executed one per one alternately. Groove execution of instruction can change if (there are) any ramification of conditional.
Data on file in manipulation memory by instruction by sequence (named by this procedural), this of programming procedural. Language of programming high level like language of Cobol, Basic, Pascal, C language, Fortran and of is included in language category programming of procedural.
Logical condition notation algorithm it is so easy implementation to language software of programming certain. Order writing of algorithm consist of three part, is :
  • Program title (header) : Program title is part of used as by algorithm text is place define the name of program. Name of program wearied by may not is equal to name of procedure, function and there may not be any dissociation use space.
  • Declaration (dictionary) : Declaration is part of algorithm text as place to define the name of type (type), constantan (variable and const) and also function definition place (procedure and function) (procedure). Comment is the part of algorithm notation which will not execute by comment program, condition is to reside in between parenthesis, example {comment}. Comment can be placed wherever in algorithm notation because especial function of comment is to water down or explain process a algorithm notation.
  • Algorithm : Part of algorithm is part of containing core of instructions or denominating of action which have been defined. Text algorithm component in programming of procedural can in the form of instruction, sequence (case sequence), analyze or restating (loop). Every algorithm step read the from the top of downwards because executing program also walk the from the top of downwards so that sequence writing of algorithm determine step sequence execute program.
Diagram emit a stream of program is picture explaining sequence read of decision data, take of data, processing data and presentation of data process result. Diagram emit a stream of functioning to explain sequence do programming step and as program documentation which it is to facilitate the understanding of to program. Way of designing simple data bases :
  • Collecting all entity in application which you wish to make, then determine also data items (field) in entity.
  • Specifying keys of index. Index is sequence list assess in one field for the entity of made an index to field to be referred as with field lock or index field. One other of vital importance is to specify primary key. Primary key is important so central in compilation of tables, because : given by field is primary index, will have the character of uniquely (may not twin), key required to specify relationship between tables, specifying relationship between tables.
There is three relationship type between tables, that is :
  • One To One : is most relationship of simple, which every data at a its it relationship with a data also at other tables.
  • One To Many : is relationship which at most show, which a data at one particular tables have relationship with many data at other tables.
  • Many To Many : is relationship which must avoid in scheme of bases of data. If relationship happened of this, so have to look for by its alternative by making the tables of medium between tables.


Recent Articles

Blog Archive