第三章 Stack：introduce some about stack,it is very important3.1Introduction to Stacks:This chapter explains why you should learn stack and a little program[单选题]
3.2Stack Operations:introduce about Stack Terms,Alogorithm for PUSH,Algorithm for POP and Stack Implementation
3.3Applications of Stacks:introduce about Dynamic Data Structures and Linked representation of a Stack
The element is inserted first and will be removed last in _____________.
选项:[ queue, stack
, linked list
, none of the above
]
[单选题]
The expression 1 * 2 ^ 3 * 4 ^ 5 * 6 is evaluated as (^ is for power, as in a^b=ab):
选项:[ 49152, 173458
, 162^30
, 32^30
]
[单选题]
The data structure required to check whether an expression contains balanced parenthesis is?
选项:[ Stack, Queue
, Array
, Tree
]
[单选题] The postfix form of A*B+C/D is?选项:[ A*BC+/D
, *AB/CD+
, ABCD+/*
, AB*CD/+
]
[单选题]Which data structure is needed to convert infix notation to postfix notation?选项:[ Branch
, Queue
, Tree
, Stack
]
[单选题]
Transform the following infix expression to prefix form.
((C*2)+1) /(A+B)
选项:[ A B + 1 2 C * + /, / * + 1 2 C A B +
, / + * C 2 1 + A B
, None of the above
]
[单选题]
Transform the following infix expression to postfix form.
(A+B) * (C-D)/E
选项:[ A B * C + D / -, A B + C D * - / E
, A B + C D - * E /
, A B C * C D / - +
]
[单选题]A stack is a data structure in which all insertions and deletions are made respectively at: 选项:[ one end
, at any position
, in the middle
, both the ends
]
[单选题]Which of the following applications may use a stack?: 选项:[ All of the above
, Keeping track of local variables at run time
, Syntax analyzer for a compiler
, A parenthesis balancing program
]
[单选题]
Which of the following statement is correct.
选项:[ Postfix and prefix expressions use parenthesis, None of the above
, A postfix expression is not the reverse of the prefix expression
, A postfix expression is merely the reverse of the prefix expression
]
温馨提示支付 ￥3.00 元后可查看付费内容,请先翻页预览!
