|
Lecture |
|
|
|
|
|
|
|
|
|
|
Algo And Complexity B |
Enrollment Information (not real time - data refreshed nightly)
|
|
|
|
|
|
|
|
Class #:
|
<<< >>> | |
Enrollment Capacity:
|
104 |
|
Section:
|
B |
|
Enrollment Total:
|
99 |
|
Credits:
|
4.00 credits
|
|
Seats Available:
|
5 |
|
Dates:
|
01/30/2023 - 05/12/2023 |
|
Status:
|
OPEN |
|
Days, Time:
|
M W F , 10:00 AM - 10:50 AM |
| Room: |
Nsc 215 |
view map |
| Location: |
North Campus |
|
|
|
|
|
| Chained Courses |
|
|
You must register in one of the class(es) below to get the above section:
|
|
|
| Enrollment Requirements |
|
|
|
Prerequisites: Pre-Requisite: MTH 142 and CSE 250 and (CSE 191 or MTH 311). Computer Science, Computer Engineering, or Bioinformatics majors only. |
|
|
| Course Description |
|
|
| Introduces paradigms for designing algorithms and fundamental limitations to what algorithms can do. Covers basic algorithm design paradigms of greedy algorithms, divide and conquer algorithms and dynamic programming, as well as a selection of advanced algorithmic topics, such as randomized algorithms, algorithms for distributed systems and basic algorithms for machine learning. Topics related to limitations of algorithms include NP-completeness and undecidability. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms. |
|
|
| Instructor(s) |
|
|
| |
Akhter |
look up |
|
|
|
|
| On-line Resources |
|
|
|
|
|
|
| Other Courses Taught By: Akhter |
|
|
|
|
