CIS 252   —   SPRING 2012

Introduction to Computer Science

News

• I've posted sample solutions for Exam 3.
  Posted: Thu May 3 13:09:51 EDT 2012

• Old news

Homeworks

• Homework 1:   Due Thursday, January 26
  You will need to grab a copy of both Pictures.hs and start-hw1.hs.
• Homework 2:   Due Thursday, February 2
  
• Homework 3:   Due Thursday, February 9
  You will need to grab a copy of circles.hs.
• Homework 4:   Due Thursday, February 16
  Once again, you will need a copy of Pictures.hs (same version we've used previously).
• Homework 5:   Due Thursday, February 23
  
• Homework 6:   Due Thursday, March 8
  You will need to grab a copy of the module Cards.hs.
• Homework 7:   Due Thursday, March 22
  
• Homework 8:   Due Thursday, March 29
  
• Homework 9:   Due Thursday, April 12
  
• Homework 10:   Due Thursday, April 19
  
• Homework 11:   Due Thursday, April 26
  

Labs

• Lab 1:   Due Friday, January 20
  
• Lab 2:   Due Friday, January 27
  
• Lab 3:   Due Friday, February 3
  You will need to grab a copy of lab3-start.hs.
• Lab 4:   Due Friday, February 10
  Once again, you will need a copy of Pictures.hs (same version we've used previously).
• Lab 5:   Due Friday, February 17
  
• Lab 6:   Due Friday, February 24
  
• Lab 7:   Due Friday, March 9
  
• Lab 8:   Due Friday, March 23
  
• Lab 9:   Due Friday, March 30
  
• Lab 10:   Due Friday, April 13
  
• Lab 11:   Due Friday, April 20
  

Exams

• Exam 1: Tuesday, February 28
• Exam 2: Tuesday, April 3
• Exam 3: Tuesday, May 1
• Final Exam: Tuesday, May 8, 10:15am-12:15pm

Pop Quizzes

• Quiz 1 from Feb 7 (postponed from Feb 2), plus sample solutions
• Quiz 2 from Feb 14, plus sample solutions
• Quiz 3 from Mar 8, plus sample solutions
• Quiz 4 from Mar 27, plus sample solutions
• Quiz 5 from Apr 19, plus sample solutions
• Quiz 6 from Apr 26, plus sample solutions

Support

• Notes, code, and transcripts from lectures
  • Jan 17 --- Overview of course and declarative programming, including prime-sieve code
  • Jan 19 --- Some Unix basics: transcript
    Also, the Pictures module: Haskell code and the transcript
  • Jan 24 --- More with Pictures, plus Haskell basics: code and the transcript
  • Jan 26 --- A quick tour of Haskell's basic types, plus pattern matching: code and the transcript
  • Jan 31 --- A recap of Haskell's basic types, plus some syntax gotchas (see slides), plus Polya's How To Solve It
  • Feb 2 --- The basic design recipe, plus scope and local definitions: design-recipe slides, plus code and the transcript
  • Feb 7 --- Recursion: code and Picture code and the transcript
  • Feb 9 --- More recursion with pictures: code and transcript
  • Feb 14 --- Tuples and lists: code and transcript
  • Feb 16 --- Lists, pattern matching, and recursion: slides and code and transcript
  • Feb 21--- More on lists, pattern matching, and recursion: code and transcript
  • Feb 23--- Recap of Unix basics, plus a little more recursion: Unix slides and code and transcript
  • Mar 1--- Type Synonyms, type classes, and algebraic data types: slides on type classes and code and transcript
  • Mar 6---More on algebraic data types (including trees): code and transcript
  • Mar 8---Polymorphic binary trees: code and transcript
  • Mar 20---Another polymorphic binary-tree example: code
    Also, higher-order functions: slides and code, plus transcript
  • Mar 22---More on higher-order functions: slides in handout form, code, and transcript
  • Mar 27---Yet more on higher-order functions: code and transcript
  • Mar 29---Intro to Turing machines: Turing machine simulator and a few simple machines
  • Apr 5--- More Turing machines: code and transcript
  • Apr 10--- Two more Turing machines: code and transcript
  • Apr 12--- Foldr: code and transcript
  • Apr 17--- Using higher-orer functions: code and transcript
  • Apr 19--- Intro to IO in Haskell: transcript (abridged version)
  • Apr 26--- A little more IO: code and transcript
• Basic tools
  • Computer accounts
  • Unix tutorial
  • General Emacs info
  • Installing course software on your machine
  • Summary of Emacs haskell-mode commands
• Haskell and functional programming
  • General Haskell Info
  • Functional Programming Refs
  • Textbook Extras
• Miscellaneous
  • Declarative Programming Languages
  • Turing Machines
  • Polya's How to Solve It
  • How to Program it
  • Programming It In Haskell
  • The Basic Design Recipe
• Recommended reading
  • Doing Honest Work in Collegeby Charles Lipson, Univ. of Chicago Press, Second Edition, 2008.

Administrivia

• Course syllabus
• Honor Policy
• Homework and Lab Policy
• Electronic submission
  To submit your assignment electronically:
  If you have more than one file to submit, use zip (or tar or a related application) to bundle your files into a single package.
  Click this electronic-submission link, and use your NetID and password for authorization.
  Important: Make sure you select CIS 252 as the course for which you're submitting.

Important Dates

First class	Tuesday	January 17
Last day to add a course	Tuesday	January 24
Financial drop deadline	Tuesday	February 7
Academic drop deadline	Tuesday	March 20
Spring break - no classes	Sun-Sun	March 11–18
Withdrawal deadline	Tuesday	April 17
Last class	Tuesday	May 1