Skip to main content
Sponsored

Search Results

Showing matches for "computer"

Courses

224 results

CS / Computer Science

CS 5501 Selected Topics in Computer Science
Spring 2024

Content varies annually, depending on students' needs and interests. Recent topics included the foundations of computation, artificial intelligence, database design, real-time systems, Internet engineering, and electronic design automation. Prerequisite: Instructor …

Rating
Difficulty
3.98
GPA
CS 3501 Special Topics in Computer Science
Spring 2026

Content varies, depending on instructor interests and the needs of the Department. Taught strictly at the undergraduate level. Prerequisite: Instructor permission; additional specific requirements vary with topics.

3.6
Rating
3.8
Difficulty
3.49
GPA
CS 7501 Selected Topics in Computer Science
Spring 2022

Content varies based on the interest and needs of students. Topics may include safety critical systems, parallel processing, information retrieval, data communications, computer networks, real-time computing, distributed multimedia systems, electronic …

Rating
Difficulty
4.00
GPA
CS 2130 Computer Systems and Organization 1
Fall 2026

This course covers topics on the computer architecture abstraction hierarchy ranging from a step above silicon to a step below modern programming languages. Students in this course will learn to …

3.0
Rating
4.3
Difficulty
3.17
GPA
CS 3130 Computer Systems and Organization 2
Fall 2026

A second course in computer systems, this course will explore a more realistic model of processors and how they and the operating system work together to provide various functionality we …

3.1
Rating
4.5
Difficulty
3.25
GPA
CS 3102 Theory of Computation
Fall 2022

Introduces computation theory including grammars, finite state machines, pushdown automata, and Turing machines.Prerequisites: (CS 2102 or CS 2120) and (CS 2100 or CS 2110 or CS 2501 topic "DSA 2" …

3.1
Rating
3.3
Difficulty
3.34
GPA
CS 6160 Theory of Computation
Fall 2026

Analyzes formal languages, the Chomsky hierarchy, formal computation and machine models, finite automata, pushdown automata, Turing machines, Church's thesis, reductions, decidability and undecidability, and NP-completeness. Prerequisite: CS 3102 or equivalent.

Rating
Difficulty
3.79
GPA

CPE / Computer Engineering

MDST / Media Studies

SARC / Architecture School

MUSI / Music

PHYS / Physics

BIMS / Biomedical Sciences