Object-Oriented Data Abstraction in Modula-3

Joseph Bergin
Pace University

Joseph Bergin
Computer Science
Pace University
One Pace Plaza
New York, NY 10038

Chapter 1. Introduction

• 1.1 Object Oriented Programming
• 1.2 Other Languages
• 1.3 The Language Modula-3
• 1.4 Programming In Modula-3
• 1.5 Introduction to the Elementary Ideas and Syntax of Modula-3
  • 1.5.1 What a Modula-3 Program Looks Like.
  • 1.5.2. How you use Modula-3
  • 1.5.3 Input and Output
  • 1.5.4 Data Types
  • 1.5.5 Statements and Expressions
  • 1.5.6 Pointers and Reference Parameters
  • 1.5.7 Type Inquiry at Run-Time
  • 1.5.8 Procedures and Procedure Types
  • 1.5.9 Separate Compilation and Linkage
  • 1.5.10 Classes and Objects
  • 1.5.11 Example -- Simple Stacks
  • 1.5.12 Generic Interfaces and Modules
  • 1.5.13 Exceptions
• 1.6 Summary
• EXERCISES

Chapter 2 Data Abstraction and Object Oriented Programming

• 2.1 The Programming Process
• 2.2 Abstraction and Structure
• 2.3 Abstraction in programming
• 2.4 Procedural Abstraction
• 2.5 Data Abstraction
• 2.6 Object Oriented Programming
• 2.7 CLASSES and OBJECTS and References to OBJECTS
• 2.8 Executing Methods
• 2.9 What an Object Oriented Program Looks Like.
• 2.10 OBJECT DESIGN
• 2.11 Designing Objects
• 2.12 Stacks as a Class
• 2.13 Object Programming and Abstract Data Types
• 2.14 A Mental Model for Object Programming
• 2.15 Summary
• EXERCISES

Chapter 3 Fundamental Ideas and the Class Hierarchy

• 3.1 Classes and Objects
• 3.2 Object References and Aliases
• 3.3 Inheritance: Start at the Top
• 3.4 Collections and Iterators
• 3.5 Magnitudes
• 3.6 Another simple example -- Fractions
• 3.7 Summary

Chapter 4 The Collection and Magnitude classes

• 4.1 OBJECT
• 4.2 Magnitudes
  • 4.2.1 Characters
  • 4.2.2 Strings
  • 4.2.3 Associations
  • 4.2.4 Pairs
  • 4.2.5 Numeric classes
  • 4.2.6 Fractions
  • 4.2.7 Complex Numbers
  • 4.2.8 Integers
  • 4.2.9 Reals
  • 4.2.10 Large integers
• 4.3 Collections and their Iterators.
  • 4.3.1 Sets
  • 4.3.2 Bags or Multi-Sets
  • 4.3.3 Dictionaries
  • 4.3.4 Lists and List Positions
  • 4.3.5 List-like structures
  • 4.3.6 Sortable lists
  • 4.3.7 Binary trees
  • 4.3.8 General trees
  • 4.3.9 Binary Search Trees and Heaps
  • 4.3.10 Dynamic arrays
  • 4.3.11 Intervals
• 4.4 Abstraction again
• 4.5 Summary
• Exercises

Chapter 5 Using the Fundamental Structures

• 5.1 Deterministic Finite Automata
• 5.2 Expression Translation
• 5.3 Summary
• Exercises
• Projects
  • 1. Relational Databases
  • 2. Grocery Warehouse Problem
  • 3. Maze Walking Robot Problem
  • 4. Simulation problem
  • 5. Huffman Encoding and Decoding Problem
  • 6. Simulation of a simple computer system.