Assignment 1, due June 13

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, and unless there is what insurance companies call "an act of God", 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. If you have none, say so, you'll get one.)

   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. What text editors have you used to develop programs?

5. What machine architectures have you studied -- at the level of the machine's assembly language or instruction set.

   Questions covering Prerequisites for the Course

6. A complete binary tree has n leaves. How many internal nodes does it have? If you've completed 22C:34, you should be able to answer this.

7. If a machine has 1 gigabyte of main memory, how many bits are required, at minimum, to hold a pointer. If you've completed 22C:40, you should be able to answer this.

8. At minimum, a node in a binary search tree needs only two pointers, one to the left child and one to the right. Sometimes, a third pointer is added, to the parent. What are some of the additional tree operations that you can do if you have this extra link? If you've completed 22C:30, you should be able to answer this.

9. What is the difference between indirect-indexed addressing and indexed-indirect addressing? If you've completed 22C:40, you should be able to take a stab at this, even if the machine you studied didn't use these terms.