Lecture 14 - October 10, 2007

 

Returned graded assignment8 and discussed grading of it briefly

 

Collected assignment9

 

We discussed

  • linked lists
  • modifying our queue specification and body to work with linked lists instead of arrays
      • note that the test program should not need to be altered at all
      • note that the headers of the procedures and functions should not be altered at all
      • there will not be an array in this linked list program
  • exception handling review plus illustration of user-defined exception
      • need to declare it
      • need to raise it
      • need to handle it
  •  illustration of Ada case statement use
    • no break statement
    • only one alternative executed
    • duplicate values not allowed
    • 3 | 4  means 3 OR 4
    • 4..6  means 4 through 6  (i.e. 4 | 5 | 6)
    • others keeps program from bombing if value not handled by alternatives occurs

 

Code examples were bundled into 3  text files and are available on the web page and should be studied before attempting to write any code for Assignment10.

 

Assignment 10 posted on Blackboard - electronic submission due Sunday October 14th by 11:59pm

                                                        paper copies due Monday in class.

 

BUY ANOTHER FOLDER JUST IN CASE YOU NEED IT.