This course is concerned with the design, analysis, and implementation of algorithms for sequential and parallel models of computation. Traditional algorithmic techniques, including divide-and-conquer, dynamic programming, and greedy algorithms will be discussed. Models of computation include the traditional RAM, as well as standard parallel models, such as the PRAM, array, ring, mesh, hypercube, and pyramid. In addition, innovative parallel models that involve dynamic reconfiguration will be discussed. Problem domains include computational geometry, graph theory, image analysis, sorting, and searching. Time and space complexity of solutions to problems are a critical component to the course.
Copyright © 2010 by Russ Miller.
All rights reserved. No part of this document may be used in any form by any electronic or mechanical means without permission in writing by the author.