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.