数据结构(本)课程作业3608（Data structure (Ben) homework 3608）.docVIP

数据结构(本)课程作业3608（Data structure (Ben) homework 3608） Books are friends, although not enthusiastic, but very loyal -- Hugo Data structure (this) course assignments Assignment 2 (this section covers the contents of chapter 3-5 of the textbook) 1. Single choice 1. If the element 1, 2, 3 goes on the stack, then the stack order cannot be (). A. 3, 2, 1, B. 2, 1, 3 C. 3, 1, 2, D. 1, 3, 2 2. The queue entry sequence for one queue is 1, 2, 3, 4 The output sequence of the queue is () A. 4, 3, 2, 1, B. 1, 2, 3, 4 C. 1, 4, 3, 2 d. 3, 2, 4, 1 3. When the new element is pressed into the sequential stack, it should () A. Move the top pointer of the stack first, then deposit the element b. first, store the element and then move the top pointer of the stack C. the order doesnt matter 4. At the top of a stack, the node of a p pointer is pushed to the stack and should be executed (). A.t op - next = p; P. - next = top - next; Top - next = p; C.p - next = top; Top = p; D.p - next = top - next; Top = top - next; 5. When a node is deleted in a stack top of a stack, save the value of the deleted node with x, then execute () A.x = top; Top = top - next; B.x = top - data; C.t op = top - next; X = top - data; D.x = top - data; Top = top - next; 6. In general, the conversion of recursive algorithm to equivalent non-recursive algorithm should be set (). A. stack b. queue C. Stack or queue D. Array 7. The suffix expression of expression a * (b + c) -d is () A.a BCD * + -b.a BC + * d - c + d. - + * abcd 8. Determine that the condition for a sequential queue sq (m0 at most) is () The A.s q- rear - sq- front = = m0 B.s q- rear - sq- front - 1 = = m0 C s q- front = sq- rear D.s q- front = sq- rear + 1 9. Determine that a cyclic queue Q (m0) is the condition of () Front = q- rear b.q- front! = Q - rear C q- front = = (q- rear + 1). = (Q - rear + 1) % m0 10. The condition to determine that a loop queue Q (maximum element is m0) is () Front = q- rear b.q- front! = Q - rear C q- front