Tuesdays and Thursdays, 10:10AM - 11:00AM, Olin Hall 155
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Welcome
to the CS 211 (Fall 2001)
Course description,
from the Cornell Catalogue
Prerequisite: COM S 100 or an equivalent course in Java or C++. Intermediate programming in a high-level language and introduction to computer science. Topics include program structure and organization, modules (classes), program development, proofs of program correctness, recursion, data structures and types (lists, stacks, queues, trees), object-oriented and functional programming, analysis of algorithms, and an introduction to elementary graph theory and graph algorithms. Java is the principal programming language. Knowledge of classes and objects is assumed. Instructor
TAs
Consultants
Java Bootcamp
Olin 255, 7PM (in the evening): Tuesday, 4 September, Thursday, 6 September, and Tuesday 11 September. The bootcamp will introduce you to the basics of object-oriented programming in Java, and CS211 will have one or two review lectures as well. If you got less than B+ in a previous programming course, you may want to take the 1-credit course CS202 instead of CS211. If you are not sure of what to do, sit in on both CS202 and CS211 and make your decision in a week or two. But don't fall behind! Also, talk to Gries Programming environment
Required and optional texts
An optional text is by Gries and Gries, "ProgramLive", Wiley & Sons, 2001. This semester, it is used in CS202, a 1-credit course on Java for those who know another language (usually C++). It contains over 250 recorded lectures with synched animation for a first programming course, with the addition of some other material, like recursion. The lectures makes it easier to learn some material than with a mere book. CS211 versus CS212
CS212 is a 1-credit project course. It meets the whole semester. Those enrolled will work on a single project, given in four segments, in temas of two. The project is extremely interesting this semester. You will write a program that has some of the functionality of mapblast or mapquest. Type in two addresses, and the shortest path between them is drawn on the screen. The project involves looking at real data and working with the format in which it is stored, implementing GUIs, drawing a map on the screen (really, a graph), finding shortest paths in a graph, and more. Tests
The final is period 16, 9:30AM, 20 December. Generally, Gries makes the final optional; he will give you a grade at the end of the semester. You can accept it or take the final to try to improve it. Taking the final may lower as well as raise your grade, and it lowering your grade by taking the final has been known to happen in the past. Recitations
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||