''Lecture:'' String [[StringFormatting | formatting]], Python [[lists]]\\

[[Lab:'' [[Lab5]]

''Lecture:'' String [[StringFormatting | formatting]], Python [[lists]]\\

!!Week 4:

''Lecture:'' Python [[lists]]\\

[[http://openbookproject.net/thinkcs/python/english2e/ch07.html | Chapter 7]] in the book.\\

''Lecture:'' More on while loops: [[inputValidation | input validation]]; iteration using [[forLoops | for loops]], [[tables]].\\

''Lecture:'' More on while loops: [[inputValidation | input validation]].\\

''Lab:'' [[Lab3]]

[[http://openbookproject.net/thinkcs/python/english2e/ch06.html#the-while-statement| Chapter 6]] in the book.\\

''Lab:'' [[Lab3]]

''Lecture:'' [[whileLoops | while loops]].\\

''Lecture:'' While Loops: [[whileLoops]].\\

''Reading:'' [[http://openbookproject.net/thinkcs/python/english2e/ch04.html | Chapter 4]] in the book.\\

''Lecture:'' More conditionals: [[SortNames | sort names]], [[letterGrade |letter grade calculator]], [[letterGrade2 | a better version]] of letter grade.

''Lecture:'' Functions: [[LocalVariables]]; [[BooleanVariables | Boolean expressions and the if statement]].\\

''Lecture:'' Functions: [[LocalVariables]]; [[BooleanExpressions | Boolean expressions and the if statement]].\\

''Lecture:'' Python [[expressions]] using expressions: [[celsius2fahrenheit | celsius to fahrenheit conversion]]; introduction to functions [ [[Path:../../pdfs/02_functions.pdf | slides]] ] some code: [[draw_rectangle]], [[celsius2fahrenheit with functions | c2f conversion with functions]], [[functions | using functions]].

''Reading:'' [[http://openbookproject.net/thinkcs/python/english2e/ch02.html | Chapter 2]] in the book.\\

''Lecture:'' Python [[types]], [[variables]]\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch02.html | 2]].\\

''Reading:'' Chapter 1 in [[http://openbookproject.net/thinkcs/python/english2e/ch01.html | How to think like a computer scientist]]. \\

''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch02.html | 2]].\\

''Lecture:'' Course introduction; [[http://www.sciencemag.org/cgi/content/short/325/5940/541 | why do life science researchers should care about programming?]] [ [[Path:../../pdfs/01_intro.pdf | slides]] ] \\

''Lecture:'' Our [[first program]], [[programming errors]], Python [[types]], [[variables]]\\

''Lecture:'' Course introduction; [[http://www.sciencemag.org/cgi/content/short/325/5940/541 | why programming?]] [ [[Path:../../pdfs/01_intro.pdf | slides]] ] \\

!!Week 15:

'''Monday, 4/26'''

''Lecture:'' Plotting with [[http://matplotlib.sf.net|matplotlib]]. Here's code for a simple [[sine curve|plot]]. \\
''Reading:'' The matplotlib [[http://matplotlib.sourceforge.net/users/pyplot_tutorial.html|tutorial]].\\
''Lab:'' [[lab14 | lab 14]]

'''Wednesday, 4/28'''

''Lecture:'' Plotting: Generating [[subplots]], [[histograms]], [[legends]].

'''Friday, 4/30'''

''Lecture:'' Review for exam.


!!Week 14:

'''Monday, 4/26'''

''Lecture:'' Using biopython for DNA sequence motifs [[biopython-motif|motifs]]. Example data: the [[Path:../../data/MA0024.1.pfm|E2F1 motif]] and [[Path:../../data/human_promoter500.fasta|human promoter sequences]].\\
''Lab:'' [[lab13 | lab 13]]

'''Wednesday, 4/28'''

''Lecture:'' More about motif finding.

'''Friday, 4/30'''

''Lecture:'' Finish motif finding with biopython.

!!Week 13:

'''Monday, 4/19'''\\
''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions.\\
''Lab:'' [[lab12 | lab 12]]

'''Wednesday, 4/21'''\\
''Lecture:'' We will start playing with biopython [[biopython-seq|sequence objects]].\\
''Reading:'' Chapter 3 in the biopython [[http://biopython.org/DIST/docs/tutorial/Tutorial.html#htoc16 | tutorial]].

'''Friday, 4/23'''\\
''Lecture:'' We will use biopython to [[biopython-parse|parse]] sequence files.\\
Here's the data for these examples: Calmodulin sequences in [[Path:../../data/cam.fasta | fasta]], [[Path:../../data/cam.txt|uniprot]], and [[Path:../../data/cam.gbk|genbank]] formats. \\
''Reading:'' Chapter 2 in the biopython [[http://biopython.org/DIST/docs/tutorial/Tutorial.html#htoc10 | tutorial]].

!!Week 12:

'''Monday, 4/12'''\\
''Lecture:'' Inheritance in python [[inheritance| the shapes example]].\\
''Lab:'' [[lab11 | lab 11]]\\
''Assignment:'' [[Assignment11 | Assignment 11]]

'''Wednesday, 4/14'''\\
''Lecture:'' [[interfaces]] in Python. New style classes [[new classes | example]]. See also the
python [[http://docs.python.org/reference/datamodel.html#new-style-and-classic-classes | documentation]].

'''Friday, 4/16'''\\
''Lecture:'' Methods for solving [[Assignment9 | assignment 9]].

!!Week 11:

'''Monday, 4/5'''\\
''Lecture:'' Python classes - representing [[shapes|shapes]]; digression: [[random numbers]]\\
''Lab:'' [[lab10 | lab 10]]\\
''Assignment:'' [[Assignment10 |Assignment 10]]

'''Wednesday, 4/7'''\\
''Lecture:'' Operator overloading [[overloading|example]]; the [[cards | cards]] example.\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch15.html#operator-overloading|15]].

'''Friday, 4/9'''\\
''Lecture:'' Python classes (cont)


!!Week 10:

'''Monday, 3/29'''\\
''Lecture:'' Using Python object - continued.\\
''Lab:'' [[lab9 | lab 9]]\\
''Assignments:'' [[Assignment9 |Assignment 9]]

'''Wednesday, 3/31'''\\
''Lecture:'' Introduction to Python classes. code [[classes introduction|examples]].\\
''Reading:'' [[http://openbookproject.net/thinkcs/python/english2e/ch13.html|chapter 13]] and [[http://openbookproject.net/thinkcs/python/english2e/ch15.html|chapter 15]]

'''Friday, 4/2'''\\
''Lecture:'' No lecture today due to [[http://futurevisions.colostate.edu| future visions]].

!!Week 9:

'''Monday, 3/22'''\\
''Lecture:'' dictionaries. code [[dictionaries|examples]].\\
''Lab:'' [[lab8 | lab 8]]\\
''Assignments:'' [[Assignment8 |Assignment 8]]\\
''Reading:'' [[http://openbookproject.net/thinkcs/python/english2e/ch12.html|chapter 12]]

'''Wednesday, 3/24'''\\
''Lecture:'' tuples ([[tuples|examples]]); functions revisited: variable length argument lists using [[tuple_var_args|tuples]] and [[dictionary_var_args|dictionaries]].

'''Friday, 3/26'''\\
''Lecture:'' Using python objects - object methods of [[using objects|strings, lists, and dictionaries]].

!!Week 8:

'''Monday, 3/8'''\\
''Lecture:'' recursion [ [[Path:../../pdfs/05_recursion.pdf | slides]] ]. code [[recursion|examples]].\\
''Lab:'' [[lab7 | lab 7]]\\
''Assignments:'' [[Assignment7 |Assignment 7]]\\
''Reading:'' [[http://openbookproject.net/thinkcs/python/english2e/ch11.html#recursion|chapter 11]]

'''Wednesday, 3/10'''\\
''Lecture:'' recursion - continued. More examples: [[factorial]], [[recursive binary search]].

'''Friday, 3/12'''\\
''Lecture:'' midterm

!!Week 7:

'''Monday, 3/1'''\\
''Lecture:'' binary search [[binary search | code]]; measuring the efficiency of algorithms [ [[Path:../../pdfs/04_complexity.pdf | slides]] ]\\
''Lab:'' [[lab6 | lab 6]]\\
''Assignments:'' [[Assignment6 |Assignment 6]]

'''Wednesday, 3/3'''\\
''Lecture:'' algorithm efficiency (cont).

'''Friday, 3/5'''\\
''Lecture:'' Exceptions [[exceptions | code]]; command line arguments [[argv_example| example]].\\
''Reading:'' Exceptions section in [[http://openbookproject.net/thinkcs/python/english2e/ch11.html#exceptions | chapter 11]].

!!Week 6:

'''Monday, 2/22'''\\
''Lecture:'' Strings and lists ([[strings and lists | code]]), iterators ([[iterators | code]]), files ([[files | code]]).\\
''Lab:'' [[lab5 | lab 5]]\\
''Assignments:'' [[Assignment5 |Assignment 5]]

'''Wednesday, 2/24'''\\
''Lecture:'' Sorting algorithms [ [[Path:../../pdfs/03_sorting.pdf | slides]] ]; here's the [[sorting|code]].

'''Friday, 2/26'''\\
''Lecture:'' Sorting algorithms, continued;


!!Week 5:

'''Monday, 2/15'''\\
''Lecture:'' Strings (continued), string formatting ([[string formatting | examples]]).\\
''Lab:'' [[lab4 | lab 4]]\\
''Assignments:'' [[Assignment4 |Assignment 4]]

'''Wednesday, 2/17'''\\

''Lecture:'' Lists ([[lists]])\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch09.html | 9]].

'''Friday, 2/19'''\\
''Lecture:'' Lists are mutable ([[list mutability | code]]), lists as function parameters ([[lists as parameters | code]]), nested lists ([[nested lists | code]]).\\


!!Week 4:

'''Monday, 2/8'''\\
''Lecture:'' While loops (cont): printing [[tables]]. Iteration using [[for loops]].\\
''Lab:'' [[lab3 | Lab 3]]\\
''Assignments:'' [[Assignment3 |Assignment 3]]

'''Wednesday, 2/10'''\\
''Lecture:'' For loops (cont): [[nestedLoops | nested loops]]. Strings ([[string_examples| examples]]).\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch07.html | 7]].

'''Friday, 2/12'''\\
''Lecture:'' Strings (continued).\\


!!Week 3:

'''Monday, 2/1'''\\
''Lecture:'' Conditionals - the if statement [[boolean variables]], [[conditionals]], [[sort names]], [[letter grade]] calculator, a better version of [[letter grade2 | letter grade]].\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch04.html | 4]].\\
''Lab:'' [[lab2 | Lab 2]]\\
''Assignments:'' [[Assignment2 |Assignment 2]]

'''Wednesday, 2/3'''\\
''Lecture:'' Functions that return a value. Examples: [[area]], [[divisibility]], [[absolute value]].\\
Iteration - the while statement. Here's an [[while example|example]].\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch05.html | 5]],
chapter [[http://openbookproject.net/thinkcs/python/english2e/ch06.html | 6]] \\


'''Friday, 2/5'''\\
''Lecture:'' While loops: [[inputValidation | input validation]].\\

!!Week 2:

'''Monday, 1/25'''\\
''Lecture:'' Python [[expressions]], and [[input]]. Putting it together: [[celsius2fahreheit | Celsius to fahreheit converter]] \\
''Lab:'' [[lab1]]\\
''Assignments:'' [[Assignment1]]

'''Wednesday, 1/27'''\\
''Lecture:'' Functions [ [[Path:../../pdfs/02_functions.pdf | slides]] ]. [[draw_rectangle]], [[celsius2fahrenheit]], [[functions]].
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch03.html | 3]].\\


'''Friday, 1/29'''\\
''Lecture:'' Functions - continued [[local variables]], conditionals - the if statement [[boolean variables]].\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch04.html | 4]].\\

'''Wednesday, 1/20'''\\

'''Friday, 1/22'''\\

!

''Lecture:'' Plotting with [[http://matplotlib.sf.net|matplotlib]]. Here's code for a simple [[sine curve|plot]]. Generating [[subplots]].\\

''Reading:'' The matplotlib [[http://matplotlib.sourceforge.net/users/pyplot_tutorial.html|tutorial]].

''Lecture:'' Plotting with [[http://matplotlib.sf.net|matplotlib]]. Here's code for a simple [[sine curve|plot]]. Generating [[subplots]].

!!Week 14:

''Lecture:'' Finish motif finding with biopython. Start plotting with [[http://matplotlib.sf.net|matplotlib]]. Here's code for a simple [[sine curve|plot]].

''Lab:'' [[[[lab12 | lab 12]]

!!Week 13:

''Lecture:'' We will use biopython to [[biopython-parse|parse]] sequence files, and to hanld [[biopython-motif|motifs]].\\
Here's the data for these examples: Calmodulin sequences in [[Path:../../data/cam.fasta | fasta]], [[Path:../../data/cam.txt|uniprot]], and [[Path:../../data/cam.gbk|genbank]] formats. The [[Path:../../data/MA0024.1.pfm|E2F1 motif]] and [[Path:../../data/human_promoter500.fasta|human promoter sequences]].\\

Here's the data for these examples: Calmodulin sequences in [[Path:../../data/cam.fasta | fasta]], [[Path:../../data/cam.txt|uniprot]], and [[Path:../../data/cam.gbk|genbank]] formats. The [[Path:../../data/MA0024.1.pfm|E2F1 motif]] and [[Path:../../data/human_promoter500.fasta|human promoter sequences]].

''Reading:'' Chapter 3 in the biopython [[http://biopython.org/DIST/docs/tutorial/Tutorial.html#htoc16 | tutorial]].\\

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions. We will start playing with biopython [[biopython-seq|sequence objects]].\\

'''Monday, 4/19'''\\
''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions. We will start playing with biopython [[biopython-seq|sequence objects]].\\
''Reading:'' Chapter 3 in the biopython [[http://biopython.org/DIST/docs/tutorial/Tutorial.html#htoc16 | tutorial]].

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions. We will start playing with biopython [[biopython-seq|sequence objects]].//

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions. We will start playing with biopython [[biopython-seq|sequence objects]].

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]]. Also see the biopython [[http://biopython.org/wiki/Download|install]] instructions.

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package. More info at the [[http://docs.python.org/install/|python documentation]].

''Lecture:'' [[Installing packages]]. As an example, we will install the [[http://biopython.org|biopython]] package.

''Lecture:'' New style classes [[new classes | example]]. See also the

''Lecture:'' Inheritance in python [[inheritance| the shapes example]]. New style classes [[new classes | example]]. See also the
python [[http://docs.python.org/reference/datamodel.html#new-style-and-classic-classes | documentation]].\\

''Lecture:'' Operator overloading [[overloading|example]]; another [[cards | example]].\\

''Lecture:'' Inheritance in python [[inheritance| example]]. New style classes [[new classes | example]]. See also the

''Lecture:'' Python classes - [[shapes|more examples]]; digression: [[random numbers]]\\

'''Monday, 4/12'''\

python [[http://docs.python.org/reference/datamodel.html#new-style-and-classic-classes | documentation]].

''Assignments:'' [[Assignment10 |Assignment 10]]

''Lecture:'' New style classes [[new classes | example]]. See also the
python [[http://docs.python.org/reference/datamodel.html#new-style-and-classic-classes | documentation]]. Inheritance [[inheritance| example]].

''Reading:'': Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch15.html#operator-overloading|15]].

''Lecture:'' No lecture today due to [[futurevisions.colostate.edu| future visions]].

''Lecture:'' Python classes - [[shapes|more examples]].\\

'''Wednesday, 3/24'''\\

''Assignments:'' [[Assignment9 |Assignment 9]]\\

''Lecture:'' Introduction to Python classes. code [[classes introduction|examples]].\\

''Lecture:'' tuples ([[tuples|examples]]); functions revisited: beyond fixed size argument lists. Using [[tuple_var_args|tuples]] and [[dictionary_var_args|dictionaries]].

''Assignments:'' [[Assignment7 |Assignment 7]]

''Lecture:'' Exceptions [[exceptions | code]].\\

''Lecture:'' algorithm efficiency (cont).\\

''Lecture:'' algorithm efficiency (cont); Exceptions [[exceptions | code]].\\

''Lecture:'' algorithm efficiency (cont); Exceptions [[exceptions | code]].

''Lecture:'' binary search [[binary search | code]];
measuring the efficiency of algorithms [ [[Path:../../pdfs/04_complexity.pdf\\

''Lecture:'' Sorting algorithms, continued; binary search [[binary search | code]].

''Lecture:'' Sorting algorithms [ [[Path:../../pdfs/03_sorting.pdf | slides]] ]; here's the [[sorting|code]].\\

''Lecture:'' Sorting algorithms, continued; binary search [[binary search | code]].\\

''Lecture:'' Sorting algorithms [ [[Path:../../pdfs/03_sorting.pdf | slides]] ]\\

''Lecture:'' Sorting algorithms ([ [[Path:../../pdfs/03_sorting.pdf | slides]] ])\\

''Lecture:'' Strings (continued), string formatting ([[string formatting | examples]]).\\

!!Week 6:

''Lecture:'' Strings and lists ([[strings and lists | code]]), iterators ([[iterators | code]]), files ([[files | code]]).\\

!!Week 5:

'''Monday, 2/15'''\\

''Lecture:'' Lists are mutable ([[list mutability | code]]), lists as function parameters ([[lists as parameters | code]]), nested lists ([[nested lists | code]]), strings and lists ([[strings and lists | code]]).\\

''Lecture:'' Lists are mutable ([[list mutability | code]]), lists as function parameters ([[lists as parameters | code]]), nested lists [[nested lists | code]], strings and lists ( [[strings and lists | code]] ).\\

''Lecture:'' Lists are mutable [[list mutability | code]], lists as function parameters [[lists as parameters | code]], nested lists [[nested lists | code]], strings and lists [[strings and lists | code]].\\

''Lecture:'' Lists are mutable [[list mutability | code]], lists as function parameters [[lists as parameters | code]], nested lists [[nested lists | code]].\\

''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch09.html | 9]].\\

''Lecture:'' Lists ([[examples]])\\

''Lecture:'' Lists ([[examples|lists]])\\

''Lecture:'' String formatting ([[string formatting | examples]]). Lists ([[examples|lists]])\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch09.html | 9]].\\

''Assignments:'' [[Assignment3 |Assignment 3]]

''Lecture:'' String formatting ([[string formatting | examples]]). Lists ([[examples|lists]])\\
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch09.html | 9]].\\

''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch07.html | 7]].\\

''Lecture:'' For loops (cont): [[nestedLoops | nested loops]]. Strings ([[string_examples| examples]].\\

''Lecture:'' For loops (cont): [[nestedLoops | nested loops]].\\

''Lecture:'' While loops (cont): printing [[tables]], [[nestedLoops | nested loops]]. Iteration using [[for loops]].\\

''Lecture:'' While loops (cont): printing [[tables]], [[nestedLoops | nested loops]]. Iteration using [[for loops]]\\.

''Lecture:'' While loops: [[inputValidation | input validation]]\\.

'Lecture:'' While loops (cont): printing [[tables]], [[nestedLoops | nested loops]]. Iteration using [[for loops]]\\.

''Lecture:'' While loops: [[inputValidation | input validation]], printing [[tables]], [[nestedLoops | nested loops]]. Iteration using [[for loops]]\\.

Iteration - the while statement. Here's an [[while example|example]].

''Lecture:'' Functions that return a value. Examples: [[area]], [[divisibility]], [[absolute value]].
''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch05.html | 5]].\\

'''Monday, 2/3'''\\

''Reading:'' Chapter [[http://openbookproject.net/thinkcs/python/english2e/ch04.html | 5]].\\

''Lecture:'' Functions - continued [[local variables]], conditionals - the if statement [[boolean variables]], [[conditionals]], [[sort names]], [[letter grade]] calculator, a better version of [[letter grade2 | letter grade]].\\

''Lecture:'' Functions - continued [[local variables]], conditionals - the if statement [[boolean variables]], [[conditionals]], [[sort names]], [[letter grade]] calculator, a better version of [[letter grade2 | letter grade]].

''Lecture:'' Functions [ [[Path:../../pdfs/01_intro.pdf | slides]] ]. [[draw_rectangle]], [[celsius2fahrenheit]], [[functions]].

'''Wed, 1/20'''\\

'''Fri, 1/22'''\\

!!!Week 1:

!!!Week 2:

''Lecture:'' Python [[expressions]], and [[input]]. \\
''Lab:'' [[lab1]]\\
''Assignments:'' [[Assignment1]]

''Lab:'' [[lab1]]

''Lecture:'' Python [[expressions]], and [[input]]. \\

''Lecture:'' Python[[expressions]], and [[input]]. \\

''Lecture:'' Our [[first program]], [[programming errors]], Python [[types]], [[variables]], [[expressions]], and [[input]]. \\

''Lecture:'' Our [[FirstProgram]], [[programming errors]], Python [[types]], [[variables]], [[expressions]], and [[input]]. \\

''Lectures:'' Course introduction; [[http://www.sciencemag.org/cgi/content/short/325/5940/541 | why programming?]] [ [[Path:../../pdfs/01_intro.pdf | slides]] ] \\

!!Week 1:

!!!Wed, 1/20

!!!Week 1: 1/20

''Assignments:'' Coming soon

''Lectures:'' Course introduction; [[http://www.sciencemag.org/cgi/content/short/325/5940/541 | why programming?]]\\

''Lectures:'' Course introduction; \\
''Reading:'' \\

!!!Week 1: 8/25

''Lectures:'' Course introduction; cs160 recap
[ [[Path:../../pdfs/01_intro.pdf | slides]] ] (updated)\\
''Reading:'' 160 material: chapters 1-4, 7 in the Java book.\\
''Recitation:'' [[ recit1 | cs160 recap]]\\
''Assignments:'' First programming assignment is [[assignments | available]]

!!!Week 2: 9/1

''Lectures:'' Java classes, objects, and object oriented programming
[ [[Path:../../pdfs/02_classes.pdf | slides]] ]. Here's the code for the [[Die]] class. Quiz on Thu.\\
''Reading:'' Chapter 5 in the Java book.\\
''Recitation:'' [[ recit2 | Getting familiar with Classes]]\\
''Assignments:'' Programming assignment is [[assignments | available]]

!!!Week 3: 9/8

''Lectures:'' More on Java classes [ [[Path:../../pdfs/03_classes_cont.pdf | slides]] ] (updated thu). The code for the [[Account]] class. Quiz on Thu.\\
''Reading:'' Chapters 5-6 in Savitch (5 in Lewis).\\
''Recitation:'' [[ recit3 | More on Classes]]\\

!!!Week 4: 9/15

''Lectures:'' Assertions, pre/post conditions [ [[Path:../../pdfs/04_assertions.pdf | slides]] ]. Javadoc commenting of code. Here's an [[AccountCommented | example]]. ArrayList [ [[Path:../../pdfs/04_arrayList.pdf | slides]] ]. Here's the [[ArrayListExample| example]] we worked on in class . Quiz on Thu.\\
''Reading:'' Assertions - chapter 4.2 in Savitch. ArrayList - chapter 12.1 in Savitch; \\
''Recitation:'' [[ recit4 | A Break from Classes]]\\

!!!Week 5: 9/22

''Lectures:'' Recursion [ [[Path:../../pdfs/05_recursion.pdf | slides]] ]. Quiz on Thu. More recursion [ [[Path:../../pdfs/05_recursion_cont.pdf | slides]] ]. The [[maze]] example.\\
''Reading:'' Chapter 11 in Savitch, or Chapter 12 in Lewis, or Chapter 3 in Walls and Mirrors.\\
''Recitation:'' [[ recit5 | Recursion]]\\

!!!Week 6: 9/29

''Lectures:'' Counting [ [[Path:../../pdfs/06_counting.pdf | slides]] ]. Midterm on Thu.\\
''Reading:'' Chapter 5 in Rosen.\\
''Recitation:'' [[ recit6 | Recursion]]\\

!!!Week 7: 10/6

''Lectures:'' Permutations, r-permutation, combinations, and the traveling salesman problem [ [[Path:../../pdfs/07_permutations.pdf | slides]] ] (updated on thursday). Quiz on Thu.\\
''Reading:'' Chapter 5 in Rosen.\\
''Recitation:'' [[ recit7 | Enumeration and Counting]]\\

!!!Week 8: 10/13

''Lectures:'' Induction [ [[Path:../../pdfs/08_induction.pdf | slides]] ]. Quiz on Thu.\\
''Reading:'' Chapter 4.1,4.2 in Rosen.\\
''Assignments:'' A written assignment on induction is [[assignments | available]]

!!!Week 9: 10/20

''Lectures:'' Inheritance [ [[Path:../../pdfs/09_inheritance.pdf | slides]] ]. Inheritance and polymorphism [ [[Path:../../pdfs/09_inheritance2.pdf | slides]] ] Quiz on Thu.\\
''Reading:'' Chapter 8 in either of the Java books.\\
''Recitation:'' [[ recit9 | Inheritance]]\\

!!!Week 10: 10/27

''Lectures:'' Interfaces [ [[Path:../../pdfs/10_interfaces.pdf | slides]] ]. (updated after thursday's class) [ [[Path:../../code/staffExample.tar | Code]] ] for the StaffMember/Employee etc. example. Quiz on Thu.\\
''Reading:'' Chapter 8 in Savitch, chapter 9 in Lewis.\\
''Recitation:'' [[recit10 | Interfaces]]\\

!!!Week 11: 11/3

''Lectures:'' Midterm on Tue. Static again [ [[Path:../../pdfs/11_static.pdf | slides]] ]. Linked lists [ [[Path:../../pdfs/11_linked_lists.pdf | slides]] ]\\
''Reading:'' Chapter 5 in Walls and Mirrors, 12.1 in Savitch, 14.4 in Lewis.\\
''Recitation:'' Programming quiz\\

!!!Week 12: 11/10

''Lectures:'' Linked lists [ [[Path:../../pdfs/12_linked_lists2.pdf | slides]] ] (updated on wed). Linked list [[LinkedList | code]] and doubly linked list [[DoublyLinkedList | code]]. \\
''Reading:'' Chapter 5 in Walls and Mirrors, 12.1 in Savitch, 14.4 in Lewis.\\
''Recitation:'' [[recit12 | Linked Lists]]\\

!!!Week 13: 11/17

''Lectures:'' Sorting [ [[Path:../../pdfs/13_sorting.pdf | slides]] ] (updated on thu) Here's a nice [[ http://math.hws.edu/TMCM/java/xSortLab/ | java applet]] that illustrates the sorting algorithms we looked at. Obama being asked about [[http://www.youtube.com/watch?v=k4RRi_ntQc8|sorting]]\\
''Reading:'' Chapter 13 in Lewis, Chapter 10 in Walls and Mirrors\\
''Recitation:'' [[recit13 | Sorting]]\\


!!!Week 14: 12/1

''Lectures:'' Java packages [ [[Path:../../pdfs/14_packages.pdf | slides]] ]. JUnit and testing [ [[Path:../../pdfs/15_junit.pdf | slides]] ]. Graphics, GUI and Applets in Java [ [[Path:../../pdfs/16_graphics_gui.pdf | slides]] ] and [ [[Path:../../code/graphics_gui.tgz | code]] ]\\
''Reading:'' Packages: Chapter 11 in Lewis, 6.7 in Savitch. Lewis covers version 3 of JUnit.\\
''Recitation:'' [[recit14 | JUnit]]\\

!!!Week 15: 12/8
''Lectures:'' Java Graphics, GUI and Applets - continued (tuesday). Review (thursday).\\
''Recitation:'' Programming final.

''Lectures:'' Java packages [ [[Path:../../pdfs/14_packages.pdf | slides]] ]. JUnit and testing [ [[Path:../../pdfs/15_junit.pdf | slides]] ]. Graphics, GUI and Applets in Java [ [[Path:../../pdfs/16_graphics_gui.pdf | slides]] ]\\

''Lectures:'' Java packages [ [[Path:../../pdfs/14_packages.pdf | slides]] ]. JUnit and testing [ [[Path:../../pdfs/15_junit.pdf | slides]] ] \\

''Recitation:'' \\

''Lectures:'' Java packages [ [[Path:../../pdfs/14_packages.pdf | slides]] ]. JUnit and testing [ [[Path:../../pdfs/15_testing.pdf | slides]] ] \\

''Recitation:'' [[recit13 | Sorting]]\\

''Lectures:'' Sorting [ [[Path:../../pdfs/13_sorting.pdf | slides]] ] (updated on thu) Here's a nice [[ http://math.hws.edu/TMCM/java/xSortLab/ | java applet]] that illustrates the sorting algorithms we looked at\\

''Lectures:'' Sorting [ [[Path:../../pdfs/13_sorting.pdf | slides]] ] (updated on thu) \\

''Lectures:'' Sorting [ [[Path:../../pdfs/13_sorting.pdf | slides]] ] \\

''Recitation:'' [[recit13 | Sorting]]\\

''Recitation:'' \\

''Lectures:'' Linked lists [ [[Path:../../pdfs/12_linked_lists2.pdf | slides]] ] (updated on wed). Linked list [[LinkedList | code]] \\

''Lectures:'' Linked lists [ [[Path:../../pdfs/12_linked_lists2.pdf | slides]] ] (updated on wed)\\

''Lectures:'' Linked lists [ [[Path:../../pdfs/12_linked_lists2.pdf | slides]] ]\\

''Recitation:'' [[recit10 | Interfaces]]\\

''Lectures:'' Interfaces [ [[Path:../../pdfs/10_interfaces.pdf | slides]] ]. [ [[Path:../../code/staffExample.tar | Code]] ] for the StaffMember/Employee etc. example. Quiz on Thu.\\

''Lectures:'' Interfaces [ [[Path:../../pdfs/10_interfaces.pdf | slides]] ]. Quiz on Thu.\\

!!!Week 9: 10/27

''Lectures:'' Inheritance [ [[Path:../../pdfs/09_inheritance.pdf | slides]] ]. Quiz on Thu.\\

''Reading:'' Chapter 11 in Savitch, or Chapter 12 in Lewis, or Chapter 3 in Walls and Mirrors.

''Reading:'' Chapter 5 in Rosen.

''Reading:'' Chapter 5 in Rosen.

''Lectures:'' Permutations, r-permutation, combinations, and the traveling salesman problem [ [[Path:../../pdfs/07_permutations.pdf | slides]] ]. Quiz on Thu.\\

''Lectures:'' Permutations, r-permutation, combinations, and the traveling salesman problem [ [[Path:../../pdfs/07_permutations.pdf | slides]] ]. Midterm on Thu.\\

''Lectures:'' Recursion [ [[Path:../../pdfs/05_recursion.pdf | slides]] ]. Quiz on Thu. More recursion [ [[Path:../../pdfs/05_recursion_cont.pdf | slides]] ]\\

''Lectures:'' Recursion [ [[Path:../../pdfs/05_recursion.pdf | slides]] ]. Quiz on Thu.\\

''Lectures:'' Assertions, pre/post conditions [ [[Path:../../pdfs/04_assertions.pdf | slides]] ]. Javadoc commenting of code. Here's an [[AccountCommented | example]]. ArrayList [ [[Path:../../pdfs/04_arrayList.pdf | slides]] ]. Quiz on Thu.\\

''Lectures:'' Assertions, pre/post conditions [ [[Path:../../pdfs/04_assertions.pdf | slides]] ]. Javadoc commenting of code. Here's an [[AccountCommented | example]]. Quiz on Thu.\\
''Reading:'' Assertions - chapter 4.2 in Savitch.\\

''Recitation:''

''Lectures:'' More on Java classes [ [[Path:../../pdfs/04_assertions.pdf | slides]] ]. Quiz on Thu.\\

!!!Week 4: 9/8

!!!Week 3: 9/15

!!!Week 3: 9/8

''Lectures:'' More on Java classes [ [[Path:../../pdfs/03_classes_cont.pdf | slides]] ]. The code for the [[Account]] class. Quiz on Thu.\\

''Recitation:'' \\

''Lectures:'' More on Java classes [ [[Path:../../pdfs/03_classes_cont.pdf | slides]] ]. Quiz on Thu.\\

''Recitation:'' [[ recit2 | Getting familiar with Classes]]\\

[ [[Path:../../pdfs/02_classes.pdf | slides]] ]. Here's the code for the [[Die]] class. \\

[ [[Path:../../pdfs/02_classes.pdf | slides]] ] \\

[ [[Path:../../pdfs/02_classes.pdf | slides]] ] (updated)\\

!!!Week 1: 8/25

[ [[Path:../../pdfs/01_intro.pdf | slides]] ]\\

>>comment<<
[ [[Path:../../pdfs/introduction.pdf | slides]] ]\\
>><<
''Reading:'' Chapters 1-4, 7 in the Java book.\\
''Recitation:'' \\

>>comment<<

>><<

''Lectures:'' Course introduction; cs160 recap [ [[Path:../../pdfs/introduction.pdf | slides]] ]\\
''Reading:'' Chapter 1 in Walls and Mirrors.\\

''Reading:'' Chapter 4 in Walls and Mirrors.\\

!!!Week 1: 1/21 - 1/23

''Lectures:'' Course introduction; abstract data types (ADTs) [ [[Path:../../pdfs/introduction.pdf | slides]] ]\\

''Recitation:'' No recitations this week\\

!!!Week 2: 1/26 - 1/30

''Lectures:'' Measuring the efficiency of algorithms [ [[Path:../../pdfs/complexity.pdf | slides]] ]\\
''Reading:'' Sections 3.2,3.3 in Rosen, Section 10.1 in Walls and Mirrors.\\
''Recitation:'' Using checkin, review of linked lists, help on programming assignment\\

!!!Week 3: 2/2 - 2/6

''Lectures:'' Stacks and Queues [ [[Path:../../pdfs/stacksAndQueues.pdf | slides]] ]\\
''Reading:'' chapters 7 and 8 in Walls and Mirrors\\
''Recitation:'' Review of big-O analysis, generics, stacks\\

''Assignments:'' Second programming assignment is [[assignments | available]]

!!!Week 4: 2/9 - 2/13

''Lectures:'' Queues (cont). Advanced sorting algorithms using divide and conquer strategies; evaluating complexity of recursive algorithms [ [[Path:../../pdfs/divide-conquer.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors 10.2, Rosen 7.1, 7.3\\
''Recitation:'' Programming a queue; work on programming assignment\\

!!!Week 5: 2/16 - 2/20

''Lectures:'' Sorting algorithms using divide and conquer strategies (cont)\\
''Reading:'' Walls and Mirrors 10.2, Rosen 7.1, 7.3\\
''Recitation:'' recursion\\
''Assignments:'' Second written assignment is [[assignments | available]]

!!!Week 6: 2/23 - 2/27

''Lectures:'' Wednesday: Midterm. Mon, Fri: Trees, binary search trees\\ [ [[Path:../../pdfs/trees.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 11\\
''Recitation:'' Review for midterm, recursion

!!!Week 7: 3/2 - 3/6

''Lectures:'' Trees, binary search trees (cont)\\
''Reading:'' Walls and Mirrors ch. 11\\
''Recitation:'' Iterators, recursion

!!!Week 8: 3/9 - 3/13

''Lectures:'' Priority queues and heaps [ [[Path:../../pdfs/PQ_heaps.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 12.2\\
''Recitation:'' More iterators

!!!Week 9: 3/23 - 3/27

''Lectures:'' Monday: grammars [ [[Path:../../pdfs/grammars.pdf | slides]] ] Wednesday: Working in teams - a talk by Debbie Bartlett. Friday: Balanced search trees [ [[Path:../../pdfs/balancedTrees.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 6.2, ch. 12,13\\
''Recitation:'' implementing a heap


!!!Week 10: 3/30 - 4/3

''Lectures:'' Balanced search trees (cont). Friday: graphs [ [[Path:../../pdfs/graphs1.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 13; ch. 14.1-14.2\\
''Recitation:'' programming quiz. You will use the [[http://www.cs.colostate.edu/~hamiltom/cs200/BinaryTree.java | binary tree]] and [[http://www.cs.colostate.edu/~hamiltom/cs200/BT_Node.java | tree node]] classes.

!!!Week 11: 4/6 - 4/10

''Lectures:'' Monday: graphs (cont). Wednesday: midterm. Friday: more graphs [ [[Path:../../pdfs/graphs2.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 14\\
''Recitation:'' help with programming assignment, go over written hw, command-line arguments, review for midterm

!!!Week 12: 4/13 - 4/17

''Lectures:'' graphs - directed acyclic graphs and topological sorting of graphs; graph algorithms [ [[Path:../../pdfs/graphs3.pdf | slides]] ], relations [ [[Path:../../pdfs/relations.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 14, Rosen 8.1-8.5 (relations)\\
''Recitation:'' Implementing graphs.

!!!Week 14: 4/27 - 5/1

''Lectures:'' Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ [[Path:../../pdfs/graphs4.pdf | slides]] ]\\
hash tables [ [[Path:../../pdfs/hashtables.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 14 (graphs), 13 (hash tables) \\
''Recitation:'' Review of relations and grammars.

!!!Week 15: 5/4 - 5/8

''Lectures:'' hash tables (cont); discussion of final [ [[Path:../../pdfs/study_guide.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 13 \\
''Recitation:'' Programming part of final.

!!!Week 16:

Wed -- special review session 1-3pm at CSB130.
Thu -- final exam at 7am.

hash tables [ [[Path:../../pdfs/hashtables.pdf | slides]] ]

''Reading:'' Walls and Mirrors ch. 14 \\

''Lectures:'' Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ [[Path:../../pdfs/graphs3.pdf | slides]] ]\\

''Lectures:'' Dijkstra's algorithm, more problems on graphs [ [[Path:../../pdfs/graphs3.pdf | slides]] ]\\

''Lectures:'' Relations, Dijkstra's algorithm, more problems on graphs [ [[Path:../../pdfs/graphs3.pdf | slides]] ]
''Reading:'' Walls and Mirrors ch. 14, Rosen 8.1-8.5 (relations)\\

!!!Week 13: 4/27 - 5/1

''Lectures:'' graphs - directed acyclic graphs and topological sorting of graphs; graph algorithms [ [[Path:../../pdfs/graphs3.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 14\\

''Lectures:'' graphs - directed acyclic graphs and topological sorting of graphs \\

''Lectures:'' Monday: graphs (cont). Wednesday: midterm. Friday: more graphs \\

''Reading:'' Walls and Mirrors ch. 13; beginning ch. 14\\

''Lectures:'' Balanced search trees (cont). Friday: graphs \\

''Lectures:'' Balanced search trees (cont) \\
''Reading:'' Walls and Mirrors ch. 13\\

''Reading:'' Walls and Mirrors ch. 6.2\\

''Lectures:'' Monday: grammars [ [[Path:../../pdfs/grammars.pdf | slides]] ] Wednesday: Working in teams - a talk by Debbie Bartlett Friday: Balanced search trees [ [[Path:../../pdfs/balancedTrees.pdf | slides]] ] \\

''Lectures:'' Monday: grammars [ [[Path:../../pdfs/grammars.pdf | slides]] ] Wednesday: Working in teams - a talk by Debbie Bartlett\\

''Recitation:''

''Lectures:'' Priority queues and heaps [ [[Path:../../pdfs/PQ_heaps.pdf | slides]] ] grammars [ [[Path:../../pdfs/grammars.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 12.2, ch. 6.2\\

''Lectures:'' Priority queues and heaps [ [[Path:../../pdfs/PQ_heaps.pdf | slides]] ] \\
''Reading:'' Walls and Mirrors ch. 12.2\\

''Lectures:'' Priority queues and heaps [[Path:../../pdfs/PQ_heaps.pdf | slides]] ] \\

''Recitation:'' recursion

''Reading:'' Walls and Mirrors ch. 11\\

''Lectures:'' Wednesday: Midterm. Mon, Fri: Trees, binary search trees [[[Path:../../pdfs/trees.pdf | slides]]]\\

''Lectures:'' Wednesday: Midterm. Mon, Fri: Trees, binary search trees [ [[Path:../../pdfs/trees.pdf | slides]] ]\\

!!!Week 5: 2/23 - 2/27

''Lectures:'' Wednesday: Midterm. Mon, Fri: Trees, binary search trees [[Path:../../pdfs/trees.pdf | slides]] ]\\

''Recitation:''

''Lectures:'' Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms [ [[Path:../../pdfs/divide-conquer.pdf | slides]] ]\\

''Lectures:'' Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms\\

!!!Week 4: 2/2 - 2/6

Lecture: [ slides ]
Reading: Walls and Mirrors 10.2, Rosen 7.1, 7.3

''Recitation:'' Review of big-O analysis, generics, stacks\\

''Recitation:'' Review of big-O analysis, generics, stacks

''Recitation:'' Review of big-O analysis, generics

''Lectures:'' Course introduction; abstract data types (ADTs) [ [[Path:../../pdfs/introduction.pdf | slides]] ]\\

''Lectures:'' Measuring the efficiency of algorithms [ [[Path:../../pdfs/complexity.pdf | slides]] ]\\

''Recitation:'' Using checkin, review of linked lists, file IO, help on programming assignment\\

''Recitation:'' Using checkin, review of linked lists and file IO\\

!!!Week 1: 1/26 - 1/30

''Recitation:'' \\

''Reading:'' Sections 3.2,3.3 in Rose, Section 10.1 in Walls and Mirrors.\\

''Lectures:'' Course introduction; abstract data types (ADTs) [[Path:../../pdfs/introduction.pdf | slides]] \\

''Lectures:'' Course introduction; abstract data types (ADTs)\\

''Reading:'' Chapter 4 in Walls and Mirrors.

''Recitation:'' No recitations this week

''Lectures:'' Course introduction; abstract data types (ADTs)

-> ''Reading:'' Chapter 4 in Walls and Mirrors.
-> ''Lectures:'' Course introduction; abstract data types (ADTs)
-> ''Recitation:'' No recitations this week

!!!Week 1: 1/21 - 8/23

!!!Week 1: 8/25 - 8/29

Coming soon!