2. The error in the following description of the linear table is ().
A. The linear table uses sequential storage ,which is easy to insertion and deletion.
B. The linear table uses sequential storage, and must occupy a continuous storage unit.
C. The linear table uses linked storage, which does not need to occupy a continuous storage unit.
D. The linear table uses linked storage, which is easy to insert and delete.
查看答案
3. If the most common operation of a linear table is to access any element with specified sequence number and insert and delete at the end of the operation, the () storage method is the most time-saving
A. sequence table
B. doubly linked list
C. doubly linked circular list with a head node
D. singly linked circular list
6. The most common operation for setting a linked list is to insert a node at the end and delete the tail node, so () is the most time-saving option.
A. doubly linked circular list with a head node
B. singly linked list
C. singly linked circular list with a tail pointer
D. singly linked circular list
7. The pointer in the static linked list represents ().
A. the address of the next element
B. memory address
C. array subscript
D. address of the left child and the right child
8. If the linear table with length n uses the sequential storage structure, the time complexity of the algorithm of inserting a new element in its ith position is ().
A. O(n)
B. O(0)
C. O(1)
D. O(n^2)
微信支付 
支付宝支付