CS:1210 (22C:16) Computer Science I: Fundamentals
Lectures: 9:30-10:20 MWF Room W10 PBB (John Papajohn Business Building)
Sriram V. Pemmaraju
101G MLH, email@example.com, 319-353-2956
Office Hours: 1:30-2:30 M, 10:30-11:30 W, 1:00-2:00 Th (and by appointment)
Information about TAs,
Quizzes, Projects, and Exams,
There are 3 TAs assigned to this course. Their names, e-mail addresses, and associated discussion sections are given below.
Name e-mail address Discussion Sections
Jayant Parchure firstname.lastname@example.org A3 (11-11:50 116 MH), A5 (3:30-4:20, 248 JH)
Ruchika Salunke email@example.com A1 (8:30-9:20 221 MLH), A2 (9:30-10:20, 213 MLH)
Momina Tabish firstname.lastname@example.org A4 (12:30-1:20, 66 SH), A6 (5-5:50, 346 JH)
Office hours for the TAs are as follows. All office hours will be held in the computer lab
in 301 MLH.
Jayant Parchure TW 2-3:30
Ruchika Salunke W 5-6:30, F 9-9:30 and 2:30-3:30
Momina Tabish M 2-4; Th 8:30-9:30
- Homework 5 Solution.
- Pop Quiz 5.
- Project 2, Phase 2(a) Test file: anotherTestProject2Phase2a.py.
- Project 2, Phase 1(b) Solution: project2Phase1b.py.
- Project 2, Phase 1(a) Test Files: project2Phase1aTest.py,
- Project 2. Data file: ml-100k.zip. Phase 1 due on Wednesday 4/29 and Phase 2 due on Thursday 5/7.
- Exam 2 and Exam 2 Solution.
- Homework 5. Due via ICON at 4:59 pm on 4/17. Data file: babyNames.txt. Notes on running times and correctness of Problems (a) and (b). A test file for HW5(c): hw5cTest.py.
- Project 1 Phase 2 Solution. Feel free to use in your solution to Phase 3.
- KML tutorial from the developers at Google. Sample kml files:
- Quiz 5, Quiz 6,
Quiz 7, Quiz 8,
- Pop Quiz 4.
- Project 1, Phase 2 test file: Phase2Test.py.
- Project 1 Phase 1 Solution. Feel free to use in your solutions to Phases 2 and 3.
- Homework 4 Solution. This solution llustrates the power of binary Search. It runs in about 5 seconds compared to about 4 minutes for an almost identical solution that uses the Python-provided index function for searching.
- Project 1. Data file: miles.dat. Phase 1 test file: Phase1Test.py.
- Homework 4 Test Files.
- Homework 3 Solutions.
- Pop Quiz 3 (3/5).
- Homework 4. Due via ICON at 4:59 pm on 3/11.
- Practice Problem set 6
- Exam 1 and Exam 1 Solution.
- Homework 2 Solutions.
- Homework 3. Due via ICON at 4:59 pm on 2/27.
- Practice Problem Set 5.
- Quiz 1, Quiz 2,
Quiz 3, Quiz 4.
- Pop Quiz 2 (2/12).
- Exam 1: 6:30-8:30 pm, Fri Feb 20th, W10 PBB. More information on Exam 1.
- Homework 1 Solutions.
- Practice Problem Set 4. isPrime.py, numPrimes.py.
- Homework 2. Due via ICON at 4:59 pm on 2/13.
- Practice Problem Set 3.
- Pop Quiz 1 (1/30).
- Practice Problem Set 2.
- Homework 1. Due via ICON at 4:59 pm on 2/2. binaryToDecimal.py.
- Practice Problem Set 1. Solutions.
- 5/3 The final exam is on Friday, 5/15 12:30-2:30 in 100 PH (Philips Hall).
Here is more information about the final.
Spring 2013 Exam and
Solution to Spring 2013 Exam.
Spring 2012 Exam and
Solution to Spring 2012 Exam.
- 5/1 Pre-final tentative letter grades are here.
- 4/24 The final exam is on Friday, 5/15 12:30-2:30 in 100 PH (Philips Hall).
- 4/13 Homework 5 handout has been updated based on the discussion in the lecture today (4/13).
- 4/13 Exam 2 performance analyzed: Exam 2 Stats.
- 4/6 No discussion sections tomorrow (4/7).
- 3/25 Exam 2 is on Friday, April 3rd, 6:30 pm-8:30 pm in W10 PBB (our classroom). It is an open notes/book exam. Here is more information on the exam.
- 2/23 Register for and attend the UICC this weekend (Feb 27-28). Write one paragraph describing what your learned from any one of the talks. Turn this in after the lecture on Monday, March 2 for 10 points extra credit.
- 2/11 Exam 1 is on Friday, Feb 20th, 6:30 pm-8:30 pm in W10 PBB (our classroom). It is an open notes/book exam.
- 2/6 The 2015 University of Iowa Computing Conference
will take place on Feb 27th and Feb 28th. This is a fabulous opportunity to learn more about computing
as a science and as a profession. You should plan to register and attend and as incentive I'll arrange extra credit
for attendance. More details on that soon.
- 2/2 TA Jayant Parchure will not hold office hours on Tuesday, 2/3. His replacement office hours will be on Thursday, 2/5 from 3:30-5:00 in 101N.
- 1/21 Instructions on How to install Python and Wing on Windows computer and on How to install Python and Wing on Mac.
- 1/17 There will be no discussion section meetings on Tuesday, 1/20.
Week 15 (last week!): 5/4-5/8
Lecture Notes: • May 4
- Using a queue ("FIFO") data structure to obtain shortests paths
- List-based and dictionary-based implementations of the queue class
- The power of inheritance
- Exam review (on Friday, 5/8).
Readings: To be posted.
Practice Problems: None this week.
Week 14: 4/27-5/1
Lecture Notes: • April 29, May 1
- Finishing up exceptions and exception-handling.
- Introduction to object-oriented programming.
- Classes, objects, constructors, operator overloading.
- Example of the point class.
Readings: Chapter on Object-Oriented Program from Prof. Ted Herman's notes; read until and including Page 253.
Practice Problems: Practice Problem set 13. Solve these problems to practice material on object-oriented programming and prepare for the quiz on Tuesday, 5/5.
Week 13: 4/20-4/24
Lecture Notes: • April 20
• April 22
• April 24
- The quickSort algorithm.
- The partition algorithm.
- Why quickSort is efficient. Randomized quickSort.
- Exceptions and exception-handling.
Readings: None this week.
Practice Problems: Practice Problem set 12. Solve these problems to practice material on the partition and quickSort functions.
Week 12: 4/13-4/17
Lecture Notes: • April 15,
• April 17.
- Finishing up the word network example: traversing network.
- Recursion and recursive functions. Basic examples: factorial, Fibonacci numbers,
computing the power efficiently.
- The divide-and-conquer paradigm. Introduction to recursive sorting: quickSort.
Readings: To be posted.
Practice Problems: Practice Problem set 11. Solve these problems to practice material on network exploration and recursion
and to prepare for quiz on Tuesday, April 21st.
Week 11: 4/6-4/10
Lecture Notes: • April 6
• April 8
- Dictionaries in Python, dictionary operations.
- Examples showing off the efficiency of dictionaries for search
- Building a word network using dictionaries
- Finishing up the word network example: traversing network.
Readings: Read Chapter 11 on Dictionaries (Sections 11.1, 11.2, 11.3, and 11.4 only) from "Think Python: How to Think Like a Computer Scientist" by Allen B. Downey.
Data file: words.dat.
Practice Problems: Practice Problem set 10. Solve these problems to practice material on dictionaries and prepare for quiz on Tuesday, April 14th.
Week 10: 3/30-4/3
Lecture Notes: • March 30
• April 1
- Programming Problem: Building and traversing a word ladder
- Networks, nodes, edges, building a word network.
Readings: Nothing this week. Just exam preparation.
Code: wordNetwork1.py Data file: words.dat.
Practice Problems: For Exam 2 on Friday use Spring 2014 Exam 2 as practice. Also, Problems 3 and 4 from
Spring 2012 Exam 2
and Problems 2, 3, and 4 from
Spring 2013 Exam 2.
Week 9: 3/23-3/27
Lecture Notes: • March 23-25
• March 27
- List comprehensions.
- Programming Problem: Extracting principal characters in a novel.
Readings: Read Slice, Split, Join (Chapter 11 from Prof. Ted Herman's notes on CS1) and Python 3 tutorial Sections 5.1.3 and 5.1.4 on list comprehensions.
Code: characters.py and data file: illiad.txt.
Practice Problems: Practice Problem set 9. Solve these problems to practice material on list comprehensions and prepare for quiz on Tuesday, March 31st.
Week 8: 3/9-3/13
Lecture Notes: • March 9,
• March 11
• March 13
- Binary Search. Comparison with linear search.
- Generating lists. The range type. List slices.
- String operations.
Readings: Operations that modify lists in-place in Python 3 documentation; String methods in Python 3 documentation.
Practice Problems: Practice Problem set 8. Solve these problems to practice material on lists and strings and prepare for quiz on Tuesday, March 24th.
Week 7: 3/2-3/6
Lecture Notes: • March 4,
• March 6
- Lists as mutable objects
- List operations: append, extend, insert, remove,
sort, reverse, etc.
- Why are lists mutable? Implementation of lists via references.
- Sorting and searching: selection sort.
Readings: Read Section 5.1 (stop before Subsection 5.1.1) and Section 5.2 on list operations in this
Practice Problems: Practice Problem set 7. Solve these problems to practice material on lists and prepare for quiz on Tuesday, March 10th.
Week 6: 2/23-2/27
Lecture Notes: • Feb 23-25
- Introduction to sequence type: strings and lists
- Using the [ ] notation to access elements of strings and lists
- The in, "+", and "*" operators on lists and strings
- Reading from files
- Programming Problem 4: reading from a file, parsing lines of text, and counting distinct integers in file.
Readings: Extra reading on functions: Chapter 8 from Prof. Ted Herman's notes for CS1.
Code: fileInputExample.py, input.txt, parseFile.py, test.txt.
Practice Problems: Practice Problem set 6. Solve these problems to practice material on lists and prepare for quiz on Tuesday, March 3rd.
Week 5: 2/16-2/20
Lecture Notes: • Feb 16
• Feb 18
- Organizing functions within a program
- The "sticky note" model of variables in Python.
- Arguments and parameters and the "sticky note" model applied to
- Scope of variables, local and global variables, declaring variables global
- Keyword arguments, Keyword parameters
- Exam 1 review
Readings: To be posted.
Code: isPrime.py, numPrimes.py.
Practice Problems: Practice Problem set 5. Solve these problems to prepare for Exam 1 (Feb 20th) and Quiz 5 (Feb 24th).
Week 4: 2/9-2/14
Lecture Notes: • Feb 9 and 11
- Using randomness in program. The random module and some useful functions defined in this module.
- Programming Problem 3: Simulating a 1-dimensional random walk.
- Defining and calling functions in Python
- Solution to Programming Problem 3 involving several functions.
Readings: Sections 6.1, 6.2, 6.3, and 6.4 on functions from
Think Python: How to Think Like a Computer Scientist.
Practice Problems: Practice Problem Set 4. Solve to prepare for Quiz 4 on Tuesday, Feb 17th.
Week 3: 2/2-2/6
• Feb 2
• Feb 4
• Feb 6
- Programming Problem 2: Listing primes.
- More practice with control flow: while-loops, if- and if-else-statements,
and break statements.
- Modules in python; math module and some useful functions in this module, time module and
how to time python programs using functions in this module.
- Boolean variables and the boolean operators: and, or, and not.
- Understading and using nested loops
Readings: Read about if-statements and while-loops in Chapter 6,
Pages 24-27 from the book A byte of Python. Note: This book uses Python 2. What we call input in Python 3 is called
raw_input in Python 2.
Solve Practice Problem Set 3 to
prepare for Quiz 3 in discussion sections on Feb 10th.
Week 2: 1/26-1/30
• Jan 26
• Jan 28
• Jan 30
- Understanding the program that converts decimal integers to binary representation.
- A whirlwind tour of constants, variables, operators, expressions, data types,
built-in functions, input statements, output statements, and while-loops in Python
- Improving the intToBinary program.
Readings: Chapter 2 (Pages 11-18) from Think Python: How to Think Like a Computer Scientist.
This chapter discusses Python constants, variables, operators, expressions, statements, etc., and is a nice complement to
the material we will cover in class this week.
Code: • intToBinary1.py • intToBinary2.py • intToBinary3.py • intToBinary4.py
Solve Practice Problem Set 2 to
prepare for Quiz 2 in discussion sections on Feb 3rd.
Week 1: 1/20-1/23
Lecture Notes: • Jan 21 • Jan 23
- Welcome to Computer Science I: Fundamentals: why this is an exciting time to be a computer scientist.
- Programming Problem 1: converting nonnegative integers into equivalent binary representation.
- Designing an algorithm to solve this problem and using pseudocode to
describe this algorithm.
- Translating this algorithm into our first Python program.
Readings: Chapter 1 (Pages 1-8) from Think Python: How to Think Like a Computer Scientist.
This chapter introduces terminology that we will use throughout the course.
Code: • intToBinary1.py • intToBinary2.py • intToBinary3.py • intToBinary4.py • intToBinary5.py
Practice Problems: Solve Practice Problem Set 1 to get ready for next week's quiz (in the discussion sections on 1/27).
Miscellaneous: Here are instructions on How to install Python and Wing on Windows computer and on How to install Python and Wing on Mac.
- Python.org is the authoritative source
on all Python matters. You will find links to downloads and tutorials here.
- Previous offerings of the course:
- Free Online textbooks:
- Textbooks for purchase: (not required, but useful if you wish to own a book on Python)
- Miscellaneous stuff: