Skip to Content
University at Buffalo

UB Undergraduate Academic Schedule: Spring 2022


This information is updated nightly. Additional information about this course, including real-time course data, prerequisite and corequisite information, is available to current students via the HUB Student Center, which is accessible via MyUB.


|

CSE 331LR - Algo And Complexity
Lecture
Algo And Complexity A Enrollment Information (not real time - data refreshed nightly)
Class #:   <<<  >>>   Enrollment Capacity:   185
Section:   A   Enrollment Total:   175
Credits:   4.00 credits   Seats Available:   10
Dates:   01/31/2022 - 05/13/2022   Status:   OPEN
Days, Time:   M W F , 3:00 PM - 3:50 PM
Room:   Cooke 121 view map
Location:   North Campus      
Chained Courses
You must register in one of the class(es) below to get the above section:
Comments
CS minors will need to use the force registration system (https://academics.eng.buffalo.edu/force-registration/request) for their upper level CSE courses and will be enrolled during open enrollment.
Enrollment Requirements
Prerequisites: Pre-Requisite: MTH 142 and CSE 250 and (CSE 191 or MTH 311). Approved Computer Science, Computer Engineering, Bioinformatics/CS 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