Standard Article

Abstract Data Types

  1. Donald Cowan,
  2. P.S.C. Alencar

Published Online: 15 SEP 2008

DOI: 10.1002/9780470050118.ecse001

Wiley Encyclopedia of Computer Science and Engineering

Wiley Encyclopedia of Computer Science and Engineering

How to Cite

Cowan, D. and Alencar, P. 2008. Abstract Data Types. Wiley Encyclopedia of Computer Science and Engineering. 1–11.

Author Information

  1. University of Waterloo, Waterloo, Ontario, Canada

Publication History

  1. Published Online: 15 SEP 2008

Abstract

This article contains a description of the concepts related to abstract data types (ADTs). Specifically, the presentation contains a explanation of the syntax and semantics of ADTs and uses algebraic semantics to describe the properties of the operations on the data types: stack, queue, set, and bag. A program for a stack ADT in the language C is presented to illustrate a practical implementation. Two different versions of the program use an array and a linked list as the underlying data structures to implement the stack ADT without any effect on its interface and hence the program that uses the stack.

Keywords:

  • abstraction;
  • abstract data types;
  • ADTs;
  • data type;
  • algebraic semantics;
  • information hiding;
  • stack;
  • queue;
  • set;
  • bag