An Elementary Approach to Design and Analysis of Algorithms: 4 - Rilegato

Vermani, Lekh Rej; Vermani, Shalini

 
9781786346759: An Elementary Approach to Design and Analysis of Algorithms: 4
Rilegato
ISBN 10: 1786346753 ISBN 13: 9781786346759
Casa editrice: World Scientific Pub Co Inc, 2019

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
World Scientific Pub Co Inc
Data di pubblicazione
2019
Lingua
Inglese
ISBN 10 
1786346753
ISBN 13 
9781786346759
Rilegatura
Copertina rigida
Numero di pagine
515
Contatto del produttore
non disponibile
Persona responsabile
gpsr@libri.de
gpsr@libri.de

Friedensallee 273
Hamburg
22763
Germania