Assignment 5 (Due Monday 10/08/2007 before class)

Weight: 150 points.

Submit via SVN.

Required problems (Must be submitted for grading):

• 14.2.4
  • Be sure to compare list searching with tree searching, as the problem states.
• 15.3.3
• 16.3.3
  • In this and similar problems in which you write mutually recursive functions, you don't need to write comprehensive examples & tests for each function. Instead, get good coverage on the main function (5+ examples), and just write a few examples/tests for each helper function (3 examples).
  • Be sure to include definitions for both variations of du-dir.
  • The final sentence should read "storing a file or a directory in a dir structure costs 1 storage unit." In other words, given a dir structure, each directory entry (a file or a directory) contained therein costs 1 unit of storage for the bookkeeping data. For a file, this is in addition to the size of its data.
• 17.1.2
• 17.6.1
• 17.7.1
  • Make sure you understand section 14.4 before working on this problem. Use this data definition as a starting point:

    ; expression
    ; An expression is one of:
    ; - a number
    ; - a symbol
    ; - (make-mul e1 e2) where e1 and e2 are expressions
    ; - (make-add e1 e2) where e1 and e2 are expressions
    

    You are required to extend this definition to include applications (that is, expressions like (f (+ 15 x))). Be sure to include a function template with your solution.

Access Permissions: (Please don't edit)

• Set ALLOWTOPICCHANGE = TeachersComp210Group