CS200 - Schedule

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 [ 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 [ slides ]

to:

hash tables [ 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 [ 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 [ slides ]

to:

Lectures: Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ slides ]

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

Changed line 80 from:

Lectures: Dijkstra's algorithm, more problems on graphs [ slides ]

to:

Lectures: Dijkstra's algorithm (slides in the graph algorithms set), more problems on graphs [ 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 [ slides ] Reading: Walls and Mirrors ch. 14, Rosen 8.1-8.5 (relations)

to:

Lectures: Dijkstra's algorithm, more problems on graphs [ 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 [ 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 [ slides ]
Reading: Walls and Mirrors ch. 14

to:

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)

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 [ 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 [ 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 [ 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 binary tree and tree node classes.

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

Changed line 55 from:

Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett Friday: Balanced search trees [ slides ]

to:

Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett. Friday: Balanced search trees [ slides ]

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

Changed line 55 from:

Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett

to:

Lectures: Monday: grammars [ slides ] Wednesday: Working in teams - a talk by Debbie Bartlett Friday: Balanced search trees [ 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 [ slides ] grammars [ slides ]
Reading: Walls and Mirrors ch. 12.2, ch. 6.2

to:

Lectures: Priority queues and heaps [ slides ]
Reading: Walls and Mirrors ch. 12.2

Added lines 52-57:

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:

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

Changed lines 49-50 from:

Lectures: Priority queues and heaps [ slides ]
Reading: Walls and Mirrors ch. 12.2

to:

Lectures: Priority queues and heaps [ slides ] grammars [ 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 slides ]

to:

Lectures: Priority queues and heaps [ 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 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 ]

to:

Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees
[ slides ]

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

Changed line 37 from:

Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees [ slides ]

to:

Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees ]

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 slides ]

to:

Lectures: Wednesday: Midterm. Mon, Fri: Trees, binary search trees [ 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 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 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 [ slides ]

to:

Lectures: Queues (cont). Advanced sorting algorithms using divide and conquer strategies; evaluating complexity of recursive algorithms [ 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 [ 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 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) [ slides ]

Deleted line 4:

Lectures: Course introduction; abstract data types (ADTs) [ slides ]

Added line 10:

Lectures: Measuring the efficiency of algorithms [ slides ]

Deleted line 11:

Lectures: Measuring the efficiency of algorithms [ slides ]

Added lines 13-19:

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

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 [ slides ]
Recitation:

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

Changed line 4 from:

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

to:

Lectures: Course introduction; abstract data types (ADTs) [ 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) 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 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

Week 16:

Week 15: 5/4 - 5/8

Week 13: 4/27 - 5/1

Week 14: 4/27 - 5/1

Week 13: 4/27 - 5/1

Week 12: 4/13 - 4/17

Week 11: 4/6 - 4/10

Week 10: 3/30 - 4/3

Week 9: 3/23 - 3/27

Week 8: 3/9 - 3/13

Week 7: 3/2 - 3/6

Week 5: 2/23 - 2/27

Week 6: 2/23 - 2/27

Week 5: 2/23 - 2/27

Week 5: 2/16 - 2/20

Week 4: 2/2 - 2/6

Week 4: 2/9 - 2/13

Week 4: 2/2 - 2/6

Week 3: 2/2 - 2/6

Week 1: 1/26 - 1/30

Week 2: 1/26 - 1/30

Week 1: 1/26 - 1/30

Week 1: 1/21 - 8/23

Week 1: 1/21 - 1/23

Week 1: 8/25 - 8/29

Week 1: 1/21 - 8/23

Week 1: 8/25 - 8/29