历年考试（Past year exams）.docVIP

历年考试（Past year exams） (1) the following data structure, which belongs to nonlinear structure, is (D) (A) cyclic queue B) C with chain queue) two fork tree D) with chain stack (2) in the following data results, it is possible to access data in accordance with the advanced ex post principle (B) (A) circular queue B) stack C) queue D) two fork tree (3) for circular queues, the following statement is correct A) the head of the team is fixed B) the team head must be larger than the pointer C) the team head must be smaller than the tail pointer D. The team head pointer can be larger than the tail pointer or smaller than the tail pointer (4) the spatial complexity of the algorithm is A) B computer storage space required by the algorithm in the implementation process) the amount of data processed by the C algorithm) statement or instruction number D algorithm in the program) temporary work unit required by the algorithm in the implementation process of the number (5) a criterion for partitioning modules in software design is (A) low cohesion, low coupling B), high cohesion, low coupling C), low cohesion and high coupling D) high cohesion and high coupling (6) the following options do not belong to the principles of structured programming A) encapsulate D) top down C) modular D) step by step refinement (1) the following statement is correct A) stack is the FIFO linear table B) queue is a FIFO linear form C) circular queue is nonlinear structure D) ordering table can use sequential storage structure, can also be used in chain store structure (2) the data structure that supports subroutine calls is A () stack B) tree C) queue D) two fork tree (3) A two fork tree has 5 degrees of 2 nodes, then the two leaves in the tree node is the number of points A) 10, B) 8, C) 6, D) 4 (4) in the following sorting methods, the worst case comparison is the least A) bubble sort B) simple choice of sorting C) direct insertion of sort D) heap sort (5) software can be divided into application sof