Sequential and Concurrent Programming in Java

Area 01 – Scienze matematiche e informatiche

We present a collection of Java programs which can be used in a course on object oriented programming and concurrent programming in Java. In the first part of the book we illustrate the use of classes, objects, and interfaces, and we present some important programming techniques such as iteration, recursion, and backtracking. We also present the construction of a parser for a simple context-free language. In the second part of the book we introduce the basic ideas of concurrent programming in Java. We present, among others, the following programs: concurrent mergesort, concurrent quicksort, producers and consumers acting on shared bounded buffers, Peterson's algorithm for mutual exclusion, a solution of Dijkstra's Five Philosophers problem, and the concurrent computation of shortest paths in directed graphs. In the third part of the book we illustrate, through some simple Java programs according to Sestoft's style, the definitions of class hierarchies, the use of member and local classes, the construction of objects, the access to fields, the use of overridden and overloaded methods, and the use of graphical interfaces, exceptions, and packages.Alberto Pettorossi is Professor of Theoretical Computer Science at the Engineering Faculty of the University of Roma “Tor Vergata”. His research activity has been in the area of rewriting systems, concurrent computation, and automatic derivation, transformation, and verification of programs.

SINTESI