This book in an all-inclusive presentation introduces the datastructures (and their algorithms) that comprise the foundationof software engineering. Designed to show students at the sophomorelevel the connection between a programming approach and mathematicaltheory, the text focuses on practical techniques for studentsto master data structures and efficient algorithm implementation.Other topics pertinent to programmers also receive coverage. Chapter-endingproblems and references give students a helpful review and solidifychapter concepts.
067339736XB04062001
I. INTRODUCTION PROGRAMMING AS AN ENGINEERING ACTIVITY.
STYLE="margin-left: 0.2in;">
Computer Science Background.STYLE="margin-left: 0.4in;">Memory and Data in Von Neuman Computers.
STYLE="margin-left: 0.4in;">Notation for Programs; Locatives.
STYLE="margin-left: 0.4in;">Abstract Data Types.
STYLE="margin-left: 0.2in;">
Mathematical Background.STYLE="margin-left: 0.4in;">Finite and Infinite Series.
STYLE="margin-left: 0.4in;">Logarithms, Powers, and Exponentials.
STYLE="margin-left: 0.4in;">Order Notation.
STYLE="margin-left: 0.4in;">Recurrence Relations.
STYLE="margin-left: 0.4in;">Naive Probability Theory.
II. ALGORITHM ANALYSIS.
STYLE="margin-left: 0.2in;">
Properties of an Algorithm.STYLE="margin-left: 0.4in;">Effectiveness; Correctness.
STYLE="margin-left: 0.4in;">Termination; Efficiency.
STYLE="margin-left: 0.4in;">Program Complexity.
STYLE="margin-left: 0.2in;">
Exact vs. Growth-Rate Analysis.STYLE="margin-left: 0.4in;">Principles of Mathematical Analysis.
STYLE="margin-left: 0.4in;">Expected Case and Amortized Analysis.
STYLE="margin-left: 0.2in;">
Algorithm Paradigms.STYLE="margin-left: 0.4in;">Brute-Force and Exhaustive Search.
STYLE="margin-left: 0.2in;">
Greedy Algorithms.STYLE="margin-left: 0.4in;">Dynamic Programming.
STYLE="margin-left: 0.4in;">NP Completeness.
III. LISTS.
STYLE="margin-left: 0.2in;">
List Operations.STYLE="margin-left: 0.4in;">Basic List Representations.
STYLE="margin-left: 0.4in;">Stack Representation in Contiguous Memory.
STYLE="margin-left: 0.4in;">Queue Representation in Contiguous Memory.
STYLE="margin-left: 0.4in;">Stack Representation in Linked Memory.
STYLE="margin-left: 0.4in;">Queue Representation in Linked Memory.
STYLE="margin-left: 0.4in;">Stacks and Recursions.
STYLE="margin-left: 0.4in;">List Representations for Traversals.
STYLE="margin-left: 0.4in;">Doubly Linked Lists.
IV. TREES BASIC DEFINITIONS.
STYLE="margin-left: 0.2in;">
Special Kinds of Trees.STYLE="margin-left: 0.4in;">Tree Operations and Traversals.
STYLE="margin-left: 0.4in;">Tree Implementations.
STYLE="margin-left: 0.4in;">Representation of Binary Trees.
STYLE="margin-left: 0.4in;">Representation of Ordered Trees.
STYLE="margin-left: 0.4in;">Representation of Complete Binary Trees.
STYLE="margin-left: 0.4in;">Implementing Tree Traversals and Scans.
STYLE="margin-left: 0.4in;">Stack-Based Traversals.
STYLE="margin-left: 0.4in;">Link Inversion Traversal.
STYLE="margin-left: 0.4in;">Scanning a Tree in Constant Space.
STYLE="margin-left: 0.4in;">ThreadedTrees.
STYLE="margin-left: 0.4in;">Implementing Level-Order Traversal.
<< less