Computer Science 2:
Recent news items :
Exemptions from final exam
Anyone who has earned all 900 possible points so far can afford to get zero points on the final and would still get an A (not an A-) in the course. Such people can therefore afford not to show up for the final.
Extending this exemption a bit further, we will assume that anyone who has earned 875 or more points so far would easily get 25 points or more on the final and hence get an A for the course. Such people can therefore also afford not to take the final and still get an A.
Monday, January 13, 2003 [Edited March 2 and March 14, 2003.]
This page is on the web at http://www.cs.colorado.edu/~karl/2270.spring03/.
Mon 11:00-12:30 Alan ECCR 1B54/1B56 Tue 1:30- 2:30 Damon ECCR 1B54/1B56 Wed 11:00-12:15 Alan ECCR 1B54/1B56 Wed 3:00- 5:00 Shea ECCR 1B54/1B56 Thu 3:00- 5:00 Shea ECCR 1B54/1B56 Fri 3:00- 4:00 Damon ECCR 1B54/1B56 Fri 3:00- 5:00 Shea ECCR 1B54/1B56
R011 T 0930AM-1045AM ECCH 105 Alan R012 T 1100AM-1215PM ECCH 105 Shea R013 T 1230PM-0145PM ECCH 105 Shea R014 T 0200PM-0315PM ECCH 105 Assad R015 T 0330PM-0445PM ECCH 105 Assad R021 R 0930AM-1045AM ECCH 105 Alan R022 R 1100AM-1215PM ECCH 105 Shea R023 R 1230PM-0145PM ECCH 105 Assad R024 R 0200PM-0315PM ECCH 105 Damon R025 R 0330PM-0445PM ECCH 105 Damon
|Week of ...||Class topics + reading assignments||Recitations||Assignments|
Objects and classes.
|Logistics. Basic Unix commands.||Assignment 1 handed out (using classes and objects).|
Objects and classes, continued.
Read Chapter 2.
|emacs, submission of assignments.|
Container classes. |
Read Chapter 3.
|Finishing Assignment 1.||
(using container classes).
Assignment 1 due Friday, February 7.
Read Chapter 4, Sections 4.1-4.4.
|Interactive debugging with gdb. Permissions, RCS.|
Pointers and linked lists. |
Read Chapter 5.
|Finishing Assignment 2.||
(using linked lists).
Assignment 2 due Friday, February 21.
Queues, stacks and trees.
Covered in Chapters 7-10.
Heapsort (Sections 11.1 and 13.3).
|Finishing Assignment 3.||Assignment 4 handed out (using trees).|
|8.||March 3-7||Binary search trees (Section 10.5).||Sample exam problems.||Assignment 3 due Friday, March 7.|
Monday, March 10,
(about dynamic arrays, linked lists, heaps).
Wednesday and Friday: Parse trees. Discussion of Assignment 4.
|Recursive tree drawing.|
|10.||March 17-21||Various structures (B-trees, skiplists, ... )||Assignment 4 due Wednesday, March 19. [Note that this is a change from the originally posted due date.] [Further postponed to Friday, April 4, because of the snow closure.]|
|March 24-28||Spring Break|
|11.||March 31-April 4||
Graphs (Chapter 15).
Wednesday and Friday: Discussion of Assignment 5.
|Sample lab exam.||
Assignment 4 due Friday, April 4. [Once more postponed, to Monday, April 7, because of disk space problems in the lab.]
|12.||April 7-11||Graphs, continued.||Lab exam 1 (extensions to Assignment 4).||Assignment 4 due Monday, April 7.|
Various sorting algorithms
Limits on sorting.
|Finishing Assignment 5.||Assignment 5 due Friday, April 18. [Note that this is a change from the originally posted due date.]|
Hash tables (Sections 12.2 and 12.3).
Demos and review.
|Lab exam 2 (extensions to Assignment 5).|
April 28-May 2
||Demos and review, continued.|
Getting 900 or more points guarantees you an A, getting 800 or more points guarantees you at least a B, getting 700 or more points guarantees you at least a C, getting 600 or more points guarantees you at least a D, getting less than 600 points will get you an F.
+/- grades will be given to raise some grades. The extent to which this is done may differ among recitations since their lab exams may turn out to be of slightly different levels of difficulty (which we try to avoid but which can happen).
The University of Colorado Academic Honor Code applies, of course.