[PORTALNAME]

Course Criteria

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

  • COMS W4187x: or y Security Architecture and Engineering

    3.00 Credits
    Barnard College

    Secure programming. Cryptograhic engineering and key handling. Access controls. Tradeoffs in security design. Design for security. - Steven Bellovin Prerequisites: COMS W4118; W4180 and/or W4119 recommended. General Education Requirement: Quantitative and Deductive Reasoning (QUA). 3 points
    ShareCOMS W4187x - or y Security Architecture and Engineering
    Favorite

  • COMS W4203y: Graph Theory

    3.00 Credits
    Barnard College

    General introduction to graph theory. Isomorphism testing, algebraic specification, symmetries, spanning trees, traversability, planarity, drawings on higher-order surfaces, colorings, extremal graphs, random graphs, graphical measurement, directed graphs, Burnside-Polya counting, voltage graph theory. - J. Gross Prerequisites: COMS W3203 General Education Requirement: Quantitative and Deductive Reasoning (QUA). Not offered in 2009-2010. Lect: 3. 3 pts.
    ShareCOMS W4203y - Graph Theory
    Favorite

  • COMS W4205x: Combinatorial Theory

    3.00 Credits
    Barnard College

    Sequences and recursions, calculus of finite differences and sums, elementary number theory, permutation group structures, binomial coefficients, Stilling numbers, harmonic numbers, generating functions. - J. Gross Prerequisites: COMS W3203 and a course in calculus. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
    ShareCOMS W4205x - Combinatorial Theory
    Favorite

  • COMS W4236y: Introduction To Computational Complexity

    3.00 Credits
    Barnard College

    Develops a quantitative theory of the computational difficulty of problems in terms of the resources (eg. time, space) needed to solve them. Classification of problems into complexity classes, reductions and completeness. Power and limitations of different modes of computation such as nondeterminism, randomization, interaction and parallelism. - M. Yannakakis, R. Servedio Prerequisites: COMS W3261. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
    ShareCOMS W4236y - Introduction To Computational Complexity
    Favorite

  • COMS W4241y: Numerical Algorithms and Complexity

    3.00 Credits
    Barnard College

    Modern theory and practice of computation on digital computers. Introduction to concepts of computational complexity. Design and analysis of numerical algorithms. Applications to computational finance, computational science, and computational engineering. - J. Traub Prerequisites: Knowledge of a programming language. Some knowledge of scientific computation is desirable. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
    ShareCOMS W4241y - Numerical Algorithms and Complexity
    Favorite

  • COMS W4252x: or y Introduction To Computational Learning Theory

    3.00 Credits
    Barnard College

    Possibilities and limitations of performing learning by computational agents. Topics include computational models of learning, polynomial time learnability, learning from examples and learning from queries to oracles. Computational and statistical limitations of learning. Applications to Boolean functions, geometric functions, automata. - R. Servedio Prerequisites: COMS W4231 or COMS W4236 or (COMS W3203 and permission of instructor) or (COMS W3261 and permission of instructor). General Education Requirement: Quantitative and Deductive Reasoning (QUA). lect: 3. 3pts
    ShareCOMS W4252x - or y Introduction To Computational Learning Theory
    Favorite

  • COMS W4261x: or y Introduction To Cryptography

    3.00 Credits
    Barnard College

    An introduction to modern cryptography, focusing on the complexity-theoretic foundations of secure computation and communication in adversarial environments; a rigorous approach, based on precise definitions and provably secure protocols. Topics include private and public key encryption schemes, digital signatures, authentication, pseudorandom generators and functions, one-way functions, trapdoor functions, number theory and computational hardness, identification and zero knowledge protocols. - T. Malkin Prerequisites: Comfort with basic discrete math and probability. Recommended: COMS W3261 or COMS W4231. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 2.5. 3 pts.
    ShareCOMS W4261x - or y Introduction To Cryptography
    Favorite

  • COMS W4281x: or y Introduction to Quantum Computing

    3.00 Credits
    Barnard College

    Introduction to quantum computing. Shor's factoring algorithm, Grover's database search algorithm, the quantum summation algorithm. Relationship between classical and quantum computing. Potential power of quantum computers. - H. Wozniakowski Prerequisites: Knowledge of linear algebra. Prior knowledge of quantum mechanics is not required although helpful. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts
    ShareCOMS W4281x - or y Introduction to Quantum Computing
    Favorite

  • COMS W4444x: Programming and Problem Solving

    3.00 Credits
    Barnard College

    Hands-on introduction to solving open-ended computational problems. Emphasis on creativity, cooperation, and collaboration. Projects spanning a variety of areas within computer science, typically requiring the development of computer programs. Generalization of solutions to broader problems, and specialization of complex problems to make them manageable. Team-oriented projects, student presentations, and in-class participation required. - K. Ross Prerequisites: COMS W3137 and W3824. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
    ShareCOMS W4444x - Programming and Problem Solving
    Favorite

  • COMS W4560x: Introduction to Computer Applications in Health Care and Biomedicine

    3.00 Credits
    Barnard College

    An overview of the field of biomedical informatics, combining perspectives from medicine, computer science and social science. Use of computers and information in health care and the biomedical sciences, covering specific applications and general methods, current issues, capabilities and limitations of biomedical informatics. Biomedical Informatics studies the organization of medical information, the effective management of information using computer technology, and the impact of such technology on medical research, education, and patient care. The field explores techniques for assessing current information practices, determining the information needs of health care providers and patients, developing interventions using computer technology, and evaluating the impact of those interventions. - M. Chiang Prerequisites: Experience with computers and a passing familiarity with medicine and biology. Undergraduates in their senior or junior years may take this course only if they have adequate backgroud in mathematics and receive permission from the instructor General Education Requirement: Quantitative and Deductive Reasoning (QUA). 3 points
    ShareCOMS W4560x - Introduction to Computer Applications in Health Care and Biomedicine
    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)