Jim's
Tutorials

Spring 2013
course
navigation

Alex Exams

1. Algorithms : courses: more coding; less math theory algorithms - discrete combinatorics stuff; O(), hash tables, heaps, trees linked lists, string search, graph problems don't do P, NP FFT ... ? AI - neural net sort of stuff, not Bayesian "implement a few cool things in C" evolutionary algorithms ... search in AI compression, entropy, * possibilities - combinatorics, numerical, FFT, ... 2. Languages Yes: C, Python, Common Lisp, Ruby, JavaScript, bash, x86 assembler No : Haskell, R, C++, perl, Forth, postscript, Conway's life Concepts : scope, closure, callback types strongly / loosely ; duck types static, dynamic compiled, interpreted parsing, BNF notation for defining 'em, forks, threads objects, data structures (hash, array, ...) APIs for this and that libraries : graphic, event, GUI, 'net, ... data types : int, string, ... functional: yield, curry, reduce, map, filter, lazy, eval procedural: loops, conditionals object oriented: inheritance, privacy of data & methods lambda, methods, functions, packages : pointers, pass-by-value vs pass-by-reference garbage collection Tue/Thu Jan ,24 29,31 Feb 5, 7 Algorithms: discuss/define 12,14 review 19,21 take 26,28 Languages: discuss/define Mar , 7 review 12,14 take spring break Apr 2, 4 9,11 16,18 23,25 30, 2 May 7
http://cs.marlboro.edu/ courses/ spring2013/jims_tutorials/ alex/ Exams
last modified Thursday February 28 2013 3:02 pm EST