Course Information

Section 1: MWF 10:30–11:20, Science Center 256
Professor: Sara Mathieson
Office: Science Center 260
Office hours: Friday 3-5pm
Piazza: CS21 Q&A forum

Links to all sections:

• Sara Mathieson (MWF 10:30–11:20)
• Jeff Knerr (MWF 11:30–12:20)
• Rich Wicentowski (TR 9:55–11:10)

Welcome to CS21. This course will introduce fundamental ideas in computer science while also teaching you how to write computer programs. We will study algorithms for solving problems and implement solutions in the Python programming language. Python is an interpreted language that is known for its ease of use. We also introduce object-oriented programming and data structures. A deeper coverage of these topics will be presented in CS 35.

This course is appropriate for all students who want to learn how to write computer programs and think like computer scientists. It is the usual first course for computer science majors and minors. Students with advanced placement credit or extensive programming experience should place out of this course and instead begin with CS31 or CS35.

Textbook:

We will primarily be using the online book How to think like a computer scientist: Learning with Python by Elkner, Downey and Meyers.

See the Schedule for each week's reading assignment.

Here are a few other useful online resources:

• Basic Unix Commands
• atom basics
• Python Tutor
• The Python tutorial
• Python documentation (Note: we are using v3.5)

Goals for the course:

By the end of the course, we hope that you will have developed the following skills:

• Given a program, be able to simulate on paper how a computer would execute the program, and show the results that would be produced.
• Given a problem, be able to design a clear, concise, and correct pseudocode algorithm to solve it.
• Given a pseudocode algorithm, be able to successfully implement it in Python.
• Be able to use top-down design to sub-divide a large problem into reasonably-sized modular sub-problems.
• Given several algorithms for solving the same problem, be able to analyze which algorithm would be more efficient in terms of running time.
• Develop debugging and unit testing skills. Consistently use these skills while implementing programs.

Schedule

Here is the tentative schedule; it may change as we go...

WEEK	DAY	ANNOUNCEMENTS	TOPIC & READING	LABS
1	Sep 04		Introduction to Python and Unix python, unix, atom editor data types variables, assignment calling built-in functions print(), type(), int(), float(), str() user input: input() def main() writing and running a program Ch 1: The way of the program Ch 2: Variables, expressions and statements Ch 4, Sec 9: keyboard input Ch 4, Sec 10: type conversion	Mon: * Slides 1 * Handout 1 Wed: * Slides 2 * Transcript 2 Fri: * Slides 3 * welcome.py * graduate.py Lab 0: unix, editing
	Sep 06
	Sep 08
2	Sep 11		Writing simple programs for loops, sequences, range() accumulator pattern indexing, len() print() from math import * Ch 2: Variables, expressions and statements Ch 2: lists, looping, range() Ch 7: Strings (sections 1-4, 6, 13 only) Ch 9: Lists (sections 1-3, 5, 6, 8)	Mon: * Slides 4 * right_triangle.py * pretty_print.py * Transcript 4 Wed: * Slides 5 * miles_loop.py * Transcript 5 Fri: * Slides 6 * even_loop.py * len_loop.py * sum_loop.py Lab 1: first programs
	Sep 13
	Sep 15	Drop/add ends
3	Sep 18		Conditionals boolean type comparison operators (<, >, ==, !=, etc) logical operators (and, or, not) mod operator if/elif/else nesting the in operator string comparisons, ASCII strings and lists: mutable vs immutable string formatting Ch 4: Conditionals (skip sections 8,11) Ch 7: Strings (in operator) Ch 7: Strings (str formatting)	Mon: * Slides 7 * stretch.py * random_avg.py * conditionals1.py * Transcript 7 Wed: * Slides 8 * movie.py * telephone.py Fri: * Slides 9 * Transcript 9 Lab 2: numbers and strings
	Sep 20	Quiz study guide
	Sep 22	Quiz 1
4	Sep 25		First functions, while loops writing simple functions arguments, parameters while loops random numbers Ch 3: Functions (just 3.1 - 3.3) Ch 5: Fruitful functions (just 5.1, 5.2) Ch 6: Iteration	Mon: * Slides 10 * pretty_function.py * factorial.py Wed: * Slides 11 * mystery_errros.py * min_max_range.py Fri: * Slides 12 * while_random.py * guess_number.py Lab 3: if/else
	Sep 27
	Sep 29
5	Oct 02		Graphics, Using Objects intro to objects intro to graphics RGB colors object.method() more practice with functions mouse and keyboard input animation Notes on the Zelle graphics library Zelle's Chapter 5: Objects and graphics Zelle Graphics Module	Mon: * Slides 13 * circles.py * Transcript 13 Wed: * Slides 14 * box.py * Transcript 14 Fri: * Slides 15 * snow_start.py Lab 4: while loops/functions
	Oct 04	Q2 study guide
	Oct 06	Quiz 2
