CS440 - Schedule

December 07, 2009, at 07:36 PM MST by 71.237.92.151 -

Changed lines 81-82 from:

to:

!!!Week 15: 12/8

''Lectures:'' Project [[PresentationSchedule | presentations]]

November 30, 2009, at 11:33 AM MST by 129.82.44.241 -

Added lines 73-78:

''Reading:'' Russell and Norvig, chapter 20.\\

!!!Week 14: 12/1

''Lectures:'' Statistical learning [ [[Path:../../pdfs/18_statistical_learning.pdf | slides]] ] and decision trees [ [[Path:../../pdfs/19_decision_trees.pdf | slides]] ] \\

November 19, 2009, at 02:11 PM MST by 129.82.44.241 -

Changed line 72 from:

''Lectures:'' Learning from data [ [[Path:../../pdfs/17_learning.pdf | slides]] ] \\

to:

''Lectures:'' Learning from data [ [[Path:../../pdfs/17_learning.pdf | slides]] ] (modified on thu) \\

November 17, 2009, at 02:49 PM MST by 129.82.44.241 -

Changed line 66 from:

''Lectures:'' Bayesian networks [ [[Path:../../pdfs/15_bayesian_networks_exact_inference.pdf | slides]] ] \\

to:

''Lectures:'' Inference in Bayesian networks [ [[Path:../../pdfs/15_bayesian_networks_exact_inference.pdf | slides]] ]. Approximate inference and learning in Bayesian networks [ [[Path:../../pdfs/16_bayesian_networks_approximate_inference.pdf | slides]] ]\\

Added lines 68-73:

!!!Week 13: 11/17

''Lectures:'' Learning from data [ [[Path:../../pdfs/17_learning.pdf | slides]] ] \\
''Reading:'' Russell and Norvig, chapter 20.\\

November 11, 2009, at 10:10 AM MST by 129.82.44.241 -

Changed line 64 from:

!!!Week 11: 11/10

to:

!!!Week 12: 11/10

November 11, 2009, at 10:10 AM MST by 129.82.44.241 -

Added lines 62-66:

''Reading:'' Russell and Norvig, chapter 14.\\

!!!Week 11: 11/10

''Lectures:'' Bayesian networks [ [[Path:../../pdfs/15_bayesian_networks_exact_inference.pdf | slides]] ] \\

November 03, 2009, at 11:36 AM MST by 129.82.44.241 -

Changed lines 54-55 from:

!!!Week 10: 10/20

to:

!!!Week 10: 10/27

Changed lines 57-59 from:

''Reading:'' Russell and Norvig, chapter .\\

!!!Week 11: 10/20

to:

''Reading:'' Russell and Norvig, chapter 13.\\

!!!Week 11: 11/3

November 03, 2009, at 11:33 AM MST by 129.82.44.241 -

Added lines 53-65:

!!!Week 10: 10/20

''Lectures:'' Inference in first order logic, continued. Agents in an uncertain environment [ [[Path:../../pdfs/13_uncertainty.pdf | slides]] ] \\
''Reading:'' Russell and Norvig, chapter .\\

!!!Week 11: 10/20

''Lectures:'' Bayesian networks [ [[Path:../../pdfs/14_bayesian_networks.pdf | slides]] ] \\
''Reading:'' Russell and Norvig, chapter 14.\\

October 21, 2009, at 06:02 PM MST by 71.237.92.151 -

Changed line 44 from:

''Lectures:'' First order logic [ [[Path:../../pdfs/12_fol1.pdf | slides]] ]. Inference in first order logic [ [[Path:../../pdfs/12_fol2.pdf | slides]] ] \\

to:

''Lectures:'' First order logic [ [[Path:../../pdfs/12_fol1.pdf | slides]] ]. \\

Added lines 48-52:

!!!Week 9: 10/20

