A Second Course in Computer Science with MODULA-2Covering thoroughly the central subject of computer science--data structures and algorithms--this text offers a practical introduction to theory, implementation, and applications using the Abstract Data Type approach. For each of the major data types, it provides a definition in terms of objects and operations, an illustration of its use, and at least one method of implementation. Specific topics include parsing, simulation, expression simplification, BNF, and backtracking. Most implementations are analyzed informally through the Big-Oh notation, introduced in the first chapter. Each discussion is followed by larger applications and overviews of related issues. Special emphasis is placed on recursion, which is fully explained and used to clarify other concepts in the book. In addition, program readability is also stressed and reinforced. Throughout, the superiority of Modula-2 over earlier languages is fully exploited. Exercises comprise almost 15% of the text. |
Contents
EXERCISES | 14 |
PROBLEM | 32 |
SUGGESTIONS FOR FURTHER STUDY | 63 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
Ä Ä Ä AddNode adjacency matrix adjacent algorithm application array AVL tree BEGIN binary search tree binary tree BOOLEAN bucket bucket array called CARDINAL chapter CHAR characters Complex Number computer science CONST CurrCh definition module deletions depth-first search DeQueue digit edge element ELSIF empty EndOfFile EnQueue error Euler path example expression tree function graph hash table heap heapsort implementation module Index infix expression input insertion sort integers Item ItemType left subtree length linked list ListIsEmpty loop modified Modula-2 NewItem node OpenInput OpenOutput operand operations output palindrome parameter pointer variable postfix postfix form problem queue Quicksort record recursive right subtree root SearchArg selection sort sequence SetType Shell sort SortArray sorting methods stack StartPos storage StrError string StrLength StrType subfile Token traversal vertex vertices word WriteCard WriteLn END WriteString zero