6	Oct 09		Fruitful Functions more practice with functions incremental development boolean functions stack diagrams passing lists to functions exceptions (try/except) Ch 3: Functions Ch 5: Fruitful functions Stack diagrams handout A Better/Longer Stack Diagram Example Another Stack Diagram Example Ch 11, Sec 7: exceptions Ch 8: Graphics Case Study	Mon: * Slides 16 * build_list.py * Transcript 16 Wed: * Slides 17 * shuffle_list.py Fri: * Slides 18 * Handout 2 * max_circle.py Lab 5: graphics
	Oct 11
	Oct 13
	Oct 16	Fall Break
	Oct 18
	Oct 20
7	Oct 23		File IO, Top-Down Design reading/writing files top-down design function stubs list-of-lists string and list methods, string slicing? Ch 10, Sec 8: Text Files Intro and CompSci sections from Wikipedia TDD Ch 10, Sec 6: str, list methods	Mon: * Slides 19 * Handout 3 * colleges_file.py * cs21_students.py Wed: * Slides 20 * Handout 4 * word_guessTDD.py * Transcript 20 Fri: * Slides 21 * try_except.py * write_ninjas.py Lab 6: more functions
	Oct 25
	Oct 27
8	Oct 30		More TDD reading/writing files top-down design function stubs list-of-lists string and list methods Ch 10, Sec 8: Text Files Intro and CompSci sections from Wikipedia TDD Ch 10, Sec 6: str, list methods	Mon: * Slides 22 * tictactoe_TDD.py Wed: * Slides 23 * ttt_functions.py * 9letter_words.py Fri: * Slides 24 Lab 7: 3square
	Nov 01	Q3 study guide
	Nov 03	Quiz 3
9	Nov 06		Searching linear search analysis of algorithms binary search Binary Search (skip the recursive version) Ben's musicAlgo videos	Mon: * Slides 25 * linear_search.py Wed: * Slides 26 * Handout 5 * binary_search.py Fri: * Slides 27 * searches.py * dictionary_tests.py Lab 7: 3square
	Nov 08
	Nov 10	CR/NC/W Deadline
10	Nov 13		Sorting selection sort analysis of algorithms insertion and bubble sort idea of merge sort, recursion Ben's musicAlgo selection sort video interactivepython selection sort interactivepython bubble sort	Mon: * Slides 28 * Handout 6 Wed: * Slides 29 * pseudocode.py * sorts.py Fri: * Slides 30 * sort_runtime.py Lab 8: DH/searching
	Nov 15	Q4 study guide
	Nov 17	Quiz 4
11	Nov 20		Classes and Objects creating our own objects instance variables self, __init__, __str__ methods getters/setters class writer vs class user interface/information hiding Ch 13: Classes and objects Ch 14: Classes and functions Ch 15: Classes and methods	Mon: * Slides 31 * pie.py * student.py * Transcript 31 Wed: * Slides 32 * die.py * random_gene.py * Transcript 32 Lab 9: DH/sorting
	Nov 22
	Nov 24	Thanksgiving
12	Nov 27		Classes and Objects more examples of classes Ch 13: Classes and objects Ch 14: Classes and functions Ch 15: Classes and methods	Mon: * Slides 33 * random_gene.py * screen_saver.py * Transcript 33 Wed: * Slides 34 * screen_saver.py * baseball.py Fri: * Slides 35 Lab 10: classes
	Nov 29	Q5 study guide
	Dec 01	Quiz 5
13	Dec 04		Recursion recursive call base case leap of faith... graphics examples back to merge sort Ch 11: Recursion (Skip tuples) Recursion (from Wikipedia) PYTHON TUTOR	Mon: * Slides 36 * factorial.py Wed: * Slides 37 * fibonacci.py * circles.py Fri: * Slides 38 * fractal_tree.py Lab 11: recursion practice
	Dec 06
	Dec 08
14	Dec 11	final exam study guide	Wrap up	Mon: * Slides 39
	Dec 15	Final Exam: Fri, Dec 15, 7-10pm, Sci Cen 101

Grading Policies

Grades will be weighted as follows:

35%	Lab assignments
30%	Quizzes
30%	Final Exam
5%	Class Participation

Exam and Quizzes

Quizzes will be given at the beginning of class on the days posted on the Schedule. Please look over these dates carefully and contact the professor in advance if you cannot be in class for a quiz.

If you are not present on the day of a quiz, and do not let me know ahead of time that you are missing class, you will receive a zero for that quiz.

There will be one final exam for the semester. Details and dates will be released during the semester. Please read the section on accommodations if you are in need of extra time. You must inform me of accommodations or conflicts at least 2 weeks in advance of the exam.

Lab Policy

