MA-351 Homework 3
Due at 4:59 in my mailbox in HA 245, Thursday October 19, 2006
Calculations necessary for these problems may be done either by
hand or with Maple.
Solutions may be submitted in person in class,
or you may email an ASCII text,
Maple Worksheet (.mws),
html, or postscipt/pdf-formatted document to me
(kaltofen@math.ncsu.edu).
Note my office hours on my
schedule.
- Consider the formula
-
Using the binary operators + (plus), - (minus),
* (times), / (divides),
and ^ (exponentiation), all of which have exactly 2 operands,
please draw the expression
tree corresponding to this expression.
-
Please convert the expression tree into a fully parenthesized linear infix
expression string.
-
Please write the parenthesis string consisting entirely of
properly matched left and right parentheses that linearly encodes
the structure of the tree given in answer a.
-
Please write the prefix expression string equivalent to the expression tree.
-
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.