Search Results
CSCEÂ 43203. Formal Languages and Computability. 3 Hours.
Finite Automata and regular languages, regular expressions, context-free languages and pushdown automata, nondeterminism, grammars, and Turing machines. Church's thesis, halting problem, time complexity, space complexity and undecidability. Prerequisite: (°ä³§°ä·¡Ìý31903 or °ä³§°ä·¡Ìý319±á3, each with a grade of C or better) and (²Ñ´¡°Õ±áÌý26103 or ²Ñ´¡°Õ±áÌý28003). (Typically offered: Spring)
Data Science (DTSC)
/undergraduatecatalog/collegesandschools/interdisciplinarystudies/datasciencedasc/
...CSCE 41203 , CSCE 43203 , CSCE 45203 , CSCE 47503 , CSCE 48103 . 7 Pre-req for CSCE...
Data Science B.S. with Computational Analytics Concentration
/plangrids/data_science_bs_computational_analytics/
...CSCE 41203 , CSCE 43203 , CSCE 45203 , CSCE 47503 , CSCE 48103 . 7 Pre-req for CSCE...
General Education
/undergraduatecatalog/gened/generaleducation/
...4.1 No PHIL 43203 No No PHIL...COMM 49801 No No CSCE 35103 No No...
Industrial Engineering (INEG)
/undergraduatecatalog/collegesandschools/collegeofengineering/industrialengineeringineg/
...BMEG, CHEG, CHEM, CVEG, CSCE, DASC, ELEG, EMGT...are not approved. OMGT 43203 , OMGT 43303 , OMGT...