''Lectures:'' Midterm. Inference in first order logic [ [[Path:../../pdfs/12_fol2.pdf | slides]] ] \\
''Reading:'' Russell and Norvig, chapter 9.\\
''Assignments:'' Assignment 5 is [[assignments | available]].

October 14, 2009, at 08:36 PM MST by 71.237.92.151 -

Changed line 44 from:

''Lectures:'' First order logic [ [[Path:../../pdfs/12_fol1.pdf | slides]] ] \\

to:

''Lectures:'' First order logic [ [[Path:../../pdfs/12_fol1.pdf | slides]] ]. Inference in first order logic [ [[Path:../../pdfs/12_fol2.pdf | slides]] ] \\

October 12, 2009, at 11:49 AM MST by 129.82.44.241 -

Added lines 41-46:

!!!Week 8: 10/13

''Lectures:'' First order logic [ [[Path:../../pdfs/12_fol1.pdf | slides]] ] \\
''Reading:'' Russell and Norvig, chapter 8.\\
''Assignments:'' Assignment 4 is [[assignments | available]].

October 07, 2009, at 01:18 PM MST by 129.82.44.241 -

Changed line 38 from:

''Lectures:'' Logical agents [ [[Path:../../pdfs/11_logic1.pdf | slides]] ]. \\

to:

''Lectures:'' Logical agents using propositional logic [ [[Path:../../pdfs/11_logic1.pdf | slides]] ] and more [ [[Path:../../pdfs/11_logic2.pdf | slides]] ]. \\

October 06, 2009, at 02:47 PM MST by 129.82.44.241 -

Changed lines 36-38 from:

!!!Week 6: 10/6

''Lectures:'' Logical agents [ [[Path:../../pdfs/11_logic.pdf | slides]] ]. \\

to:

!!!Week 7: 10/6

''Lectures:'' Logical agents [ [[Path:../../pdfs/11_logic1.pdf | slides]] ]. \\

October 06, 2009, at 02:47 PM MST by 129.82.44.241 -

Added lines 34-40:

!!!Week 6: 10/6

''Lectures:'' Logical agents [ [[Path:../../pdfs/11_logic.pdf | slides]] ]. \\
''Reading:'' Russell and Norvig, chapter 7.\\

October 01, 2009, at 06:52 PM MST by 71.237.92.151 -

Changed line 31 from:

''Lectures:'' Games [ [[Path:../../pdfs/09_games.pdf | slides]] ]. Constraint satisfaction problems [ [[Path:../../pdfs/09_games.pdf | slides]] ]\\

to:

''Lectures:'' Games [ [[Path:../../pdfs/09_games.pdf | slides]] ]. Constraint satisfaction problems [ [[Path:../../pdfs/10_csp.pdf | slides]] ]\\

September 28, 2009, at 02:50 PM MST by 129.82.44.241 -

Changed lines 31-32 from:

''Lectures:'' Games [ [[Path:../../pdfs/09_games.pdf | slides]] ].\\
''Reading:'' Russell and Norvig, chapter 6.\\

to:

''Lectures:'' Games [ [[Path:../../pdfs/09_games.pdf | slides]] ]. Constraint satisfaction problems [ [[Path:../../pdfs/09_games.pdf | slides]] ]\\
''Reading:'' Russell and Norvig, chapters 5,6.\\

September 28, 2009, at 11:06 AM MST by 129.82.44.241 -

Added lines 28-34:

!!!Week 6: 9/29

''Lectures:'' Games [ [[Path:../../pdfs/09_games.pdf | slides]] ].\\
''Reading:'' Russell and Norvig, chapter 6.\\
''Assignments:'' Assignment 3 is [[assignments | available]].

September 22, 2009, at 02:29 PM MST by 129.82.44.241 -

Changed line 26 from:

''Lectures:'' Global optimization [ [[Path:../../pdfs/08_global_optimization.pdf | slides]] ].

to:

