[PORTALNAME]
Toggle menu
Home
Search
Search
Search Transfer Schools
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
PA Bureau of CTE SOAR Programs
Transfer Student Center
Transfer Student Center
Adult Learners
Community College Students
High School Students
Traditional University Students
International Students
Military Learners and Veterans
About
About
Institutional information
Transfer FAQ
Register
Login
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
CS 133: Computational Geometry
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 141, MATH 113, or equivalents. Introduction to the design of geometry algorithms. Covers the basic computational geometry concepts and techniques used in graphics, robotics, and engineering design. Topics include polygons and polytops, convex hulls, and voronoi diagrams.
Share
CS 133 - Computational Geometry
Favorite
CS 134: Video Game Creation and Design
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 130. Covers academic, theoretical, and practical aspects of video games by exploring common algorithms, data structures, and software design for different genres. Topics include game interface, character movement, intelligent behaviors, and networked or multiplayer games. Requires in-depth, applied programming and a term project, including the design, implementation, and analysis of a computer game.
Share
CS 134 - Video Game Creation and Design
Favorite
CS 141: Intermediate Data Structures and Algorithms
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 014 with a grade of "C-" or better; CS 111/MATH 111; MATH 009C or MATH 09HC; proficiency in C++. Explores basic algorithm analysis using asymptotic notations, summation and recurrence relations, and algorithms and data structures for discrete structures including trees, strings, and graphs. Also covers general algorithm design techniques including "divide-and-conquer," the greedymethod, and dynamic programming. Homework and programming assignments integrate knowledge of data structures, algorithms, and programming.
Share
CS 141 - Intermediate Data Structures and Algorithms
Favorite
CS 143: Multimedia Technologies and Programming
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 010 or knowledge of an object-oriented or fourthgeneration (scripting) programming language, for example C++, Hypertalk, Supertalk, Lingo, Openscript, ScriptX. Introduces multimedia technologies and programming techniques, multimedia hardware devices, authoring languages and environments, temporal and nontemporal media (interactivity in text, graphics, audio, video, and animation), applications, and trends. A term project is required. Cross-listed with EE 143.
Share
CS 143 - Multimedia Technologies and Programming
Favorite
CS 145: Combinatorial Optimization Algorithms
4.00 Credits
University of California-Riverside
Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 141; MATH 113 or MATH 131. The study of efficient algorithm design techniques for combinatorial optimization problems. Topics include shortest paths, minimum spanning trees, network flows, maximum matchings, stable matchings, linear programming, duality, two-person games, algorithmic techniques for integer programming problems, NP-completeness, and approximation algorithms.
Share
CS 145 - Combinatorial Optimization Algorithms
Favorite
CS 150: The Theory of Automata and Formal Languages
4.00 Credits
University of California-Riverside
Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 014; CS 111/MATH 111; MATH 009C or MATH 09HC. A study of formal languages, including regular and context-free languages; computational models for generating these languages such as finite-state automata, pushdown automata, regular expressions, and context-free grammars; mathematical properties of the languages and models; equivalence between the models, and an introduction to Turing machines and decidability.
Share
CS 150 - The Theory of Automata and Formal Languages
Favorite
CS 151: Introduction to Theory of Computation
4.00 Credits
University of California-Riverside
Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 141, CS 150. The study of fundamental questions about the nature of computing. Topics include Turing machines, computability, reductions, complexity theory, complexity classes P and NP, the P=NP problem, NP-completeness, and other time and space complexity classes.
Share
CS 151 - Introduction to Theory of Computation
Favorite
CS 152: Compiler Design
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 061, CS 141, CS 150. Covers the fundamentals of compiler design, including lexical analysis, parsing, semantic analysis, compile-time memory organization, run-time memory organization, code generation, and compiler portability issues. Laboratory work involves exercises covering various aspects of compilers.
Share
CS 152 - Compiler Design
Favorite
CS 153: Design of Operating Systems
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 061, CS 141 with a grade of "C-" or better, C++ programming proficiency. Covers the principles and practice of operating system design, including concurrency, memory management, file systems, protection, security, command languages, scheduling, and system performance. Laboratory work involves exercises about various aspects of operating systems.
Share
CS 153 - Design of Operating Systems
Favorite
CS 160: Concurrent Programming and Parallel Systems
4.00 Credits
University of California-Riverside
Lecture, 3 hours; laboratory, 3 hours. Prerequisite(s): CS 061, CS 141. Study of concurrent and parallel systems. Topics include modular structure and design, interprocess communication, synchronization, failures and persistence, concurrency control, atomic transactions, recovery, language support, distributed interprocess communication, and implementation mechanisms. Provides preparation for the study of operating systems, databases, and computer networking.
Share
CS 160 - Concurrent Programming and Parallel Systems
Favorite
First
Previous
81
82
83
84
85
Next
Last
Results Per Page:
10
20
30
40
50
Search Again
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
College:
(Type the name of a College, University, Exam, or Corporation)
Course Subject:
(For example: Accounting, Psychology)
Course Prefix and Number:
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
Course Title:
(For example: Introduction To Accounting)
Course Description:
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
Within
5 miles
10 miles
25 miles
50 miles
100 miles
200 miles
of
Zip Code
Please enter a valid 5 or 9-digit Zip Code.
(For example: Find all institutions within 5 miles of the selected Zip Code)
State/Region:
Alabama
Alaska
American Samoa
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Federated States of Micronesia
Florida
Georgia
Guam
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Marshall Islands
Maryland
Massachusetts
Michigan
Minnesota
Minor Outlying Islands
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Northern Mariana Islands
Ohio
Oklahoma
Oregon
Palau
Pennsylvania
Puerto Rico
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virgin Islands
Virginia
Washington
West Virginia
Wisconsin
Wyoming
American Samoa
Guam
Northern Marianas Islands
Puerto Rico
Virgin Islands