1 / 4

How to Teach “Programming” Kenneth.Church@jhu

How to Teach “Programming” Kenneth.Church@jhu.edu. Lecture 1: Education for kids Lego Mindstorms ( NQC : Not Quite C) Scratch Lecture 2: Unix for Poets Request: bring a laptop if possible Windows Users: please install http://www.cygwin.com/ Target audience: Grad Students in Linguistics

tekli
Download Presentation

How to Teach “Programming” Kenneth.Church@jhu

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. How to Teach “Programming”Kenneth.Church@jhu.edu • Lecture 1: Education for kids • Lego Mindstorms (NQC: Not Quite C) • Scratch • Lecture 2: Unix for Poets • Request: bring a laptop if possible • Windows Users: please install http://www.cygwin.com/ • Target audience: Grad Students in Linguistics • Unix shell scripts (almost not programming) • Small is Beautiful • Lecture 3: Symbolic Processing • Target audience: • MIT Computer Science Majors (circa 1974) • LISP: Recursion, Eval, Symbolic Differentiation • Lambda Calculus (“Small is Beautiful” beyond reason)

  2. Agenda • Old Business • Homework from last week • New Business • Requests for Next Week • Today’s Lecture • Unix for Poets

  3. Requests for Next Week • Bring Laptops (again) • Install LISP: http://www.newlisp.org/ • Read “The Roots of LISP” (see Lecture3/jmc.PDF on CD or http://lib.store.yahoo.net/lib/paulgraham/jmc.ps) • Homework (nothing to hand in): • Read: Basics of the Unix Philosophy • http://www.faqs.org/docs/artu/ch01s06.html • Fun (optional): http://www.cs.dartmouth.edu/~sinclair/doug/?doug=mcilroy • Continue exercises in Unix For Poets • M&Ms/Lecture2/unix_for_poets.pdf • Try to finish at least pp. 1-26 (better: pp. 1-37) • Incompatibility notes: • You may have to skip exercises that depend on “spell” • Arguments to sort are not the same on Macs (see man)

  4. Unix has survived the test of timeBetter than many… Why? • Doug McIlroy • Small is Beautiful • Portability • Everything had to run everywhere • Pipes  Parallelism (with multiple cores) • Documentation • Taken seriously • Publish or Perish • Brian Kernighan

More Related