-
Institution:
-
University at Buffalo
-
Subject:
-
-
Description:
-
Credits: 4 Prerequisites: CSE 50, MTH 14with a grade of C or higher Corequisites: None Type: LEC/REC Introduces methods for algorithm design, paradigms such as divide and conquer, greedy, and dynamic programming, and techniques for algorithm analysis, such as asymptotic notations and estimates, as well as time/space tradeoffs. Topics include sorting, searching, scheduling, string matching, graph algorithms, computational geometry, and more.
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(716) 645-2000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.