''Lectures:'' Global optimization [ [[Path:../../pdfs/08_global_optimization.pdf | slides]] ].\\

September 22, 2009, at 02:29 PM MST by 129.82.44.241 -

Added lines 22-26:

''Reading:'' Russell and Norvig, chapter 4.\\

!!!Week 5: 9/22

''Lectures:'' Global optimization [ [[Path:../../pdfs/08_global_optimization.pdf | slides]] ].

September 14, 2009, at 07:20 PM MST by 67.162.146.156 -

Changed line 16 from:

''Lectures:'' Uniformed search methods [ [[Path:../../pdfs/05_uninformed_search.pdf | slides]] ]\\

to:

''Lectures:'' Uninformed search methods [ [[Path:../../pdfs/05_uninformed_search.pdf | slides]] ]\\

Added lines 18-22:

!!!Week 4: 9/15

''Lectures:'' Informed search [ [[Path:../../pdfs/06_informed_search.pdf | slides]] ]. Local search [ [[Path:../../pdfs/07_local_search.pdf | slides]] ]. \\
''Reading:'' Russell and Norvig, chapter 4.\\

September 09, 2009, at 07:55 PM MST by 67.162.146.156 -

Changed line 14 from:

!!!Week 2: 9/1

to:

!!!Week 3: 9/8

September 09, 2009, at 07:55 PM MST by 67.162.146.156 -

Changed lines 12-17 from:

''Python tutorial:'' Wed 4pm, Thu 4pm [ [[Attach: python_slides.odp | Slides]] ], [ [[Attach: python_code | Examples]] ], [ [[Attach: python_example | Exercise]] ], [ [[Attach: python_solution | Solution]] ]

to:

''Python tutorial:'' Wed 4pm, Thu 4pm [ [[Attach: python_slides.odp | Slides]] ], [ [[Attach: python_code | Examples]] ], [ [[Attach: python_example | Exercise]] ], [ [[Attach: python_solution | Solution]] ]

!!!Week 2: 9/1

''Lectures:'' Uniformed search methods [ [[Path:../../pdfs/05_uninformed_search.pdf | slides]] ]\\
''Reading:'' Russell and Norvig, chapter 3.\\

September 03, 2009, at 09:48 PM MST by 67.162.146.156 -

Changed line 11 from:

''Reading:'' Russell and Norvig, chapter 2.\\

to:

''Reading:'' Russell and Norvig, chapters 2,3.\\

September 03, 2009, at 09:47 PM MST by 67.162.146.156 -

Changed line 10 from:

