Essential Algorithms - Stephens Rod | Libro John Wiley & Sons 09/2013 - HOEPLI.it


home libri books ebook dvd e film top ten sconti 0 Carrello


Torna Indietro

stephens rod - essential algorithms

Essential Algorithms A Practical Approach to Computer Algorithms




Disponibilità: Normalmente disponibile in 10 giorni


PREZZO
€ 51,30
NICEPRICE
€ 43,60
SCONTO
15%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con App18 Bonus Cultura e Carta Docenti


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Pubblicazione: 09/2013





Note Editore

This book provides an easy-to-read introduction to computer algorithms. It describes a number of important classical algorithms and tells when each is appropriate. It explains how to analyze algorithms to understand their behavior. Most importantly it teaches techniques that the reader can use to create new algorithms to meet future needs. Some of the useful algorithms that this book describes include: Methods for manipulating common data structures such as arrays, linked lists, trees, and networks Using more advanced data structures such as heaps, 2-3 trees, B-trees Sorting and searching Network algorithms such as shortest path, spanning tree, topological sorting, redundancy, and flow calculations Numerical algorithms such as numeric integration, finding level curves, plotting unknown functions, and curve fitting Some of the general problem-solving techniques that this book explains include: Brute force and exhaustive search Divide and conquer Backtracking Recursion Branch and bound Greedy algorithms and hill climbing Least cost algorithms Constricting bounds Heuristics In addition to describing these algorithms and approaches, this book explains how to analyze the performance of algorithms. To make understanding the algorithms easier, it provides exercises that you can use to explore ways you can modify the algorithms to apply them to new situations. Finally this book includes a collection of questions of the kind that you might see in a job interview. You can then practice using the techniques you learn from studying the algorithms to outline solutions to the questions. While you may not encounter these exact questions in an interview, working through the questions may help you solve problems that involve similar techniques. The web site will include reference implementations in C#(which can be easily applied toJava and C++). There are also instructor materials, includinga syllabus, PowerPoint slides covering the books material, and lecture notes. A test bank of questions instructors can use to check student progress will also be available to instructors only.




Sommario

A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures such as arrays, linked lists, trees, and networks Addresses advanced data structures such as heaps, 2-3 trees, B-trees Addresses general problem-solving techniques such as branch and bound, divide and conquer, recursion, backtracking, heuristics, and more Reviews sorting and searching, network algorithms, and numerical algorithms Includes general problem-solving techniques such as brute force and exhaustive search, divide and conquer, backtracking, recursion, branch and bound, and more In addition, Essential Algorithms features a companion website that includes full instructor materials to support training or higher ed adoptions.




Trama

A friendly and accessible introduction to the most useful algorithms

Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview.
* Reveals methods for manipulating common data structures such as arrays, linked lists, trees, and networks
* Addresses advanced data structures such as heaps, 2-3 trees, B-trees
* Addresses general problem-solving techniques such as branch and bound, divide and conquer, recursion, backtracking, heuristics, and more
* Reviews sorting and searching, network algorithms, and numerical algorithms
* Includes general problem-solving techniques such as brute force and exhaustive search, divide and conquer, backtracking, recursion, branch and bound, and more

In addition, Essential Algorithms features a companion website that includes full instructor materials to support training or higher ed adoptions.







Altre Informazioni

ISBN:

9781118612101

Condizione: Nuovo
Dimensioni: 235 x 32.81 x 192 mm Ø 1110 gr
Formato: Brossura
Pagine Arabe: 624






Utilizziamo i cookie di profilazione, anche di terze parti, per migliorare la navigazione, per fornire servizi e proporti pubblicità in linea con le tue preferenze. Se vuoi saperne di più o negare il consenso a tutti o ad alcuni cookie clicca qui. Chiudendo questo banner o proseguendo nella navigazione acconsenti all’uso dei cookie.

X