Hello. Yesterday I modified the article data model but can not modify it. In particular, with respect to the classification by the model data page reads: In addition to the classification for the role of databases, they can also be classified according to their data management model. The data model has little to do with how they manage data and has more to do with representing the data in the base. A data model is basically a "description" of something known as a container of data (where something is stored information) as well as methods for storing and retrieving information from these containers. This is quite far from what is considered a model of data in the subject area database in particular, left out models such as Entity-Relationship .. since they do not care at all about how to retrieve information. Data models are not physical things: they are abstractions that allow the implementation of an efficient database; usually refer to algorithms, concepts and models that facilitate matemáticos.son the work of a company administrator. I agree with one part: they are abstractions .... but I do not agree to take that view, by itself, with the efficiency of the base. Again, the entity-relationship model is counter to this. No worries at all (and should not worry) for efficiency. In sorting the data model, it is not relevant because it is not suitable for databases, but is more suitable for DBMS's

GAME 1 LOGICA.No want to play? enter the page http://plastelina.net/

It must pass the monks and cannibals from point A to point B across the river. Avoiding the numerical advantage of the cannibals on the monks:

C: cannibal

M: monk

1_ climb a C and an M and go from point A to point B C

2_sebaja returning an item andalusia M

3_ M is low and rises from 2 C to B Cy a

4_se low returns from a C to point A

5_se down the C & M from rising 2 to point B

6_baja 1 m and rises to point C from A

7_bajo a C and M's going to climb a point B

8_se low 2 M and C are going to go up a point

9_se rises and passes a C to B

10 is a low C and C returns a point A

11_se rises and returns a C to B 2 C bajandonse ...

... FELICITACONES.

GAME OF LOGIC No 2

You must pass the basket, the sheep and the wolf from point A to point B safe:

C: Baske

O: sheep

L: Wolf

Congratulations

USB 1,1 is an external bus that supports rates of 12 data transfer of Mbps. A single port USB can be used to connect up to 127 peripheral devices, such as mice, modems, and keyboards. The USB also supports to the Plug-and-Play installation and hot plugging.It began to be used in 1996, some manufacturers of computers began to include support for USB in its new machines. With the launching of iMac in 1998 the use of the USB extended. One hopes that it totally replaces the ports of series and parallels.

Sum all the numbers of one or several ranks of cells. Examples of Operation: Sum of rango.=SUMA (A1: A4) In the previous example all the numbers will be added that are in the A1 rank: A4, that is to say, A1+A2+A3+A4.Resultado: A1+A2+A3+A4Suma of cells separadas=SUMA (A1, B2, C3) In the previous example will add the values of the cells A1, A2 and A3Resultado: A1+B2+C3Suma of several rangos=SUMA (A1: A3, B2: B4) In the previous example the cells of the A1 rank will be added: A3 (A1, A2, A3) plus the cells of the B2 rank: B4 (B2, B3, B4) Result: A1+A2+A3+B2+B3+B4

An informal definition (a formal definition is not considered here , although it exists): finite set of rules that give a sequence of operations to solve all the problems of a given type. Of simpler form, we can say that an algorithm is a set of steps that allows us to collect a data. In addition it must fulfill these conditions:· Finitud: the algorithm must finish after a finite number of steps. It is more, is almost fundamental that it is in a reasonable number of steps. · Definibilidad: the algorithm must be defined of precise form for each step, that is to say, each step is necessary to avoid all ambiguity when defining. Since the human language is vague, the algorithms are expressed by means of a formal, or mathematical language or of programming for a computer. · Entrance: the algorithm will have zero or more entered, that is to say, amounts given before beginning the algorithm. These amounts belong in addition to specified sets to objects. By example, they can be chains of characters, whole numbers, natural, fractional, etc. One is always expressed representative amounts of the real world of such form that are apt for their interpretation by the computer. · Exit: the algorithm has one or more exits, in relation to the entrances. · Effectiveness: it is understood by that a person is able to make the algorithm of exact way and without aid of a machine in a finite time interval .