Course Search | Main

CS474 COURSE DETAILS


4 Version(s) of this Course

CS474 (Version: 2023 2) COURSE DETAILS


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS474 INTRO TO THEORETICAL COMP SCI 2023 2 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
This course introduces computer science theory through the study of abstract machines, grammars, languages, decidability, and NP-completeness. Students evaluate fundamental limits of these machines and grammars and classify languages according to the Chomsky hierarchy; apply various techniques to prove facts about these machines, grammars, and languages; recognize the difference between problems that are and are not solvable; and determine when a problem is NP-complete. Throughout, the course links fundamental computer science theory to modern-day practical computing devices and computational problems.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS474 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
CO REQUISITE  
  CS385 2007 2 1 Y
PRE REQUISITE  
  EE360 2014 1 1 Y
  MA372 2013 1 1 Y

CS474 (Version 2023-2) COURSE OFFERINGS


AYT #SECT/SIZE CPBLTY ENRLD WAIT SEATS CLOSED DETAILS
2024 - 2 3 18 54 33 0 21 N Hours

2025 - 2 4 18 72 46 0 26 N Hours

2026 - 2 3 18 54 41 0 13 N Hours

2027 - 2 3 18 54 1 0 53 N Hours


CS474 (Version: 2015 2) COURSE DETAILS


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS474 FUNDAMENTALS-COMPUTER THEORY 2015 2 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
Grounds the cadet in the essentials of theory of computation: formal languages, automata, and computability theory. Frames computation in the context of the Chomsky hierarchy, the polynomial and exponential time hierarchies, and the decidability hierarchy. Explores fundamental limits on computation: what problems can never be solved, what problems can be solved but are intractable, and the class NP of problems that are thought to be intractable, but for which no proof of intractability exists to date.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS474 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
CO REQUISITE  
  CS385 2007 2 1 Y
PRE REQUISITE  
  MA372 2013 1 1 Y

CS474 (Version 2015-2) COURSE OFFERINGS


AYT #SECT/SIZE CPBLTY ENRLD WAIT SEATS CLOSED DETAILS
2027 - 1 0 0 0 0 0 0 N Hours

2027 - 8 1 18 18 0 0 18 N Hours


CS474 (Version: 1999 1) COURSE DETAILS (ARCHIVED)


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS474 FUNDAMENTLS-COMPUTER THEORY 1999 1 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
Grounds the cadet in the essentials of theory of computation: formal languages, automata, and computability theory. Frames computation in the context of the Chomsky hierarchy, the polynomial and exponential time hierarchies, and the decidability hierarchy. Explores fundamental limits on computation: what problems can never be solved, what problems can be solved but are intractable, and the class NP of problems that are thought to be intractable, but for which no proof of intractability exists to date.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS474 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  CS385 2007 2 1 Y

CS474 (Version: 1997 1) COURSE DETAILS (ARCHIVED)


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
CS474 FUNDAMENTLS-COMPUTER THEORY 1997 1 Electrical Engineering and Computer Science 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
Grounds the cadet in the essentials of theory of computation: formal languages, automata, and computability theory. Frames computation in the context of the Chomsky hierarchy, the polynomial and exponential time hierarchies, and the decidability hierarchy. Explores fundamental limits on computation: what problems can never be solved, what problems can be solved but are intractable, and the class NP of problems that are thought to be intractable, but for which no proof of intractability exists to date.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

CS474 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
DISQUALIFIER  
  CS475B 1990 2 1 Y
PRE REQUISITE  
  CS385 1990 1 1 Y