山东科技大学
- Parenthesis are never needed for postfix or prefix expression( )
- 60. Consider an integer array which stores the values of binary tree as (91,6,82,18,4,2,100). What is the left child value of node with value 82? ( )
- 43. A polynomial can be represented using____________.( )
- 54. For any nonempty binary tree, if there are six nodes with degree two, what is the number of nodes with degree zero? ( )
- 21. Which one of the following statement is wrong? ( )
- Stack is a __________kind of data structure.( )
- The maximum number of nodes of level i of a binary tree is ___, for i≥1.
- 12. Which of the following term is not used with binary trees in general? ( )
- Which of the following data structures is a nonlinear structure? ( )
- 37. In the polynomial, A(x)= x4+10x3+3x2+1, what is the correct list of exponents only? ( )
- 25. Identify the recursive expression to find the factorial of a number using recursion. ( )
- 42. The most common way of representing ordered list is using_________.( )
- When user switch from one function to other then the details of previous function are stored into the stack.( )
- It is impossible to perform _________operation on an empty stack.( )
- 57. Consider an integer array which stores the values of binary tree as (91,6,82,18,4,2,100). What is the number of nodes with degree 0? ( )
- Which of the following tree traversal visits the root first?( )
- Which of the following are essential statement types for describing algorithms?( )
- 39. In the polynomial, A(x)= x4+10x3+3x2+1, what is (coefficient, exponent) pair of last term? ( )
- The time complexity of Binary search algorithm with n elements is________.
- What would be the asymptotic time complexity to find an element in the linked list?
- If we store the nodes of a binary tree in an array with index starting from zero, the father of a node having index n can be obtained by( )
- 29. The series 0,1,1,2,3,5,8,13,21….are known as ___________. ( )
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a( )
- 26. Binary search works on ________arrays.（ ）
- 9. In stack, the input sequence is ABC, and to get the output sequence CBA, the stack operations required are: ( )
- Consider the following C code, where stack is implemented using the array.#define MAX 10struct STACK { int arr[MAX] int top = __________;}What will be the initial value with which top is initialized?( )
- A linear collection of data element given by means of pointer is called ( )
- The maximum level of any node in the tree is called as( )
- A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?( )
- Which of the following term is not used with stacks in general? ( )
- What is the maximum number of nodes in a binary tree with depth of 4? ( )
- While evaluating expressions using computers, computer prefer ___________expression.( )
- The average case occurs in Linear search algorithm when（ ）
- 23. Arrows in the flowchart is used for the purpose of ______.( )
- The speed of a recursive program becomes ______ because of stack overheads.（ ）
- 35. In the polynomial, A(x)= x4+10x3+3x2+1, if we start representing using array, what is the last value in the array? ( )
- 67. Which of the following statements are correct? ( ).
- 55. Consider an integer array which stores the values of binary tree as (91,6,82,18,4,2,100). What is the depth of this binary tree? ( )
- A three-dimensional array is defined as an array in which________subscript values are used to access an individual array element.( )
- What is the term used to describe O(n) algorithm? （ ）
- If two numbers in sequence in the Fibonacci series are 13, 21, what is the next number? ( )
- If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed( )
- 48. What is the maximum number of nodes with degree zero in a binary tree at level 3? ( )
- If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?( )
- Sparse matrices have ( )
- In a stack, the process of inserting an element is called as ( )
- Identify the data structure which allows the deletions at both ends of the list, but insertions at only one end.( )
- 47. The time complexity of algorithm of adding two polynomials with m and n terms using arrays is equal to____________.( )
- Set of consecutive memory locations is called as ( )
- User perform following operations on stack of size 5 then: push(1);pop();push(2);push(3);pop();push(2); pop();pop();push(4);pop();pop();push(5); Which of the following is correct statement for stack ?( )
A:True B:False
答案:A:True
A:2 B:4 C:100 D:18
答案:2
A:both linked list and arrays B:none of the above C:arrays only D:linked list only
答案:A: both linked list and arrays
A:7 B:6 C:8 D:5
答案:A:7
A:One can understand the machine code easily B:One can understand a flowchart easily C:One can understand a algorithm easily D:One can understand a program easily
答案:A: One can understand the machine code easily
A:LIFO B:FIFO C:LILO D:None of these
答案:LIFO
A:
B:
C:
D:
答案:
A:root B:right C:left D:rear
答案:rear
A:Stack B:Queue C:Binary tree D:Linked list
答案:Binary tree
A:(4,3,2,0) B:(1,4,10,3) C:(1,10,3,1) D:(3,2,1,0)
A:fact(n)=n*fact(n-1) B:n!=n*(n-1)! C:n!=n*fact(n-1) D:fact(n)=n!
A:trees B:arrays C:queues D:stacks
A:False B:True
A:POP B:PUSH C:None of the above D:TOP
A:5 B:2 C:4 D:3
A:Preorder B:Level order C:Postorder D:Inorder
A:All the above B:Sequence C:Repetition D:Selection
A:(1,0) B:(0,1) C:(4,1) D:(1,4)
A:
B:
C:
D:
A:O(n) B:None
C:O(1)
D:O(n²)
A:2n+1 B:(n-1)/2 C:2n+2 D:n-1
A:Ramanujan series B:Euler series C:Prime series D:Fibonacci series
A:Stack B:Queue C:Linked list D:Tree
A:linked B:random C:unsorted D:sorted
A:Push, Pop, Push, Push, Pop, Pop B:Push, Push, Pop, Pop, Push, Pop C:Push, Push, Push, Pop, Pop, Pop D:Push, Pop, Push, Pop, Push, Pop
A:0 B:10 C:-1 D:1
A:Linked list B:Stack C:Graph D:Queue
A:leaf B:forest C:degree D:depth
A:Dequeue B:Queue C:Priority queue D:Circular queue
A:Top B:Pop C:Front D:Push
A:4 B:16 C:8 D:15
A:None of the above B:postfix C:prefix D:infix
A:Item is somewhere in the middle of the array B:Item is the last element in the array or is not there at all. C:Item is the last element in the array D:Item is not in the array at all
A:to decide the order of steps B:for decision making C:compare the values D:Input and output
A:minimum B:faster C:maximum D:slower
A:4 B:3 C:2 D:1
A:Arrays are nonlinear data structure B:The stack operates on a FIFO basis C:The queue is operates on FILO basis D:Linked list can be implemented using pointers
A:5 B:2 C:4 D:3
A:two B:three C:None of the above D:one
A:Linear B:Non polynomial deterministic C:Constant D:Logarithmic
A:13 B:34 C:43 D:21
A:DCBA B:ABCD C:DCAB D:ABDC
A:9 B:5 C:4 D:3
A:DCBA B:ABDC C:ABCD D:DCAB
A:none of the above B:many non-zero entries C:higher dimension D:many zero entries
A:POP B:CREATE C:PUSH D:ENTER
A:Output-restricted queue B:Input-restricted queue C:None of the above D:Priority queues
A:O(m-n) B:O(m+n) C:O(n) D:O(m)
A:pointer B:function C:array D:loop
A:None of these B:Overflow occurs C:Stack operations will be performed smoothly D:Underflow occurs
温馨提示支付 ￥5.00 元后可查看付费内容,请先翻页预览!
