[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.
Computer Science 231-232: Intelligent Robots I,II
4.00 Credits
Bard College
Cognitive Science Intended for highly motivated students who want hands-on experience with mobile robot hardware and software. Students learn to program in Python and control robots using the ARIA robot interface as they work toward building an intelligent system that includes visual object identification, obstacle avoidance, and sonar-based navigation capabilities. The eventual goal is to have robots participate in a scavenger hunt. The spring semester has a much greater emphasis on higher-level organization, including cognitive architectures, machine learning, visual recognition, and problem solving. Students are assigned to small teams that work cooperatively toward a shared objective. Interested students must meet with the instructors prior to registration.
Share
Computer Science 231-232 - Intelligent Robots I,II
Favorite
Computer Science 243: Introduction to Functional Programming
4.00 Credits
Bard College
This course introduces students to the functional programming paradigm. Topics include recursion, recursively defined data types, and first-class functions. The course also introduces some basic programming techniques from artificial intelligence, including blind and heuristic search algorithms. Prerequisite: Computer Science 141.
Share
Computer Science 243 - Introduction to Functional Programming
Favorite
Computer Science 244: Discrete Math and Functional Programming
4.00 Credits
Bard College
This course covers many mathematical concepts of importance to the foundation of the modern computer scientist, employing a functional programming language as a vehicle for computational expression. General discrete mathematics topics include logic and formal proof, sets, relations, functions, induction and coinduction, number theory, and graph theory. Functional programming concepts include lambda calculus, type theory, lists and algebraic data types, recursion and corecursion, and polymorphism. Prerequisites: Math 141 and an introductory computer science course, or their equivalents.
Share
Computer Science 244 - Discrete Math and Functional Programming
Favorite
Computer Science 301: Algorithms
4.00 Credits
Bard College
This course covers the design and analysis of correct and efficient computer algorithms. Topics include sorting, greedy algorithms, divide-andconquer algorithms, dynamic programming algorithms, and graph algorithms. Advanced topics in algorithms may be selected from specialized areas of the mathematical and empirical sciences. Prerequisites: Computer Science 201 and Mathematics 235 or 261.
Share
Computer Science 301 - Algorithms
Favorite
Computer Science 305: Design of Programming Languages
4.00 Credits
Bard College
Covers a selection of important issues in the design of programming languages including, but not limited to, type systems, procedure activation, parameter passing, data encapsulation, dynamic memory allocation, and concurrency. In addition, the functional, logical, and object-oriented programming paradigms are presented, along with a history of high-level programming languages. Prerequisite: Computer Science 201.
Share
Computer Science 305 - Design of Programming Languages
Favorite
Computer Science 312: Theory of Computation
4.00 Credits
Bard College
An introduction to several computational models developed to formalize the notion of an algorithm, the course also offers detailed discussion of primary topics in the theory of computation, including the theory of recursive functions, Turing machines, and several undecidable problems, such as the halting problem. Prerequisite: Mathematics 261 or both Computer Science 301 and Mathematics 235.
Share
Computer Science 312 - Theory of Computation
Favorite
Computer Science 321: Databases:Theory and Practice
4.00 Credits
Bard College
An introduction to the design, implementation, and uses of databases. Topics include database design, models, integrity, concurrency, security, and query languages. Prerequisite: Computer Science 201.
Share
Computer Science 321 - Databases:Theory and Practice
Favorite
Computer Science 323: Computer Graphics
4.00 Credits
Bard College
Computer graphics have become ubiquitous in today's society, from magazine ads to movies to video games. In this course students explore the basic algorithms used to create and manipulate two- and three-dimensional graphic objects. Among the topics covered are coordinate transformations, projection, hidden surfaces, shading, ray tracing, and texture mapping. A strong background in mathematics and programming is necessary. Prerequisites: Mathematics 242 or 331, Computer Science 201, and permission of the instructor.
Share
Computer Science 323 - Computer Graphics
Favorite
Computer Science 326: Operating Systems
4.00 Credits
Bard College
Covers traditional topics of operating systems, including interprocess communication, semaphores, monitors, scheduling algorithms, deadlocks, virtual memory, and file system design. In addition, discussion may include issues in distributed systems such as the client-server model, remote procedure call, distributed synchronization, transactions, threads, and file servers. Prerequisite: Computer Science 201.
Share
Computer Science 326 - Operating Systems
Favorite
Computer Science 335: Computer Networks
4.00 Credits
Bard College
Takes a bottom-up approach to computer networking, covering in detail the physical, datalink, MAC, network, transport, and application layers. TCP/IP and OSI reference models are introduced, with examples taken from the Internet, ATM networks, and wireless networks. Prerequisite: Computer Science 201.
Share
Computer Science 335 - Computer Networks
Favorite
First
Previous
21
22
23
24
25
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