Declarative Methods (600.325/425) Jason Eisner (jason@cs.jhu.edu) First-Day Questionnaire - Jan. 28, 2013 Name (include nickname): Email (for class mailing list - please be legible): Major, year, etc.: Are you in 325 or 425? Also, if you are auditing or sitting in, please say so. Why are you in this class? (And what do you most want out of it?) Favorite candy bar: Hobbies, or favorite book: What do you look like? Please give enough detail so that the TA or I can tell you apart from the other students. (Do you have a lightning- shaped scar on your forehead? Do you wear an unusual hat to class?) Programming languages you know well: Programming languages you know somewhat: (CONTINUED ON BACK) Check off your level of knowledge of each of these topics. (It is fine if you don't know them. I'm trying to get a sense of what I'll need to teach you.) 0 = never heard of it 1 = vaguely know about it 2 = basic understanding (could answer some questions about it) 3 = strong understanding (with a little review, could help others learn it) 0 1 2 3 [ ][ ][ ][ ] propositional calculus (formulas like A ^ ~B --> C v D) [ ][ ][ ][ ] proofs in general [ ][ ][ ][ ] NP-completeness [ ][ ][ ][ ] specific NP-complete problems and why they're NP-complete [ ][ ][ ][ ] gradient descent (or gradient ascent) [ ][ ][ ][ ] linear programming [ ][ ][ ][ ] generic graph search algorithms (e.g., Dijkstra's alg., IDS, A*) [ ][ ][ ][ ] dynamic programming [ ][ ][ ][ ] backtracking/branch-and-bound search strategies [ ][ ][ ][ ] other topics in Artificial Intelligence [ ][ ][ ][ ] probability notation (like p(A | B)) [ ][ ][ ][ ] at least one machine learning technique [ ][ ][ ][ ] regular expressions [ ][ ][ ][ ] finite-state automata [ ][ ][ ][ ] Perl, Python, or a similar scripting language [ ][ ][ ][ ] an object-oriented programming language [ ][ ][ ][ ] a functional programming language (e.g., LISP,OCaml,Haskell, ...) [ ][ ][ ][ ] a logic programming language (e.g., Prolog or Datalog) Other comments about yourself, or suggestions for me: