-
Institution:
-
University of San Francisco
-
Subject:
-
-
Description:
-
Prerequisite: CS - 245. Algorithm analysis and asymptotic running time estimates. Expected running times and amortized analysis. Design techniques, including divide and conquer, greedy, and dynamic programming. Algorithms for searching and sorting, graphs, and advanced topics. Four hours lecture. Offered Spring 2007.
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(415) 422-5555
-
Regional Accreditation:
-
Western Association of Schools and Colleges
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.