04软件工程数据结构期末试卷2347（Software engineering data structure final examination paper 2347）.doc

04软件工程数据结构期末试卷2347（Software engineering data structure final examination paper 2347） 2, must build a new country strategy, strive to read a good book -- Guo Moruo Final examination paper for South China Agricultural University (A volume) 2004 semester first semester exam subjects: data structure (04 Software Engineering) Test type: (closed) examination time: 120 minutes Student number, name, grade, major Question no. One Two Three Four The total score Score A reviewer Note: 1, the answer to this test paper must be written on the answer sheet, the answer card at the same time written on the professional, class, student number, name; First, the multiple-choice questions (2 points per game, 30 points) The 1. HH sets the substring s1=ABCDEFG, s2=PQRST, and the function con (x, y) returns the connection string of the X and the Y string, subs (s, I, J) returns the substring of the string s, starting from the character of the ordinal I, and Len (s) returns the length of the string s, then J The result string of con (subs (s1,2, len (S2), subs (S1, len (S2), 2)) is () A.BCDEF B.BCDEFG C.BCPQRST D.BCDEFEF A stack of 2. input sequences of a, B, C, D, the following four sequences, _________ impossible is its output sequence A.a, C, B, D, B.b, C, D, a C.c, D, B, a, D.d, C, a, B 3. the length of the N chain link in the length m of the single list after the time complexity of the algorithm is _________. A.0 (1) B.0 (n) C.0 (m) D.0 (m+n) 4. in the order of length n (1, n), front and rear indicate the head and tail of the queue, respectively Determine the queue full conditions for _________. A.rear%n=front B.front%n+1=rear C.rear%n-1=front D.rear%n+1=front 5. two fork tree with 2n nodes, for mn, there can be no _________ node A.n degree is 0, B.2m degree is 0 C.2m degree is 1, D.2m degree is 2 The sequence of the first order of 6. n0 nodes of the two fork tree on the contrary, the two tree must not _________ the two fork tree A. any node, no left child, B., any node, no right child