Pomona College

Fall 2015

**instructor:** Dave Kauchak

**e-mail:** David.last_name@pomona.edu

**office hours:** Edmunds 224

*Tue.* 11am-12

*Wed.* 3:00-4:30pm

*Thu.* 2:30-4pm

and by appointment

**class time: **T/Th 9:35-10:50pm

**class location: **Edmunds 101

**web page: **http://www.cs.pomona.edu/classes/cs52/

**Other information:**

There is no official book for this course (though we suggest many optional books, most of which we have available in the lab). The readings for the course will come from handouts:

- Intro SML: A Brief Introduction to SML
- CS41B: The CS41B Machine
- LWI: Logic, Words, and Integers
- IRO: Induction, Recursion, and O-notation
- NT: Some Facts from Number Theory
- MC: Models of Computation

Date | Topic | Reading | Assignment | Comments |
---|---|---|---|---|

9/1 | admin, sml basics | Intro SML, Part I | Assignment 0 | |

9/3 | SML data types | data types handout Intro SML, pgs. 10-17 | ||

9/8 | list recursion | Intro SML, Part III | Assignment 1 | |

9/10 | advanced recursion | Intro SML, pgs. 34-43 | ||

9/15 | more SML fun | Intro SML, pgs. 18-21, 43-52 | Assignment 2 | |

9/17 | math on big numbers | |||

9/22 | defining new types | Intro SML, pgs. 53-58 | Assignment 3 | |

9/24 | memory (ppt) | CS41B, pgs. 1-11 | ||

9/29 | CS41B machine (ppt) | CS41B, pgs. 12-19, Appendices A-C | ||

10/1 | Midterm 1 | Example problems | ||

10/6 | CS41B recursion (ppt) | CS41B, pgs. 20-29 | Assignment 4 cs41b.jar | |

10/8 | circuits (ppt) | LWI, sections 1-3, 5-6, 10 | ||

10/13 | python basics | Assignment 5 | ||

10/15 | gates in python induction (ppt) | IRO, pgs. 1-4 | ||

10/20 | No class | |||

10/22 | big-O (ppt) | IRO, pgs. 5-6 | ||

10/27 | list induction (ppt) | IRO, pgs. 7-10 | Assignment 6 assign6.tex | |

10/29 | encryption (ppt) | NT, sections 1-2Optional: original RSA paper | ||

11/3 | encryption in practice (ppt) | NT, sections 5-6 | Assignment 7 | |

11/5 | Midterm 2 | Example problems | ||

11/10 | parsing | Intro SML, Section 17 | ||

11/12 | lazy evaluation | Intro SML, Section 16 | Assignment 8 | |

11/17 | lazy search | |||

11/19 | branch and bound 4 queens example (ppt) | Assignment 9 | ||

11/24 | DFAs | MC, section 1 | Assignment 10 | |

11/26 | No class | |||

12/1 | regular languages | MC, sections 2-3 | ||

12/3 | Turing machines | MC, sections 4-8 | ||

12/8 | recursion |

Final exam Thursday December 17, 9am-12. Sample problems.

**Additional resources**

- SML resources
- SML software and various tutorials and resources.
- Harper, Programming in Standard ML
- Gilmore, Programming in Standard ML '97: An On-line Tutorial
- Pucella, Notes on Programming Standard ML of New Jersey
- Copies of the following books are available in the computer science laboratory, Edmunds 227. Please do not remove them from the laboratory! They cannot be replaced if they disappear:
- Paulson, ML for the Working Programmer, second edition, Cambridge University Press, 1996.
- Ullman, Elements of ML Programming, ML 97 Edition, Prentice-Hall, 1998.
- Hansen and Rischel, Introduction to Programming using SML, Addison-Wesley, 1999.

- Unix and emacs resources
- Aquamacs (a common installation of Emacs on Mac)
- Some basic unix commands
- Harvey Mudd's UNIX: The Basics
- The Gnu Emacs Manual (probably more than you want to know). There is also an emacs quick reference guide.
- Python resources
- JFlap resources
- Main JFlap page, including a link to obtain a copy of the simulator
- JFlap tutorial