The page uses Browser Access Keys to help with keyboard navigation. Click to learn moreSkip to Navigation

Different browsers use different keystrokes to activate accesskey shortcuts. Please reference the following list to use access keys on your system.

Alt and the accesskey, for Internet Explorer on Windows
Shift and Alt and the accesskey, for Firefox on Windows
Shift and Esc and the accesskey, for Windows or Mac
Ctrl and the accesskey, for the following browsers on a Mac: Internet Explorer 5.2, Safari 1.2, Firefox, Mozilla, Netscape 6+.

We use the following access keys on our gateway

n Skip to Navigation
k Accesskeys description
h Help
Oakland University Logo
    Oakland University
  Dec 14, 2017
2017-2019 Graduate Catalog
[Add to Portfolio]

APM 5610 - Algorithms and Complexity

(4 credits)

A general introduction to algorithm design and analysis, including study of the following algorithmic techniques: divide-and-conquer, greedy methods, backtracking, preconditioning and precomputation, probabilistic and approximation algorithms. Topics covered also include: the fast Fourier transform, lower bound theory, reduction and NP-completeness.  Required background: a course in discrete mathematics and knowledge of data structures.  Formerly APM 567.  Cannot receive credit for both APM 5610 and CSE 5610.

Prerequisite(s): Required background: a course in discrete mathematics and knowledge of data structures.

Course revisions made after the Graduate Catalog publication date will be posted in the Graduate Catalog Addendum.

[Add to Portfolio]