2011-2012 Bulletin – PDF - SEAS Bulletin - Columbia University

112
COMS W1001x and y Introduction to
information science
3 pts. Lect: 3. Professor Cannon.
Basic Introduction to concepts and skills
in Information Sciences: human-computer
interfaces, representing information digitally,
organizing and searching information on the
World Wide Web, principles of algorithmic
problem solving, introduction to database
concepts, introduction to programming in Python.
COMS W1003x or y Introduction to computer
science and programming in C
3 pts. Lect: 3.
A general introduction to computer science
concepts, algorithmic problem-solving
capabilities, and programming skills in C.
Columbia University students may receive credit
for only one of the following three courses: 1003,
1004, and 1005.
COMS W1004x and y Introduction to
computer science and programming in Java
3 pts. Lect: 3. Professor Cannon.
A general introduction to computer science for
science and engineering students interested in
majoring in computer science or engineering.
Covers fundamental concepts of computer
science, algorithmic problem-solving capabilities,
and introductory Java programming skills.
Assumes no prior programming background.
Columbia University students may receive credit
for only one of the following three courses: 1003,
1004, and 1005.
COMS W1005x and y Introduction to
computer science and programming in
MATLAB
3 pts. Lect: 3. Professor Blaer.
Prerequisites: None. Corequisites: None.
A general introduction to computer science
concepts, algorithmic problem-solving
capabilities, and programming skills in MATLAB.
Assumes no prior programming background.
Columbia University students may receive credit
for only one of the following three courses: 1003,
1004, and 1005.
COMS W1007x and y Object-oriented
programming and design in Java
3 pts. Lect: 3. Professor Kender.
Prerequisite: COMS W1004 or AP Computer
Science with a grade of 4 or 5. The second
course for majors in computer science.
A rigorous treatment of object-oriented
concepts using Java as an example language.
Development of sound programming and design
skills, problem solving and modeling of real
world problems from science, engineering, and
economics using the object-oriented paradigm.
ECBM E3060x Introduction to genomic
information science and technology
3 pts. Lect: 3. Professor Anastassiou.
Introduction to the information system
paradigm of molecular biology. Representation,
organization, structure, function and manipulation
of the biomolecular sequences of nucleic
acids and proteins. The role of enzymes and
gene regulatory elements in natural biological
functions as well as in biotechnology and
genetic engineering. Recombination and
other macromolecular processes viewed
as mathematical operations with simulation
and visualization using simple computer
programming. This course shares lectures with
ECBM E4060, but the work requirements differ
somewhat.
COMS W3101x and y Programming languages
1 pt. Lect: 1.
Prerequisite: Fluency in at least one
programming language. Introduction to a
programming language. Each section is
devoted to a specific language. Intended only
for those who are already fluent in at least one
programming language. Sections may meet for
one hour per week for the whole term, for three
hours per week for the first third of the term, or
for two hours per week for the first six weeks.
May be repeated for credit if different languages
are involved.
COMS W3133x or y Data structures in C
3 pts. Lect: 3.
Prerequisite: COMS W1003 or knowledge of
C. Not intended for computer science majors.
Data types and structures: arrays, stacks, singly
and doubly linked lists, queues, trees, sets, and
graphs. Programming techniques for processing
such structures: sorting and searching, hashing,
garbage collection. Storage management.
Rudiments of the analysis of algorithms. Taught
in C. Note: Due to significant overlap, students
may receive credit for only one of the following
four courses: COMS W3133, W3134, W3137,
and W3139.
COMS W3134x and y Data structures in Java
3 pts. Lect: 3.
Prerequisite: COMS W1004 or knowledge of
Java. Not intended for computer science majors.
Data types and structures: arrays, stacks, singly
and doubly linked lists, queues, trees, sets, and
graphs. Programming techniques for processing
such structures: sorting and searching, hashing,
garbage collection. Storage management.
Rudiments of the analysis of algorithms. Taught
in Java. Note: Due to significant overlap,
students may receive credit for only one of the
following four courses: COMS W3133, W3134,
W3137, and W3139.
COMS W3137x and y Data structures and
algorithms
4 pts. Lect: 3. Professor Hershkop.
Prerequisite: COMS W1007. Corequisite: COMS
W3203. Data types and structures: arrays,
stacks singly and doubly linked lists, queues,
trees, sets, and graphs. Programming techniques
for processing such structures: sorting and
searching, hashing, garbage collection. Storage
management. Design and analysis of algorithms.
Taught in Java. Note: Due to significant overlap,
students may receive credit for only one of the
following four courses: COMS W3133, W3134,
W3137, and W3139.
COMS W3157x and y Advanced programming
4 pts. Lect: 4.
Prerequisite: COMS W1007. Practical, hands-on
introduction to programming techniques and tools
for professional software construction, including
learning how to write code to given specifications
as well as document the results. Provides
introductory overview of C and C++ in a UNIX
environment, for students with Java background.
Also introduces scripting languages (Perl) and
basic web programming. UNIX programming
utilities are also covered. Lab required.
COMS W3203x and y Discrete mathematics:
introduction to combinatorics and graph
theory
3 pts. Lect: 3. Professor Gross.
Prerequisite: Any introductory course in
computer programming. Logic and formal proofs,
sequences and summation, mathematical
induction, binomial coefficients, elements
of finite probability, recurrence relations,
equivalence relations and partial orderings, and
topics in graph theory (including isomorphism,
traversability, planarity, and colorings).
COMS W3210y Scientific computation
3 pts. Lect: 3.
Prerequisites: Two terms of calculus. Introduction
to computation on digital computers. Design
and analysis of numerical algorithms. Numerical
solution of equations, integration, recurrences,
chaos, differential equations. Introduction to
Monte Carlo methods. Properties of floating point
arithmetic. Applications to weather prediction,
computational finance, computational science,
and computational engineering.
COMS W3251x Computational linear algebra
3 pts. Lect: 3. Professor Papageorgiou.
Prerequisites: Two terms of calculus.
Computational linear algebra, solution of linear
systems, sparse linear systems, least squares,
eigenvalue problems, and numerical solution of
other multivariate problems as time permits.
COMS W3261x and y Computer science theory
3 pts. Lect: 3. Professor Aho.
Prerequisite: COMS W3203. Corequisite: COMS
W3137. Regular languages: deterministic
and nondeterministic finite automata, regular
expressions. Context-free languages: contextfree
grammars, push-down automata. Turing
machines, the Chomsky hierarchy, and the
Church-Turing thesis. Introduction to complexity
theory and NP-completeness.
engineering 2011–2012