东软笔试题（Neusoft test paper）.docVIP

东软笔试题（Neusoft test paper） Neusoft test.Txt, when you think you have nothing, you have at least time, time can heal all wounds, so please dont cry. A contented expectation is worth a wait; a willing hope is worth a fall. The secret to staying young is having a restless heart. It is not the quality of life that determines what tastes, but the quality that determines what life is. First, the multiple-choice questions (30 questions, 2 points for each subject, 60 points out of the question) 1, (data structure) on the graph of the two fork tree, according to the first root order traversal, the resulting sequence of nodes is B A, ABCDHEIFG B, ABDHIECFG C, HDIBEAFCG D, HIDBEFGAC 2, (data structure) a linear table (A1, A2, A3,..., A500) sorted in the value of all the elements, for a given value of K, with the dichotomy in the lookup table and K equivalent elements, in search of the unsuccessful cases, up to A times. (Im not sure.) A, 8 B, 9 C, 10 D, 11 3, (data structure) two fork tree search, depth first and breadth first, depth first, including A A, preorder traversal, preorder traversal, preorder traversal, B, preorder traversal, backward traversal, and level traversal C, preorder traversal, preorder traversal, hierarchical traversal, D, preorder traversal, backward traversal, and hierarchical traversal 4, (data structure) known, two binary tree preorder sequence is ABDECF, the sequence is DBEAFC, then the sequence is D A, DEBAFC, B, DEFBCA C, DEBCFA, D, DEBFCA 5, the queue (data structure) is a commonly used data structure, its elements into the team and the team follow the principle of A. A first in first out B, advanced out of C, random, random out D, sequential, random out 6, (data structure) in the data structure, the relationship between nodes and nodes is the logical structure of data. Data structures are usually divided into two categories according to logical relations A, dynamic structure and position structure, B, compact structure and non compact structure C,