REGIONAL BOGOT D.

C:
CENTRO DE DISEO METROLOGIA Y CALIDAD
Programa de Formacin Anlisis y Desarrollo de Sistemas de Informacin

TEMA ENTENDIENDO EL LENGUAJE DE PROGRAMACION

I
1.

1.1
1.2
1.3
1.4
1.5
1.6
1.7
1.8
1.9

WHAT ARE PROGRAMMING LANGUAGES?

The wrong question
Imperative languages
Data-oriented languages
Object-oriented languages
Non-imperative languages
Standardization
Computer architecture
* Computability
Exercises

ELEMENTS OF PROGRAMMING LANGUAGES

2.1
Syntax
2.2
* Semantics
2.3
Data
2.4
The assignment statement
2.5
Type checking
2.6
Control statements
2.7
Subprograms
2.8
Modules
2.9
Exercises

PROGRAMMING ENVIRONMENTS
3.1
Editor
3.2
Compiler
3.3
Librarian
3.4
Linker
3.5
Loader
3.6
Debugger
3.7
Profiler
3.8
Testing tools
3.9
Configuration tools
3.0
Interpreters
3.10 The Java model
3.11 Exercises

II
4

5.10

INTRODUCTION TO PROGRAMMING LANGUAGES

6

ESSENTIAL CONCEPTS8
4.1
4.2
4.3
4.4
4.5
4.6
4.7
4.8
4.9

ELEMENTARY DATA TYPES

Integer types
Enumeration types
Character type
Boolean type
* Subtypes
* Derived types
Expressions
Assignment statements
Exercises

COMPOSITE DATA TYPES

5.1
Records
5.2
Arrays
5.3
Reference semantics in Java
5.4
Arrays and type checking
5.5
* Array subtypes in Ada
5.6
String type
5.7
Multi-dimensional arrays
5.8
Array implementation
5.9
* Representation specification

6.1
6.2
6.3
6.4
6.5
6.6
6.7
6.8

CONTROL STRUCTURES
switch-/case-statements
if-statements
Loop statements
for-statements
Sentinels
* Invariants
goto-statements
Exercises

7.1
7.2
7.3
7.4
7.5
7.6
7.7
7.8
7.9

SUBPROGRAMS
Subprograms: procedures and functions
Parameters
Passing parameters to a subprogram
Block structure
Recursion
Stack architecture
More on stack architecture
* Implementation on the
Exercises

III
8

Exercises

ADVANCED CONCEPTS
8.1
8.2
8.3
8.4
8.5
8.6
8.7

POINTERS
Pointer types
Data structures
Dynamic data structures in Java
Equality and assignment in Java
Memory allocation
Algorithms for heap allocation
Exercises

9.1
9.2
9.3
9.4
9.5

REAL NUMBERS
Representations of real numbers
Language support for real numbers
The three deadly sins
* Real types in Ada
Exercises

10

POLYMORPHISM
10.1 Type conversion
10.2 Overloading
10.3 Generics
10.4 Polymorphic data structures in Java
10.5 Variant records
10.6 Dynamic dispatching
10.7 Exercises

11

EXCEPTIONS
11.1 Exception handling requirements
11.2 Exceptions in PL/I
11.3 Exceptions in Ada
11.4 Exceptions in C++
11.5 Error handling in Eiffel
11.6 Exercises

12

CONCURRENCY
12.1 What is concurrency?
12.2 Shared memory

REGIONAL BOGOT D. C:
CENTRO DE DISEO METROLOGIA Y CALIDAD
Programa de Formacin Anlisis y Desarrollo de Sistemas de Informacin

TEMA ENTENDIENDO EL LENGUAJE DE PROGRAMACION

12.3
12.4
12.5
12.6
12.7
12.8
12.9
12.10
IV

The mutual exclusion problem

Monitors and protected objects
Concurrency in Java
Message passing
occam
Ada rendezvous
Linda00
Exercises

PROGRAMMING LARGE SYSTEM

13

PROGRAM DECOMPOSITION
13.1 Separate compilation . . . .
13.2 Why are modules needed? .
13.3 Packages in Ada . . . . . . .
13.4 Abstract data types in Ada .
13.5 How to write modules in C++
13.6 Exercises . . . . . . . . . .

14

OBJECT-ORIENTED PROGRAMMING
14.1 Object-oriented design . . .
14.2 Object-oriented programming in C++
14.3 Inheritance
14.4 Dynamic polymorphism in C++
14.5 Object-oriented programming in Ada
14.6 Exercises

15

MORE ON OBJECT-ORIENTED PROGRAMMING

15.1 Structuring classes
15.2 Encapsulation in Java
15.3 Access to private components
15.4 Class data
15.5 The Eiffel programming language
15.6 Design considerations
15.7 Methods of dynamic polymorphism
15.8 Exercises

NON-IMPERATIVE PROGRAMMING LANGUAGES

16

FUNCTIONAL PROGRAMMING
16.1 Why functional programming?
16.2 Functions
16.3 Compound types
16.4 Higher-order functions
16.5 Lazy and eager evaluation
16.6 Exceptions
16.7 Environments
16.8 Exercises

17

LOGIC PROGRAMMING
17.1 Pure logic programming
17.2 Unification
17.3 Prolog
17.4 Advanced logic programming concepts
17.5 Exercises

SELECTED BIBLIOGRAPHY

REGIONAL BOGOT D. C:
CENTRO DE DISEO METROLOGIA Y CALIDAD
Programa de Formacin Anlisis y Desarrollo de Sistemas de Informacin

TEMA