-
Institution:
-
Colgate University
-
Subject:
-
-
Description:
-
V. Ramachandran This course provides a conceptual framework within which both theoretical and concrete analyses of computer algorithms may be developed. Topics to be covered include abstract models of computation; the efficient design of algorithms using data structures such as trees, networks, lists, queues, and stacks; sorting; searching; graph algorithms; and intractable problems. The required credit-bearing laboratory COSC 460L must be taken concurrently with COSC 460. Prerequisites: COSC 304 or permission of instructor.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(315) 228-1000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.