Description: A unified and accessible introduction for graduate courses in computational fluid dynamics and heat transfer. This unique approach covers all necessary mathematical preliminaries before walking the student through the most common heat transfer and fluid dynamics problems, then testing their understanding further with ample end-of-chapter problems. Part I. The Basics: 1. Introduction; 2. Asymptotic notation; 3. Divide-and-Conquer algorithms; 4. The master method; 5. QuickSort; 6. Linear-time selection; Part II. Graph Algorithms and Data Structures: 7. Graphs: the Basics; 8. Graph search and its applications; 9. Dijkstra's shortest-path algorithm; 10. The heap data structure; 11. Search trees; 12. Hash tables and Bloom filters; Part III. Greedy Algorithms and Dynamic Programming; 13. Introduction to greedy algorithms; 14. Huffman codes; 15. Minimum spanning trees; 16. Introduction to dynamic programming; 17. Advanced dynamic programming; 18. Shortest paths revisited; Part IV. Algorithms for NP-Hard Problems; 19. What is NP-Hardness?; 20. Compromising on correctness: efficient inexact algorithms; 21. Compromising on speed: exact inefficient algorithms; 22. Proving problems NP-hard; 23. P, NP, and all that; 24. Case study: the FCC incentive auction; Appendix A. Quick review of proofs By induction; Appendix B. Quick review of discrete probability; Epilogue. A field guide to algorithm design; Hints and solutions.
Price: 92.64 AUD
Location: Hillsdale, NSW
End Time: 2024-11-17T02:58:12.000Z
Shipping Cost: 33.18 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 60 Days
Return policy details:
EAN: 9780999282984
UPC: 9780999282984
ISBN: 9780999282984
MPN: N/A
Format: Hardback, 690 pages
Author: Roughgarden, Tim
Book Title: Algorithms Illuminated: Omnibus Edition by Roughga
Item Height: 4.8 cm
Item Length: 25.6 cm
Item Weight: 1.59 kg
Item Width: 18.2 cm
Language: Eng
Publisher: Cambridge University Pr.
