Computer Science 477/677: Design and Analysis of Algorithms

Spring 1999

Homework Assignment 5.

Due March 8, 1999

You may discuss this assignment with other students in the class, or other persons. But you must actually write the assignment in your own hand. You must turn in the homework on letter-sized paper, with your name at the top of each page. Use pen or pencil, any color.

Do not write your homework as a computer file and turn in a printout.

• Work exercise 12.1-2 on page 221 of your textbook.
• Work exercise 12.2-1 on page 225 of your textbook.
• Work exercise 12.2-2 on page 226 of your textbook.
• Work exercise 12.4-1 on page 240 of your textbook.
• Work exercise 13.1-3 on page 246 of your textbook.
• Work exercise 13.3-3 on page 254 of your textbook.
• • Who discovered binary search trees?
  • A binary search tree is the data structure that is a static realization of what well-known algorithm? (Hint: two words.)