NUST Institutions Library Catalogue

Algorithms- (E-BOOK) Robert Sedgewick

By: Sedgwick, RobertPublisher: New York Addision Wesley 1983Description: 560 pISBN: O201066726Subject(s): E-BOOKDDC classification: 519.4
Contents:
Introduction 1. Preview Mathematical Algorithms 2. Arithmetic 3. Random Numbers 4. Polynomials 5. Gaussian Elimination 6. Curve Fitting 7. Integration Sorting 8. Elementary Sorting Methods 9. Quicksort 10. Radix Sorting 11. Priority Queues 12. Selection and Merging 13. External Sorting SEARCHIN 14. Elementary Searching Methods 15. Balanced Trees 16. Hashing 17. Radix Searching 18. External Searching String Processing 19. String Searching 20. Pattern Matching 21. Parsing 22. File Compression 23. Cryptology Geometric Algorithms 24. Elementary Geometric Methods 25. Finding the Convex Hull 26 Range Searching 27. Geometric Intersection 28. Closest Point Problems GRAPH ALGORITHMS 29. Elementary Graph Algorithms 30. Connectivity 31. Weighted Graphs 32. Directed Graphs 33. Network Flow 34. Matching Advanced Topics 35. Algorithm Machines 36. The Fast Fourier Transform 37. Dynamic Programming 38. Linear Programming 39. Exhaustive Search 40. NP-complete Problems
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Home library Collection Call number URL Status Date due Barcode Item holds
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
NFIC 519.4 SED (Browse shelf) Link to resource Available MCSEB-826
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
NFIC 519.4 SED (Browse shelf) Link to resource Available MCSEB-830
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
NFIC 519.4 SED (Browse shelf) Link to resource Available MCSEB-833
Total holds: 0

Introduction 1. Preview Mathematical Algorithms 2. Arithmetic 3. Random Numbers 4. Polynomials 5. Gaussian Elimination 6. Curve Fitting 7. Integration Sorting 8. Elementary Sorting Methods 9. Quicksort 10. Radix Sorting 11. Priority Queues 12. Selection and Merging 13. External Sorting SEARCHIN 14. Elementary Searching Methods 15. Balanced Trees 16. Hashing 17. Radix Searching 18. External Searching String Processing 19. String Searching 20. Pattern Matching 21. Parsing 22. File Compression 23. Cryptology Geometric Algorithms 24. Elementary Geometric Methods 25. Finding the Convex Hull 26 Range Searching 27. Geometric Intersection 28. Closest Point Problems GRAPH ALGORITHMS 29. Elementary Graph Algorithms 30. Connectivity 31. Weighted Graphs 32. Directed Graphs 33. Network Flow 34. Matching Advanced Topics 35. Algorithm Machines 36. The Fast Fourier Transform 37. Dynamic Programming 38. Linear Programming 39. Exhaustive Search 40. NP-complete Problems

There are no comments on this title.

to post a comment.
© 2023 Central Library, National University of Sciences and Technology. All Rights Reserved.