Information representation and manipulation using Pascal / E.S. Page, L.B. Wilson.
Material type:
TextLanguage: English Series: Cambridge computer science texts ; 15Publication details: Cambridge [Cambridgeshire] ; New York : Cambridge University Press, c1983. Description: xii, 272 p. : ill. ; 24 cmISBN: 0521249546; 0521270960 (pbk.)Subject(s): Input design, Computer | Data structures (Computer science)DDC classification: 004 LOC classification: QA76.9.I55 | P333 1983Online resources: OCLC | Table of contents Summary: The book first introduces basic ideas of information and coding theory and then proceeds to discuss how single items of data are represented and manipulated in computers. The middle section of the book deals with the three main classes of data structure - arrays, lists and trees. The final two chapters cover the important subjects of searching and sorting. At the end of each chapter, three kinds of example are given: straightforward drill exercises, university examination questions and suggestions for project work; hints on the solutions are provided. In this new text, based on the authors' Information Representation and Manipulation in a Computer (second edition), Pascal has been used for all of the algorithms, which have also been structurally improved with their conversion, particularly by the removal of the GOTO statements.
| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Text
|
Dr. S. R. Lasker Library, EWU Reserve Section | Non-fiction | 004 PAI 1983 (Browse shelf(Opens below)) | C-1 | Not For Loan | 507 |
Includes bibliographical references and index.
The book first introduces basic ideas of information and coding theory and then proceeds to discuss how single items of data are represented and manipulated in computers. The middle section of the book deals with the three main classes of data structure - arrays, lists and trees. The final two chapters cover the important subjects of searching and sorting. At the end of each chapter, three kinds of example are given: straightforward drill exercises, university examination questions and suggestions for project work; hints on the solutions are provided. In this new text, based on the authors' Information Representation and Manipulation in a Computer (second edition), Pascal has been used for all of the algorithms, which have also been structurally improved with their conversion, particularly by the removal of the GOTO statements.
CSE
Rokon Mahamud
Click on an image to view it in the image viewer
There are no comments on this title.