Go to Main Content

Purdue Self-Service

 

HELP | EXIT

Detailed Course Information

 

Fall 2014
Oct 20, 2020
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

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: Graduate, Indiana College Network, Professional, Undergraduate
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.

Restrictions:
Must be enrolled in one of the following Levels:     
      Graduate

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