CollegeTransfer.Net

Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.

  • 15 128: Freshman Immigration Course

    1.00 Credits
    Carnegie Mellon University

    The Freshman Immigration Course is taken by first-semester Computer Science majors on the Pittsburgh campus. The course is designed to acquaint incoming majors with computer science at CMU. Talks range from historical perspectives in the field to descriptions of the cutting edge research being conducted in the School of Computer Science. 15-128 is a one unit course and is graded pass/fail. Enrollment is limited to SCS Freshmen ONLY.
    Share15 128 - Freshman Immigration Course
    Favorite

  • 15 129: Freshman Immigration Course II

    3.00 Credits
    Carnegie Mellon University

    This course is offered at our Qatar campus only. Students and instructors will solve different problems each week by searching the Web and other likely places for answers. The problems will be submitted by other faculty who will grade the quality of the answers. Students will learn strategies and techniques for finding information on the Web more efficiently; learn when to start with a search engine, a subject-oriented directory, or other tools; explore and practice using advanced search syntax for major search engines; experience specialized search engines for images, sound, multimedia, newsgroups, and discussion lists as well as subject-specific search engines; discover valuable resources to help keep you up-to-date in this fast-changing environment.
    Share15 129 - Freshman Immigration Course II
    Favorite

  • 15 150: Principles of Functional Programming

    10.00 Credits
    Carnegie Mellon University

    An introduction to programming based on a "functional" model of computation. The functional model is a natural generalization of algebra in which programs are formulas that describe the output of a computation in terms of its inputs---that is, as a function. But instead of being confined to real- or complex-valued functions, the functional model extends the algebraic view to a very rich class of data types, including not only aggregates built up from other types, but also functions themselves as values. This course is an introduction to programming that is focused on the central concepts of function and type. One major theme is the interplay between inductive types, which are built up incrementally; recursive functions, which compute over inductive types by decomposition; and proof by structural induction, which is used to prove the correctness and time complexity of a recursive function. Another major theme is the role of types in structuring large programs into separate modules, and the integration of imperative programming through the introduction of data types whose values may be altered during computation. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
    Share15 150 - Principles of Functional Programming
    Favorite
    Show comparable courses

  • 15 190: Topics in Intermediate Programming

    3.00 Credits
    Carnegie Mellon University

    This three-credit extension of 15-110 is open to current 15-110 students by invitation of their instructor only. The seminar meetings examine interesting and challenging topics in programming and computer science that are accessible to students after half a semester of 15-110.
    Share15 190 - Topics in Intermediate Programming
    Favorite

  • 15 195: Special Topic: Techniques for Competition Programming

    3.00 Credits
    Carnegie Mellon University

    This course is intended as a systematic introduction to the approaches and techniques required in programming competitions. Common types of problems will be covered on a topic-by-topic basis with minimal background assumptions. The students will learn a suite of implementational, algorithmic and mathematical techniques, and acquire skills in solving problems that require creative usage of various techniques.
    Share15 195 - Special Topic: Techniques for Competition Programming
    Favorite

  • 15 199: Special Topics: Discovering Logic

    3.00 Credits
    Carnegie Mellon University

    This 3-unit extension of 15-100 is open to current 15-100 students by invitation of their instructor only. The seminar meetings examine interesting topics in programming and computer science that are accessible to students after half a semester of 15-100.
    Share15 199 - Special Topics: Discovering Logic
    Favorite

  • 15 210: Parallel and Sequential Data Structures and Algorithms

    12.00 Credits
    Carnegie Mellon University

    Teaches students about how to design, analyze, and program algorithms and data structures. The course emphasizes parallel algorithms and analysis, and how sequential algorithms can be considered a special case. The course goes into more theoretical content on algorithm analysis than 15-122 and 15-150 while still including a significant programming component and covering a variety of practical applications such as problems in data analysis, graphics, text processing, and the computational sciences. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
    Share15 210 - Parallel and Sequential Data Structures and Algorithms
    Favorite
    Show comparable courses

  • 15 211: Fundamental Data Structures and Algorithms

    12.00 Credits
    Carnegie Mellon University

    Fundamental programming concepts are presented together with supporting theoretical foundations and practical applications. This course emphasizes the practical application of techniques for writing and analyzing programs: data abstraction, program verification, and performance analysis. These techniques are applied in the design and analysis of fundamental algorithms and data structures. The course is currently taught in Java. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
    Share15 211 - Fundamental Data Structures and Algorithms
    Favorite
    Show comparable courses

  • 15 212: Principles of Programming

    12.00 Credits
    Carnegie Mellon University

    This course presents principles and techniques of programming, focusing on sophisticated methods for specifying, constructing, and reasoning about computer programs. Via features of a high-level functional programming language (currently ML), this course concretely illustrates mechanisms for building user-defined data types, including recursive and polymorphic types, and infinite data structures such as streams; for building higher-order control constructs such as first-class functions and continuations; and for building large programs using advanced module composition. It also introduces the use of formal methods for specifying and verifying programs.
    Share15 212 - Principles of Programming
    Favorite

  • 15 213: Introduction to Computer Systems

    12.00 Credits
    Carnegie Mellon University

    This course provides a programmer's view of how computer systems execute programs, store information, and communicate. It enables students to become more effective programmers, especially in dealing with issues of performance, portability and robustness. It also serves as a foundation for courses on compilers, networks, operating systems, and computer architecture, where a deeper understanding of systems-level issues is required. Topics covered include: machine-level code and its generation by optimizing compilers, performance evaluation and optimization, computer arithmetic, memory organization and management, networking technology and protocols, and supporting concurrent computation. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
    Share15 213 - Introduction to Computer Systems
    Favorite
    Show comparable courses
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)