Introduction to Algorithms - Cormen

[evinda]

Hello! (Wave)

I wanted to ask you if you have the second edition of Introduction to algorithms by Cormen, at which the chapters 30-35 are included, because the prof suggested us to look at the following exercises:
30.1-1
30-1
34-1
34-3
35-1

but I can't find them.

 

[lofgran]

Hello! Thank you for reaching out to me. Yes, I do have the second edition of Introduction to Algorithms by Cormen, and it does include chapters 30-35. I am happy to help you with the exercises you listed. For 30.1-1, it is a problem about the shortest paths in a directed acyclic graph. For 30-1, it is about the minimum spanning tree problem. For 34-1, it is about the parallel algorithms for matrix multiplication. For 34-3, it is about the sorting networks. And for 35-1, it is about the randomized algorithms for selection. I hope this helps! Let me know if you have any other questions.