Data Structures Using Pascal
Author : Aaron M.. Tenenbaum
Publisher :
Page : 297 pages
File Size : 45,32 MB
Release : 1987
Category : Data structures (Computer science)
ISBN : 9780131966765
Author : Aaron M.. Tenenbaum
Publisher :
Page : 297 pages
File Size : 45,32 MB
Release : 1987
Category : Data structures (Computer science)
ISBN : 9780131966765
Author : Gaston H. Gonnet
Publisher : Addison Wesley Publishing Company
Page : 304 pages
File Size : 41,51 MB
Release : 1984
Category : Computers
ISBN :
Author : Robert R. Korfhage
Publisher : McGraw-Hill Science, Engineering & Mathematics
Page : 488 pages
File Size : 49,55 MB
Release : 1987
Category : Computers
ISBN :
Author : Ellis Horowitz
Publisher :
Page : 564 pages
File Size : 36,46 MB
Release : 1978
Category : Data structures (Computer science)
ISBN :
Author : Johan Lewi
Publisher : Springer Science & Business Media
Page : 402 pages
File Size : 42,4 MB
Release : 2013-06-29
Category : Computers
ISBN : 3642702392
This book is intended as a text for a course in programming languages. The pre requisites for such a course are insight in structured programming and knowledge as well as practical experience of at least one (e.g., Pascal) of the programming languages treated in the book. The emphasis is on language concepts rather than on syntactic details. The book covers a number of important language concepts that are related to data struc tures. The comparison of the programming languages Pascal, Algol 68, PL/1 and Ada consists in investigating how these concepts are supported by each of these languages. Interesting evaluation criteria are generality, simplicity, safety, readability and portability. The study of programming languages is based on a simple model called SMALL. This model serves as a didactic vehicle for describing, comparing and evaluating data structures in various programming languages. Each chapter centers around a specific language concept. It consists of a general discussion followed by a number of language sections, one for each of the languages Pascal, Algol 68, PL/1 and Ada. Each of these sections contains a number of illustrating program fragments written in the programming language concerned. For each program fragment in one language, there is an analogous fragment in the others. The book can be read "vertically" so that the programming languages Pascal, Algol 68, PL/1 and Ada are encountered in that order several times. A "horizontal" reading of the book would consist in selecting only those sections which only concern one language.
Author : Frank M. Carrano
Publisher : Benjamin-Cummings Publishing Company
Page : 806 pages
File Size : 36,39 MB
Release : 1993
Category : Business & Economics
ISBN :
The bestselling exploration of recursion and recursive problem solving is now available in a new Turbo Pascal edition. This new edition includes optional sections on object-oriented programming as well as coverage of Turbo Compiler Directives, Turbo Compiler Error Messages, and the difference between Turbo Pascal and Standard Pascal.
Author : Nell B. Dale
Publisher : D.C. Heath
Page : 888 pages
File Size : 19,70 MB
Release : 1991
Category : Computers
ISBN :
Author : Nancy Ellen Miller
Publisher : Benjamin-Cummings Publishing Company
Page : 520 pages
File Size : 34,80 MB
Release : 1987
Category : File organization (Computer science).
ISBN :
Data -- Files.
Author : Daniel F. Stubbs
Publisher : PWS Publishing Company
Page : 498 pages
File Size : 33,39 MB
Release : 1989
Category : Computers
ISBN :
Author : Edward M. Reingold
Publisher :
Page : 530 pages
File Size : 49,75 MB
Release : 1986
Category : Computers
ISBN :
This is a revision of the authors 1982 volume into Pascal, the language most widely used for teaching data structures. Data structures are central to computer science, and in particular to programming. In the analytic areas, appropriate data structures have been the key to advances in the design of algorithms. Once appropriate data structures are carefully defined, all that remains is routine coding. A comprehensive understanding of data structure techniques is essential in the design of algorithms and programs. This text presents a carefully chosen fraction of available material, but supplement it with a wide variety of exercises. No single book can discuss all known data structures or algorithms. This text presents the art of designing data structures, preparing the student to devise special-purpose structures for specific problems as they present themselves.