What people are saying - Write a review
We haven't found any reviews in the usual places.
Information and Its Storage Representation
The Representation and Manipulation of Strings
Linear Data Structures and Their Sequential Storage Representation
6 other sections not shown
Other editions - View all
adjacency matrix algorithm allocated applications array assigned associated assume binary tree block called character contains created CURSOR data structures deletion denotes described descriptor digit discussed EBCDIC 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 linear list linked list main memory Markov algorithm matrix merge method multilist NULL operations output parameters Pascal performed PL/I pointer variable polynomial position primary bucket problem procedure programming language queue recursive Repeat thru step represented Return scanning sequence shown in Fig SNOBOL sort stack statement storage representation stored sub2term subject string subsection substring subtree symbol table tape term tion topological sort TRANSACTION traversal update vector virtual hashing VSAM