Andere Kunden interessierten sich auch für
![Practical Applications of Data Processing, Algorithms, and Modeling]( "Practical Applications of Data Processing, Algorithms, and Modeling")
Practical Applications of Data Processing, Algorithms, and Modeling347,99 €![Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 2]( "Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 2")
Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 2361,99 €![Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 2]( "Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 2")
Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 2537,99 €![Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 3]( "Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 3")
Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, VOL 3537,99 €![Early Introduction of Computer Science Education in Minority Youth:]( "Early Introduction of Computer Science Education in Minority Youth:")
Early Introduction of Computer Science Education in Minority Youth:26,99 €![Introduction to Programming Concepts with Case Studies in Python]( "Introduction to Programming Concepts with Case Studies in Python")
Introduction to Programming Concepts with Case Studies in Python34,99 €![Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 1]( "Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 1")
Handbook of Research on Emergent Applications of Optimization Algorithms, VOL 1358,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.