Below is an outline of the concepts covered during the course. The final exam is cumulative. We’ve put asterisks next to some particularly important items sure to appear!
- Concepts
- Basic PL concepts
- Compiled vs. Interpreted
- Syntax
- BNF*
- Orthogonality
- Writing parsers (recursive descent)
- Memory allocation
- Stack / heap / static
- Object / binding lifetime
- Avoiding common memory / security issues
- Object orientation
- Generics and Templates
- Information hiding
- Nested functions
- Module systems
- Multiple inheritance
- Diamond problem*
- Approaches taken by different languages
- Type systems*
- Type conversion
- Determining types (type inference)
- Optional type
- Propositions as types
- Dynamic vs static
- Scope
- Method binding
- Typing
- Logic and Answer-Set programming concepts
- State-space problem solving
- Grounder vs. solver
- Unification
- Functional programming concepts
- Lambdas, lambda calculus
- Higher order functions
- Closures
- Immutability
- Pure functions (side-effect free)
- Code is data is code*
- Pattern matching
- Scripting Languages
- Characteristics / uses
- Concurrency / Parallelism
- Basic PL concepts
- Languages
- All of them we’ve used! Be able to read/understand/interpret short programs illustrating the concepts above. Be able to write short snippets of code.