Difference between revisions of "Enhancement Project"

From CSCWiki
Jump to navigation Jump to search
m (add to Projects category)
Line 38: Line 38:
   
 
???????
 
???????
  +
  +
[[Category:Projects]]

Revision as of 18:58, 22 March 2010

The current (as of this writing) state of affairs of second year CS courses is rather abysmal. They are aimed lower than the lowest common denominator and based off of the outdated and poor CS134 curriculum. As it stands students in the top half of CS136 and all students from CS145 are bored to tears and left bitter and angry about the field. The School has made some attempts at mending second year but they've been ineffective, ignored, or token superficial changes. Traditionally, the Club has picked up the School's slack and here we again find ourselves doing such.

To help the top students enjoy the material of second year (and to some extent first year) it has been proposed that we write a series of "enhancements" that introduce accessable and semi open ended tangents to the actual course material, in the hopes that they either become part of the curriculum or at least pressure the school to rasie the bar.

This page will be used to track ideas, who is working on them, and how we'll publicize them once an adequate folio has been assembled for distribution along side courses.

Ideas

Ideas can be posted in any level of detail, from a blank heading to a list of links to references. Once writing begins please mark your username next to the idea so that others know its in progress and to contact you for further discussion instead of wikiing. If a topic can be broken up, feel free to break it up.

CS 241

Functional Lexing and Parsing

plragde will give a talk on this, after which its unclear who will write the enhancement from the talk slides

Formal Language Intro

Compiler Optimization

CS 240

A source of ideas, info, etc. Great Algorithms Course

Probabilistic Computational Geometry

Binomial Heaps done Lazy

Functional Purity

Mathematical Underpinnings

The lack of mathematics used during analysis of algorithms, and the odd "proof" leaves something to be desired. More formality in the arguments would be helpful to students who learn this way and enjoy it.

Audio Compression

Publicity

???????