''Lectures:'' Agents [ [[Path:../../pdfs/03_agents.pdf | slides]] ] Search [ [[Path:../../pdfs/04_search.pdf | slides]]\\

to:

''Lectures:'' Agents [ [[Path:../../pdfs/03_agents.pdf | slides]] ] Search [ [[Path:../../pdfs/04_search.pdf | slides]] ]\\

September 03, 2009, at 09:47 PM MST by 67.162.146.156 -

Changed line 10 from:

''Lectures:'' Agents [ [[Path:../../pdfs/03_agents.pdf | slides]] ]\\

to:

''Lectures:'' Agents [ [[Path:../../pdfs/03_agents.pdf | slides]] ] Search [ [[Path:../../pdfs/04_search.pdf | slides]]\\

September 03, 2009, at 07:22 AM MST by 67.162.146.156 -

Changed line 10 from:

''Lectures:'' Agents [ [[Path:../../pdfs/02_agents.pdf | slides]] ]\\

to:

''Lectures:'' Agents [ [[Path:../../pdfs/03_agents.pdf | slides]] ]\\

September 02, 2009, at 01:17 PM MST by 129.82.46.127 -

Changed line 12 from:

''Python tutorial:'' Wed 4pm, Thu 4pm

to:

''Python tutorial:'' Wed 4pm, Thu 4pm [ [[Attach: python_slides.odp | Slides]] ], [ [[Attach: python_code | Examples]] ], [ [[Attach: python_example | Exercise]] ], [ [[Attach: python_solution | Solution]] ]

September 02, 2009, at 12:44 PM MST by 129.82.44.241 -

Added line 12:

''Python tutorial:'' Wed 4pm, Thu 4pm

September 02, 2009, at 09:42 AM MST by 75.166.12.157 -

Changed line 10 from:

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

to:

''Lectures:'' Agents [ [[Path:../../pdfs/02_agents.pdf | slides]] ]\\

September 01, 2009, at 02:29 PM MST by 129.82.44.241 -

Changed line 10 from:

''Lectures:'' Agents [ [[Path:../../pdfs/01_intro.pdf | slides]] ]

to:

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

September 01, 2009, at 02:27 PM MST by 129.82.44.241 -

Added lines 7-11:

!!!Week 2: 9/1

''Lectures:'' Agents [ [[Path:../../pdfs/01_intro.pdf | slides]] ]
''Reading:'' Russell and Norvig, chapter 2.\\

August 27, 2009, at 03:01 PM MST by 129.82.44.204 -

Changed line 4 from:

[ [[Path:../../pdfs/01_intro.pdf | slides]] ] intro to python [ [[Path:../../pdfs/02_python.pdf | slides]] ] and some [[Path:../../code/python_examples.py | code]] ]\\

to:

[ [[Path:../../pdfs/01_intro.pdf | slides]] ] intro to python [ [[Path:../../pdfs/02_python.pdf | slides]] ] and some [ [[Path:../../code/python_examples.py | code]] ]\\

August 27, 2009, at 03:01 PM MST by 129.82.44.204 -

Changed line 4 from:

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

to:

[ [[Path:../../pdfs/01_intro.pdf | slides]] ] intro to python [ [[Path:../../pdfs/02_python.pdf | slides]] ] and some [[Path:../../code/python_examples.py | code]] ]\\

August 25, 2009, at 02:44 PM MST by 129.82.44.235 -

Changed line 4 from:

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

to:

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

August 19, 2009, at 12:26 PM MST by 129.82.44.242 -

Changed lines 3-8 from:

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

to:

''Lectures:'' Course overview, what is AI?
[ [[Path:../../pdfs/01introduction.pdf | slides]] ]\\
''Reading:'' Russell and Norvig, chapter 1.\\

August 18, 2009, at 04:00 PM MST by 129.82.44.242 -

Deleted line 8:

>>comment<<

Deleted line 9:

>><<

August 18, 2009, at 03:58 PM MST by 129.82.44.242 -

Changed lines 3-4 from:

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

to:

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

Added line 9:

>>comment<<

Added line 11:

>><<

August 16, 2009, at 08:44 PM MST by 67.176.39.82 -

Changed line 4 from:

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

to:

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

August 16, 2009, at 08:42 PM MST by 67.176.39.82 -

Changed lines 1-3 from:

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

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

to:

!!!Week 1: 8/25

''Lectures:'' Course introduction; cs160 recap [ [[Path:../../pdfs/introduction.pdf | slides]] ]\\

Changed line 5 from:

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

to:

''Recitation:'' \\

Deleted lines 6-94:

!!!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.

May 08, 2009, at 01:36 PM MST by Asa -

Added lines 90-94:

!!!Week 16:

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

May 08, 2009, at 01:34 PM MST by Asa -

Added lines 84-89:

!!!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.

May 01, 2009, at 01:44 PM MST by Asa -

Changed line 81 from:

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

to:

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

May 01, 2009, at 01:43 PM MST by Asa -

Changed lines 81-82 from:

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

to:

hash tables [ [[Path:../../pdfs/hashtables.pdf | slides]] ]
''Reading:'' Walls and Mirrors ch. 14 (graphs), 13 (hash tables) \\

April 29, 2009, at 01:26 PM MST by Asa -

Changed line 80 from:

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

