Assignment 1, due Sept 3

Part of the homework for 22C:50, Fall 2003
by Douglas W. Jones
THE UNIVERSITY OF IOWA Department of Computer Science

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 Godt" (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 high level programming languages have you used to write even small programs?

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

  4. Have you previously used Unix or Linux systems?

  5. What machine architectures or assembly languages have you studied?

    Real Homework!

  6. This quesiton is one you should be able to answer based entirely on courses that are prerequisites to this course: Given a complete binary tree with n leaves, how many internal vertices does it have?

  7. This quesiton is one you should be able to answer based entirely on courses that are prerequisites to this course: Given a lexicographic binary search tree holding n integers, what is the minimum memory required to hold this tree, in bytes, on a typical modern 32-bit machine?

  8. Do problem 3 from chapter 2 of the notes.

  9. Do problem 7 from chapter 2 of the notes.