计算机应用基础数据结构部分试题及答案(2)(6)

relationship, R:

K={a, B, C, D, e, F, G, h}

R={, , , , }, f>, ,

The data structure has a _____ structure.

9. a collection of data structures, K, and his two - element relationship, R:

K={a, B, C, D, e, F, G, h}

R={, , , , }, e>, ,

The data structure has a _____ structure.

10. a collection of data structures, K, and his two - element relationship, R:

K={1,2,3,4,5,6}

R={(1,2), (2,3), (2,4), (3,4), (3,5), (3,6), (4,5), (4,6)}

The data structure has a _____ structure.

1. sets, linear structure, tree structure, graphic structure (mesh structure)

2. sequentially stored, chained, stored, hashed, indexed

3., physical structure, logical structure (the order of the two can be reversed), operations, algorithms, the original

4., poverty, certainty, feasibility, input and output

5. statement execution times, storage space

6. orders of magnitude, O (1), O (n), O (logn) and O (N2)

7. data, data elements, data items, data items, files

8. linear structure

9. tree structure

10. graphic structure (mesh structure)

11. if the linear table often need to insert and delete operations, it is best to use _____ storage structure, if often need to search operation of the linear table, it is best to use _____ storage structure.

12. access to a linear table of elements with a given value of time complexity in the order of _____.

13. for a length n of the sequence table, the time complexity of insert header elements for _____, at the end of the table, insert the time complexity of the elements _____.

14. in a single linked list node pointer P points to insert a pointer to the Q node, the _____ value assigned to q->next, and

then the _____ value assigned to p->next.

15. in a single chain table P point to the node before inserting a pointer, s point to the node, you can perform the following operations:

(1) s->next=_____;

(2) p->next= s;

(3) t= p->data;

(4) p->data=_____;

(5) s->data=_____;

The 16. assumption to the first node in the list of the single table pointer for the head, to the single list header, insert the new node pointer P points, the first implementation of _____ assignment, then performs _____ assignment.

17. in a single linked list delete pointer P points node successor node, need to _____ the value assigned to the p->next pointer domain.

18., in a single chain table, delete the pointer P point to the node, you should perform the operation:

Q=p->next;

P->data= p->next->data;

P->next=_____;

Free (Q);

In the 19. _____ list, either by setting a head pointer can be determined by setting it a tail pointer, i.e. by a head pointer or the tail pointer can access to each node in the linked list. Twenty

When a pointer is inserted before a node pointed to by a P in a bidirectional cyclic list with a header, the following operations can be performed when the s points to the node:

(1) s->data= element;

(2) s ->prior=_____;

(3) p->prior->next=s;

(4) s->next=_____;

(5) p->prior=_____;

11. chain, order 12.O (n)

13.O (n) and O (1)

14.p->next, q

15.p->next, s->data, t

16.p->next=, head, head=p

17.p->next->next

18.p->next->next

19. cycle

Some things, knowing that is wrong, but also to adhere to, because not reconciled; some people, knowing that love is also to give up, because there is no end; sometimes, knowing that there is no road, but still forward, because used to.

20.p->prior, P, s

21. pointers in a two-way linked list pointed to by P node before inserting a new node, its time complexity is in the order of _______.

22. linear table length refers to _______.

23. in the linear order of the table storage, the logical relationship between elements is determined by _______, in linear form a chain store, the logical relationship between elements is determined by _______.

24. according to each node chain storage structure of linear