[PORTALNAME]

Course Criteria

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

  • Computer Science 105F,S: Explorations in Computer Science

    3.00 Credits
    Hamilton College

    Investigation, through hands-on experience, of a modern application of computer science. Applications may include robotics, virtual reality, games, manipulation of digital media, and human-computer interaction. Topics for individual sections will be printed in the preregistration materials. No prior computer experience is expected. Not open to students who have completed 110. May not be counted toward the concentration or the minor. (Quantitative and Symbolic Reasoning.) Maximum enrollment, 12. Hirshfield.
    ShareComputer Science 105F,S - Explorations in Computer Science
    Favorite

  • Computer Science 110F,S: Introduction to Computer Science

    3.00 Credits
    Hamilton College

    The first course in computer science is an introduction to algorithmic problem-solving using the Python programming language. Topics include primitive data types, mathematical operations, structured programming with conditional and iterative idioms, functional abstraction, objects, classes and aggregate data types. Students apply these skills in writing programs to solve problems in a variety of application areas. No previous programming experience necessary. (Quantitative and Symbolic Reasoning.) Maximum enrollment, 26. Bailey and Campbell.
    ShareComputer Science 110F,S - Introduction to Computer Science
    Favorite

  • Computer Science 111F,S: Data Structures

    3.00 Credits
    Hamilton College

    A second course in programming, concentrating on the implementation of dynamic structures for data representation. Students will write programs in the C++ programming language which implement the following classic data structures, among others: stacks, lists, queues, hash tables, and trees. Course discussion will emphasize recursion, efficient implementations in terms of memory space and running time, computational complexity of algorithms, and introduction to two important fields of study: searching and sorting. (Quantitative and Symbolic Reasoning.) Prerequisite, 110, or placement by the department. Maximum enrollment, 26. A Campbell.
    ShareComputer Science 111F,S - Data Structures
    Favorite

  • Computer Science 123S: Discrete Mathematics

    3.00 Credits
    Hamilton College

    Study of mathematical models and techniques commonly used in computer science. Emphasis on analytical and logical skills, including an introduction to proof techniques and formal symbolic manipulation. Topics include set theory, number theory, permutations and combinations, mathematical induction and graph theory. Topics will be reinforced with hands-on experiences using the ML programming language. Appropriate for students with strong pre-calculus backgrounds. No previous programming experience necessary. (Quantitative and Symbolic Reasoning.) Not open to seniors; open to juniors by consent of instructor. Maximum enrollment, 26. Decker.
    ShareComputer Science 123S - Discrete Mathematics
    Favorite

  • Computer Science 210F: Applied Theory

    3.00 Credits
    Hamilton College

    An investigation of the nature of computation through development of several models of computation. Topics include finite state machines, pushdown automata and Turing machines, the Chomsky language hierarchy, discussion of computational complexity, and illustration of how these abstract models of computation may be applied to language recognition problems such as lexical analysis and parsing. (Quantitative and Symbolic Reasoning.) Prerequisite, 123; or, senior standing and permission of instructor. Maximum enrollment, 26. Decker.
    ShareComputer Science 210F - Applied Theory
    Favorite

  • Computer Science 220S: Principles of Programming Languages

    3.00 Credits
    Hamilton College

    Investigation into the nature, features, design and implementation of programming languages. Students will gain experience with a wide variety of programming languages through programming exercises. Topics will include, among others, object-oriented programming, functional programming, higher-order functions, type systems and polymorphism. Prerequisite, 111; or, senior standing and permission of instructor. Maximum enrollment, 26. Bailey.
    ShareComputer Science 220S - Principles of Programming Languages
    Favorite

  • Computer Science 240F: Computer Organization and Assembly Language

    3.00 Credits
    Hamilton College

    A study of the connection between high-level programs and the machines on which they run by means of extensive programming experience using assembly language. Topics will include translation of high-level language idioms into assembly language, number systems and representation schemes, exceptions, interrupts, polling, and an introduction to the structure of the underlying hardware. In the final project, students develop an assembler. Prerequisite, 111; or, senior standing and permission of instructor. Maximum enrollment, 26. Campbell.
    ShareComputer Science 240F - Computer Organization and Assembly Language
    Favorite

  • Computer Science 290F,S: Programming Challenges

    3.00 Credits
    Hamilton College

    Study of classic programming problems from regional and national programming competitions. Students are required to participate in a regional programming contest. Prerequisite, CPSCI 111, and consent of instructor. One-quarter course credit. Offered credit/no credit. May be repeated. Students may count up to one credit from courses numbered 290-298 toward graduation. Maximum enrollment, 20. Bailey and Campbell.
    ShareComputer Science 290F,S - Programming Challenges
    Favorite

  • Computer Science 310F: Compilers

    3.00 Credits
    Hamilton College

    Study of the translation of high-level languages into assembly language. Topics will include tokenizing, parsing, type checking, code generation and optimization. Each student will implement a significant portion of a compiler. Programming intensive. Prerequisite, 210, 220 and 240. Maximum enrollment, 26. Bailey.
    ShareComputer Science 310F - Compilers
    Favorite

  • Computer Science 330S: Algorithms

    3.00 Credits
    Hamilton College

    Discussion of the canon of standard algorithms, with analysis of time and space complexity. Topics will include, among others: sorting, searching and selection; numerical algorithms; string matching; graph algorithms; parallel algorithms; non-determinism and NP-completeness. Theory intensive. Prerequisite, 111 and 123. Maximum enrollment, 26.
    ShareComputer Science 330S - Algorithms
    Favorite
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)