A lab consultant who can help with C251 questions is in LF105 or LF111.

See: www.ius.edu/rwisman/lab for current schedule.

Contact me by email with any questions. I can also usually arrange to meet on campus.

Options:

1. Bring a handwritten homework to class on due date.
    
2. Email Word document HW10.doc to instructor by 13:00 on due date.

Note:

• Draw Graphs by Hand
  • Scan in hand drawn graphs
  • If you are are able to cut and paste the scanned in graph into your Word .doc, then do so.
  • If you are not able to cut and paste the scanned in graph into your Word .doc
• Draw Graphs Using a Drawing Software Package
  • Copy and paste electronically generated graphs into your Word .doc.

• Section 10.1 -- pp. 693
  • 4
  • 6
  • 8
  • 18
  • Trees can model recurrence relations.

    The Fibonacci sequence is defined as:

    F₀ = 0
    F₁ = 1
    F_n = F_n-1 + F_n-2

    The first few terms of the Fibonacci sequence is given in the tree below. Calculate F₅ by:

    1. completing the tree drawing to the leaves, either F₀ = 0 or F₁ = 1
    2. compute parent vertex values by applying the recurrence definition to child vertices, e.g. F₂ = F₁ + F₀

    
    

• Section 10.2 -- pp. 708
  • 2
  • 4
  • 6
  • Decision tree for sorting:
    1. Redraw Figure 4 using actual values of a=5, b=3, and c=4.
    2. What is the least number of comparisons needed to sort 5 elements?
• Section 10.3 -- pp. 722
  • 8
  • 12
  • 14
  • 16b,c
  • 24a,b
• Section 10.4 -- pp. 734
  • 2
  • 14
  • 16 for Exercise 14 only.