Tuesday, Thursday
9:05 (ILR 315)
11:15 (Call Aud)

CS 1110: Introduction to Computing Using Python

Fall 2018

Instructor: Walker White

451 Gates Hall


Information about alternative courses

Latest Announcements

You must register your iClicker

Visit http://atcsupport.cit.cornell.edu/pollsrvc to register your iClicker, once you have it.
read more

You must purchase an iClicker

We require an actual iClicker for this course (the phone apps are not supported). You will need it in class starting Tuesday, August 28.
read more

The textbook is optional and online

There is no official textbook for the class, but there is a free PDF that you can use as a reference.
read more

Course Description

CS 1110: Introduction to Computing using Python            Fall, spring, summer. 4 credits.
Assumes basic high school mathematics (no calculus) but no programming experience.

Programming and problem solving using Python. Emphasizes principles of software development, style, and testing. Topics include procedures and functions, iteration, recursion, arrays and vectors, strings, an operational model of procedure and function calls, algorithms, exceptions, object-oriented programming, and GUIs (graphical user interfaces). Weekly labs provide guided practice on the computer, with staff present to help. Assignments use graphics and GUIs to help develop fluency and understanding.

Forbidden Overlap: Due to a partial overlap in content, students will receive 6 credits instead of 8 if they take CS 1110 and one of the following: CS 1112, CS 1114, CS 1115, BEE 1510.

Expected Outcomes

  1. Be fluent in the use of procedural statements — assignments, conditional statements, loops, method calls — and arrays. Be able to design, code, and test small Python programs that meet requirements expressed in English. This includes a basic understanding of top-down design.
  2. Understand the concepts of object-oriented programming as used in Python: classes, subclasses, properties, inheritance, and overriding.
  3. Have knowledge of basic searching and sorting algorithms. Have knowledge of the basics of vector computation.

For more information on the course, see the syllabet.


The times for all prelims and the final are given here. Please notify us as soon as possible if you have any conflicts.

Course Material Authors: D. Gries, L. Lee, S. Marschner, & W. White (over the years)