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.
COMPUTER SCIENCE 231a: MCSR.Algorithms
3.00 Credits
Bowdoin College
Every fall. STEPHEN MAJERCIK. The study of algorithms concerns programming for computational efficiency, as well as problem-solving techniques. The course covers practical algorithms and theoretical issues in the design and analysis of algorithms. Topics include divide and conquer algorithms, greedy algorithms, dynamic programming, approximation algorithms, and a study of intractable problems. Prerequisite: Computer Science 210 and either Computer Science 189 or Mathematics 200, or permission of the instructor.
Share
COMPUTER SCIENCE 231a - MCSR.Algorithms
Favorite
COMPUTER SCIENCE 250a: MCSR.Principles of Programming Languages
3.00 Credits
Bowdoin College
Every spring. ERIC CHOWN. Focuses on different paradigms for solving problems, and their representation in programming languages. These paradigms correspond to distinct ways of thinking about problems. For example, "functional" languages (such as Haskell) focus attention on the behavioralaspects of the real-world phenomena being modeled; "logic programming" languages (suchas Prolog) focus attention on the declarative aspects of problem-solving. Covers principles of language design and implementation including syntax, semantics, type systems, control structures, and compilers. Prerequisite: Computer Science 210 and either Computer Science 189 or Mathematics 200.
Share
COMPUTER SCIENCE 250a - MCSR.Principles of Programming Languages
Favorite
COMPUTER SCIENCE 260a: MCSR.Software Design
3.00 Credits
Bowdoin College
Fall 2006. ALLEN TUCKER. Studies the process for designing complex software applications, with a special focus on the use of formal design and verification methods. The study of formal methods includes contemporary methodologies and tools like "designs by contract," the Unified ModelingLanguage (UML), and the Java Modeling Language (JML). Students evaluate the overall strengths and limitations of formal specification and verification in the software design process. A substantial software design project is used as a case study for working with various concepts, tools, and techniques in a laboratory setting. Prerequisite: Computer Science 210 and either Computer Science 189 or Mathematics 200.
Share
COMPUTER SCIENCE 260a - MCSR.Software Design
Favorite
COMPUTER SCIENCE 270a: MCSR.Artificial Intelligence
3.00 Credits
Bowdoin College
Spring 2008. ERIC CHOWN. Explores the principles and techniques involved in programming computers to do tasks that would require intelligence if people did them. State-space and heuristic search techniques, logic and other knowledge representations, reinforcement neural network learning, and other approaches are applied to a variety of problems with an emphasis on agentbased approaches.
Share
COMPUTER SCIENCE 270a - MCSR.Artificial Intelligence
Favorite
COMPUTER SCIENCE 289a: MCSR.Theory of Computation
3.00 Credits
Bowdoin College
Every spring. ADRIANA PALACIO. What is computation This course studies this question, and examines the principles that determine what computational capabilities are required to solve particular classes of problems. Topics include an introduction to the connections between language theory and models of computation, and a study of unsolvable problems. Prerequisite: Computer Science 189 or Mathematics 200, or permission of the instructor.
Share
COMPUTER SCIENCE 289a - MCSR.Theory of Computation
Favorite
COMPUTER SCIENCE 291a¨C294a: Intermediate Independent Study
3.00 Credits
Bowdoin College
THE DEPARTMENT.
Share
COMPUTER SCIENCE 291a¨C294a - Intermediate Independent Study
Favorite
COMPUTER SCIENCE 320a: MCSR.Robotics
3.00 Credits
Bowdoin College
Fall 2006. ERIC CHOWN. Robotics is a challenging discipline that encourages students to apply theoretical ideas from a number of different areas-artificial intelligence, cognitive science, operations research-in pursuit of an exciting, practical application: programming robots to do useful tasks. Two of the biggest challenges are building effective models of the world using inaccurate and limited sensors, and using such models for efficient robotic planning and control. Addresses these problems from both a theoretical perspective (computational complexity and algorithm development) and a practical perspective (systems and human/ robot interaction) through multiple programming projects involving simulated and actual robots. Prerequisite: Computer Science 210 and either Computer Science 189 or Mathematics 200.
Share
COMPUTER SCIENCE 320a - MCSR.Robotics
Favorite
COMPUTER SCIENCE 325a: MCSR.Cryptography and Network Security
3.00 Credits
Bowdoin College
Fall 2006. ADRIANA PALACIO. The smooth functioning of our society increasingly depends on the flow of information through computer networks. Problems of privacy, authenticity, and security of information have become extremely important, and cryptography is an essential tool in addressing these issues. Covers cryptographic techniques and their application to real-world network security problems. Topics include mathematics of cryptography, cryptographic algorithms, computational issues in cryptography, real-world security systems, and social and political issues surrounding cryptography and security. Prerequisite: Computer Science 210 and either Computer Science 189 or Mathematics 200, or permission of the instructor.
Share
COMPUTER SCIENCE 325a - MCSR.Cryptography and Network Security
Favorite
COMPUTER SCIENCE 340a: MCSR.Spatial Data Structures
3.00 Credits
Bowdoin College
MCSR.Spatial Data Structures
Share
COMPUTER SCIENCE 340a - MCSR.Spatial Data Structures
Favorite
COMPUTER SCIENCE 350a: MCSR.GIS Algorithms and Data Structures
3.00 Credits
Bowdoin College
MCSR.GIS Algorithms and Data Structures
Share
COMPUTER SCIENCE 350a - MCSR.GIS Algorithms and Data Structures
Favorite
First
Previous
26
27
28
29
30
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