Assignment 1, due Aug 27

Always, on every assignment, please write your name legibly as it appears on your University ID and on the class list! All assignments will be due at the start of class on the day indicated, and unless there is what insurance companies call "an act of God" - something outside your control; the only exceptions to this rule will be by advance arrangement.

1. What is your E-mail address? (If you have more than one, give the address you'd prefer used for class purposes.)

   Survey Questions

2. What programming languages have you used to write even small programs?

3. What programming languages have you used to write programs that you considered large?

4. Have you previously used Unix or Linux systems?

   Real Homework!

5. To test your preparation for this course:

   a) How many leaves are there in a complete binary tree with n internal nodes?

   b) Give the algorithm, using any programming languag or pseudo-code that approximates a programming language, for traversal of a binary tree, assuming that each vertex has a left child and a right child. Your code should apply the operation bang to each leaf of the tree, defined as a node with no children at all, and half-bang to internal nodes with just one child (left or right).

6. Show the representation of the string "Short String" in ASCII (see chapter 2 of the course notes), given as a sequence of 7-bit binary values.

7. Do exercise f from chapter 2 of the notes.