This course features weekly lab assignments which are the largest component of your course grade. Lab attendance is required by all students, unless you have already completed and submitted the lab assignment for the week. You must attend the lab session for which you are enrolled:

Weekly Lab Sessions
CS21 A 1:05—2:35pm Tuesdays	Mathieson	Science Center 240
CS21 B 2:45—4:15pm Tuesdays	Mauskop	Science Center 240
CS21 C 1:15—2:45pm Wednesdays	Mathieson	Science Center 240
CS21 D 3:00—4:30pm Wednesdays	Wicentowski	Science Center 240

Lab assignments will typically be assigned in class at the beginning of the week and will be due before midnight on Saturdays. You are strongly encouraged to start early and to attend the study sessions for extra practice.

You will submit you assignments electronically using the handin21 program. You may submit your assignment multiple times, and a history of previous submission will be saved. You are encouraged to submit your work regularly.

Late Policy:

Late assignments are not accepted and will receive zero credit (see exceptions below). Even if you do not fully complete an assignment, you should submit what you have done to receive partial credit.

The CS labs are open 24 hours a day, 7 days a week for you to use for CS21 lab assignments.

If you feel that you need an extension on an assignment or that you are unable to attend class for two or more meetings due to a medical condition (e.g., extended illness, concussion, hospitalization) or other emergency, you must contact the dean's office and your instructors. Faculty will coordinate with the deans to determine and provide the appropriate accommodations. Note that for illnesses, the College's medical excuse policy, states that you must be seen and diagnosed by the Worth Health Center if you would like them to contact your class dean with corroborating medical information.

Academic Integrity

Academic honesty is required in all your work. Under no circumstances may you hand in work done with (or by) someone else under your own name. Your code should never be shared with anyone; you may not examine or use code belonging to someone else, nor may you let anyone else look at or make a copy of your code. This includes, but is not limited to, obtaining solutions from students who previously took the course or code that can be found online. You may not share solutions after the due date of the assignment.

Discussing ideas and approaches to problems with others on a general level is fine (in fact, we encourage you to discuss general strategies with each other), but you should never read anyone else's code or let anyone else read your code. All code you submit must be your own with the following permissible exceptions: code distributed in class, and code found in the course text book. In these cases, you should always include detailed comments that indicates on which parts of the assignment you received help, and what your sources were.

Failure to abide by these rules constitutes academic dishonesty and will lead to a hearing of the College Judiciary Committee. According to the Faculty Handbook: "Because plagiarism is considered to be so serious a transgression, it is the opinion of the faculty that for the first offense, failure in the course and, as appropriate, suspension for a semester or deprivation of the degree in that year is suitable; for a second offense, the penalty should normally be expulsion." Be aware that we will be routinely running plagiarism detection software on the lab solutions of students from all sections of CS21.

Please contact me if you have any questions about what is permissible in this course.

Student Support

Lauri Courtenay is the CS Department's Academic Support Coordinator. She will be working closely with our student mentors, also known as Ninjas, to help you learn how to program and think like a computer scientist. The CS21 Ninjas will assist me in class and run evening study sessions in the birds' nest (Sci 256). The CS21 Ninjas (student mentors) are: Rye Buckley, Theint Kyaw, Misha Khan, Rachel Diamond, Clarissa Phillips, Anya Chaudhri, Michelle Ma, Christina Holmgren, Tristan Cates, Pravadh Singh, Alexa (Scout) Clark, Brent Jacobs

Study Sessions

You are invited -- and encouraged -- to participate in Ninja evening study sessions to prepare for quizzes, to discuss programming concepts, and to get friendly assistance in working on lab assignments. Our CS mentoring team is dedicated to helping students, who have no prior knowledge of computer science, learn to program in Python while keeping their senses of humor intact. As an added bonus, free snacks will be provided at the sessions. The sessions are held:

Weekly Evening Ninja Sessions
Tuesdays	7—9pm	Sci Center 256
Wednesdays	7—10pm	Sci Center 256
Fridays	7—9pm	Sci Center 256

Accessing the CS labs after hours

You can use your ID to gain access to the computer labs at nights and on the weekends. Just wave your ID over the microprox reader next to the lab doors. When the green light goes on, just push the door to get in (the door knob will not turn). If the green light doesn't go on, then we need to enter your microprox number into the system. Email local-staff@cs.swarthmore.edu (or see Bridget) if you have problems with this. If the building is locked, you can use your ID to enter the door between Martin and Cornell library. For this class, your ID will give you access to the labs in rooms 238, 240, and 256 and Clothier 16.

Academic Accommodations

If you believe that you need accommodations for a disability, please contact the Office of Student Disability Services (Parrish 113W) or email studentdisabilityservices at swarthmore.edu to arrange an appointment to discuss your needs. As appropriate, the Office will issue students with documented disabilities a formal Accommodations Letter. Since accommodations require early planning and are not retroactive, please contact the Office as soon as possible. For details about the accommodations process, visit the Student Disability Service website.

