Course Details Skip Navigation

Course Details

COSC 302 A   Analysis of Algorithms back to previous pageBack to Results  
line for display separation
spacer image for extra space
spacer image for extra display space

MaxActualRemainWaitlist
EnrollmentGeneral3035-51
Total3035-51

InstructorRamachandran, Vijay
MeetsTR 120-235, MCGREG 312
Pre-RequisitesCOSC 102
NotesCOSC 290 strongly recommended
DistributionNat Science/Math Requirement
Core AreaNone

line image for content separation

View Courses taught by this instructorView all courses taught by this instructor
View Courses in this departmentView all courses in this department


This course provides a conceptual framework within which both theoretical and concrete analyses of computer algorithms may be developed. Topics to be covered include nuber-theoretic algorithms; graph algorithms; problem-solving techniques including divide-and-conquer, greedy algorithms, and dynamic programming; linear programming; and intractability. The required credit-bearing laboratory COSC 302L must be taken concurrently with COSC 302. Prerequisites: COSC 290 (may be taken concurrently) or permission of instructor. (Formerly COSC 460.)


end of course details line