University at Buffalo

UB Undergraduate Academic Schedule: Fall 2017


  • 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. Information about HUB can be found at www.buffalo.edu/hub


  • |

    CSE 431LR - Algorithms Anal & Dsgn 1
    Lecture
    Algorithms Anal & Dsgn 1 B Enrollment Information (not real time - data refreshed nightly)
    Class #:   <<<  >>>   Enrollment Capacity:   5
    Section:   B   Enrollment Total:   2
    Credits:   4.00 credits   Seats Available:   3
    Dates:   08/28/2017 - 12/08/2017   Status:   OPEN
    Days, Time:   M W F , 9:00 AM - 9:50 AM
    Room:   Knox 109 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: CSE 331 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only
      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)
                 Xu, J look up    
      On-line Resources
    Other Courses Taught By: Xu, J