top of page


Public·27 members


Fundamentos de algoritmia Brassard 1997 Prentice Hall

Fundamentos de algoritmia (Fundamentals of Algorithmics) is a book written by Gilles Brassard and Paul Bratley, published by Pearson Educación in 1997. It is a Spanish translation of the original English edition, which was published by Prentice Hall in 1996. The book covers the basic concepts and techniques of algorithm design and analysis, as well as some advanced topics such as NP-completeness, approximation algorithms, and parallel algorithms.


The book consists of 13 chapters, organized into four parts:


Download File:

Part I: Preliminaries

  • Chapter 1: Introduction

  • Chapter 2: Mathematical Foundations

  • Chapter 3: Correctness and Analysis of Algorithms

Part II: Basic Techniques

  • Chapter 4: Divide-and-Conquer

  • Chapter 5: Dynamic Programming

  • Chapter 6: Greedy Algorithms

  • Chapter 7: Backtracking

Part III: Advanced Topics

  • Chapter 8: Branch-and-Bound

  • Chapter 9: Computational Complexity

  • Chapter 10: NP-Completeness

  • Chapter 11: Approximation Algorithms

Part IV: Parallel Algorithms

  • Chapter 12: Models of Parallel Computation

  • Chapter 13: Parallel Algorithms for Sorting, Searching, and Selection


The book is intended for undergraduate and graduate students of computer science, engineering, and mathematics, who want to learn the fundamentals of algorithmics. It is also suitable for self-study and reference by professionals and researchers in the field. The book assumes some basic knowledge of discrete mathematics, data structures, and programming languages, but provides sufficient explanations and examples to make the material accessible to a wide audience. The book is well-written, clear, and rigorous, with numerous exercises and problems at the end of each chapter. The book also includes references to other sources and literature for further reading.


Welcome to the group! You can connect with other members, ge...
bottom of page