Publicado por Springer International Publishing, 2022
ISBN 10: 3031170423 ISBN 13: 9783031170423
Idioma: Inglés
Librería: Buchpark, Trebbin, Alemania
EUR 56,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Gut. Zustand: Gut | Seiten: 528 | Sprache: Englisch | Produktart: Bücher.
Publicado por Springer International Publishing, 2022
ISBN 10: 3031170423 ISBN 13: 9783031170423
Idioma: Inglés
Librería: Buchpark, Trebbin, Alemania
EUR 56,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Hervorragend. Zustand: Hervorragend | Seiten: 528 | Sprache: Englisch | Produktart: Bücher.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 73,46
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 74,28
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Springer International Publishing, 2023
ISBN 10: 3031170458 ISBN 13: 9783031170454
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 69,54
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and some others are supported by hints and comments. This book is intended for students wishing to deepen their knowledge of algorithm design in an undergraduate or beginning graduate class on algorithms, for those teaching courses in this area, for use by practicing programmers who wish to hone and expand their skills, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. About all, it is a good source for exam problems for those who teach algorithms and data structure. The format of each chapter is just a little bit of instruction followed by lots of problems.This book is intended to augment the problem sets found in any standard algorithms textbook.This book-begins with four chapters on background material that most algorithms instructors would like their students to have mastered before setting foot in an algorithms class. The introductory chapters include mathematical induction, complexity notations, recurrence relations, and basic algorithm analysis methods.-provides many problems on basic and advanced data structures including basic data structures (arrays, stack, queue, and linked list), hash, tree, search, and sorting algorithms.-provides many problems on algorithm design techniques: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and backtracking algorithms.-is rounded out with a chapter on NP-completeness.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 71,96
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 73,45
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 78,92
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 80,12
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 104,66
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer-Nature New York Inc, 2023
ISBN 10: 3031170458 ISBN 13: 9783031170454
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 101,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 525 pages. 9.26x6.10x1.06 inches. In Stock.
Publicado por Springer International Publishing, 2022
ISBN 10: 3031170423 ISBN 13: 9783031170423
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 106,99
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and some others are supported by hints and comments. This book is intended for students wishing to deepen their knowledge of algorithm design in an undergraduate or beginning graduate class on algorithms, for those teaching courses in this area, for use by practicing programmers who wish to hone and expand their skills, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. About all, it is a good source for exam problems for those who teach algorithms and data structure. The format of each chapter is just a little bit of instruction followed by lots of problems.This book is intended to augment the problem sets found in any standard algorithms textbook.This book-begins with four chapters on background material that most algorithms instructors would like their students to have mastered before setting foot in an algorithms class. The introductory chapters include mathematical induction, complexity notations, recurrence relations, and basic algorithm analysis methods.-provides many problems on basic and advanced data structures including basic data structures (arrays, stack, queue, and linked list), hash, tree, search, and sorting algorithms.-provides many problems on algorithm design techniques: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and backtracking algorithms.-is rounded out with a chapter on NP-completeness.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 104,65
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 114,42
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 115,84
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 119,86
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Springer-Nature New York Inc, 2022
ISBN 10: 3031170423 ISBN 13: 9783031170423
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 156,05
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 525 pages. 9.25x6.10x9.21 inches. In Stock.