|
An Elementary Approach to Design and Analysis of Algorithms
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 3 Artikel!
Lieferstatus: |
i.d.R. innert 14-24 Tagen versandfertig |
Veröffentlichung: |
Mai 2019
|
Genre: |
EDV / Informatik |
ISBN: |
9781786346759 |
EAN-Code:
|
9781786346759 |
Verlag: |
WSPC (Europe) |
Einband: |
Gebunden |
Sprache: |
English
|
Dimensionen: |
H 235 mm / B 157 mm / D 33 mm |
Gewicht: |
917 gr |
Seiten: |
534 |
Zus. Info: |
HC gerader Rücken kaschiert |
Bewertung: |
Titel bewerten / Meinung schreiben
|
Inhalt: |
In computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.
As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology. |
|