Its a good book - AHU is a pretty standard first year CS text. I think I have 2 copies of the standard upper division Algorithms text that they currently use at Cal and the older version from CMU back in the late 80's ( http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=3440 ). You're welcome to one copy if you want a meatier algorithms text.

In my data structures class back in the stone ages, we had to write an algorithm to solve the four color problem as part of our final exam. For a set of coordinates describing a map, we had to select colors for each region using one of four colors, and no adjacent region could have the same color.

I should add that four color problem was a trick question since researchers figured out a reasonably efficient and "simple" (for certain definitions of simple) algorithm for the four color problem over a decade after I took my data structures class.

## 4 Comments:

What's the word, Jim? Btw, I have that book on my shelf at home. I've been underground lately too, gotta lotta work to do.

Its a good book - AHU is a pretty standard first year CS text. I think I have 2 copies of the standard upper division Algorithms text that they currently use at Cal and the older version from CMU back in the late 80's ( http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=3440 ). You're welcome to one copy if you want a meatier algorithms text.

Elementary but fun.

In my data structures class back in the stone ages, we had to write an algorithm to solve the four color problem as part of our final exam. For a set of coordinates describing a map, we had to select colors for each region using one of four colors, and no adjacent region could have the same color.

I should add that four color problem was a trick question since researchers figured out a reasonably efficient and "simple" (

for certain definitions of simple) algorithm for the four color problem over a decade after I took my data structures class.Post a Comment

<< Home