Abstract Data Types and Algorithms

Abstract Data Types and Algorithms
Author: Manoochchr Azmoodeh
Publisher: Springer
Total Pages: 395
Release: 1990-11-30
Genre: Computers
ISBN: 1349211516

Intended as a second course on programming with data structures, this book is based on the notion of an abstract data type which is defined as an abstract mathematical model with a defined set of operations.

Java Collections

Java Collections
Author: David A. Watt
Publisher: John Wiley & Sons
Total Pages: 572
Release: 2001-03-30
Genre: Computers
ISBN:

A unique, practical approach to working with collection classes in Java 2 Software developers new to Java will find the practical, software-engineering based approach taken by this book extremely refreshing. With an emphasis more on software design and less on theory, Java Collections explores in detail Java 2 collection classes, helping programmers choose the best collection classes for each application they work on. Watt and Brown explore abstract data types (ADTs) that turn up again and again in software design, using them to provide context for the data structures required for their implementation and the algorithms associated with the data structures. Numerous worked examples, several large case studies, and end-of-chapter exercises are also provided.

Abstract Data Types

Abstract Data Types
Author: Nell Dale
Publisher: Jones & Bartlett Learning
Total Pages: 770
Release: 1996
Genre: Computers
ISBN: 9780669400007

Since 1985 Nell Dale's texts have helped shape the way computer science is taught. Now she and Henry Walker, an accomplished instructor and author in his own right, are proposing a new focus for the junior/senior level data structures course. A timely response to the prevalence of object-oriented programming, this new text expands the focus of the advanced data structures course to examine not only the structure of a data object but also its type. This new focus gives students the opportunity to look at data objects from the point of view of both user and implementer.

Abstract Data Types in Java

Abstract Data Types in Java
Author: Michael S. Jenkins
Publisher: McGraw-Hill Companies
Total Pages: 356
Release: 1998
Genre: Computers
ISBN:

Accompanying CD-ROM has complete source code for abstract data types in Java as discussed in the book and Java development kit (JDK) version 1.13.

Abstract Data Types in Standard ML

Abstract Data Types in Standard ML
Author: Rachel Harrison
Publisher:
Total Pages: 232
Release: 1993-08-27
Genre: Computers
ISBN:

Abstract Data Types in Standard ML Rachel Harrison University of Southampton, UK This book presents a thorough treatment of data abstraction within a functional framework. The approach to abstract data types strikes a balance between the theoretical and the practical, stressing the importance of producing reliable, high quality code which is robust and reusable. Exercises are provided, as well as numerous annotated algorithms in Standard ML. Emphasis is placed on the key concepts of specification, modularity and generality. Each chapter shows how to specify, apply and implement generic abstract data types, and the specifications are used to verify and validate the correctness of the implementations. Students of software engineering will find this book particularly attractive—for courses such as advanced programming, program design, algorithms and data structures, and program specification. It will also serve as a useful post-introductory text for courses on functional programming.

Specification of Abstract Data Types

Specification of Abstract Data Types
Author: Jacques Loeckx
Publisher: Vieweg+Teubner Verlag
Total Pages: 280
Release: 1996
Genre: Computers
ISBN:

Specification of Abstract Data Types provides an authoritative introduction to the mathematical foundations of algebraic program specification. Unlike most other publications on the subject, this book does not draw on category theory, but instead tries to demystify the topic and promote its use in practical applications. It clearly distinguishes between the study of algebras, logic, specification methods and specification languages and it avoids focusing on a particular logic or a particular specification method. While treating the subject with mathematical precision, the book contains numerous examples, exercises and comments to provide a deeper understanding of concepts discussed. It was conceived as a student textbook but will also be a useful source of reference for researchers and developers using formal specification methods for software design.

Simply Scheme

Simply Scheme
Author: Brian Harvey
Publisher: MIT Press
Total Pages: 620
Release: 1999
Genre: Computers
ISBN: 9780262082815

Showing off scheme - Functions - Expressions - Defining your own procedures - Words and sentences - True and false - Variables - Higher-order functions - Lambda - Introduction to recursion - The leap of faith - How recursion works - Common patterns in recursive procedures - Advanced recursion - Example : the functions program - Files - Vectors - Example : a spreadsheet program - Implementing the spreadsheet program - What's next?

Problem Solving with Algorithms and Data Structures Using Python

Problem Solving with Algorithms and Data Structures Using Python
Author: Bradley N. Miller
Publisher: Franklin Beedle & Associates
Total Pages: 0
Release: 2011
Genre: Algorithms
ISBN: 9781590282571

Thes book has three key features : fundamental data structures and algorithms; algorithm analysis in terms of Big-O running time in introducied early and applied throught; pytohn is used to facilitates the success in using and mastering data strucutes and algorithms.

Nonsequential and Distributed Programming with Go

Nonsequential and Distributed Programming with Go
Author: Christian Maurer
Publisher: Springer Nature
Total Pages: 419
Release: 2021-01-19
Genre: Computers
ISBN: 3658297824

Der Band bietet eine kompakte Einführung in die Nichtsequentielle Programmierung als gemeinsamen Kern von Vorlesungen über Betriebssysteme, Verteilte Systeme, Parallele Algorithmen, Echtzeitprogrammierung und Datenbanktransaktionen. Basiskonzepte zur Synchronisation und Kommunikation nebenläufiger Prozesse werden systematisch dargestellt: Schlösser, Semaphore, Monitore, lokaler und netzweiter Botschaftenaustausch. Die Algorithmen sind in der Programmiersprache Google Go formuliert, mit der viele Synchronisationskonzepte ausgedrückt werden können.