An Introduction to Data Structures with ApplicationsThis text is designed for a course in data structures, to introduce students to concepts and terminology in a way that permits a view of computer science as a unified discipline, with an emphasis on problem-solving. This second edition has improvements which include an increased formalization of algorithmic language, more structured algorithms, use of Pascal, new exercises, and more analysis of algorithms. This edition assumes basic familiarity with assembly languages, Pascal, and combinatorial mathematics (including recurrence relations). |
Contents
Introduction | 1 |
Information and Its Storage Representation 3425 | 23 |
The Representation and Manipulation of Strings | 65 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
adjacency matrix algorithm allocated applications array assigned associated assume binary tree block buffer called character contains created CURSOR data structures deletion denotes described descriptor digit discussed disk edge element empty example Exercises for Sec expr expression FIGURE given in Fig graph hash table hashing function indexed sequential file infix INFO initial input insertion integer length linear hashing LINK field linked list main memory Markov algorithm matrix merge method multilist node NULL operations output parameters Pascal pattern performed PL/I pointer variable polynomial position primary bucket problem procedure programming languages queue recursive Repeat thru step represented Return scanning sequence shown in Fig SNOBOL sort stack statement storage representation stored sub2term subject string subsection subtree symbol table tape term tion topological sort TRANSACTION traversal update vector virtual hashing VSAM
References to this book
Text Information Retrieval Systems Charles T. Meadow,Bert R. Boyce,Donald H. Kraft No preview available - 2007 |
An Introduction To The Theory Of Spatial Object Modelling For GIS Martin Molenaar Limited preview - 1998 |