|
Lecture |
|
|
|
|
|
|
|
|
|
|
Algorithms Anal & Dsgn 1 000 |
Enrollment Information (not real time - data refreshed nightly)
|
|
|
|
|
|
|
|
Class #:
|
10502 | |
Enrollment Capacity:
|
31 |
|
Section:
|
000 |
|
Enrollment Total:
|
30 |
|
Credits:
|
3.00 credits
|
|
Seats Available:
|
1 |
|
Dates:
|
01/31/2022 - 05/13/2022 |
|
Status:
|
OPEN |
|
Days, Time:
|
M W F , 9:00 AM - 9:50 AM |
| Room: |
Nsc 201 |
view map |
| Location: |
North Campus |
|
|
|
|
|
| Comments |
|
|
| MAJORS ONLY |
|
|
| Enrollment Requirements |
|
|
|
Prerequisites: Pre-Requisite: CSE 331.
Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only. Students must complete a mandatory advisement session with their faculty advisor. |
|
|
| Course Description |
|
|
| Introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, NP-completeness, approximation algorithms, and network flows. For each topic, beside in-depth coverage, we discuss one or more representative problems and their algorithms. In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer scientists and engineers. |
|
|
| Instructor(s) |
|
|
| |
Li |
look up |
|
|
|
|
| On-line Resources |
|
|
|
|
|
|
| Other Courses Taught By: Li |
|
|
|
|
