This is an informational page only for students who are considering enrolling in the course. All changes and updates will be posted on the NYU Classes course page when it becomes available. All students enrolled in the course through Albert will automatically be given access to the NYU Classes course page and all associated features.
We will examine basic concepts underlying the design of modern general-purpose programming languages: types, control structures, abstraction mechanisms, inheritance, concurrency, garbage collection, constructs for programming in the large, etc. Implementation issues and data structures will be discussed. We will discuss a representative sample of languages across each of the imperitive, fuctional, logical, and object-oriented language paradigms. Our main goal will be to focus on key features, ideas, contributions, and influences of each language we discuss in the course. We will also discuss the purpose and importance of language standards. Coming out of this course, you should be able to better understand the languages you already know, reason about the pros and cons of each, more easily learn and understand new languages, and have an appreciation and understanding of both the theoretical and practical underpinnings.
Our goal is not to try and cover as many languages as possible, nor is it to spend considerable time on mundane syntax issues, nor focus heavily on any one language. It is also not a software engineering course where you will write large programs or work in groups. It is also not a compiler course where we will study deeply the full process of translating input to executable code, although we will briefly discuss this process and offer somewhat more detailed treatment on lexical analysis and parsing.
There will be programming assignments in several languages across all major language paradigms. The languages are chosen because of the interest of their features, not necessarily because of their wide use. We will touch on Algol, Ada, C++, Java, Scheme, and ML and mention others.
Undergraduate courses in data structures and algorithms or equivalent, as well as familiarity and programming experience in C, C++, Ada, Java, Pascal or a similar language.
All registered students will be automatically added to the course mailing list approximately one week before class begins. The list will be updated approximately one week after the course begins. Students may manually sign up for the course mailing list at any time, as well as change mailing list preferences. Subscription to the course mailing list, as well as participation in mailing list discussion concerning course topics, is mandatory for all students enrolled in the course.
There will be a number of paper and pencil assignments and programming assignments in various languages. In all cases, I will specify the compiler/interpreter to use, all of which will be freely available for download and will support all major OS/hardware platforms.
Don't do it! The work you hand in should be your own. Cheating on any exam or homework in this course will result in a failing grade. Please also read the department's policy here. Violations are taken very seriously; here is a quote from the link above:
"Disciplinary actions can vary in severity and can result in probation or termination from the graduate program."
If you find yourself falling behind, please see me before it's too late.