Q$115$ Points

Grading comment:

In this problem, we modify the original definition of the Towers of Hanoi. We want to move $3$ disks from peg $3$ to peg $1.$ The table below shows the order in which recursive calls are made.

Fill in the missing blanks in the table for all the function calls generated when calling hanoi$(3,3,1).$ The first parameter is numDisks, the second is the number of the fromPeg, and the last is the toPeg.

Refer to the code discussed in class to complete the recursive calls. Each call should include the function name and three parameters described above. $(10$ points$)$

For questions Q$1\mathrm{.}1$ to Q$1\mathrm{.}10$:

hanoi$(3,3,1)$

hanoi$($Q$1\mathrm{.}1,3,$Q$1\mathrm{.}2)$

hanoi$(1,$Q$1\mathrm{.}3,1)$

hanoi$($Q$1\mathrm{.}4,1,$Q$1\mathrm{.}5)$

hanoi$($Q$1\mathrm{.}6,2,$Q$1\mathrm{.}7)$

hanoi$(1,$Q$1\mathrm{.}8,3)$

hanoi$($Q$1\mathrm{.}9,3,$Q$1\mathrm{.}10)$

For questions Q$1\mathrm{.}11$ to Q$1\mathrm{.}15$:

Fill in the missing numbers that order the following statements from $1$ to $7$ in the order that they were printed out $(1$ being the first and $7$ being the last$).$ Do not include spaces in your answer. $(5$ points$)$

Q$325$ Points

Grading comment:

Suppose $+$ and $-$ have HIGHER PRECEDENCE than $*$ and $/($in other words, we will first add$/$subtract adjacent numbers and then multiple$/$divide$).$

You have the following infix expression: $4+3*1+(6-5)$

Convert the expression from infix to postfix with the new precedence order. The table lists the action of each step and shows the contents of the stack and postfix expression after completing the action. Fill in all missing blanks with the correct step or output. If your stack is empty, write $($empty$)$ with the brackets. Note that popping an element off the stack and appending it to the postfix expression is one step. $(23$ points$)$