Main.Schedule History
Hide minor edits - Show changes to markup
Week 15: 12/8
Lectures: Project presentations
Lectures: Learning from data [ slides ]
Lectures: Learning from data [ slides ] (modified on thu)
Lectures: Bayesian networks [ slides ]
Lectures: Inference in Bayesian networks [ slides ]. Approximate inference and learning in Bayesian networks [ slides ]
Week 13: 11/17
Lectures: Learning from data [ slides ]
Reading: Russell and Norvig, chapter 20.
Week 11: 11/10
Week 12: 11/10
Week 10: 10/20
Week 10: 10/27
Reading: Russell and Norvig, chapter .
Week 11: 10/20
Reading: Russell and Norvig, chapter 13.
Week 11: 11/3
Lectures: First order logic [ slides ].
Lectures: First order logic [ slides ]
Lectures: Logical agents [ slides ].
Week 6: 10/6
Lectures: Logical agents [ slides ].
Week 7: 10/6
Lectures: Logical agents [ slides ].
Week 6: 10/6
Lectures: Logical agents [ slides ].
Reading: Russell and Norvig, chapter 7.
Lectures: Games [ slides ].
Reading: Russell and Norvig, chapter 6.
Lectures: Global optimization [ slides ].
Lectures: Global optimization [ slides ].
Lectures: Uniformed search methods [ slides ]
Lectures: Uninformed search methods [ slides ]
Week 2: 9/1
Week 3: 9/8
Reading: Russell and Norvig, chapter 2.
Reading: Russell and Norvig, chapters 2,3.
Lectures: Agents [ slides ]
Lectures: Agents [ slides ]
Python tutorial: Wed 4pm, Thu 4pm
Python tutorial: Wed 4pm, Thu 4pm
Lectures: Agents [ slides ]
Lectures: Agents [ slides ]
Lectures: Agents [ slides ]
Lectures: Agents [ slides ]
Week 2: 9/1
Lectures: Agents [ slides ]
Reading: Russell and Norvig, chapter 2.
Lectures: Course introduction; cs160 recap
Lectures: Course overview, what is AI?
[ slides ]
Reading: Russell and Norvig, chapter 1.
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!
