CSci 4651: PPL: Programming Languages - Syllabus.

[Home] [Syllabus] [Assignments] [Resources]


The syllabus will be updated throughout the semester. Dates, topics, assigned reading, and problem set due dates will be added or might change. All changes in assigned reading and due dates will be announced in class (and occasionally by e-mail). While I will do my best to update the web site accordingly, it is a student's responsibility to keep track of the problem set due dates and reading assignments. If you are not sure about due dates, please don't hesitate to ask.

Reading assignments are listed for the day when the material is first explained in class. You may read the material ahead of the lecture or after, either way is fine.

The midterm, the final, and quizzes are open book, open notes.
However, you are not allowed to use any materials from previous offerings of the course at any point in this class (in class or on your own).

The dates for the midterm exam and the final are set and will not change. If you have a conflict with these dates, please let me know right away. No makeup exams will be given unless there are circumstances beyond your control AND the makeup time is arranged as soon as possible.

In addition to exams there will be 5-8 short in-class quizzes throughout the semester. Quizzes will not be announced in advance. The lowest quiz grade will be dropped (i.e. not counted towards the quiz total). A missed quiz will receive a grade of zero and thus will be counted as the lowest grade, unless it was missed due to an illness or other circumstances beyond your control. If you missed a quiz or a lab because of an illness or similar circumstances, it is your responsibility to communicate these reasons to me as soon as possible and arrange for make-up work.

Policies on Collaboration and Use of Resources

Problem sets and labs are individual work, unless stated otherwise. While it's perfectly OK (and is encouraged) to discuss problem sets in general terms with others in the class, your solution must be your own work (i.e. written or coded by you without using anybody else's materials). Copying any part of another person's solution (even if you modify the code) is considered academic dishonesty and will be dealt with according to the university's policy.

You may use electronic resources for problem sets to get general ideas for your solutions as well as to help in fixing errors. However, you may not copy a code fragment found online into your solution. Use of sources other than the textbook and the handouts given in class must be acknowledged in the beginning of the problem solution. You also need to acknowledge any ideas that you got for your solution fromyour classmates or anyone else, including a TA.

For take home tests please follow the instructions on the test to determine appropriate resources.

Use of any materials from previous runs of this class is not allowed.

If in doubt whether a resource is appropriate for a given problem set, please ask.

Late problem sets policy:

Problem sets are due in the beginning of the class on the due date, unless a different time is specified for an electronic submission. If a problem set or a lab is submitted at (or before) the next class meeting after the due date, it is graded out of 3/4 credit. If it is submitted any time after the next meeting (until the last class meeting), then it is graded out of 1/2 credit.

Groups for labs and problem sets

Hand in one assignment from the entire group with names of both students on the first page. If submitting by e-mail, you must CC it to all your partner(s). In a programming assignments make sure to keep track (in comments or in some other electronic form) of each partner's contribution to the work.

Generally all group members get the same grade for the submitted group work. If you feel that your group members are not contributing the way they should or if there are any circumstances that prevent you or you partner from contributing a fair share, please talk to your partner(s) to work out an arrangement (if possible) and in either case let me know right away that the contributions to a problem set are not equal. If after the assignment is finished you feel that the group members have contributed unevenly, please talk to me and I'll try to come up with a fair grading strategy.

Discussion with students other than those in your group (or anyone not in this class) should be limited to general approaches to the problem. All such discussions as well as use of sources other than the textbook and the handouts given in class must be acknowledged in the beginning of the problem solution.

Studying in groups

Studying in groups is strongly encouraged. You may study for tests, go over textbook materials or lecture notes, and discuss problem sets in general terms (i.e. without actually writing the program code or giving out the answers).

Use of electronic devices

Use of laptops for class-related activities is usually allowed, except for test time and other specific assignments. Laptops and other devices cannot be used for activities unrelated to the class work (checking e-mail, instant messages, Facebook, etc.). The instructor reserves a right to ask a student to leave the class if the student uses electronic devices inappropriately in a class. No communication devices can be used during a test, including quizzes. If you are taking notes on your laptop, you are not allowed to access anything on your laptop other than your notes during a test.

Course topics and timeline

Monday Wednesday Friday
Week 1: January 18 - 22
Martin Luther King holiday Course policies and setup, introductions.
Overview of key programming languages concepts (big picture).
Introduction to the terminology, concepts, and kernel language.
Reading: Ch. 1.
Week 2: January 25 - 29
EBNF, compilers and interpreters, syntax/semantics.
Reading: 2.1.
Single-assignment store, values, variables, identifiers.
Reading: 2.2.
Introduction to data types, static vs dynamic typing, basic language elements, function vs procedure.
Reading: 2.3.
Week 3: February 1 - 5
Program execution and memory management.
Reading: 2.4, 2.5, 2.6.
A talk on designing a language (see resources page)
Reading: 2.7.
Declarative programming.
Case study: Clojure.
Reading: Ch. 3 and assigned resources.
Week 4: February 8 - 12
Declarative programming, Clojure.
Concepts: functional abstraction, higher order functions, functional data structures, tail call optimization, lazy evaluation.
Declarative programming, Clojure. Declarative programming, Clojure.
Week 5: February 15 - 19
Declarative programming, Clojure. Declarative concurrency, working with threads.
Reading: Ch. 4.1, parts of 4.2.
Reading: Ch. 4.3.
Week 6: February 22 - 26
Lazy evaluation.
Reading: Ch. 4.5.
Case study: Clojure concurrency.
Case study: Clojure concurrency.
Week 7: February 29 - March 4
Case study: Clojure concurrency.
Case study: Clojure concurrency.
Difference between imperative and functional programming.
Week 8: March 7 - 11
Introduction to Haskell Review for the midterm. Midterm
March 14 - 18: spring break, no classes.
Week 9: March 21 - 25
Explicit state, imperative languages.
Reading: Ch. 6.
Explicit state, imperative languages.
Case study: C.
Week 10: March 28 - April 1
Object-oriented programming.
History of object-oriented languages.
Reading: Ch. 7.
Object-oriented programming.
Case study: Ruby.
Week 11: April 4 - 8
Case study: Ruby. Case study: Ruby. Case study: C++, multiple inheritance.
Week 12: April 11 - 15
Case study: Java. Case study: Java. Case study: Javascript.
Week 13: April 18 - 22
Case study: Javascript.
Final paper topics due.

Extensible languages: macros. Extensible languages: macros.
Week 14: April 25 - 29
Selected topics/catchup. Papers presentations. Papers presentations.
Week 15: May 2 - 6
Papers presentations. Discussion and wrap-up. Review for the final.
Final exam: Thursday May 12 11am-1pm in Sci 2185.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.