CSC 221: Introduction to Programming
Fall 2013



Section B
11:00 - 12:15 TuTh
204 Hitchcock
Dr. David Reed
203D Hitchcock      x2583
DaveReed@creighton.edu
Section 1
2:00 - 3:15 TuTh
204 Hitchcock


Free Online Texts:

Scratch for Budding Computer Scientists, David J. Malan.
Learning with Python: Interactive Edition 2.0, Brad Miller and David Ranum (based on material by Jeffrey Elkner, Allen B. Downey, and Chris Meyers).


Course Description

This course provides an introduction to problem solving and programming using the Python scripting language. The process of programming is much more than just writing code. It involves analyzing the problem at hand, designing a solution, implementing and testing that solution, and critiquing results. The python language is designed to naturally introduce fundamental concepts of programming and make it possible to being solving nontrivial problems quickly. Special emphasis will be placed on developing applications for storing and manipulating multimedia elements, such as images, sounds, and video.

The specific goals of this course are:

This course is intended as a first programming course, so no prior experience with computers is assumed. The problem-solving and programming techniques introduced in this course are further expanded in the follow-up course, CSC 222: Object-Oriented Programming.


Required Work

Learning to program requires a consistent time commitment, as each new concept and programming technique builds on those that came before. To encourage students to keep up with the course content and to provide immediate feedback, each class period will begin with a "random" quiz. A quiz will be handed out to highlight important concepts, but only administered with a 50% likelihood. To allow for unavoidable absences, the two lowest quiz grades will be dropped.

To demonstrate problem solving and programming skills, students will complete 6-8 programs throughout the semester. Each assignment will involve the design and implementation of a Python program, and may also include a written component in which the behavior of the program is analyzed. Late assignments will be accepted up to 7 days after their due date, with a 25% penalty. Beyond 7 days, late submissions will not be accepted. In addition, there will be two 75-minute tests and a cumulative 100-minute final exam.

daily quizzes/exercises 10 %
6-8 programming assignments 40 %
two 75-minute tests 30 %
100-minute final exam 20 %

The final grade for the course will be based on the above weightings. At the minimum, traditional grading cutoffs for the final average will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and Assignments will not be rescheduled except in extreme circumstances.

It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.


Policy on Collaboration

Creighton's policy on cheating and plagiarism is spelled out in the Student Handbook, with college procedures available online. Unless the assignment explicitly states otherwise, homework assignments are to be completed by each student independently, with no discussion about program design or assistance in debugging from other students. Violations of the collaboration policy will be dealt with severely, with possible outcomes including failure in the course.


Daily Schedule (check regularly for updates)

Date Topic Readings Assignments
Aug 22
Course overview. (ppt/pdf)    
27
29
Programming in Scratch: (ppt/pdf)
     motion, control, sensing,
reference
tutorial
HW1: due 9/10
 
Sep 3
5
     costumes, variables, interaction.
Computing history & background. (ppt/pdf)
 
intro
 
 
10
12
Python statements & data: (ppt/pdf)
    variables, assignments, input, loops.
data
turtle
 
HW2: due 9/23
17
19
Functions & modules: (ppt/pdf)
    import, def, parameters, return.
modules
functions
 
HW3: due 10/1
24
26
Control statements: (ppt/pdf)
    conditionals, counters & sums,
selection
iteration
 
 
Oct 1
3
    simulations, review.
TEST 1

 
 
8
10
test review
Text processing: (ppt/pdf)
strings  
HW4: due 10/28
15
17
NO CLASS -- FALL BREAK
22
24
    objects, string functions & methods,
    input/output files, file dialogs.
files  
 
29
31
Lists: (ppt/pdf)
    list access, methods, list iteration,
lists HW5: due 11/9
 
Nov 5
7
    strings to lists, string methods.
Big Data: (ppt/pdf)
 
 
 
12
14
    sick day - NO CLASS
    comprehensions, data access, review.
 
 
HW6: due 11/25
 
19
21
TEST 2
OOP & multimedia: (ppt/pdf)
classes
 
 
HW7: due 12/6
26
28
    classes & objects, cards,
NO CLASS -- THANKSGIVING BREAK
fractions  
 
Dec 3
5
    image manipulation.
course overview
 
 
 
 
Dec 10
  SECTION B: FINAL EXAM     Tue, 1:00-2:40
Dec 13   SECTION 1: FINAL EXAM      Fri, 10:00-11:40

Access sample code from class



In the event of disruption of normal classroom activities due to a flu outbreak or other emergency, the format for this course may be modified to enable completion of the course. In that event, you will be provided an addendum to this syllabus that will supersede this version.