Computer Science 1300/5001
There are four different types of assignments for this course.
Reading Assignments are administered and scored on Perusall.com. Scores will be either 0,1,2,3 where we consider a score of 2 to be 100% credit (and 3 to be extra credit).
Homework Assignments are typically pen-and-paper problems for reinforcement, and due at the beginning of particular classes. They will be graded out of 20 points.
Quizzes are given at the end of hands-on class days. They will be graded out of 20 points.
Programming Assignments are larger programming projects that are to be completed outside of class and submitted electronically. They will be graded out of 40 points. General information about preparing and submitting the assignments can be found below.
Please make sure you understand the policy towards Academic Integrity.
We will not accept late reading assignments, homework assignments, or quizzes. Late programming assignments will be accepted, but with penalty in accordance with our Late Policy.
Solutions for past assignments are posted below, when appropriate, and are password protected to keep them from being collected by a search engine. The username is slu and the password is the school mascot (singular form, and in all lowercase letters).
|Chapter 01||Python Expressions||8:00am Wednesday 29 August 2018||individual|
|Chapter 02||Python Scripts||8:00am Friday 31 August 2018||individual|
|Chapter 03||Batteries Included||8:00am Wednesday 5 September 2018||individual|
|Chapter 04||Introduction to cs1graphics||8:00am Friday 7 September 2018||individual|
|Chapter 05||Advanced cs1graphics||8:00am Tuesday 11 September 2018||individual|
|Chapter 06||Python's list class||8:00am Friday 14 September 2018||individual|
|Revised Chapter 06||Strings, tuples, lists||8:00am Monday 17 September 2018||individual|
|Chapter 07||For loops||8:00am Wednesday 19 September 2018||individual|
|Chapter 08||Conditionals||8:00am Tuesday 25 September 2018||individual|
|Chapter 09||Python Syntactic Shorthands||8:00am Monday 1 October 2018||individual|
|Chapter 10||While Loops||8:00am Wednesday 3 October 2018||individual|
|Chapter 11||User-defined Functions||8:00am Monday 8 October 2018||individual|
|Chapter 12||Case Study: Catenary Curve||8:00am Wednesday 10 October 2018||individual|
|Chapter 13||Error Checking and Exceptions||8:00am Monday 15 October 2018||individual|
|Chapter 14||Input, Ouput, and Files||8:00am Wednesday 17 October 2018||individual|
|Chapter 16||User-defined Classes||8:00am Monday 29 October 2018||individual|
|Chapter 17||More User-defined Classes||8:00am Tuesday 30 October 2018||individual|
|Chapter 20.1||Inheritance (DeluxeTV)||8:00am Wednesday 7 November 2018||individual|
|Chapter 20.2, 20.3||Inheritance (SortedSet)||8:00am Friday 9 November 2018||individual|
|Chapter 20.4-20.6||Inheritance (cs1graphics)||8:00am Monday 12 November 2018||individual|
|Chapter 21.1, 21.2||
Deeper understanding of objects
Objects that reference other objects
|8:00am Tuesday 13 November 2018||individual|
Objects in the context of a function
|8:00am Friday 16 November 2018||individual|
|Chapter 22||Sets||8:00am Tuesday 20 November 2018||individual|
|Chapter 24||Namespaces||8:00am Wednesday 28 November 2018||individual|
|Chapter 26.1||Structural Recursion; Bullseye||8:00am Friday 30 November 2018||individual|
|Chapter 26.2||Structural Recursion; OurList||8:00am Tuesday 4 December 2018||individual|
|Chapter 27||Functional Recursion||8:00am Wednesday 5 December 2018||individual|
|hw01||Python Expressions||10:00am, Wednesday, 29 August 2018||individual||soln|
|hw02||Python Scripts||10:00am, Tuesday, 4 September 2018||individual||soln|
|hw03||cs1graphics warmup||10:00am, Monday 10 September 2018||individual||soln|
|hw04||Advanced cs1graphics||10:00am, Wednesday 12 September 2018||individual||soln|
|hw05||Strings and Lists||10:00am, Tuesday 18 September 2018||individual||soln|
|hw06||For Loops||10:00am, Friday 21 September 2018||individual||soln|
|hw07||For Loops and Graphics||10:00am, Monday 24 September 2018||individual||soln|
|hw08||Conditionals||10:00am, Wednesday 26 September 2018||individual||soln|
|hw09||List Comprehension||10:00am, Tuesday 2 October 2018||individual||soln|
|hw10||While Loops||10:00am, Friday 5 October 2018||individual||soln|
|hw11||User-defined Functions||10:00am, Tuesday 9 October 2018||individual||soln|
|hw12||Error-checking and Exceptions||10:00am, Tuesday 16 October 2018||individual||soln|
|hw13||Input, Output and Files||10:00am, Friday 19 October 2018||individual||soln|
|hw14||Class Definitions||10:00am, Wednesday 31 October 2018||individual||soln|
|hw15||Deeper Understanding of Objects||10:00am, Wednesday 14 November 2018||individual||soln|
|hw16||Dictionaries||10:00am, Tuesday, 27 November 2018||individual||soln|
|hw17||Recursion||10:00am, Friday, 7 December 2018||individual||soln|
|quiz01||Python Expressions||10:50am Wednesday 29 August 2018||pairs||soln|
|quiz02||Python Scripts||10:50am Tuesday 4 September 2018||pairs||soln|
|quiz03||Intro to Graphics||10:50am Monday 10 September 2018||pairs||soln|
|quiz04||Advanced Graphics||10:50am Wednesday 12 September 2018||pairs||soln|
|quiz05||Strings and Lists||10:50am Tuesday 18 September 2018||pairs||soln|
|quiz06||For Loops||10:50am Friday 21 September 2018||pairs||soln|
|quiz07||Nested For Loops||10:50am Monday 24 September 2018||pairs||soln|
|quiz08||Conditionals||10:50am Wednesday 26 September 2018||pairs||soln|
|quiz09||List Comprehension||10:50am Tuesday 2 October 2018||pairs||soln|
|quiz10||While Loops||10:50am Friday 5 October 2018||pairs||soln|
|quiz11||User-defined Functions||10:50am Tuesday 9 October 2018||pairs||soln|
|quiz12||Challenge Problem: contest problem||10:50am Friday 12 October 2018||pairs||soln|
|quiz13||Exceptions||10:50am Tuesday 16 October 2018||pairs||soln|
|quiz14||Challenge Problem: I/O and files||10:50am Friday 19 October 2018||pairs||soln|
|quiz15||Challenge Problem: ChargeCard class||10:50am Wednesday 31 October 2018||pairs||soln|
|quiz16||Challenge Problem: Deeper Understanding||10:50am Wednesday 14 November 2018||pairs||soln|
|quiz17||Challenge Problem: Copying Objects||10:50am Monday 19 November 2018||pairs||soln|
|quiz18||Dictionaries||10:50am Tuesday 27 November 2018||pairs||soln|
|quiz19||Range Searching||10:50am Friday 7 December 2018||pairs|
|prog01||Artist||11:59pm, Monday, 17 September 2018||individual|
|prog02||DNA Reversal||11:59pm, Monday, 24 September 2018||pair|
|prog03||Backgammon||11:59pm, Monday, 8 October 2018||pair|
|prog04||Programming Contest||11:59pm, Monday, 15 October 2018||individual|
|prog05||Interest Calculator||11:59pm, Monday, 29 October 2018||pair|
|prog06||Ball||11:59pm, Friday, 9 November 2018||individual|
|prog07||LanguageHelper||11:59pm, Friday, 16 November 2018||pair|
|prog08||Animal||11:59pm, Monday, 26 November 2018||individual|
|prog09||Shakespearl||11:59pm, Monday, 3 December 2018||pair|
|prog10||Disk Usage||11:59pm, Monday, 10 December 2018||individual|
For each assignment, you must submit all source code files that you have created or modified. For some assignments, we may provided you with a number of files containing source code or data that need not be modified. There is no need to resubmit such files.
You are required to submit a text file, ideally titled readme.txt, with every program you submit. Please do not submit any formatted files such as those produced by Microsoft Word or other word processors. It will be read at the time your program is graded, so it allows you to give helpful information.
The content of the file must include:
An estimate of the amount of time spent on the assignment.
A clear citation of any help you received on this program from other (approved!) sources, as detailed in the policy on Academic Integrity.
An overview of your program and any interesting design decisions that you made. Please include any other discussion that you feel will be helpful when grading your assignment. For example, if there are known bugs, briefly discuss them in this file.
Some of our program assignments explicitly require the inclusion of additional, specific information in this file. Please read the individual program assignments carefully.