Application title
1. Each element disposed A5 × 6 two-dimensional array of 4 bytes, known Loc (a00) = 1000, the number of bytes A accounted for? 120 A junction terminal a45 start address? When the 1116 priority in rows and columns to store the start address a25 respectively?
Line Priority: Priority 1068: 1108
2. Sparse matrix storage method and classification.
Its triple ranks Number
Category: triplets order table, the order table rows logically linked, cross-linked list
3. Conceptual structure storage and generalized table: Table how to distinguish nodes and node atoms
4. Seeking the following generalized table computation results:
(. 1) GetHead ((P, H, W)): P
(2) getTail ((B, K, P, H)): (K, P, H)
(. 3) GetHead (((A, B), (C, D))): (A, B)
(. 4) getTail (((A, B), (C, D))): ((C, D))
(. 5 ) GetHead (getTail (((A, B), (C, D))): (C, D)
(. 6) getTail (GetHead (((A, B), (C, D))): (B)
