4. If the address of the first element in a sequence table is base (index starts from 1), and each node accounts for M units, then the address of the ith node is ()
A. Base+(i-1)×m
B. Base+(i+1)×m
C. Base+i×m
D. Base-i×m
查看答案
5. The most common operation in a linear table is to insert an element after the last element and delete the first element, so () storage is the most time-saving operation.
A. singly linked circular list with only a tail pointer
B. singly linked lsit
C. singly linked circular list with only a head pointer
D. doubly linked list
1 In the data structure, the data structure can be logically divided into ( ).
A. dynamic structure and static
B. compact structure and non-compact structure
C. linear and nonlinear structure
D. internal structure and external structure
2 In the data structure, from the storage structure can be divided into ( ).
A. dynamic structure and static
B. sequential structure and linked structure
C. compact structure and non-compact structure
D. linear and nonlinear structures
3 The time complexity of the algorithm depends on ( ).
A. the scale of the problem
B. initial state of data to be processed
C. the scale of the problem and the initial state of the data to be processed
D. No correct answer
微信支付 
支付宝支付