When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
We present a series of programming exercises based on photographic images of Mars collected by the NASA Viking Orbiter. Even without the news that there may once have been life on...
Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms ...
Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guy...
In courses involving team programming projects, it is desirable to have team members share files, and establish procedures for developing a configuration. Often, faculty members a...
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...