Information Technology

In a word, algorithm of trouble shooting is :

• TEST of DEVICE. If correctness hop to TEST of TCP / IP. If wrong SET last DEVICE try again. If still wrong also, check CARD and of DRIVER kernel of Linux your

• TEST of TCP / IP. If correctness hop to TEST of PING, if wrong to SETTING TCP / last IP try again

• TEST PING-GATEWAY. If correctness hop to TEST of PING, if wrong CHECK CABLE

• TEST PING-INTERNET. If correctness yes have, finished. If is wrong, set last routing try again. Extension of Internet your surely is breaking

Algorithm Concept

Algorithm in public context is an step medley written in work is notation of descriptive logical for attainment an solution or to go to an specific purpose. Meanwhile the so called with program in general, is instruction corps or compiled command in such a manner so that have correct natural existence sequence to finish an problem. Become algorithm of programming can be explained as instruction medley or compiled command in such a manner so that have correct natural existence sequence and have to obey to finishing an problem.

Diagram A Stream Of Emit (Flow Chart)

Meanwhile to conception about diagram emit a stream of, much the same to with algorithm concept, just only here its writing more made moderate namely do not descriptive with sentences long but by wearing function symbols and operator. As for symbols which is often used in depiction of diagram emit a stream of shall be as follows.

There are some used operator namely operator of arithmetic and relationship operator (gathering). Diagram emit a stream of can represent representation of data stream or program stream (instruction medley). But usually an diagram picture emit a stream of to represent its his representation, its meaning an diagram emit a stream of can be viewed as by diagram data stream at the same time as instructions flow chart program. An diagram emit a stream of which is instruction stream representation data and program hence can be made as model or design of your software (program).

Process Ramification

Algorithm and diagram emit a stream of which have been studied by above is to using successive data structure, its meaning from first step up to last step there no ramification process (decision making), choice and or repetition. Meanwhile for the process of ramification, used if in its process, program stream medley obliged to jump or go to an certain step which is not successive, this matter often is also referred as with ramification. Process this ramification can on condition that (conditional ramification) and or do not (ramification is not conditional).

Queue

Queue represent one data structure type which is often used for the simulation of situation of real world. Queue is an data aggregate of is which addition of element only can be conducted at one particular back part (referred as with side behind or rear), and abolition (intake of element) to pass other back part (referred as with next side or front). Used term if someone enter in a queue is Enqueue. While term which is often wearied by if someone go out from queue is Dequeue. Heap use principle “enter lastly of first exit” or LIFO (Last In First Out), hence at principal queue the used is“ entering is first of exit first” or FIFO (First In First Out). Equally, sequence element exit will is equal to sequence entry.

Tree

Tree is linear data structure form do not having nature and special marking. This structure is usually used to depicting relation having the character of hierarchical between element existing. Simplest example of which we can see in everyday life, specially in family is family ancestry. Tree like picture under referred as with linear of chart where every element can have more than two branch. Simply tree can be defined as element corps which one of the its element is referred as with root and remains other element (so called node) broken to become a number of becoming gathering which each other do not correlate one another, so-called with sub tree, or is also referred as with branch. If us see in each sub tree, hence this is sub tree also have root and its it him each. Besides level, is also recognized by term degree of degree from an node. Degree of an node expressed as to the number of child or born of node. Leaf also is often referred as with external node external of node. So that other node, except root, also is often referred as with node in is internal of node. High deepness or height (depth) from an tree is maximum level of node in the tree lessened by 1. Ancestor an node is all located node in one band with the node of root until node evaluated. Forest is corps a number of tree which do not each other correlating.

Graph

Graph can be conceived as corps of object activity or, for example, town bus route from one terminal to other terminal, route journey of post package at the time of he accompany letter from one house to other house, and other example of is which can be presented by as a graph. Both example of above representing classic example of with theory graph which more knowledgeable with salesman traveling of problem or problem path shortest, which is on its principle look for short band from all place which must fulfill, so that can economize time, energy, and also expense. Graph in general can be defined as dot corps or nodes of vertices and line or arcs edges. Because line always early with an dot and terminated at other dot, hence line can be written down as couple between two dot.

Data structure at algorithm of programming there is some method, that is : stack, queue, tree, graph. Election used method very hinging with data, good in gathering process and also depository its.