How to Think about Algorithms~tqw~ darksiderg

Download Torrent Secure download Usenet 5x faster downloads Direct downloads Send report
  • Torrent:
  • Category:
  • Private Client:
    Hide your personal activity while downloading torrents with TorrentPrivacy.com
  • Size:
    6 MB
  • Seeds/Leechs:
  • Added:
    08/22/2008
  • Last check:
    2009-06-08 19:49:44
  • Tracker:
    Private trackerhttp://www.h33t.com:3310
  • Comments:
    *******************************************************************************<br /> How to Think about Algorithms <br /> *******************************************************************************<br /> <br /> -------------------------------------------------------------------------------<br /> General Information<br /> -------------------------------------------------------------------------------<br /> Type.................: Ebook<br /> Part Size............: 6,335,274 bytes<br /> <br /> -------------------------------------------------------------------------------<br /> Post Information<br /> -------------------------------------------------------------------------------<br /> Posted by............: ~tqw~<br /> <br /> -------------------------------------------------------------------------------<br /> Release Notes<br /> -------------------------------------------------------------------------------<br /> There are many algorithm texts that provide lots of well-polished code and <br /> proofs of correctness. This book is not one of them. Instead, this book presents <br /> insights, notations, and analogies to help the novice describe and think about <br /> algorithms like an expert. By looking at both the big picture and easy step-by-<br /> step methods for developing algorithms, the author helps students avoid the <br /> common pitfalls. He stresses paradigms such as loop invariants and recursion to <br /> unify a huge range of algorithms into a few meta-algorithms. Part of the goal is <br /> to teach the students to think abstractly. Without getting bogged with formal <br /> proofs, the book fosters a deeper understanding of how and why each algorithm <br /> works. These insights are presented in a slow and clear manner accessible to <br /> second- or third-year students of computer science, preparing them to find their <br /> own innovative ways to solve problems.<br /> <br /> Table Of Contents<br /> <br /> Part I. Iterative Algorithms and Loop Invariants: <br /> 1. Measures of progress and loop invariants; <br /> 2. Examples using more of the input loop invariant; <br /> 3. Abstract data types; <br /> 4. Narrowing the search space: binary search; <br /> 5. Iterative sorting algorithms; <br /> 6. Euclid&rsquo;s GCD algorithm; <br /> 7. The loop invariant for lower bounds; <br /> Part II. Recursion: <br /> 8. Abstractions, techniques, and theory; <br /> 9. Some simple examples of recursive algorithms; <br /> 10. Recursion on trees; <br /> 11. Recursive images; <br /> 12. Parsing with context-free grammars; <br /> Part III. Optimization Problems: <br /> 13. Definition of optimization problems; <br /> 14. Graph search algorithms; <br /> 15. Network flows and linear programming; <br /> 16. Greedy algorithms; <br /> 17. Recursive backtracking; <br /> 18. Dynamic programming algorithms; <br /> 19. Examples of dynamic programming; <br /> 20. Reductions and NP-completeness; <br /> 21. Randomized algorithms; <br /> Part IV. Appendix: <br /> 22. Existential and universal quantifiers; <br /> 23. Time complexity; <br /> 24. Logarithms and exponentials; <br /> 25. Asymptotic growth; <br /> 26. Adding made easy approximations; <br /> 27. Recurrence relations; <br /> 28. A formal proof of correctness; <br /> Part V. Exercise Solutions.<br /> <br /> Product Details<br /> <br /> * ISBN: 0521614104<br /> * ISBN-13: 9780521614108<br /> * Format: Paperback, 472pp<br /> * Publisher: Cambridge University Press<br /> * Pub. Date: May 2008<br /> <br /> -------------------------------------------------------------------------------<br /> Install Notes<br /> -------------------------------------------------------------------------------<br /> PDF Reader
  • Alternative download:
    How to Think about Algorithms~tqw~ darksiderg might also be available on Usenet. Get the UseNet Client - Highspeed Access To 300TB of Videos, Games and Music!
Download Torrent Secure download Usenet 5x faster downloads Direct downloads Send report

Files

File Size
  How to Think about Algorithms~tqw~_darksiderg.nfo 3.5 KB
  How to Think about Algorithms~tqw~_darksiderg.pdf 6 MB
  torrent.torrent 4.6 KB
  tracked_by_h33t_com.txt 0 KB



External comments


Add comment