3

1. ; .

. . (8,53)
,
. (8,53)

2. ;
:
:
.
:
.
, , .
.
. (record),
.
.
.
.
. ,

. (53,54)

3. .

. (54)

4. ;
( ) :
(access),
.
(insertion), .
(deletion), ,
.
(searching), ,
.
(sorting), .
(copying),
.
(merging), .
(separation), . (54,55)

5.
;
,
, , .
,
.
. ,
. ( + =
Wirth) (55)

6. .
: .
: -
,
-
: - ,

-

 . (56)

7. .
( , .).

(indexes) . (..
[, ]) .
. (56)

8. .

, .
, (LIFO Last-In- First -Out). (59)

9. ;
:
(push) ,
(pop) . (60)

10. ;
.
( top)
.
, ,
(overflow) ,
, (underflow) . (60)

11. .

.
, ( FIFO : First-In-First-Out). (60)

12. ;
:
(enqueue) ,
(dequeue) . (61)

13. ;
.
: (front) (rear) ,
.

. (61)

14. .
(searching)
(key). (64)

. .
15. . (64)

16. ;
, .
, :
,
( , n 20),

17. .
a1,a2,...,an (permutation)
, ak1,ak2,...,akn ,
(ordering function), f, : f(ak1) f(ak2) ... f(akn) (66)
18. .(66,68)

19. .
(records),
(fields). .

20. ;
,
.
(primary key) .
,
(secondary keys),.

21. ;
( )
.

, ,
, .