CollegeTransfer.Net
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 102 abc: Seminar in Computer Science
1.00 - 9.00 Credits
California Institute of Technology
No course description available.
Share
CS 102 abc - Seminar in Computer Science
Favorite
CS 103 abc: Reading in Computer Science
1.00 - 9.00 Credits
California Institute of Technology
No course description available.
Share
CS 103 abc - Reading in Computer Science
Favorite
CS 11: Computer Language Shop
3.00 Credits
California Institute of Technology
A self-paced lab that provides students with extra practice and supervision in transferring their programming skills to a particular programming language; the course can be used for any language of the student’s choosing, subject to approval by the instructor. A series of exercises guide the student through the pragmatic use of the chosen language, building his or her familiarity, experience, and style. More advanced students may propose their own programming project as the target demonstration of their new language skills. CS 11 may be repeated for credit of up to a total of nine units. Instructors: Pinkston, Vanier.
Share
CS 11 - Computer Language Shop
Favorite
CS 114: Parallel Algorithms for Scientific Applications
9.00 Credits
California Institute of Technology
Introduction to parallel program design for numerically intensive scientific applications. Parallel programming methods; distributed-memory model with message passing using the message passing interface; shared-memory model with threads using open MP, CUDA; object-based models using a problem-solving environment with parallel objects. Parallel numerical algorithms: numerical methods for linear algebraic systems, such as LU decomposition, QR method, CG solvers; parallel implementations of numerical methods for PDEs, including finite-difference, finite-element; particle-based simulations. Performance measurement, scaling and parallel efficiency, load balancing strategies. Not offered 2012–13.
Share
CS 114 - Parallel Algorithms for Scientific Applications
Favorite
CS 116: Reasoning about Program Correctness
9.00 Credits
California Institute of Technology
This course presents the use of logic and formal reasoning to prove the correctness of sequential and concurrent programs. Topics in logic include propositional logic, basics of first-order logic, and the use of logic notations for specifying programs. The course presents a programming notation and its formal semantics, Hoare logic and its use in proving program correctness, predicate transformers and weakest preconditions, and fixed-point theory and its application to proofs of programs. Not offered 2012–13.
Share
CS 116 - Reasoning about Program Correctness
Favorite
CS 117 abc: Computability Theory
9.00 Credits
California Institute of Technology
Various approaches to computability theory, e.g., Turing machines, recursive functions, Markov algorithms; proof of their equivalence. Church’s thesis. Theory of computable functions and effectively enumerable sets. Decision problems. Undecidable problems: word problems for groups, solvability of Diophantine equations (Hilbert’s 10th problem). Relations with mathematical logic and the Gödel incompleteness theorems. Decidable problems, from number theory, algebra, combinatorics, and logic. Complexity of decision procedures. Inherently complex problems of exponential and superexponential difficulty. Feasible (polynomial time) computations. Polynomial deterministic vs. nondeterministic algorithms, NP-complete problems and the P = NP question. Instructors: Kechris, Sokic.
Share
CS 117 abc - Computability Theory
Favorite
CS 118: Logic Model Checking for Formal Software Verification
9.00 Credits
California Institute of Technology
An introduction to the theory and practice of logic model checking as an aid in the formal proofs of correctness of concurrent programs and system designs. The specific focus is on automata-theoretic verification. The course includes a study of the theory underlying formal verification, the correctness of programs, and the use of software tools in designs. Not offered 2012–13.
Share
CS 118 - Logic Model Checking for Formal Software Verification
Favorite
CS 119: Reliable Software: Testing and Monitoring
9.00 Credits
California Institute of Technology
The class discusses theoretical and practical aspects of software testing and monitoring. Topics include finite state machine testing algorithms, random testing, constraint-based testing, coverage measures, automated debugging, logics and algorithms for runtime monitoring, and aspect-oriented approaches to monitoring. Emphasis is placed on automation. Students will be expected to develop and use software testing and monitoring tools to develop reliable software systems. Not offered 2012–13.
Prerequisite:
CS 1 or equivalent; CS 116 and CS 118 are recommended.
Share
CS 119 - Reliable Software: Testing and Monitoring
Favorite
CS 121: Introduction to Relational Databases
9.00 Credits
California Institute of Technology
Introduction to the basic theory and usage of relational database systems. It covers the relational data model, relational algebra, and the Structured Query Language (SQL). The course introduces the basics of database schema design and covers the entity-relationship model, functional dependency analysis, and normal forms. Additional topics include other query languages based on the relational calculi, data-warehousing and dimensional analysis, writing and using stored procedures, working with hierarchies and graphs within relational databases, and an overview of transaction processing and query evaluation. Extensive hands-on work with SQL databases. Instructor: Pinkston.
Prerequisite:
CS 1 or equivalent.
Share
CS 121 - Introduction to Relational Databases
Favorite
Show comparable courses
CS 122: Database System Implementation
9.00 Credits
California Institute of Technology
This course explores the theory, algorithms, and approaches behind modern relational database systems. Topics include file storage formats, query planning and optimization, query evaluation, indexes, transaction processing, concurrency control, and recovery. Assignments consist of a series of programming projects extending a working relational database, giving hands-on experience with the topics covered in class. The course also has a strong focus on proper software engineering practices, including version control, testing, and documentation. Instructor: Pinkston.
Prerequisite:
CS2, CS38, CS 121 and familiarity with Java, or instructor’s permission.
Share
CS 122 - Database System Implementation
Favorite
First
Previous
46
47
48
49
50
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