Go to Main Content

Purdue Self-Service

 

HELP | EXIT

Catalog Entries

 

Fall 2014
Apr 28, 2024
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. The Schedule Type links will be available only when the schedule of classes is available for the selected term.

ECE 60800 - Computational Models And Methods
Credit Hours: 3.00. Computation models and techniques for the analysis of algorithm complexity. The design and complexity analysis of recursive and nonrecursive algorithms for searching, sorting, set operations, graph algorithms, matrix multiplication, polynomial evaluation and FFT calculations. NP-complete problems. Prerequisite: Master's student standing or higher. Typically offered Fall Spring.
3.000 Credit hours

Syllabus Available
Levels: Indiana College Network, Undergraduate, Graduate, Professional
Schedule Types: Distance Learning, Lecture

Offered By: School of Elec & Computer Engr
Department: Electrical & Computer Engr


May be offered at any of the following campuses:     
      West Lafayette Continuing Ed
      Indiana College Network
      PU Fort Wayne
      IUPUI
      West Lafayette

Learning Outcomes: 1. Computation models and techniques for the analysis of algorithm complexity. 2. The design and complexity analysis of recursive and non-recursive algorithms for searching, sorting, set operations, graph algorithms, matrix multiplication, polynomial evaluation and FFT calculations. 3. NP-complete problems.


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4