Computer Engineering BA (C), Theory of Programming Languages, 7.5 Credits

Aim

The main purpose of the course is to provide students with the theoretically sound “guide” in the programming languages domain. It means, first of all, introducing the main constructs of contemporary programming languages and providing students with the tools necessary for critical evaluation of different programming languages and their applicability in certain domains.

Course objectives

After completing the course, you should be able to:
- describe different paradigms, basic concepts, and constructions for different programming languages and critically compare alternatives,
- apply formal methods for syntax and semantics of languages,
- create algorithms for lexical and syntactic analysis,
- relate general tools for imperative programming including atomic data types, loops and fields as well as pointers and subroutines,
- apply object-oriented properties, such as operator overloading and inheritance,
- explain characteristics of alternative paradigms, functional and logical programming as well as concepts and structures on which these are based.

Content

- Evolution of programming languages and programming paradigms.
- Formal grammars, syntax and semantics, lexical and syntax analysis, parsing.
- Imperative programming. Names, variables, types, statements, expressions, control structures. Their usage in Fortran, Pascal, C.
- Data types and structures: arrays, records, unions, pointer and reference types.
- Procedures/subprograms, blocks, scopes, parameter passing, nested and recursive procedures, overloading.
- Object-oriented and generic programming. Classes, encapsulation, run-time polymorphism, inheritance, templates. Coverage of Smalltalk, C++, Java.
- Functional programming. Functions and notion of lambda calculus. Functional programming for typeless and typed languages. Overview of Lisp, Scheme, and ML.
- Logic programming. A brief introduction to predicate calculus and proving theorems. Basics of Prolog.
- Introduction to concurrency. Processes and threads. Safe access to shared data. Language support for concurrency: semaphores, monitors, and message passing.

Entry requirements

Computer Engineering BA (AB), 30 Credits including Computer Engineering BA (A). Operating System, 6 Credits and Computer Engineering BA (B), Programming Methodology, 6 Credits. Mathematics BA (A), 15 Credits, including Discrete Mathematics, 6 Credits.

Selection rules and procedures

The selection process is in accordance with the Higher Education Ordinance and the local order of admission.

Teaching form

Approximately 24 hours of lectures, 16 hours of laboratory work, and 12 hours of
exercises.

Examination form

L105: Laboratory work, with report, 2.5 Credits
Grade scale: Fail (U) or Pass (G)

M105: Oral examination, 5 Credits
Grade scale: Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.

Grading criteria for the subject can be found at www.miun.se/gradingcriteria.

The examiner has the right to offer alternative examination arrangements to students who have been granted the right to special support by Mid Sweden University’s disabilities adviser.

Grading system

Seven-grade scale, A, B, C, D, E, Fx and F. Fx and F represent fail levels.