Abstract data types in Modula-2
Author(s)
Bibliographic Information
Abstract data types in Modula-2
Wiley, c1989
Available at 2 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Bibliography: p. 267-269
Includes index
Description and Table of Contents
Description
Software engineering emerged as a bona fide academic discipline in the 1960s. By the mid-1970s it had been realised that data encapsulation and data abstraction also played a part in the production of correct software resulting in the design of imperative languages such as Modula-2 and Ada. This book is concerned with the theory and practice of data abstraction and the importance of specification. A functional programming style is adopted and the text illustrates how easily a specification written in a functional style can be implemented in Modula-2. It is aimed at students who have completed an introductory programming course.
Table of Contents
- The abstract data type list, queue, stack, set, tree, n-ary tree, table, graph. Appendices: review of pointers in Modula-2
- Modula-2 for Pascal programmers
- Modula-2 syntax diagrams
- Modula-2 standard utility modules
- Modula-2 reserved words and standard procedures
- answers to exercises.
by "Nielsen BookData"