221 quiz questions exam 2 prep

What is the recurrence relation for the code below?

• T(n) = T(n-1) + O(1) and T(1)=0

•  T(n) = T(n-1) + O(n) and T(1)=0

• T(n) = 2T(n-1) + O(1) and T(1)=0

• T(n) = 2T(n-1) + O(n) and T(1)=0

How many recursive problems are solved by the Recur_fun(int n) for n=3?

• 5

• 8

• 7

• 6

How many recursive problems are solved for n>0?

• n

• 2n

• 2ⁿ - 1

• 2ⁿ

How many recursive steps are required to reach the base case (the solutions to n=0)?

• n

• log₂n

• n/2

• nlog₂n

How can you classify this algorithm using the big-O asymptotic notation?

• O(n)

• O(log₂n)

• O(2ⁿ)

• O(n²)

Is this recursive function correct?

• True

• False

What is the purpose of postfix form for algebraic expression?

• The postfix form is used for find syntax errors of an algebraic expression.

• The postfix form provides a more readable form of an algebraic expression.

• The postfix form speeds up the evaluation process of an algebraic expression.

• The postfix form decreases the arithmetic operations.

What is the postfix form for the expression:  x+y-z+t

• x y + z - t +

• x y z + t + -

• x y + - z t +

• x y + z t - +

What is the purpose of using the stack data structure during the conversion from infix to postfix forms for an arithmetic expression?

• 
  To push the operands (numbers or variables) into the postfix form in the reverse order.

• To push the arithmetic operators before enqueuing them in the right order into the postfix form.

• A stack is used only to detect the end of an expression.

• A stack is redundant during the conversion to postfix form and it should not be used.

Assume that an expression consists of one digit numbers and arithmetic operations on them and it is given in postfix form:  4 3 1 + / 2 *

What is the value of the expression?

• -1

• 0

• 1

• 2