THE METHODS OF ORGANIZATION OF FACTS

IN THE INFORMATIONS SYSTEMS

Zhangisina G.D. the heard of the Department Computer Sciences,

KNTU named Satpaev, Kazakhstan, Almaty.

Akzholova A.I., teacher, ATU, Kazakhstan, Almaty

The models of facts present the formal apparatus for description of informatical necessities for users.

Classification of informatical constructions (informatical objects) is connected with the domain of usage in EIS.

1. The objects for technology of facts are relations and fan relations.

2. The objects for technology of skill intellect. They are: texts, graphical representations<phonograms and videophragment.

The recountal model of facts is characterized with the next components:

· with informatical construction. It means with relations of two level structure;

· with admissidle operations, u means won proection, optuon, connection and with others;

· with limitations, it means with functional subordinations between attribute of relation.

The base method of entering the massive is stairing search. This method supposes the regulation of cultivating records in increase or decrease. The easiest way of starting search is successive searching. The algorithm of successive seacching can be in Pascal language like this:

Program poisk;

Const M=20;

Var i, q: integer;

p:array[1…M] of integer;

begin

write (‘enter q’);

readln(q);

for i: 1 to M do

begin

write(‘enter’, i, ‘meaning’,q)

end.

Constants n and S is choosed in n – staring in earlier time. The minimum numeral of comparison will get in S=M’(1/n) (where M there is numeral of records). When we have S=2 it will be searching binary. The algorithm of this searching can be shown in PASCAL language like this:

program bin;

const M=10;

var I, A, B, q: integer;

p:array [i…M] of integer;

begin

write(‘enter q’);

readln(q)

for i:(q)

for i:=I to M do

begin

write(‘enter’, i, ‘element of massive’); reabin(p[i])

end;

A:=0; B:=M+1;

i:=(A+B) div 2; {desfinition of interval middle}

{circle till mecting p[i]=q or till zero interval A=i}

while

(p[i]<>q) and (A<i) do

begin

if q>p[i] then A:=i else B:=i;

i:=(A+B) div 2; {middle of new interval}

end.

Answering in cultivating tasks of facts requires the usage of organizating method of facts. The casiest method of using these targets is listing (chain) organization of facts. List is a lot of records which help of connecting a ress. The 1^st address or the number of record are kept in address of connection.

The description of listing records in programming language can be produced with two ways.

1. Definition of connecting addresses as the first addresses of records:

Type ref=^node;

node=record

key: integer; {key attribute of record}

other: string[30]: {other attributes}

next: ref {address of communication}

end;

2. Definition of connecting addresses as the numbers of records:

cons+M=12

type

node=record

key: integer; {key attribute of record}

other: string[30]: {other attributes}

next: ref {address of communication}

end;

var t: array[1…M] node;

In comparison with the first way, the second way is more practical, especially in keeping the List inside organization.

Literature:

1. Zhangisina G.D. The theory of the economical informative systems.

A.: ATU, 2008, 100 p.