MA351 Homework 3
Due at 4:59pm in my mailbox in SAS 3151, Tuesday, November 5, 2019
All solutions must be submitted in hardcopy
either to me in class or placed in my mailbox.
Note my office hours on my
schedule.

DMM §3.3, Problem 8, page 107. Note: in order to
have a unique DFS tree, assume that the order of
the neighboring vertices of each vertex is alphabetical
and that you start at vertex labeled a.
Please also indicate when the oneway street assignment is impossible and why.

Consider the formula:
1


(0–b+(b^{2} – 4ac)^{1/2})

2a


Using the binary operators + (plus), – (minus),
* (times), / (divides),
and ^ (exponentiation), all of which have exactly 2 operands, draw the expression
tree corresponding to this expression.
Please note that 1/2 is not a constant.

Convert the expression tree into a minimally parenthesized linear infix
expression string, using precedence and lefttoright rules whenever possible.

Write the prefix and postfix expression string equivalent to the expression tree.

Problem 1c in the
Fall 2018 second exam.

Problem 6 in the
Fall 2018 second exam.
Additional hint for part b: the xcoordinate of the limit
point is the xcoordinate of that vertical side of drawn
dashdotted rectangles that have a vertex of the equilateral triangles on it.
For iteration 1 it is x_1 = 2. for iteration 4 it is x_4 = 2–2/27.