Design and Analysis of Algorithms par Muniswamy, V.V.: Like New Paperback (2009)

A propos de cet article

Like New.

N� de r�f. du vendeur D7F5-8-M-9380026730-5

Contacter le vendeur

Signaler cet article

D�tails bibliographiques

Titre: Design and Analysis of Algorithms
�diteur: I K International Publishing House
Date de parution: 2009
Langue: anglais
ISBN � 10 chiffres: 9380026730
ISBN � 13 chiffres: 9789380026732
Reliure: Paperback
�tat de l'article: Like New
Type de livre: book

A propos de ce titre

Synopsis

This book is designed for the way we learn and intended for one-semester course in Design and Analysis of Algorithms. This is a very useful guide for graduate and undergraduate students and teachers of computer science. This book provides a coherent and pedagogically sound framework for learning and teaching. Its breadth of coverage insures that algorithms are carefully and comprehensively discussed with figures and tracing of algorithms. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors flexibility and allowing them to use the text as lecture reinforcement. Key Features: * Focuses on simple explanations of techniques that can be applied to real-world problems. * Presents algorithms with self-explanatory pseudocode. * Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. * Includes chapter summary, self-test quiz and exercises at the end of each chapter. Key to quizzes and solutions to exercises are given in appendices.

Pr�sentation de l'�diteur

This book is designed for the way we learn and intended for one-semester course in Design and Analysis of Algorithms. This is a very useful guide for graduate and undergraduate students and teachers of computer science. This book provides a coherent and pedagogically sound framework for learning and teaching. Its breadth of coverage insures that algorithms are carefully and comprehensively discussed with figures and tracing of algorithms. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors flexibility and allowing them to use the text as lecture reinforcement. Key Features: * Focuses on simple explanations of techniques that can be applied to real-world problems. * Presents algorithms with self-explanatory pseudocode. * Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. * Includes chapter summary, self-test quiz and exercises at the end of each chapter. Key to quizzes and solutions to exercises are given in appendices.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.