To receive an accommodation for a course activity, you must have an Accommodation Authorization letter from the Office of Student Disability Services and you need to meet with me to work out the details of your accommodation at least one week prior to the activity.

You are also welcome to contact me privately to discuss your academic needs. However, all disability-related accommodations must be arranged through the Office of Student Disability Services.

How to Succeed in CS 21

• Attend class.
  The primary introduction to course material is through class lecture. Additionally, we often do lab exercises during class. This is an important part of the learning process, as these exercises give you immediate experience with the material we are covering.
• Read the material before you come to class.
  Don't worry about total comprehension, but at least get a feel for what we will be covering that week. If you have some understanding of the material coming into class, it will be easier for you to ask questions during class, rather than later when help may not be available.
• Ask questions if you don't understand.
  This means both during class and while doing lab assignments. This class continually builds on previous material, so if you don't understand something one week, it will continue to be a problem the next week, and the week after that, and so on. If you need help, ask your classmates (make sure you have read the "Academic Integrity" section below first), attend study sessions, come talk with me during my office hours, or email me your question.
• Start the lab assignments early.
  I realize this one is not always easy to do, but if you can get in the habit of doing this, you will be much better off. If you get stuck early (i.e., not two hours before it is due), there will be time to look for help. In addition, if you start early enough, you can take a break, go do something else, and come back later. I find I always have at least a few new ideas when I come back to a problem after a break. If you wait until the last minute, you can't do this.
• Practice, practice, practice.
  The only effective way to learn the material and pass the quizzes and exams is to consistently do the labs. Finish all of the assigned programs (and do some extras, for fun!). Even if you don't get them done on time, they will still help you learn the material.
• Seek help early and often.
  Because course material builds on previous material, it is essential to your success in this class that you keep up with the course material. If you are having difficulty with a programming assignment, if you didn't follow something covered in lecture, if you feel you need some extra help understanding or practicing some of the course material, or if you just want to discuss something from a lecture, an assignment, or the text, please come to my office hours.
• Attend CS21 Labs and Study Sessions.
  Lab attendance is required. The student Ninjas hold evening study sessions each week. You are encouraged to participate in these sessions. The Ninjas will help you prepare for quizzes, will provide additional instruction in programming concepts, and will provide friendly assistance on your lab assignments.

Programming Style

Programming is not a dry mechanical process, but a form of art. Well written code has an aesthetic appeal while poor form can make other programmers and instructors cringe. Programming assignments will be graded based on style and correctness. Good programming practices usually include many of the following principles:

• A comment at the top of the program that includes
  • Program authors
  • Date or Dates
  • A brief description of what the program does
• Concise comments that summarize major sections of your code
• Meaningful variable and function names
• Function comments that include:
  1. description of what function does
  2. description of input value(s) (parameter values)
  3. description of return value
• Well organized code
• White space or comments to improve legibility
• Avoidance of large blocks of copy-pasted code

Also, look over the Python Code Style Guide for more details and some examples of good code style.

Piazza

This semester we’ll be using Piazza, an online Q&A forum for class discussion, help with labs, clarifications, and announcements that pertain to all sections of cs21. You should have received an email invitation to join CS21 on Piazza. If you didn't, please let us know.

Piazza is meant for questions outside of regular meeting times such as office hours, ninja sessions, class, and lab. Please do not hesitate to ask and answer questions on Piazza, but keep in mind the following guidelines:

1. Piazza should be used for ALL content and logistics questions outside of class, lab, office hours, and ninja sessions. Please do not email instructors or ninjas with your code or questions about the assignments.
2. If there is a personal issue that relates only to you, please email your instructor.
3. We encourage non-anonymous posts, but you may post anonymously (to your classmates, not the instructors).
4. Do NOT post long blocks of code on Piazza - if you can distill the problem to 1-2 lines of code and an error message, that’s fine, but try to avoid giving out key components of your work.
5. By the same token, when answering a question, try to give some guiding help but do not post code fixes or explicit solutions to the problem.
6. Posting on Piazza counts toward your participation grade, both asking and answering!

Useful Links

Links that are related to the course may be posted here. If you have suggestions for links, let me know.

pythonchallenge
Algorithms to Live By...
How To Think Like a Computer Scientist: Python for Software Design
Python Tutor
Python style guide From Prof. Tia Newhall
Using Unix
Basic Unix Commands
Graphics reference
Dive Into Python
(A Semi-Official) Python FAQ Zone
NodeBox
Python Documentation (Note: we are using v3.5)
Atom
Remote access with atom
Vi Quick Reference
emacs beginner's guide

Last updated: Friday, December 08, 2017 at 03:27:08 PM