[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.
CSCI 4820: Introduction to Numerical Methods for Differential Equations
4.00 Credits
Rensselaer Polytechnic Institute
Derivation, analysis, and use of computational procedures for solving differential equations. Topics covered include ordinary differential equations (both initial value and boundary value problems) and partial differential equations. Runge-Kutta and multistep methods for initial value problems. Finite difference methods for partial differential equations including techniques for heat conduction, wave propagation, and potential problems. Basic convergence and stability theory. Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800. Students who have passed CSCI 1200 cannot register for this course. When Offered: Spring term annually. Cross Listed: Cross-listed as MATH 4820. Credit Hours: 4
Share
CSCI 4820 - Introduction to Numerical Methods for Differential Equations
Favorite
CSCI 4940: Readings in Computer Science
1.00 - 4.00 Credits
Rensselaer Polytechnic Institute
Credit Hours: 1 to 4
Share
CSCI 4940 - Readings in Computer Science
Favorite
CSCI 4960: Topics in Computer Science
1.00 - 4.00 Credits
Rensselaer Polytechnic Institute
Credit Hours: 1 to 4
Share
CSCI 4960 - Topics in Computer Science
Favorite
CSCI 6050: Computability and Complexity
3.00 Credits
Rensselaer Polytechnic Institute
This course discusses modern concepts of computability and computational complexity theories. The Church-Turing thesis; variations of Turing Machines; Algorithms; Decidability; The Halting Problem; Reducibility; The Recursion Theorem; The Concept of Information; Time and Space Complexity; Intractability; NP-completeness and Cook's theorem. Prerequisites/Corequisites: Prerequisite: CSCI 2400 or equivalent. When Offered: Fall term annually. Credit Hours: 3
Share
CSCI 6050 - Computability and Complexity
Favorite
CSCI 6090: Generic Software Design
3.00 Credits
Rensselaer Polytechnic Institute
Study of the generic programming approach to design and systematic classification of software components. Techniques for achieving correctness, efficiency, and generality of algorithms, data structures, and memory management. Methods of structuring a library of generic software components for maximum usability are practiced in a significant design and implementation project. Prerequisites/Corequisites: Prerequisite: CSCI 2300 or equivalent. When Offered: Fall term annually. Credit Hours: 3
Share
CSCI 6090 - Generic Software Design
Favorite
CSCI 6100: Machine and Computational Learning
3.00 Credits
Rensselaer Polytechnic Institute
Introduction to the theory, algorithms, and applications of automated learning (supervised, reinforcement, and unsupervised), how much information and computation are needed to learn a task, and how to accomplish it. Emphasis will be given to unifying approaches coming from statistics, function approximation, optimization, and pattern recognition. Topics include: Decision Trees, Neural Networks, RBF's, Bayesian Learning, PAC Learning, Support Vector Machines, Gaussian processes, Hidden Markov Models. Prerequisites/Corequisites: Prerequisites: familiarity with probability, linear algebra, and calculus. When Offered: Offered on availability of instructor. Credit Hours: 3
Share
CSCI 6100 - Machine and Computational Learning
Favorite
CSCI 6130: Distributed Operating Systems
3.00 Credits
Rensselaer Polytechnic Institute
A detailed discussion of issues in distributed operating system design and in computer security. The topics discussed include distributed algorithms, distributed deadlock detection and recovery, distributed concurrency control and synchronization, cryptography, and computer security. If both CSCI 6130 and CSCI 6140 are to be taken, CSCI 6140 should be taken first. Prerequisites/Corequisites: Prerequisite: CSCI 4210 or CSCI 6140. When Offered: Offered on availability of instructor. Credit Hours: 3
Share
CSCI 6130 - Distributed Operating Systems
Favorite
CSCI 6140: Computer Operating Systems
3.00 Credits
Rensselaer Polytechnic Institute
Topics include analysis of multiprogramming systems, virtual memory, computer system performance, and queuing theory. The course also discusses tools for synchronization of parallel programs and algorithms for mutual exclusion. Prerequisites/Corequisites: Prerequisite: CSCI 4210 or permission of instructor. When Offered: Fall term annually. Credit Hours: 3
Share
CSCI 6140 - Computer Operating Systems
Favorite
CSCI 6210: Design and Analysis of Algorithms
3.00 Credits
Rensselaer Polytechnic Institute
Theoretical and empirical analysis of algorithms; tools for on-line monitoring of the algorithm's performance. Advanced algorithms for polynomial problems; randomized heuristic and approximate algorithms. Problems include computation in discrete mathematics, number theory, linear algebra, graph theory, numerical and symbolic computing. Prerequisites/Corequisites: Prerequisite: CSCI 4020 or equivalent. When Offered: Fall term annually. Credit Hours: 3
Share
CSCI 6210 - Design and Analysis of Algorithms
Favorite
CSCI 6220: Parallel Algorithm Design
3.00 Credits
Rensselaer Polytechnic Institute
Models of parallel computation; deterministic and probabilistic PRAM model; P-complete problems. Techniques for designing efficient parallel algorithms. Parallel sorting prefix and suffix computation, list ranking, DAG evaluation, solving linear systems, graph and combinatorial problems. Prerequisites/Corequisites: Prerequisite: CSCI 4020 or equivalent. When Offered: Offered on availability of instructor. Credit Hours: 3
Share
CSCI 6220 - Parallel Algorithm Design
Favorite
First
Previous
56
57
58
59
60
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