1:24 PM -
Posted by LEYDY MILENA -
0
comments


This space will learn a little more and Call Stuff Occupational my profile.
Just keep my picture and ...
2:29 PM -
Posted by LEYDY MILENA -
0
comments
Network layer, according to the normalization OSI, it is a layer that connectivity provides and selection of route between two systems of hosts that can be located in geographically different networks. It is the third level of the model OSI and its mission is to obtain that the data arrive from the origin at the destiny although they do not have direct connection. Transport level offers services to the superior level () and it leans in the connection level, is to say, it uses its functions.
If you wish more investigation on this content to give click on the scheme.

If you wish more investigation on this content to give click on the scheme.
3:18 PM -
Posted by LEYDY MILENA -
0
comments


dictionary it is a reference book of words and/or terms that are ordered generally alphabetically. Of these words or terms its meaning is provided, etimología, spelling and, to the case of certain languages it fixes its pronunciación and syllabic separation.
The information that it provides varies according to the type of dictionary del that treats. In electronic version through a program of calculation that makes work an electronic PDA or of a computer of general aims.
The information that it provides varies according to the type of dictionary del that treats. In electronic version through a program of calculation that makes work an electronic PDA or of a computer of general aims.
IF YOU WISH MAS INFORMATION TO GIVE CLICK ON THE IMAGE
2:14 PM -
Posted by LEYDY MILENA -
0
comments
The units of measurement in Computer science sometimes can be something confused. We are going to try to
clarify some concepts seUSED UNITS OF MEASUREMENT IN COMPUTER SCIENCEeing that they talk about. We can group these measures in three groups: Storage, processing and data transmission.
If you wish to have more information you can give click on the image…

clarify some concepts seUSED UNITS OF MEASUREMENT IN COMPUTER SCIENCEeing that they talk about. We can group these measures in three groups: Storage, processing and data transmission.
If you wish to have more information you can give click on the image…
2:00 PM -
Posted by LEYDY MILENA -
0
comments


A commando (I trace of the English command, “order, instruction”) is an instruction or mandate that the user provides to a computer science system, from the line of commandos (like a shell) or from a call of programming. It can be internal (contained in the own interpreter) or external (contained in an EXE file).
IF YOU WISH TO HAVE MORE INFORMATION TO GIVE CLICK ON THE IMAGE…
1:53 PM -
Posted by LEYDY MILENA -
0
comments
PDF (acronym of English Portable Document Format, portable document format) is storage format of documents, developed by the company Adobe Systems. This format is of compound type (vectorial image, bit map and text). Specially it is devised for documents susceptible to be printed, since it specifies all the necessary information for the final presentation of the document, determining all the details of how it is going to be, not requiring previous processes of adjustment nor of maquetación.
For more information on this subject to give click on the image
11:48 AM -
Posted by LEYDY MILENA -
0
comments


Visual BASIC it is a programming language developed by Wing Cooper for Microsoft. The programming language is dialecto of BASIC, with important added. His first version was presented/displayed in 1991 with the intention to simplify to the programming using an atmosphere of completely graphical development that facilitated the creation of graphical interfaces to a certain extent and also the same programming.
For more information on this subject to give click on the image
11:36 AM -
Posted by LEYDY MILENA -
0
comments

