| 12:30-1:45 MW 110 Eppley |
Dr. David
Reed
203D Hitchcock x2583 DaveReed@creighton.edu |
Official Text: Concepts of Programming Languages (11th
ed.),
Sebesta, Addison-Wesley, 2016.
Alternative Option: The 10th edition is available for free online, and can be used as an alternative to buying the latest version.
This course is concerned with the concepts and practice of programming languages. The first part of the course will focus on general programming language concepts such as binding, type checking, and memory management. The implementation of these concepts in different languages will be examined, with special attention paid to Java and C/C++. The second part of the course will focus on different programming paradigms: procedural, object-oriented, and functional programming. Java, C++, and JavaScript will be studied as hybrid languages, combining both procedural and object-oriented features with varying design goals. Scheme will be studied as an example of a completely different programming paradigm, one which focuses on functional composition as opposed to state transformation or object interaction. In addition, groups of 2-3 students will each research and present an overview of a modern scripting language (e.g., perl, php, python, ruby, R, scala).
The specific goals of this course are:
There will be 4-6 homework assignments, most of which will involve programming. Assignments will be submitted electronically via the class BlueLine site and will be due at midnight on the date specified. Late assignments will receive 75% of full credit if they are handed in within one week of the specified due date. After one week, no credit will be given. The group project will involve researching a modern scripting language and giving a 30-minute presentation on that language to the class. In addition, there will be 6-8 module quizzes (with the lowest quiz grade dropped), a midterm exam and a cumulative final exam. Grades will be determined as follows:
| homework assignments | 35 % |
| group project/presentation | 10 % |
| module quizzes | 05 % |
| midterm exam | 20 % |
| (cumulative) final exam | 30 % |
At the minimum, departmental grading cutoffs for the final average will apply. That is, 92-100% guarantees an A, 87-91% a B+, 82-86% a B, 77-81% a C+, 71-76% a C, and 60-70% a D. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.
Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and Assignments will not be rescheduled except in extreme circumstances. It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.
Creighton's policy on cheating and plagiarism is spelled out in the the Student Handbook, with college procedures available online. In addition to this, the following guidelines hold pertaining to programs. Programs are to be the sole work of the student -- collaboration on the design or coding of a program is not allowed. Questions regarding homework assignments should be directed at the instructor only. Students may seek debugging assistance or clarifications on assignments via the class mailing list (accessible via BlueLine). Repeat: All student interactions regarding homework assignments must take place via email to the entire class!
Violations of this policy will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.
|
|
|
|
|
| Jan 16 | Introduction, overview. (pptx/pdf) | Ch 1 | |
|
21 23 |
Background & syntax: (pptx/pdf) history, paradigms, BNF, EBNF. |
Ch 2, 3 |
HW1: due 2/3 |
|
28 30 |
Variables & bindings: (pptx/pdf) static vs. dynamic bindings, stack vs. heap, |
Ch 5 |
|
|
Feb 4 6 |
scope & lifetime. SILLY code review. |
|
HW2: due 2/21 |
|
11 13 |
Data types: (pptx/pdf) primitives, pointers, memory management, garbage collection. |
Ch 6 |
|
|
18 20 |
Data & control: (pptx/pdf) SNOW DAY - NO CLASS |
Ch 7-8 |
HW3: due 3/8 |
|
25 27 |
strings, arrays, assignments, control statements. Subprograms: (pptx/pdf) |
Ch 9 |
|
|
Mar 4 6 |
subprogram linkage, parameters, run-time stack, review. MIDTERM EXAM |
Ch 10 |
|
|
11 13 |
SPRING BREAK - NO CLASS | ||
|
18 20 |
Midterm & HW review Language evolution & OO: (pptx/pdf) |
Ch 11-12 |
Presentation |
|
25 27 |
C --> C++ --> Java. Functional programming: (pptx/pdf) |
Ch 15 |
|
|
Apr 1 3 |
Scheme, atoms & lists, conditionals, recursion, recursion, tail recursion optimization, map & apply. |
|
HW4: due 4/12 checkpoint 1 |
|
8 10 |
Scheme structures: (pptx/pdf) association lists, data structures, trees, let, |
|
|
|
15 17 |
I/O, sequencing, closures, OO in Scheme. Concurrency: (pptx/pdf) |
Ch 13 |
HW5: due 5/1 checkpoint 2 |
|
22 24 |
EASTER MONDAY - NO CLASS competition vs. cooperation, semaphores, monitors, Java threads. |
|
checkpoint 3 |
|
29 May 1 |
Presentations: Go,
Groovy,
Rust,
TypeScript course review |
|
|
| May 8 | FINAL EXAM Wed, 8:00-9:40 | ||