Analysis of Algorithms and Computational Complexity Questions and Answers
Practice ModeShowing 10 of 239 questions
Q151
The process of arranging data in alphabetical or numerical order is called
Answer: Option A
Q152
A _____ search begins the search with the first array element.
Answer: Option A
Q153
The data for which you are searching is called the
Answer: Option A
Q154
Which of the following is an postfix notation of NOT A OR NOT B NOT C
Answer: Option B
Q155
A postfix expression is merely the reverse of the prefix expression
Answer: Option A
Q156
A stack may be used to aid in evaluating a prefix expression
Answer: Option A
Q157
If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will set the appropriate variable to the appropriate value ?
Answer: Option C
Q158
The number of nodes in a full binary tree of depth 4 is
Answer: Option C
Q159
Which of the following is false ?
Answer: Option B
Q160
When you use the bubble sort, the first step in swapping two of the elements in the code array is to
Answer: Option A