The idea of this algorithm is the one to alongside pass the three missionaries and the three monks of side B To without the cannibals eat the missionaries.
BEGINNING NOTE: As much the cannibals as the missionaries rise the boat giving click on them and the boat moves pressing the word of yellow rhombus “GO”.
Step 1. In the boat that is located in side B it raises to a monk and a cannibal to take them A alongside.
Step 2. In the side the cannibal lowers and the monk gives back itself towards side B.
Step 3. In side B the monk lowers and two cannibals rise and happen towards side A.
Step 4. Alongside At they arrive both Cannibal and single one lowers one, being in the side To two cannibals and the other is given back towards side B.
Step 5. When arriving other cannibal alongside B lowers and two monks rise and they go away towards side A.
Step 6. When arriving alongside At both monks, a monk lowers and a cannibal rises and they go away towards side B.
Step 7. They arrive B alongside the monk and the cannibal, lowers the cannibal and another monk rises and monks go away both towards side A.
Step 8. Alongside At monks arrive both who lower and the cannibal rises and he goes away single for side B.
Step 9. Cannibal B arrives alongside where they are the other two cannibals and one of them rises and they go away both cannibal towards side A.
Step 10. They arrive both cannibal alongside At and the one of them other lowers is given back towards side B.
Step 11. When arriving alongside B the other cannibal rises and happen cannibal both alongside To and there they lower both.
Step 12. In the side To already they are both cannibal who lower and the other cannibal and the three monks meet with. CONGRATULATIONS!
AIM OF THE ALGORITHM
In order to see more games of logical it visits the page:http://www.plastelina.net/

ALGORITHM
The idea of this algorithm is the one to alongside pass the three missionaries and the three monks of side B To without the cannibals eat the missionaries.
BEGINNING NOTE: As much the cannibals as the missionaries rise the boat giving click on them and the boat moves pressing the word of yellow rhombus “GO”.
Step 1. In the boat that is located in side B it raises to a monk and a cannibal to take them A alongside.
Step 2. In the side the cannibal lowers and the monk gives back itself towards side B.
Step 3. In side B the monk lowers and two cannibals rise and happen towards side A.
Step 4. Alongside At they arrive both Cannibal and single one lowers one, being in the side To two cannibals and the other is given back towards side B.
Step 5. When arriving other cannibal alongside B lowers and two monks rise and they go away towards side A.
Step 6. When arriving alongside At both monks, a monk lowers and a cannibal rises and they go away towards side B.
Step 7. They arrive B alongside the monk and the cannibal, lowers the cannibal and another monk rises and monks go away both towards side A.
Step 8. Alongside At monks arrive both who lower and the cannibal rises and he goes away single for side B.
Step 9. Cannibal B arrives alongside where they are the other two cannibals and one of them rises and they go away both cannibal towards side A.
Step 10. They arrive both cannibal alongside At and the one of them other lowers is given back towards side B.
Step 11. When arriving alongside B the other cannibal rises and happen cannibal both alongside To and there they lower both.
Step 12. In the side To already they are both cannibal who lower and the other cannibal and the three monks meet with. CONGRATULATIONS!
AIM OF THE ALGORITHM
In order to see more games of logical it visits the page:http://www.plastelina.net/
11:37 AM -
Posted by LEYDY MILENA -
0
comments
Algorithm
From Wikipedia, the free encyclopedia
Jump to: navigation, search
In mathematics, computing, linguistics and related subjects, an algorithm is a sequence of finite instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.
A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability" (Kleene 1943:274) or "effective method" (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939.
It complements this information in:http://en.wikipedia.org/wiki/Algorithm
From Wikipedia, the free encyclopedia
Jump to: navigation, search
In mathematics, computing, linguistics and related subjects, an algorithm is a sequence of finite instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.
A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the "decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability" (Kleene 1943:274) or "effective method" (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939.
It complements this information in:http://en.wikipedia.org/wiki/Algorithm
11:22 AM -
Posted by LEYDY MILENA -
0
comments
This article is principally about managing and structuring the collections of data held on computers. For a fuller discussion of DBMS software, see Database management system.
A database is a structured collection of records or data that is stored in a computer system. The structure is achieved by organizing the data according to a database model. The model in most common use today is the relational model. Other models such as the hierarchical model and the network model use a more explicit representation of relationships.
Contents[hide]
More information about this page in:http://en.wikipedia.org/wiki/Database
A database is a structured collection of records or data that is stored in a computer system. The structure is achieved by organizing the data according to a database model. The model in most common use today is the relational model. Other models such as the hierarchical model and the network model use a more explicit representation of relationships.
Contents[hide]
More information about this page in:http://en.wikipedia.org/wiki/Database
Theme by Function
© 2008 COMPOUND SYSTEM Bloggerized by Falcon Hive.com