ECE60800 - Computational Models and MethodsSpring 2016
Days/Time: MWF / 12:30-1:20 pm
Credit Hours: 3
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.
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.
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.
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.
Homework will be assigned but not graded, solutions will be distributed.
Two exams and one two-hour final exam.
**UPDATED 12.19.11 from 2nd edition to 3rd edition** Required--T. Cormen, C. Leiserson, and R. Rivest, "Introduction to Algorithms," 3rd ed., McGraw-Hill, 2009, ISBN 262033844. Optional--Class Notes will be made available for purchase through Follett's and University Bookstores (will also be available on the course web site).
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.
ProEd Minimum Requirements: view
Tuition & Fees: view