Main.HomePage History
Hide minor edits - Show changes to output
May 03, 2009, at 12:00 PM MST
by -
Added lines 4-8:
The programming part of the final will be held in recits
during the last week of classes. You will be asked to add a method
to this [[http://www.cs.colostate.edu/~hamiltom/cs200/Graph.java | Graph]]
class.
April 23, 2009, at 03:22 PM MST
by -
Changed line 6 from:
See the [[assignments]] paige for details.
to:
See the [[assignments]] page for details.
April 23, 2009, at 03:22 PM MST
by -
Changed lines 4-15 from:
For programming assignment 4, you can ignore the late message from checkin--I will simply grade the most recent submission without deducting a late penalty.
The classes you will use in the programming quiz next week are posted
on the [[schedule]] page.
The solution to the binary heap recitation has been added to Mike's website. Be
sure to go over the code and bring any questions you have to office hours next week.
Due to weather, recitation on Mar 26 has been canceled.
Due to weather the due date for programming assignment 4 has been moved to Sunday, 3/29. There is NO late period.
The classes you will use in the programming quiz next week are posted
on the [[schedule]] page.
The solution to the binary heap recitation has been added to Mike's website. Be
sure to go over the code and bring any questions you have to office hours next week.
Due to weather, recitation on Mar 26 has been canceled.
Due to weather the due date for programming assignment 4 has been moved to Sunday, 3/29. There is NO late period.
to:
There is an extra credit option available for assignment 6.
See the [[assignments]] paige for details.
March 29, 2009, at 04:31 PM MST
by -
Added line 4:
For programming assignment 4, you can ignore the late message from checkin--I will simply grade the most recent submission without deducting a late penalty.
March 28, 2009, at 10:46 AM MST
by -
Added lines 4-7:
The classes you will use in the programming quiz next week are posted
on the [[schedule]] page.
March 27, 2009, at 05:20 PM MST
by -
Added lines 4-5:
The solution to the binary heap recitation has been added to Mike's website. Be
sure to go over the code and bring any questions you have to office hours next week.
sure to go over the code and bring any questions you have to office hours next week.
March 26, 2009, at 12:59 PM MST
by -
Changed line 7 from:
Due to weather the due date for the assignment has been moved to Sunday, 3/29. There is NO late period.
to:
Due to weather the due date for programming assignment 4 has been moved to Sunday, 3/29. There is NO late period.
March 26, 2009, at 12:58 PM MST
by -
Added lines 6-7:
Due to weather the due date for the assignment has been moved to Sunday, 3/29. There is NO late period.
March 26, 2009, at 11:20 AM MST
by -
Changed lines 5-6 from:
Mike's office hours on Thursday has moved to Wednesdays, 10:00-12:00 in Room 120.
to:
Due to weather, recitation on Mar 26 has been canceled.
February 21, 2009, at 02:37 PM MST
by -
Changed lines 5-6 from:
Mike's office hours on Thursday has moved to Wednesdays, 10:00-12:00 in Room 120. However, I will still be having office hours on 1/29 10:00-12:00 in Room 120 this
week only.
week only.
to:
Mike's office hours on Thursday has moved to Wednesdays, 10:00-12:00 in Room 120.
February 13, 2009, at 01:10 PM MST
by -
February 12, 2009, at 06:51 PM MST
by -
Deleted lines 3-4:
Recitations will not be held the first week of classes
January 28, 2009, at 01:16 PM MST
by -
Changed line 7 from:
Mike's office hours on Thursday has moved to Wednesdays, 10-12p in Room 120. However, I will still be having office hours on 1/29 10-12p in Room 120 this
to:
Mike's office hours on Thursday has moved to Wednesdays, 10:00-12:00 in Room 120. However, I will still be having office hours on 1/29 10:00-12:00 in Room 120 this
January 28, 2009, at 01:11 PM MST
by -
Added lines 6-8:
Mike's office hours on Thursday has moved to Wednesdays, 10-12p in Room 120. However, I will still be having office hours on 1/29 10-12p in Room 120 this
week only.
January 15, 2009, at 09:57 AM MST
by -
Changed line 5 from:
All recitations will be held in the first week of class, incl. the Tuesday recitation. If you missed it, attend one of the other recits.
to:
Recitations will not be held the first week of classes
January 13, 2009, at 01:44 PM MST
by -
Added lines 2-5:
!!!Announcements:
All recitations will be held in the first week of class, incl. the Tuesday recitation. If you missed it, attend one of the other recits.
January 02, 2009, at 11:02 AM MST
by -
Deleted lines 3-4:
added someting
January 02, 2009, at 11:02 AM MST
by -
Added line 5:
added someting
January 01, 2009, at 09:42 PM MST
by -
Changed lines 1-12 from:
Welcome to PmWiki!
A local copy of PmWiki's
documentation has been installed along with the software,
and is available via the [[PmWiki/documentation index]].
To continue setting up PmWiki, see [[PmWiki/initial setup tasks]].
The [[PmWiki/basic editing]] page describes how to create pages
in PmWiki. You can practice editing in the [[wiki sandbox]].
More information about PmWiki is available from http://www.pmwiki.org .
A local copy of PmWiki's
documentation has been installed along with the software,
and is available via the [[PmWiki/documentation index]].
To continue setting up PmWiki, see [[PmWiki/initial setup tasks]].
The [[PmWiki/basic editing]] page describes how to create pages
in PmWiki. You can practice editing in the [[wiki sandbox]].
More information about PmWiki is available from http://www.pmwiki.org .
to:
!CS200: algorithms and data structures
!!!Course description
The goal of this course is to convey an understanding of abstract data types, common data structures, necessary discrete structures and complexity analysis. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graph algorithms. Complementary topics from theory include complexity analysis, recurrence relations, trees, and graphs.
!!!Course description
The goal of this course is to convey an understanding of abstract data types, common data structures, necessary discrete structures and complexity analysis. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graph algorithms. Complementary topics from theory include complexity analysis, recurrence relations, trees, and graphs.