to:

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

April 29, 2009, at 01:09 PM MST by Asa -

Changed line 80 from:

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

to:

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

April 29, 2009, at 01:08 PM MST by Asa -

Changed lines 80-81 from:

''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)\\

to:

''Lectures:'' Dijkstra's algorithm, more problems on graphs [ [[Path:../../pdfs/graphs3.pdf | slides]] ]\\
''Reading:'' Walls and Mirrors ch. 14 \\

April 29, 2009, at 01:07 PM MST by Asa -

Changed line 78 from:

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

to:

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

April 29, 2009, at 01:02 PM MST by Asa -

Added lines 77-82:

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

''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)\\
''Recitation:'' Review of relations and grammars.

April 22, 2009, at 11:35 AM MST by Asa -

Changed lines 74-75 from:

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

to:

''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)\\

April 15, 2009, at 01:43 PM MST by Asa -

Changed line 74 from:

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

to:

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

April 12, 2009, at 03:40 PM MST by Asa -

Added lines 71-76:

!!!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.

April 06, 2009, at 01:00 PM MST by Asa -

Changed line 68 from:

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

to:

''Lectures:'' Monday: graphs (cont). Wednesday: midterm. Friday: more graphs [ [[Path:../../pdfs/graphs2.pdf | slides]] ] \\

April 02, 2009, at 03:59 PM MST by Asa -

Changed line 63 from:

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

to:

''Reading:'' Walls and Mirrors ch. 13; ch. 14.1-14.2\\

April 02, 2009, at 03:58 PM MST by Asa -

Changed line 62 from:

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

to:

''Lectures:'' Balanced search trees (cont). Friday: graphs [ [[Path:../../pdfs/graphs1.pdf | slides]] ] \\

April 02, 2009, at 03:20 PM MST by Asa -

Changed lines 62-63 from:

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

to:

''Lectures:'' Balanced search trees (cont). Friday: graphs \\
''Reading:'' Walls and Mirrors ch. 13; beginning ch. 14\\

Added lines 65-70:

!!!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

March 28, 2009, at 10:44 AM MST by Asa -

Changed line 56 from:

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

to:

''Reading:'' Walls and Mirrors ch. 6.2, ch. 12,13\\

Added lines 58-64:

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

''Lectures:'' Balanced search trees (cont) \\
''Reading:'' Walls and Mirrors ch. 13\\
''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.

March 27, 2009, at 01:36 PM MST by Asa -

Changed line 55 from:

''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]] ] \\

to:

''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]] ] \\

March 27, 2009, at 01:35 PM MST by Asa -

Changed line 55 from:

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

to:

''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]] ] \\

March 24, 2009, at 08:42 AM MST by Asa -

Changed line 57 from:

''Recitation:''

to:

''Recitation:'' implementing a heap

March 23, 2009, at 10:03 AM MST by Asa -

Changed lines 49-50 from:

''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\\

to:

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

Added lines 52-57:

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

''Lectures:'' Monday: grammars [ [[Path:../../pdfs/grammars.pdf | slides]] ] Wednesday: Working in teams - a talk by Debbie Bartlett\\
''Reading:'' Walls and Mirrors ch. 6.2\\
''Recitation:''

March 13, 2009, at 11:54 AM MST by Asa -

Changed lines 49-50 from:

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

to:

''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\\

March 09, 2009, at 01:18 PM MST by Asa -

Changed line 49 from:

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

to:

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

March 09, 2009, at 01:18 PM MST by Asa -

Changed line 32 from:

''Recitation:'' recursion

to:

''Recitation:'' recursion\\

Added lines 46-51:

!!!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

March 04, 2009, at 01:50 PM MST by Asa -

Changed line 44 from:

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

to:

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

March 04, 2009, at 01:50 PM MST by Asa -

Added lines 41-45:

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

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

February 23, 2009, at 01:10 PM MST by Asa -

