ideas_for_326

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | |||

ideas_for_326 [2015/04/12 10:05] scarl |
ideas_for_326 [2015/04/12 10:08] (current) scarl |
||
---|---|---|---|

Line 1: | Line 1: | ||

====== Computer Science 326: Functional Programming ====== | ====== Computer Science 326: Functional Programming ====== | ||

- | === Workload === | + | ==== Workload ==== |

- | **Daily Quizzes**: 20 @ 12 points each = 240 points / 20 = 12 semester points | + | **Many Quizzes**: up to 20 @ 12 points each = 240 points / 20 = 12 semester points |

- | **8 Assignments**: 8 @ 5 points each | + | **2 Assignments**: 8 @ 5 points each |

- | * 6 on mathematical stuff, 2 programs (choose from discrete event, max flow, balanced trees) | + | * a series of stepwise assignments culminating in a project |

+ | * Clojure project is multiprocessor aware | ||

+ | * Erlang project runs across the network | ||

**2 Presentations**: 5 points each | **2 Presentations**: 5 points each | ||

* includes a writeup (technical document, with feedback) | * includes a writeup (technical document, with feedback) | ||

- | __ | + | |

- | __ | + | |

=== Quizzing === | === Quizzing === | ||

Quiz 0: (ungraded) | Quiz 0: (ungraded) | ||

- | * Fibonacci, Al-K | + | * |

- | * Runtime complexity and implementation for approximation using Java.pow | + | * |

Quiz 1: | Quiz 1: | ||

- | * Order faster->slowest: O(n), O(n log n), O(n^10), O(log n), O(100), O(n^2), O(2^n) | + | * |

- | * (not graded) what section was to be read for today | + | * |

- | * Label each of these algorithms HARD or EASY: FACTORING, PRIMALITY | + | |

ideas_for_326.txt · Last modified: 2015/04/12 10:08 by scarl