Main.Schedule History
Hide minor edits - Show changes to markup
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages. As an example, we will install biopython.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Lecture: Plotting with matplotlib. Here are some examples: code for a simple plot, and subplots.
Lecture: Plotting with matplotlib. Here's a simple example
Lab: Lab 13: working with matplotlib.
Lab: Lab 13: working with matplotlib.
Week 15
Tuesday, 5/7
Lecture: More plotting with matplotlib. subplots, legends, histograms. We will also discuss how to install packages?. As an example, we will install http://biopython.org.
Reading: The matplotlib tutorial.
Lecture: Plotting with matplotlib. Here are some examples: code for a simple plot,
Lecture: Plotting with matplotlib. Here are some examples: code for a simple plot, and subplots.
Week 14
Tuesday, 4/30
Lecture: Plotting with matplotlib. Here are some examples: code for a simple plot,
Reading: The matplotlib tutorial.
Thursday, 4/25
Lab: Lab 13: working with matplotlib.
Week 13
Tuesday, 4/23
Lecture: Inheritance in Python. new classes.
Reading: chapter 17
Reading: [[http://openbookproject.net/thinkcs/python/english2e/ch11.html#exceptions
| chapter 11]]
Reading: chapter 11
Lecture: exceptions
Reading: [[http://openbookproject.net/thinkcs/python/english2e/ch11.html#exceptions
| chapter 11]]
Thursday, 4/18
Lab: Lab 11: More practice with Python classes.
Lecture: More Python classes: Some shape classes; the card? class, and operator overloading
Lecture: More Python classes: Some shape classes; the cards example, and operator overloading
Week 12
Tuesday, 4/16
Lecture: More Python classes: Some shape classes; the card? class, and operator overloading
Reading: chapter 15
Lab: Lab 10: Python classes.
Lab: Lab 10: Python classes and generating random numbers.
Reading: chapter 13 and chapter 15
Thursday, 4/11
Lab: Lab 10: Python classes.
Lecture: Using Python objects - methods
.
Lecture: Using Python objects - methods
.
Week 10
Tuesday, 4/4
Lab: Lab 10: Dictionaries.
Thursday, 4/4
Lab: Lab 9: Dictionaries.
Lecture: Dictionaries (example code
Lecture: Dictionaries (example code)
Tuesday, 4/4
Lab: Lab 10: Dictionaries.
Tuesday, 4/2
Lecture: Dictionaries (example code
Reading: chapter 12
Thursday, 3/28
Lecture: Continue recursion.
Lab: Lab 8
Week 9:
Tuesday, 3/26
Lecture: Recursion [ slides ] and code examples
Reading: chapter 11
Thursday, 3/14
Lecture: Sorting (cont), command-line arguments.
Lab: Lab 7
Lecture: String formatting, Python lists
Lecture: Python lists
Lecture: String formatting, Python lists
Lecture: Strings, continued. String formatting
Reading: Chapter 7 in the book.
Thursday, 2/21
Lecture: String formatting, Python lists
Week 4:
Week 5:
Lecture: Python lists
Lecture: String formatting, Python lists
Week 4:
Tuesday, 2/19
Lecture: Python lists
Reading: Chapter 9 in the book.
Chapter 7 in the book.
Reading: Chapter 7 in the book.
Chapter 7 in the book.
Lecture: More on while loops: input validation; iteration using for loops, tables.
Lecture: More on while loops: input validation; iteration using for loops, tables, strings
Week 4:
Lecture: More on while loops: input validation.
Lecture: More on while loops: input validation; iteration using for loops, tables.
Lab: Lab3
Lab: Lab3
Tuesday, 2/12
Lecture: More on while loops: input validation.
Chapter 6 in the book.
Reading: Chapter 6 in the book.
Lab: Lab3
Chapter 6 in the book.
Lab: Lab3
Lecture: while loops.
Lecture: Iteration in Python: while loops.
Lecture: While Loops: whileLoops.
Lecture: while loops.
Thursday, 2/7
Lecture: While Loops: whileLoops.
Lab: Lab3
Reading: Chapter 4 in the book.
Functions that return a value. Examples: area, divisibility, absolute value.
Reading: Chapter 4 and Chapter 5 in the book.
Lecture: More conditionals: sort names, letter grade calculator, a better version of letter grade.
Lecture: More conditionals: sort names, letter grade calculator, a better version of letter grade.
Week 3:
Tuesday, 2/5
Lecture: More conditionals: sort names, letter grade calculator, a better version of letter grade.
Reading: Chapter 4 in the book.
Lecture: Functions: LocalVariables; Boolean expressions and the if statement.
Lecture: Functions: LocalVariables; putting logic into a program: Boolean expressions and conditionals .
Lecture: Functions: LocalVariables; Boolean expressions and the if statement?.
Lecture: Functions: LocalVariables; Boolean expressions and the if statement.
Lecture: Python expressions using expressions: celsius to fahrenheit conversion; introduction to functions [ slides ] some code: draw_rectangle, c2f conversion with functions, using functions.
Lecture: Python expressions using expressions: celsius to fahrenheit conversion; introduction to functions [ slides ] some code: draw_rectangle, c2f conversion with functions, using functions.
Reading: Chapter 3 in the book.
Thursday, 1/31
Lecture: Functions: LocalVariables; Boolean expressions and the if statement?.
Reading: Chapter 4 in the book.
Reading: Chapter 2 in the book.
Reading: Chapter 2 in the book.
Week 2:
Tuesday, 1/29
Lecture: Python expressions using expressions: celsius to fahrenheit conversion; introduction to functions [ slides ] some code: draw_rectangle, c2f conversion with functions, using functions.
Lecture: Some basic linux; Python types, variables
Reading: Chapter 2 in the book.
Reading: Chapter 1 in How to think like a computer scientist.
Reading: Chapter 1 in How to think like a computer scientist.
Reading: Chapter 2.
Reading: Chapter 2.
Lecture: Course introduction; why do life science researchers should care about programming? [ slides ]
Lecture: Course introduction; why do life science researchers should care about programming? Our first program and some programming errors [ slides ]
Lecture: Our first program, programming errors, Python types, variables
Lecture: Course introduction; why programming? [ slides ]
Lecture: Course introduction; why do life science researchers should care about programming? [ slides ]
Week 15:
Monday, 4/26
Lecture: Plotting with matplotlib. Here's code for a simple plot.
Reading: The matplotlib tutorial.
Lab: 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 motifs. Example data: the E2F1 motif and human promoter sequences.
Lab: 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 biopython package. More info at the python documentation. Also see the biopython install instructions.
Lab: lab 12
Wednesday, 4/21
Lecture: We will start playing with biopython sequence objects.
Reading: Chapter 3 in the biopython tutorial.
Friday, 4/23
Lecture: We will use biopython to parse sequence files.
Here's the data for these examples: Calmodulin sequences in fasta, uniprot, and genbank formats.
Reading: Chapter 2 in the biopython tutorial.
Week 12:
Monday, 4/12
Lecture: Inheritance in python the shapes example.
Lab: lab 11
Assignment: Assignment 11
Wednesday, 4/14
Lecture: interfaces in Python. New style classes example. See also the
python documentation.
Friday, 4/16
Lecture: Methods for solving assignment 9.
Week 11:
Monday, 4/5
Lecture: Python classes - representing shapes; digression: random numbers
Lab: lab 10
Assignment: Assignment 10
Wednesday, 4/7
Lecture: Operator overloading example; the cards example.
Reading: Chapter 15.
Friday, 4/9
Lecture: Python classes (cont)
Week 10:
Monday, 3/29
Lecture: Using Python object - continued.
Lab: lab 9
Assignments: Assignment 9
Wednesday, 3/31
Lecture: Introduction to Python classes. code examples.
Reading: chapter 13 and chapter 15
Friday, 4/2
Lecture: No lecture today due to future visions.
Week 9:
Monday, 3/22
Lecture: dictionaries. code examples.
Lab: lab 8
Assignments: Assignment 8?
Reading: chapter 12
Wednesday, 3/24
Lecture: tuples (examples); functions revisited: variable length argument lists using tuples and dictionaries.
Friday, 3/26
Lecture: Using python objects - object methods of strings, lists, and dictionaries.
Week 8:
Monday, 3/8
Lecture: recursion [ slides ]. code examples.
Lab: lab 7
Assignments: Assignment 7
Reading: 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 code; measuring the efficiency of algorithms [ slides ]
Lab: lab 6
Assignments: Assignment 6
Wednesday, 3/3
Lecture: algorithm efficiency (cont).
Friday, 3/5
Lecture: Exceptions code; command line arguments example.
Reading: Exceptions section in chapter 11.
Week 6:
Monday, 2/22
Lecture: Strings and lists (code), iterators (code), files (code).
Lab: lab 5
Assignments: Assignment 5
Wednesday, 2/24
Lecture: Sorting algorithms [ slides ]; here's the code.
Friday, 2/26
Lecture: Sorting algorithms, continued;
Week 5:
Monday, 2/15
Lecture: Strings (continued), string formatting (examples).
Lab: lab 4
Assignments: Assignment 4
Wednesday, 2/17
Lecture: Lists (lists)
Reading: Chapter 9.
Friday, 2/19
Lecture: Lists are mutable (code), lists as function parameters (code), nested lists (code).
Week 4:
Monday, 2/8
Lecture: While loops (cont): printing tables. Iteration using for loops.
Lab: Lab 3
Assignments: Assignment 3
Wednesday, 2/10
Lecture: For loops (cont): nested loops. Strings (examples).
Reading: Chapter 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 grade.
Reading: Chapter 4.
Lab: Lab 2
Assignments: Assignment 2
Wednesday, 2/3
Lecture: Functions that return a value. Examples: area, divisibility, absolute value.
Iteration - the while statement. Here's an example.
Reading: Chapter 5,
chapter 6
Friday, 2/5
Lecture: While loops: input validation.
Week 2:
Monday, 1/25
Lecture: Python expressions, and input. Putting it together: Celsius to fahreheit converter
Lab: lab1
Assignments: Assignment1
Wednesday, 1/27
Lecture: Functions [ slides ]. draw_rectangle, celsius2fahrenheit, functions.
Reading: Chapter 3.
Friday, 1/29
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables.
Reading: Chapter 4.
Wednesday, 1/20
Tuesday, 1/22
Friday, 1/22
Thursday, 1/24
Lecture: Plotting with matplotlib. Here's code for a simple plot.
Wednesday, 4/28
Lecture: Plotting: Generating subplots, histograms, legends.
Friday, 4/30
Lecture: Review for exam.
Reading: The matplotlib tutorial.
Reading: The matplotlib tutorial.
Week 14:
Week 15:
Lecture: Plotting with matplotlib. Here's code for a simple plot. Generating subplots.
Week 14:
Monday, 4/26
Lecture: Finish motif finding with biopython. Start plotting with matplotlib. Here's code for a simple plot.
Lecture: Finish motif finding with biopython.
Wednesday, 4/28
Lecture: More about motif finding.
Friday, 4/30
Lecture: Finish motif finding with biopython. Start plotting with matplotlib. Here's code for a simple plot.
Lab: lab 13
Lab: lab 12
Lab: lab 12
Week 13:
Week 14:
Monday, 4/26
Lecture: Using biopython for DNA sequence motifs motifs. Example data: the E2F1 motif and human promoter sequences.
Week 13:
Lecture: We will use biopython to parse sequence files, and to hanld motifs.
Here's the data for these examples: Calmodulin sequences in fasta, uniprot, and genbank formats. The E2F1 motif and human promoter sequences.
Here's the data for these examples: Calmodulin sequences in fasta, uniprot, and genbank formats. The E2F1 motif and human promoter sequences.
Here's the data for these examples: Calmodulin sequences in fasta, uniprot, and genbank formats. The E2F1 motif and human promoter sequences.
Here's the data for these examples: Calmodulin sequences in fasta, uniprot, and genbank formats. The E2F1 motif and human promoter sequences.
Reading: Chapter 3 in the biopython tutorial.
Reading: Chapter 3 in the biopython tutorial.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions.
Wednesday, 4/21
Lecture: We will start playing with biopython sequence objects.
Week 13:
Monday, 4/19
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Reading: Chapter 3 in the biopython tutorial.
Lab: lab 12
Monday, 4/19
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Reading: Chapter 3 in the biopython tutorial.
Lecture: Methods for solving assignment 9.
Monday, 4/19
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.//
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.// Reading: Chapter 3 in the biopython tutorial.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions. We will start playing with biopython sequence objects.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation. Also see the biopython install instructions.
Lecture: Installing packages. As an example, we will install the biopython package.
Lecture: Installing packages. As an example, we will install the biopython package. More info at the python documentation.
Friday, 4/16
Lecture: Installing packages. As an example, we will install the biopython package.
Lecture: New style classes example. See also the
Lecture: interfaces in Python. New style classes example. See also the
Lecture: Inheritance in python the shapes example. New style classes example. See also the
python documentation.
Lecture: Inheritance in python the shapes example.
Wednesday, 4/14
Lecture: New style classes example. See also the
python documentation.
Lecture: Inheritance in python the shapes example. New style classes example. See also the
Lecture: Python classes - more examples; digression: random numbers
Lecture: Python classes - representing shapes; digression: random numbers
Monday, 4/12
Monday, 4/12
python documentation.
python documentation.
Week 12:
Monday, 4/12
Lecture: Inheritance in python example. New style classes example. See also the
python documentation.
Lab: lab 11
Assignment: Assignment 11
Assignments: Assignment 10
Assignment: Assignment 10
Lecture: Python classes (cont)
Reading:: Chapter 15.
Lecture: No lecture today due to .
Lecture: No lecture today due to future visions.
Friday, 4/2
Lecture: No lecture today due to .
Lecture: Python classes - more examples.
Lecture: Python classes - more examples; digression: random numbers
Week 11:
Monday, 4/5
Lecture: Python classes - more examples.
Lab: lab 10
Assignments: Assignment 10
Wednesday, 3/24
Wednesday, 3/31
Assignments: Assignment 9
Assignments: Assignment 9
Lecture: Introduction to Python classes. code examples.
Lecture: Using Python object - continued.
Wednesday, 3/24
Lecture: Introduction to Python classes. code examples.
Week 10:
Monday, 3/29
Lecture: Introduction to Python classes. code examples.
Lab: lab 9
Assignments: Assignment 9
Reading: chapter 13 and chapter 15
Lecture: tuples (examples); functions revisited: beyond fixed size argument lists. Using tuples and dictionaries.
Lecture: tuples (examples); functions revisited: variable length argument lists using tuples and dictionaries.
Friday, 3/26
Lecture: Using python objects - object methods of strings, lists, and dictionaries.
Wednesday, 3/24
Lecture: tuples (examples); functions revisited: beyond fixed size argument lists. Using tuples and dictionaries.
Week 9:
Monday, 3/22
Lecture: dictionaries. code examples.
Lab: lab 8
Assignments: Assignment 8?
Reading: chapter 12
Friday, 3/12
Lecture: midterm
Wednesday, 3/10
Lecture: recursion - continued. More examples: factorial, recursive binary search.
Assignments: Assignment 7
Assignments: Assignment 7
Reading: chapter 11
Week 8:
Monday, 3/8
Lecture: recursion [ slides ]. code examples.
Lab: lab 7
Assignments: Assignment 7
Lecture: algorithm efficiency (cont).
Lecture: algorithm efficiency (cont).
Lecture: algorithm efficiency (cont); Exceptions code.
Lecture: algorithm efficiency (cont).
Friday, 3/5
Lecture: Exceptions code.
Lecture: algorithm efficiency (cont); Exceptions code.
Lecture: algorithm efficiency (cont); Exceptions code.
Wednesday, 3/3
Lecture: algorithm efficiency (cont); Exceptions code.
Reading: Exceptions section in chapter 11.
Lecture: binary search code;
measuring the efficiency of algorithms [ [[Path:../../pdfs/04_complexity.pdf
Week 7:
Monday, 3/1
Lecture: binary search code;
measuring the efficiency of algorithms [ lab 6
Assignments: Assignment 6
Lecture: Sorting algorithms, continued; binary search code.
Lecture: Sorting algorithms, continued;
Lecture: Sorting algorithms, continued; binary search code.
Lecture: Sorting algorithms, continued; binary search code.
Lecture: Sorting algorithms [ slides ]
Lecture: Sorting algorithms ([ slides ])
Lecture: Sorting algorithms [ slides ]
Wednesday, 2/24
Lecture: Sorting algorithms ([ slides ])
Lecture: Strings (continued), string formatting (examples).
Week 6:
Week 5:
Lecture: Strings (continued), string formatting (examples).
Week 5:
Monday, 2/15
Week 6:
Monday, 2/22
Lab: lab 5
Assignments: Assignment 5
Week 6:
Monday, 2/15
Lecture: Strings and lists (code), iterators (code), files (code).
Lecture: Lists are mutable (code), lists as function parameters (code), nested lists (code), strings and lists (code).
Lecture: Lists are mutable (code), lists as function parameters (code), nested lists code, strings and lists ( code ).
Lecture: Lists are mutable code, lists as function parameters code, nested lists code, strings and lists code.
Reading: Chapter 9.
Reading: Chapter 9.
Lecture: Lists (examples)
Lecture: Lists (lists)
Lecture: Lists (lists)
Lecture: Lists (examples)
Lecture: Strings (continued), string formatting (examples).
Wednesday, 2/17
Lecture: Lists (lists)
Reading: Chapter 9.
Assignments: Assignment 3
Assignments: Assignment 4
Week 5:
Monday, 2/15
Lecture: String formatting (examples). Lists (lists)
Reading: Chapter 9.
Lab: lab 4
Assignments: Assignment 3
Lecture: Strings (continued).
Reading: Chapter 7.
Reading: Chapter 7.
Lecture: For loops (cont): nested loops. Strings (examples.
Lecture: For loops (cont): nested loops. Strings (examples).
Lecture: For loops (cont): nested loops.
Lecture: For loops (cont): nested loops. Strings (examples.
Reading: Chapter 7.
Lecture: While loops (cont): printing tables, nested loops. Iteration using for loops.
Wednesday, 2/10
Lecture: For loops (cont): nested loops.
Lecture: While loops (cont): printing tables, nested loops. Iteration using for loops
.
Lecture: While loops (cont): printing tables, nested loops. Iteration using for loops.
Lab: Lab 3
Assignments: Assignment 3
Lecture: While loops: input validation
.
Lecture: While loops: input validation.
'Lecture:'' While loops (cont): printing tables, nested loops. Iteration using for loops
.
Lecture: While loops (cont): printing tables, nested loops. Iteration using for loops
.
Week 4:
Monday, 2/8
'Lecture:'' While loops (cont): printing tables, nested loops. Iteration using for loops
.
Lecture: While loops: input validation, printing tables, nested loops. Iteration using for loops
.
Lecture: While loops: input validation
.
Friday, 2/5
Lecture: While loops: input validation, printing tables, nested loops. Iteration using for loops
.
Iteration - the while statement. Here's an example.
Iteration - the while statement. Here's an example.
Lecture: Functions that return a value. Examples: area, divisibility, absolute value.
Reading: Chapter 5.
Lecture: Functions that return a value. Examples: area, divisibility, absolute value.
Iteration - the while statement. Here's an example.
Reading: Chapter 5,
chapter 6
Monday, 2/3
Wednesday, 2/3
Reading: Chapter 5.
Reading: Chapter 5.
Monday, 2/3
Lecture: Functions that return a value. Examples: area, divisibility, absolute value.
Reading: Chapter 5.
Week 3:
Monday, 2/1
Lecture: Conditionals - the if statement boolean variables, conditionals, sort names, letter grade calculator, a better version of letter grade.
Reading: Chapter 4.
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables, conditionals, sort names, letter grade calculator, a better version of letter grade.
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables.
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables, conditionals, sort names, letter grade calculator, a better version of letter grade.
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables, conditionals, sort names, letter grade calculator, a better version of letter grade.
Reading: Chapter 4.
Friday, 1/29
Lecture: Functions - continued local variables, conditionals - the if statement boolean variables, conditionals, sort names, letter grade calculator, a better version of letter grade.
Lecture: Functions [ slides ]. draw_rectangle, celsius2fahrenheit, functions.
Lecture: Functions [ slides ]. draw_rectangle, celsius2fahrenheit, functions.
Wednesday, 1/27
Lecture: Functions [ slides ]. draw_rectangle, celsius2fahrenheit, functions.
Reading: Chapter 3.
Wed, 1/20
Wednesday, 1/20
Fri, 1/22
Friday, 1/22
Week 1:
Week 1:
Week 2:
Monday, 1/25
Lecture: Python expressions, and input. Putting it together: Celsius to fahreheit converter
Lab: lab1
Assignments: Assignment1
Week 2:
Lecture: Python expressions, and input.
Lab: lab1
Assignments: Assignment1
Lab: lab1
Lab: lab1
Assignments: Assignment1
Lecture: Python expressions, and input.
Lecture: Python expressions, and input.
Lab: lab1
Lecture: Pythonexpressions, and input.
Lecture: Python expressions, and input.
Lecture: Our first program, programming errors, Python types, variables, expressions, and input.
Lecture: Our first program, programming errors, Python types, variables
Week 2:
Lecture: Pythonexpressions, and input.
Lecture: Our FirstProgram, programming errors, Python types, variables, expressions, and input.
Lecture: Our first program, programming errors, Python types, variables, expressions, and input.
Lectures: Course introduction; why programming? [ slides ]
Lecture: Course introduction; why programming? [ slides ]
Fri, 1/22
Lecture: Our FirstProgram, programming errors, Python types, variables, expressions, and input.
Reading: Chapter 2.
Week 1:
Wed, 1/20
Week 1:
Wed, 1/20
Week 1: 1/20
Week 1:
Wed, 1/20
Assignments: Coming soon
Lectures: Course introduction; why programming?
Lectures: Course introduction; why programming? [ slides ]
Lectures: Course introduction;
Reading:
Lectures: Course introduction; why programming?
Reading: Chapter 1 in How to think like a computer scientist.
Week 1: 8/25
Lectures: Course introduction; cs160 recap
[ slides ] (updated)
Reading: 160 material: chapters 1-4, 7 in the Java book.
Recitation: cs160 recap?
Assignments: First programming assignment is available
Week 2: 9/1
Lectures: Java classes, objects, and object oriented programming
[ slides ]. Here's the code for the Die? class. Quiz on Thu.
Reading: Chapter 5 in the Java book.
Recitation: Getting familiar with Classes?
Assignments: Programming assignment is available
Week 3: 9/8
Lectures: More on Java classes [ slides ] (updated thu). The code for the Account? class. Quiz on Thu.
Reading: Chapters 5-6 in Savitch (5 in Lewis).
Recitation: More on Classes?
Week 4: 9/15
Lectures: Assertions, pre/post conditions [ slides ]. Javadoc commenting of code. Here's an example?. ArrayList [ slides ]. Here's the example? we worked on in class . Quiz on Thu.
Reading: Assertions - chapter 4.2 in Savitch. ArrayList - chapter 12.1 in Savitch;
Recitation: A Break from Classes?
Week 5: 9/22
Lectures: Recursion [ slides ]. Quiz on Thu. More recursion [ slides ]. The maze? example.
Reading: Chapter 11 in Savitch, or Chapter 12 in Lewis, or Chapter 3 in Walls and Mirrors.
Recitation: Recursion?
Week 6: 9/29
Lectures: Counting [ slides ]. Midterm on Thu.
Reading: Chapter 5 in Rosen.
Recitation: Recursion?
Week 7: 10/6
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ] (updated on thursday). Quiz on Thu.
Reading: Chapter 5 in Rosen.
Recitation: Enumeration and Counting?
Week 8: 10/13
Lectures: Induction [ slides ]. Quiz on Thu.
Reading: Chapter 4.1,4.2 in Rosen.
Assignments: A written assignment on induction is available
Week 9: 10/20
Lectures: Inheritance [ slides ]. Inheritance and polymorphism [ slides ] Quiz on Thu.
Reading: Chapter 8 in either of the Java books.
Recitation: Inheritance?
Week 10: 10/27
Lectures: Interfaces [ slides ]. (updated after thursday's class) [ Code ] for the StaffMember/Employee etc. example. Quiz on Thu.
Reading: Chapter 8 in Savitch, chapter 9 in Lewis.
Recitation: Interfaces?
Week 11: 11/3
Lectures: Midterm on Tue. Static again [ slides ]. Linked lists [ 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 [ slides ] (updated on wed). Linked list code? and doubly linked list code?.
Reading: Chapter 5 in Walls and Mirrors, 12.1 in Savitch, 14.4 in Lewis.
Recitation: Linked Lists?
Week 13: 11/17
Lectures: Sorting [ slides ] (updated on thu) Here's a nice java applet that illustrates the sorting algorithms we looked at. Obama being asked about sorting
Reading: Chapter 13 in Lewis, Chapter 10 in Walls and Mirrors
Recitation: Sorting?
Week 14: 12/1
Lectures: Java packages [ slides ]. JUnit and testing [ slides ]. Graphics, GUI and Applets in Java [ slides ] and [ code ]
Reading: Packages: Chapter 11 in Lewis, 6.7 in Savitch. Lewis covers version 3 of JUnit.
Recitation: JUnit?
Week 15: 12/8
Lectures: Java Graphics, GUI and Applets - continued (tuesday). Review (thursday).
Recitation: Programming final.
Week 1: 1/20
Lectures: Course introduction;
Reading:
Assignments: Coming soon
Week 15: 12/8
Lectures: Java Graphics, GUI and Applets - continued (tuesday). Review (thursday).
Recitation: Programming final.
Lectures: Java packages [ slides ]. JUnit and testing [ slides ]. Graphics, GUI and Applets in Java [ slides ]
Lectures: Sorting [ slides ] (updated on thu) Here's a nice java applet that illustrates the sorting algorithms we looked at
Lectures: Sorting [ slides ] (updated on thu) Here's a nice java applet that illustrates the sorting algorithms we looked at. Obama being asked about sorting
Lectures: Sorting [ slides ] (updated on thu)
Lectures: Sorting [ slides ] (updated on thu) Here's a nice java applet that illustrates the sorting algorithms we looked at
Lectures: Sorting [ slides ]
Lectures: Sorting [ slides ] (updated on thu)
Week 13: 11/17
Lectures: Sorting [ slides ]
Reading: Chapter 13 in Lewis, Chapter 10 in Walls and Mirrors
Recitation:
Lectures: Linked lists [ slides ] (updated on wed)
Lectures: Linked lists [ slides ]
Lectures: Linked lists [ slides ] (updated on wed)
Week 12: 11/10
Lectures: Linked lists [ slides ]
Reading: Chapter 5 in Walls and Mirrors, 12.1 in Savitch, 14.4 in Lewis.
Recitation: Interfaces?
Recitation: Interfaces?
Week 11: 11/3
Lectures: Midterm on Tue. Static again [ slides ]. Linked lists [ slides ]
Reading: Chapter 5 in Walls and Mirrors, 12.1 in Savitch, 14.4 in Lewis.
Recitation: Programming quiz
Lectures: Interfaces [ slides ]. Quiz on Thu.
Week 9: 10/27
Week 10: 10/27
Week 9: 10/27
Lectures: Interfaces [ slides ]. Quiz on Thu.
Reading: Chapter 8 in Savitch, chapter 9 in Lewis.
Lectures: Inheritance [ slides ]. Quiz on Thu.
Week 9: 10/20
Lectures: Inheritance [ slides ]. Quiz on Thu.
Reading: Chapter 8 in either of the Java books.
Assignments: A written assignment on induction is available
Reading: Chapter 11 in Savitch, or Chapter 12 in Lewis, or Chapter 3 in Walls and Mirrors.
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.
Reading: Chapter 5 in Rosen.
Reading: Chapter 5 in Rosen.
Week 8: 10/13
Lectures: Induction [ slides ]. Quiz on Thu.
Reading: Chapter 4.1,4.2 in Rosen.
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ]. Quiz on Thu.
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ] (updated on thursday). Quiz on Thu.
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ]. Midterm on Thu.
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ]. Quiz on Thu.
Week 7: 10/6
Lectures: Permutations, r-permutation, combinations, and the traveling salesman problem [ slides ]. Midterm on Thu.
Reading: Chapter 5 in Rosen.
Week 6: 9/29
Lectures: Counting [ slides ]. Midterm on Thu.
Reading: Chapter 5 in Rosen.
Lectures: Recursion [ slides ]. Quiz on Thu.
Week 5: 9/22
Lectures: Recursion [ slides ]. Quiz on Thu.
Reading: Chapter 11 in Savitch, or Chapter 12 in Lewis, or Chapter 3 in Walls and Mirrors.
Lectures: Assertions, pre/post conditions [ slides ]. Javadoc commenting of code. Here's an example?. ArrayList [ slides ]. Quiz on Thu.
Lectures: Assertions, pre/post conditions [ slides ]. Javadoc commenting of code. Here's an example?. Quiz on Thu.
Reading: Assertions - chapter 4.2 in Savitch.
Recitation:
Recitation: A Break from Classes?
Lectures: More on Java classes [ slides ]. Quiz on Thu.
Week 4: 9/8
Week 3: 9/8
Week 3: 9/15
Week 4: 9/15
Week 3: 9/8
Week 4: 9/8
Week 3: 9/15
Lectures: More on Java classes [ slides ]. Quiz on Thu.
Reading: Assertions - chapter 4.2 in Savitch.
Recitation:
Recitation:
Recitation: More on Classes?
Lectures: More on Java classes [ slides ]. Quiz on Thu.
Recitation: Getting familiar with Classes?
Recitation: Getting familiar with Classes?
Assignments: Programming assignment is available
Week 3: 9/8
Lectures: More on Java classes [ slides ]. Quiz on Thu.
Reading: Chapters 5-6 in Savitch (5 in Lewis).
Recitation:
Week 1: 8/25
Week 2: 9/1
Week 1: 8/25
Lectures: Java classes, objects, and object oriented programming
[ slides ] (updated)
Reading: Chapter 5 in the Java book.
[ slides ]
Reading: 160 material: chapters 1-4, 7 in the Java book.
Recitation: cs160 recap?
Lectures: Course introduction; cs160 recap [ slides ]
Reading: Chapter 1 in Walls and Mirrors.
Lectures: Course introduction; cs160 recap
Reading: Chapter 4 in Walls and Mirrors.
Reading: Chapter 1 in Walls and Mirrors.
Week 1: 1/21 - 1/23
Lectures: Course introduction; abstract data types (ADTs) [ slides ]
Week 1: 8/25
Lectures: Course introduction; cs160 recap [ slides ]
Recitation: No recitations this week
Recitation:
Week 2: 1/26 - 1/30
Lectures: Measuring the efficiency of algorithms [ 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 [ slides ]
Reading: chapters 7 and 8 in Walls and Mirrors
Recitation: Review of big-O analysis, generics, stacks
Assignments: Second programming assignment is available
Week 4: 2/9 - 2/13
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquer strategies; evaluating complexity of recursive algorithms [ 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 available
Week 6: 2/23 - 2/27
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees
[ 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 [ slides ]
Reading: Walls and Mirrors ch. 12.2
Recitation: More iterators
Week 9: 3/23 - 3/27
Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett. Friday: Balanced search trees [ 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 [ slides ]
Reading: Walls and Mirrors ch. 13; ch. 14.1-14.2
Recitation: programming quiz. You will use the binary tree and tree node classes.
Week 11: 4/6 - 4/10
Lectures: Monday: graphs (cont). Wednesday: midterm. Friday: more graphs [ 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 [ slides ], relations [ 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 [ slides ]
hash tables [ 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 [ 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.
Week 16:
Wed -- special review session 1-3pm at CSB130. Thu -- final exam at 7am.
Week 15: 5/4 - 5/8
Lectures: hash tables (cont); discussion of final [ slides ]
Reading: Walls and Mirrors ch. 13
Recitation: Programming part of final.
hash tables [ slides ]
hash tables [ slides ]
Reading: Walls and Mirrors ch. 14
hash tables [ slides ]
Reading: Walls and Mirrors ch. 14 (graphs), 13 (hash tables)
Lectures: Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ slides ]
Lectures: Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ slides ]
Lectures: Dijkstra's algorithm, more problems on graphs [ slides ]
Lectures: Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ slides ]
Lectures: Relations, Dijkstra's algorithm, more problems on graphs [ slides ]
Reading: Walls and Mirrors ch. 14, Rosen 8.1-8.5 (relations)
Lectures: Dijkstra's algorithm, more problems on graphs [ slides ]
Reading: Walls and Mirrors ch. 14
Week 13: 4/27 - 5/1
Week 14: 4/27 - 5/1
Week 13: 4/27 - 5/1
Lectures: Relations, Dijkstra's algorithm, more problems on graphs [ slides ]
Reading: Walls and Mirrors ch. 14, Rosen 8.1-8.5 (relations)
Recitation: Review of relations and grammars.
Lectures: graphs - directed acyclic graphs and topological sorting of graphs; graph algorithms [ slides ]
Reading: Walls and Mirrors ch. 14
Lectures: graphs - directed acyclic graphs and topological sorting of graphs
Lectures: graphs - directed acyclic graphs and topological sorting of graphs; graph algorithms [ slides ]
Week 12: 4/13 - 4/17
Lectures: graphs - directed acyclic graphs and topological sorting of graphs
Reading: Walls and Mirrors ch. 14
Recitation: Implementing graphs.
Lectures: Monday: graphs (cont). Wednesday: midterm. Friday: more graphs
Lectures: Monday: graphs (cont). Wednesday: midterm. Friday: more graphs [ slides ]
Reading: Walls and Mirrors ch. 13; beginning ch. 14
Reading: Walls and Mirrors ch. 13; ch. 14.1-14.2
Lectures: Balanced search trees (cont). Friday: graphs
Lectures: Balanced search trees (cont). Friday: graphs [ slides ]
Lectures: Balanced search trees (cont)
Reading: Walls and Mirrors ch. 13
Lectures: Balanced search trees (cont). Friday: graphs
Reading: Walls and Mirrors ch. 13; beginning ch. 14
Week 11: 4/6 - 4/10
Lectures: Monday: graphs (cont). Wednesday: midterm. Friday: more graphs
Reading: Walls and Mirrors ch. 14
Recitation: help with programming assignment, go over written hw, command-line arguments, review for midterm
Reading: Walls and Mirrors ch. 6.2
Reading: Walls and Mirrors ch. 6.2, ch. 12,13
Week 10: 3/30 - 4/3
Lectures: Balanced search trees (cont)
Reading: Walls and Mirrors ch. 13
Recitation: programming quiz. You will use the binary tree and tree node classes.
Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett Friday: Balanced search trees [ slides ]
Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett
Recitation:
Recitation: implementing a heap
Lectures: Priority queues and heaps [ slides ] grammars [ slides ]
Reading: Walls and Mirrors ch. 12.2, ch. 6.2
Lectures: Priority queues and heaps [ slides ]
Reading: Walls and Mirrors ch. 12.2
Week 9: 3/23 - 3/27
Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett
Reading: Walls and Mirrors ch. 6.2
Recitation:
Lectures: Priority queues and heaps [ slides ]
Reading: Walls and Mirrors ch. 12.2
Lectures: Priority queues and heaps slides ]
Lectures: Priority queues and heaps [ slides ]
Recitation: recursion
Recitation: recursion
Week 8: 3/9 - 3/13
Lectures: Priority queues and heaps slides ]
Reading: Walls and Mirrors ch. 12.2
Recitation: More iterators
Reading: Walls and Mirrors ch. 11
Reading: Walls and Mirrors ch. 11
Week 7: 3/2 - 3/6
Lectures: Trees, binary search trees (cont)
Reading: Walls and Mirrors ch. 11
Recitation: Iterators, recursion
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees ]
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees
[ slides ]
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees [ slides ]
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees ]
Week 5: 2/23 - 2/27
Week 6: 2/23 - 2/27
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees slides ]
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees [ slides ]
Week 5: 2/23 - 2/27
Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees slides ]
Reading: Walls and Mirrors ch. 11
Recitation: Review for midterm, recursion
Recitation:
Recitation: recursion Assignments: Second written assignment is available
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:
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms [ slides ]
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquer strategies; evaluating complexity of recursive algorithms [ slides ]
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms [ slides ]
Week 4: 2/2 - 2/6
Lecture: [ slides ] Reading: Walls and Mirrors 10.2, Rosen 7.1, 7.3
Week 4: 2/9 - 2/13
Recitation: Review of big-O analysis, generics, stacks
Recitation: Programming a queue; work on programming assignment
Week 4: 2/2 - 2/6
Lecture: [ slides ] Reading: Walls and Mirrors 10.2, Rosen 7.1, 7.3
Lectures: Queues (cont). Advanced sorting algorithms using divide and conquor strategies; evaluating complexity of recursive algorithms
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, stacks
Assignments: Second programming assignment is available
Recitation: Review of big-O analysis, generics
Recitation: Review of big-O analysis, generics, stacks
Lectures: Course introduction; abstract data types (ADTs) [ slides ]
Lectures: Course introduction; abstract data types (ADTs) [ slides ]
Lectures: Measuring the efficiency of algorithms [ slides ]
Lectures: Measuring the efficiency of algorithms [ slides ]
Week 3: 2/2 - 2/6
Lectures: Stacks and Queues [ slides ]
Reading: chapters 7 and 8 in Walls and Mirrors
Recitation: Review of big-O analysis, generics
Recitation: Using checkin, review of linked lists, file IO, help on programming assignment
Recitation: Using checkin, review of linked lists, help on programming assignment
Recitation: Using checkin, review of linked lists and file IO
Recitation: Using checkin, review of linked lists, file IO, help on programming assignment
Week 1: 1/26 - 1/30
Week 2: 1/26 - 1/30
Recitation:
Recitation: Using checkin, review of linked lists and file IO
Reading: Sections 3.2,3.3 in Rose, Section 10.1 in Walls and Mirrors.
Reading: Sections 3.2,3.3 in Rosen, Section 10.1 in Walls and Mirrors.
Week 1: 1/26 - 1/30
Reading: Sections 3.2,3.3 in Rose, Section 10.1 in Walls and Mirrors.
Lectures: Measuring the efficiency of algorithms [ slides ]
Recitation:
Lectures: Course introduction; abstract data types (ADTs) slides
Lectures: Course introduction; abstract data types (ADTs) [ slides ]
Lectures: Course introduction; abstract data types (ADTs)
Lectures: Course introduction; abstract data types (ADTs) slides
Reading: Chapter 4 in Walls and Mirrors.
Reading: Chapter 4 in Walls and Mirrors.
Recitation: No recitations this week
Recitation: No recitations this week
Lectures: Course introduction; abstract data types (ADTs)
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 Assignments: First programming assignment is available
Week 1: 1/21 - 8/23
Week 1: 1/21 - 1/23
Week 1: 8/25 - 8/29
Week 1: 1/21 - 8/23
Coming soon!
Week 1: 8/25 - 8/29
Coming soon!
