MA-351 Homework 3
Due as indicated for each problem.

All solutions must be submitted on the Moodle web site for the class at wolfware.ncsu.edu. You may upload a photo of your handwritten solution or a file of your typed solution.
Note my office hours on my schedule.
  1. Due Thur Oct 27, 11:59pm.
    DMM §3.3, Problem 8, page 107: photo of book pages. 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 one-way street assignment is impossible and why.
  2. Due Thur Oct 27, 11:59pm.
    Consider Stirling 's formula for approximating n!:

    		n
    (
    		)n * ( 2*π*n )1/2

    		e
    1. 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.
    2. Convert the expression tree into a minimally parenthesized linear infix expression string, using precedence and left-to-right rules whenever possible.
    3. Write the prefix and postfix expression string equivalent to the expression tree.
  3. Due Thur Oct 27, 11:59pm.
    Please consider the context-free grammar from class (also given in Problem 1c in the Fall 2016 second exam). Please give the parse tree for the string (a↑b/c–d↑e)*f+g .
  4. NEW Due Mon Nov 7, 11:59pm.
    Problem 4 in the Fall 2021 second exam.
  5. NEW Due Mon Nov 7, 11:59pm.
    DMM §3.6, Problem 13, page 168: photo of book page. Note that your coloring also needs to include the country "11" surrounding countries 1-10.