Esta web utiliza cookies propias y de terceros que nos permiten optimizar tu experiencia en el sitio web, evaluar su rendimiento, generar estadísticas de uso y mejorar y añadir nuevas funcionalidades. Mediante el análisis de tus hábitos de navegación podemos mostrar contenidos más relevantes y medir las interacciones con la web.
Puede obtener más información aquí.

Avanzado
Artículos
Portada

ELEMENTARY APPROACH TO DESIGN AND ANALYSIS OF ALGORITHMS, AN IBD

LEKH RAJ VERMANI / LEKH RAJ VERMANI & SHAL
WSPC (EUROPE)
06 / 2019
9781786346759
Inglés

Sinopsis

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.