Computational Models and Methods

Fundamental knowledge regarding algorithm design that is needed in more advanced courses in the computer engineering area; emphasizes understanding the classes of problems that can be solved by computers and quantifying the performance of algorithms used to solve such problems.

ECE60800

Credit Hours:

3

Learning Objective:

To add breadth to a student's program and to provide fundamental knowledge regarding algorithm design that is needed in more advanced courses in the computer engineering area; emphasizes understanding the classes of problems that can be solved by computers and quantifying the performance of algorithms used to solve such problems.

Description:

Fundamental knowledge regarding algorithm design that is needed in more advanced courses in the computer engineering area; emphasizes understanding the classes of problems that can be solved by computers and quantifying the performance of algorithms used to solve such problems.

Topics Covered:

Computational models and techniques for analysis of algorithm complexity; design and complexity analysis of recursive and non-recursive algorithms for searching, sorting, set operations, graph algorithms, etc.; dynamic programming, greedy algorithms, NP-complete problems.

Prerequisites:

Data structures and discrete mathematics for computer engineering or equivalent courses, or consent of instructor; programming experience in one or more high-level language (e.g., C, Pascal, Fortran, Ada) and a working knowledge of basic data structures (stacks, linked lists, queues, trees), recursion, probability, and calculus.

Applied / Theory:

60 / 40

Web Address:

https://engineering.purdue.edu/~ee608/

Homework:

Homework will be assigned but not graded, solutions will be distributed.

Projects:

None.

Exams:

Approximately 10-15 quizzes, no midterms and no final exam.

Textbooks:

Official textbook information is now listed in the Schedule of Classes. NOTE: Textbook information is subject to be changed at any time at the discretion of the faculty member. If you have questions or concerns please contact the academic department.
Tentative:Required--Thomas H. Cormen, "Introduction to Algorithms", 3rd ed., The MIT Press, ISBN 9780262033848.

Computer Requirements:

ProEd minimum computer requirements; capability to view and print PDF document. Web browser and e-mail: Internet access is required for students to print handouts from the web; e-mail will be used to disseminate answers to questions posed by individual students to the class.

Other Requirements:

None.

ProEd Minimum Requirements:

view