Finding Solutions to "Introduction to Algorithms" Exercises

  • Thread starter Thread starter azerty12
  • Start date Start date
  • Tags Tags
    Exercises
AI Thread Summary
The discussion centers on the challenges faced by students studying "Introduction to Algorithms" by Cormen et al., particularly regarding the lack of solutions to the numerous exercises in the book. While the book is praised for its comprehensive content, the absence of corrections for the exercises leads to frustration among learners. Some participants mention finding limited corrections online and suggest checking errata pages for inaccuracies in provided solutions. References to the MIT Press website and Wikipedia are shared as potential resources for select solutions. Ultimately, participants emphasize the importance of self-discovery in solving the exercises, while humorously acknowledging the potential for instructors to access additional resources.
azerty12
Messages
15
Reaction score
0
Hi,
I'm studying algorithmic on "Introduction to algorithms" by Cormen, Rivest, Stein and Leiserson.
This book is very well done and proposes more than a thousand exercises, but the point is these exercises are not corrected. It enables us to really search them, but it is frustrating when you search an exercise and don't find it.

I found some corrections on the Internet, but few of them only.

Would anyone know whether it is possible to have more corrections please?

thank you
 
Technology news on Phys.org
by corrections you mean solutions right?

Because sometimes books do provide solutions to exercises at end the book but often the solutions are not entirely correct and so online you might find errata pages for the book submitted by knowledgeable readers that indicate where the book solution was wrong and what the correction you need to make to the book's solution to make it correct.

wikipedia has a reference to this book:

http://en.wikipedia.org/wiki/Introduction_to_Algorithms

and to the MIT Press website where select solutions are published

http://mitpress.mit.edu/algorithms/#solutions

for those missing solutions, I think you'll just have to GOOGLE search them or better yet figure them out
for yourself.

Unless of course you're an instructor and can get access to the instructors manual or hire
a poor grad student pay him minimally and/or provide free snacks and he'll figure them out for you.
 
Last edited:
I think I'm gone pay myself snacks then ! ;)
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
Back
Top