Course Search | Main

CS385 COURSE DETAILS


2 Version(s) of this Course

CS385 (Version: 2007 2) COURSE DETAILS


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS385 DESIGN & ANALYS-ALGORITHMS 2007 2 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
This course studies analysis of algorithms and the relevance of analysis to the design of efficient computer algorithms. Algorithmic approaches covered include greedy, divide and conquer, and dynamic programming. Topics include sorting, searching, graph algorithms, and disjoint set structure.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS385 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  CS384 1998 1 1 Y
  MA372 1987 2 1 Y

CS385 (Version 2007-2) COURSE OFFERINGS


AYT #SECT/SIZE CPBLTY ENRLD WAIT SEATS CLOSED DETAILS
2024 - 2 3 18 54 37 0 17 N Hours
2024 - 8 1 18 18 0 0 18 N Hours
2024 - 9 1 18 18 0 0 18 N Hours
2025 - 2 4 18 72 52 0 20 N Hours
2025 - 8 1 18 18 0 0 18 N Hours
2025 - 9 1 18 18 0 0 18 N Hours
2026 - 2 3 18 54 40 0 14 N Hours
2027 - 2 3 18 54 1 0 53 N Hours
2027 - 9 1 18 18 0 0 18 N Hours

CS385 (Version: 1990 1) COURSE DETAILS (ARCHIVED)


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS385 DESIGN & ANALYS-ALGORITHMS 1990 1 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
This course studies analysis of algorithms and the relevance of analysis to the design of efficient computer algorithms. Algorithmic approaches covered include greedy, divide and conquer, and dynamic programming. Topics include sorting, searching, graph algorithms, and disjoint set structure. NP-completeness and approximation algorithms are also introduced.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS385 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  CS384 1998 1 1 Y
  MA372 1987 2 1 Y