ADA 83 TUTORIAL

This tutorial teaches the entire Ada 83 dialect of the Ada language. It is composed of 31 chapters which should be studied in order since topics are introduced in a logical order and build upon topics introduced in previous chapters. It is to the students benefit to download the source code for the example programs, then compile and execute each program as it is studied. The diligent student will then modify the example program in some way, then recompile and execute it to see if he understands the material studied for that program. This will provide the student with valuable experience with his compiler.

The recommended method of study is to print the text for one or two chapters, download the example programs, and study the material by loading the example programs in the compiler's editor for viewing. Following successful completion of each chapter additional chapters can be downloaded as progress is made.

Note that completion of the first part of this tutorial will give the student the ability to write very significant programs in Ada, but completion of the second part will give the student the ability to use all of the capabilities of Ada.

Version 2.0 - July 1, 1991 - (Minor revisions - March 14, 1997)

Part 1 - Beginning Ada 83 Tutorial

Introduction - What is Ada and why study it?
Chapter 1 - Getting Started
Chapter 2 - Program Structure
Chapter 3 - The Integer Type Variable
Chapter 4 - Logical Compares & precedence
Chapter 5 - Control Structures
Chapter 6 - Additional Scalar Types
Chapter 7 - Derived Types
Chapter 8 - Subprograms
Chapter 9 - Blocks and Scope of variables
Chapter 10 - Arrays
Chapter 11 - The Character & String Type
Chapter 12 - Records
Chapter 13 - The Access Type Variable
Chapter 14 - Input/Output
Chapter 15 - Packages
Chapter 16 - Example Programs

Part 2 - Advanced Ada 83 Tutorial

Chapter 17 - Exceptions
Chapter 18 - Advanced Subprogram Topics
Chapter 19 - Advanced Array Topics
Chapter 20 - Advanced Record Topics
Chapter 21 - Advanced Packages & Private Types
Chapter 22 - Binary Input/Output
Chapter 23 - Dynamic Allocation
Chapter 24 - Tasking
Chapter 25 - The Simple Redezvous
Chapter 26 - The Conditional Rendezvous
Chapter 27 - Additional Tasking Topics
Chapter 28 - Generic Subprograms
Chapter 29 - Generic Packages
Chapter 30 - Control of Representation
Chapter 31 - More Example Programs

The source code and the answers are kept in a separate directory.


Copyright © 1988-1997 Coronado Enterprises - Last update, March 14, 1997
Gordon Dodrill - dodrill@swcp.com -
Please email any comments or suggestions.