CISC 280 Programming Paradigms

Reload! This page is updated several times a week. The version in your web browser cache is probably stale. Reload it!

(you're looking at the version done 12/11/96)
Entries are in reverse chronological order.

Next up

  • Dec 13: Final Exam 1-3pm in course classroom.

    What we've done

  • Dec 11: query systems, pattern matching, and logic programming
    course overview
    review guide.
  • Dec 9: defmacro, back-quote, comma operators
    Reading: Section 4.4.
  • Dec 6: Eval-special
  • Dec 4: Eval and Apply.
    Reading: Section 4.1.
    Assignment Due Wed, Dec 11.
    Streams Handout.
  • Dec 2: Infinite streams
    Reading: Section 4.1
  • Nov 27: review exam
  • Nov 25: Midterm exam
  • Nov 22: Streams, review
    second midterm review handout.
  • Nov 20: Streams
    Reading: Section 3.4
  • Nov 18: Cyclic data, Heaps continued
  • Nov 15: Heaps as trees
    Assignment Due: 3.8, 3.12, 3.18 (extra credit for 3.19 in place of 3.18).
  • Nov 13: Constraint systems continued.
  • Nov 11: Constraint systems
    Reading: Sections 3.3.4, 3.3.5
  • Nov 8: Data structures with mutators
    Reading: Sections 3.3.2, 3.3.3
    New Assignment: 3.8, 3.12, 3.18 (extra credit for 3.19 in place of 3.18). Use template file hw3.8.scm . Design similar templates for the other two problems.

    Assignment due: 2.47, 2.49, 3.3 Use template files hw2.47.scm , hw2.49.scm , hw3.3.scm .
  • Nov 6: how display works. mutable list structure, set-car! and set-cdr!
    Reading: Section 3.3.1
  • Nov 4: The environment model
    Reading: Section 3.2
  • Nov 1: Uses of local State
    Reading: Section 3.1
  • Oct 30: Functional Programming
    Assignment: 2.47, 2.49, (2.54 removed), 3.3 Due Fri, Nov 8
    test files will be made available.
  • Oct 28: Tables and Data Directed Programming
  • Oct 25: Manifest types Data Directed
    Reading: section 2.3
  • Oct 23: finish Symbolic Differentation
  • Oct 21: Last exam question, Symbolic Differentation
    Reading: section 2.2.4
  • Oct 18: Return exam, Go over questions.
    Assignment (Due Fri, Oct 25 by email): 2.16, 2.17, 2.25, 2.26
  • Oct 16: equal? eq? = ; member memq
  • Oct 14, Midterm exam 1 (note date change from syllabus)
  • Oct 11: review for test
  • Oct 9: Quote and symbols as data (section 2.2 continued)
    Assignment Due today: 1.24, 1.27, 1.31
    midterm review handout .
  • Oct 7: data abstraction barriers, complex number examle.
    lists, new functions: length, list, append. reading: Section 2.2
  • Oct 4: Pairs, classes, and data abstraction.
    Reading: Section 2.1
    also Finish section 1.3 with discussion of optimum finding.
    Assignment (Due Wed, Oct 9): 1.24, 1.27, 1.31
  • Oct 2: From pattern to program part 2: Procedures as returned values
    Reading: Sections 1.3.3, 1.3.4
  • Sept 30: From pattern to program part 1: Procedures as parameters
    Reading: Sections 1.3.1, 1.3.2
  • Sept 27: Discussion of ScmInit.scm files, random number generator, timing, fast-prime?, gcd.
    Assignment due date postponed to Monday: 1.17, 1.18, 1.19.
  • Sept 25: Analysis of timing results, GCD discussion.
  • Sept 23: Primality testing
    Assignment: 1.17, 1.18, 1.19 (due Sept 27).
  • Sept 20: Exponentiation (relevant to RSA encryption among other things).
  • Sept 18: Exponentiation (relevant to RSA encryption among other things).
    Reading: Sections 1.2.4 and 1.2.5
    Assignment: 1.10, digits-code (occurrences and trailing-zeros) (due Sept 20).
  • Sept 16: Lab session in 114 Pearson Hall. Exercise on the use of tracing , implementation of recursions involving the digits of a number.
  • Sept 13: overview of public key encryption, rsa algorithm (motivation for expmod and primality testing.
    Reading: none. Students who missed should get notes from a classmate
    Assignment: Prepare for lab monday using digits handout.
  • Sept 11: more on iteration, linear and tree recursions. Fibonacci numbers, etc.
    Reading: Sections 1.2.2 and 1.2.3
  • Sept 9: interations and linear recursions, Sqrt and factorial as examples.
    Reading: Sections 1.2.1 and 1.2.2
  • Sept 6: Scheme syntax and semantics (how eval works).
    Reading: Finish section 1.1. (skip pg 16).
    Assignment: Exercises 1.1, 1.2, and 1.6 (due Sept 13).
  • Sept 4: Intro, syllabus handed out, Scheme (lisp) syntax.
    Reading: foreward, preface, Section 1.1 thru pg 20 (skip pg 16).
    Assignment: Exercises 1.1 and 1.2 (due Sept 13).

    saunders@cis.udel.edu