**Design and Analysis of Computer Algorithms**

by David M. Mount

**Publisher**: University of Maryland 2003**Number of pages**: 135

**Description**:

Programming is a very complex task, and there are a number of aspects of programming that make it so complex. The first is that most programming projects are very large, requiring the coordinated efforts of many people. (This is the topic a course like software engineering.) The next is that many programming projects involve storing and accessing large quantities of data efficiently. (This is the topic of courses on data structures and databases.) The last is that many programming projects involve solving complex computational problems, for which simplistic or naive solutions may not be efficient enough. The complex problems may involve numerical data (the subject of courses on numerical analysis), but often they involve discrete data. This is where the topic of algorithm design and analysis is important.

Download or read it online for free here:

**Download link**

(0.8MB, PDF)

## Similar books

**Notes on Data Structures and Programming Techniques**

by

**James Aspnes**-

**Yale University**

Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.

(

**2084**views)

**Search Algorithms and Applications**

by

**Nashat Mansour**-

**InTech**

This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.

(

**9312**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**14771**views)

**Computational Geometry: Methods and Applications**

by

**Jianer Chen**

The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.

(

**10945**views)