Changed line 37 from:

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

to:

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

February 23, 2009, at 01:09 PM MST by Asa -

Changed line 37 from:

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

to:

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

February 23, 2009, at 01:09 PM MST by Asa -

Changed line 35 from:

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

to:

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

February 23, 2009, at 01:08 PM MST by Asa -

Changed line 37 from:

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

to:

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

February 23, 2009, at 01:07 PM MST by Asa -

Added lines 34-39:

!!!Week 5: 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

February 18, 2009, at 12:43 PM MST by Asa -

Changed lines 32-34 from:

''Recitation:''

to:

''Recitation:'' recursion
''Assignments:'' Second written assignment is [[assignments | available]]

February 13, 2009, at 11:10 AM MST by Asa -

Added lines 27-32:

!!!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:''

February 11, 2009, at 10:33 AM MST by Asa -

Changed line 24 from:

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

to:

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

February 11, 2009, at 10:16 AM MST by Asa -

Changed line 24 from:

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

to:

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

February 08, 2009, at 01:12 PM MST by Asa -

Added line 19:

Changed lines 22-26 from:

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

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

to:

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

Changed line 26 from:

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

to:

''Recitation:'' Programming a queue; work on programming assignment\\

February 08, 2009, at 01:10 PM MST by Asa -

Deleted line 15:

Added lines 20-28:

!!!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\\

February 08, 2009, at 01:04 PM MST by Asa -

Changed line 19 from:

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

to:

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

February 08, 2009, at 01:03 PM MST by Asa -

Added line 20:

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

February 04, 2009, at 10:42 AM MST by 129.82.47.246 -

Changed line 19 from:

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

to:

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

February 02, 2009, at 06:26 AM MST by Asa -

Added line 3:

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

Deleted line 4:

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

Added line 10:

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

Deleted line 11:

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

Added lines 13-19:

!!!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

February 01, 2009, at 10:53 PM MST by 76.25.18.114 -

Changed line 12 from:

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

to:

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

January 30, 2009, at 12:54 PM MST by Asa -

Changed line 12 from:

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

to:

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

January 30, 2009, at 12:53 PM MST by Asa -

Changed line 8 from:

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

to:

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

January 26, 2009, at 01:30 PM MST by Asa -

Changed line 12 from:

''Recitation:'' \\

to:

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

January 25, 2009, at 09:42 PM MST by Asa -

Changed line 10 from:

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

to:

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

January 25, 2009, at 09:41 PM MST by Asa -

Added lines 7-13:

!!!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 [ [[Path:../../pdfs/complexity.pdf | slides]] ]\\
''Recitation:'' \\

January 21, 2009, at 01:21 PM MST by Asa -

Changed line 4 from:

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

to:

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

January 21, 2009, at 01:20 PM MST by Asa -

Changed line 4 from:

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

to:

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

January 20, 2009, at 10:00 AM MST by Asa -

Changed line 3 from:

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

to:

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

Changed line 5 from:

''Recitation:'' No recitations this week

to:

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

January 20, 2009, at 09:59 AM MST by Asa -

Changed line 4 from:

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

to:

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

January 20, 2009, at 09:59 AM MST by Asa -

Changed lines 3-5 from:

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

to:

''Reading:'' Chapter 4 in Walls and Mirrors.
''Lectures:'' Course introduction; abstract data types (ADTs)
''Recitation:'' No recitations this week
''Assignments:'' First programming assignment is [[assignments | available]]

January 15, 2009, at 03:09 PM MST by Asa -

Changed line 1 from:

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

to:

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

January 15, 2009, at 03:09 PM MST by Asa -

Changed line 1 from:

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

to:

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

January 15, 2009, at 03:08 PM MST by Asa -

Changed lines 1-2 from:

Coming soon!

to:

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

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

December 31, 2008, at 03:43 PM MST by Asa -

Added lines 1-2:

Coming soon!

Main.Schedule History