|Certificates: Informatics and Modeling|
The course will cover the design and analysis of efficient algorithms. Basic topics will include greedy algorithms, divide-and-conquer algorithms, dynamic programming, and graph algorithms. Some advanced topics in algorithms may be selected from other areas of computer science.
Logical Reasoning, Quantitative Reasoning
This course will focus on the creation of specific and general computational models and will train students in the mastery of their concrete and formal descriptions.
||Gen Ed Area Dept:
|Course Format: Lecture||Grading Mode: Graded|
||Prerequisites: COMP212 AND MATH228
||Fulfills a Major Requirement for: (COMP)(IDEA-MN)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(SISP)
||Past Enrollment Probability: Not Available
|Major Readings: Wesleyan RJ Julia Bookstore
Cormen, Leiserson, Rivest and Stein, INTRODUCTION TO ALGORITHMS, 3RD EDITION
|Examinations and Assignments: |
To be announced.
|Instructor(s): Krizanc,Daniel Times: ..T.R.. 09:00AM-10:20AM; Location: SCIE137; |
|Total Enrollment Limit: 30||SR major: 5||JR major: 5|| || |
|Seats Available: 16||GRAD: 0||SR non-major: 5||JR non-major: 5||SO: 10||FR: 0|
|Drop/Add Enrollment Requests|
|Total Submitted Requests: 0||1st Ranked: 0||2nd Ranked: 0||3rd Ranked: 0||4th Ranked: 0||Unranked: 0|