Design and Analysis of Algorithms

Educational level: this is a tertiary (university) resource.
Completion status: this resource is ~25% complete.
Resource type: this resource is a course.
Subject classification: this is a mathematics resource .
Subject classification: this is an information technology resource .
Edsger Dijkstra invented the shortest-path algorithm that bears his name. He also made contributions to formal specification and verification, algorithm design, programming languages, program design, operating systems, and distributed processing. Much of his writing is free to access at the E.W. Dijkstra Archive.

Donald Knuth lists, in the preface of The Art of Computer Programming Vol 3, the following as the important questions of design and analysis of algorithms[1]:

Course Outline

Introduction

Mathematical Foundations

Sorting


Divide and Conquer Methods

Greedy Methods


Pattern Matching

Backtracking

Graph Algorithms

Dynamic Programming


NP-Completeness


Approximation algorithms

Maximum Bipartite Matching

Problems Sets

solve the recurrence equuation for t(n)=2t(n-1)+n2^n+n^2

Textbooks

Free textbooks:

Supplementary Materials

References

  1. ↑ Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89685-0. Preface, pp.v.

See also

This article is issued from Wikiversity - version of the Wednesday, April 02, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.