Algorithms : design techniques and analysis / M H Alsuwaiyel
Material type: TextSeries: Computing ; 15Publication details: India World Scientific 2022Edition: 2ndDescription: 725pISBN:- 9781944660215
- 005.1 ALS-M
Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|---|
Books | BITS Pilani Hyderabad | 003-007 | General Stack (For lending) | 005.1 ALS-M (Browse shelf(Opens below)) | INR 1850.00. | Available | 47280 |
Browsing BITS Pilani Hyderabad shelves, Shelving location: General Stack (For lending), Collection: 003-007 Close shelf browser (Hides shelf browser)
005.015113 HEI-J Discrete structures, logic, and computability / | 005.1 AKE-A Data structures and algorithms using C++ / | 005.1 ALI-E jBPM5 Developer Guide : a Java developer's guide to the JBoss business process management framework / | 005.1 ALS-M Algorithms : design techniques and analysis / | 005.1 AMB-D Linux labs and open source technologies / | 005.1 AND-R Security engineering : a guide to building dependable distributed systems / | 005.1 ARO-S R programming for beginners / |
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This required the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them. This book presents a design thinking approach to problem solving in computing - by first using algorithmic analysis to study the specifications of the problem, before mapping the problem on to data structures, then on to the situatable algorithms. Each technique or strategy is covered in its own chapter supported by numerous examples of problems and their algorithms. The new edition includes a comprehensive chapter on parallel algorithms, and many enhancements
There are no comments on this title.