|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
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. - A. Aho General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
-
3.00 Credits
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. - Paul Blaer Prerequisites: None Corequisites: None General Education Requirement: Quantitative and Deductive Reasoning (QUA). 3 points
-
3.00 Credits
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. - Adam Cannon Prerequisites: COMS W1004 or AP Computer Science with a grade of 4 or 5. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
-
3.00 Credits
An honors-level introduction to computer science, intended primarily for students considering a major in computer science. Computer science as a science of abstraction. Creating models for reasoning about and solving problems. The basic elements of computers and computer programs. Implementing abstractions using data structures and algorithms. Taught in Java. - John Kender Prerequisites: COMS W1004 or AP Computer Science with a grade of 4 or 5. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Not offered in 2009-2010. Lect: 3. 3 pts.
-
1.00 Credits
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. Prerequisites: Fluency in at least one programming language. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 1. 1pts.
-
4.00 Credits
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. Prerequisites: COMS W1003 or knowledge of C. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
-
4.00 Credits
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. Prerequisites: COMS W1004 or knowldege of Java. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 3 pts.
-
4.00 Credits
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. Prerequisites: COMS W1007. Corequisites: COMS W3203. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect: 3. 4 pts.
-
4.00 Credits
An honors introduction to 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 C/C++. Note: Due to significant overlap, students may receive credit for only one of the following four courses: COMS W3133, W3134, W3137, and W3139. Prerequisites: COMS W3157 Corequisites: COMS W3203. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Not offered in 2009-2010. Lect: 4. 4 pts.
-
3.00 Credits
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. Prerequisites: COMS W1007 or COMS W1009 Lab Required. General Education Requirement: Quantitative and Deductive Reasoning (QUA). Lect:4. 4 pts.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|