Schaum's outline of theory and problems of data structures - Info and Reading Options

"Schaum's outline of theory and problems of data structures" Table Of Contents:

• 1- Introduction and Overview
• 2- Introduction
• 3- Basic Terminology; Elementary Data Organization
• 4- Data Structures
• 5- Data Structure Operations
• 6- Algorithms: Complexity, Time-Space Tradeoff
• 7- Preliminaries
• 8- Introduction
• 9- Mathematical Notation and Functions
• 10- Algorithmic Notation
• 11- Control Structures
• 12- Complexity of Algorithms
• 13- Subalgorithms
• 14- Variables, Data Types
• 15- String Processing
• 16- Introduction
• 17- Basic Terminology
• 18- Storing Strings
• 19- Character Data Type
• 20- String Operations
• 21- Word Processing
• 22- Pattern Matching Algorithms
• 23- Arrays, Records and Pointers
• 24- Introduction
• 25- Linear Arrays
• 26- Representation of Linear Arrays in Memory
• 27- Traversing Linear Arrays
• 28- Inserting and Deleting
• 29- Sorting; Bubble Sort
• 30- Searching; Linear Search
• 31- Binary Search
• 32- Multidimensional Arrays
• 33- Pointers; Pointer Arrays
• 34- Records; Record Structures
• 35- Representation of Records in Memory; Parallel Arrays
• 36- Matrices
• 37- Sparse Matrices
• 38- Linked Lists
• 39- Introduction
• 40- Linked Lists
• 41- Representation of Linked Lists in Memory
• 42- Traversing a Linked List
• 43- Searching a Linked List
• 44- Memory Allocation; Garbage Collection
• 45- Insertion into a Linked List
• 46- Deletion from a Linked List
• 47- Header Linked Lists
• 48- Two-Way Lists
• 49- Stacks, Queues, Recursion
• 50- Introduction
• 51- Stacks
• 52- Array Representation of Stacks
• 53- Arithmetic Expressions; Polish Notation
• 54- Quicksort, an Application of Stacks
• 55- Recursion
• 56- Towers of Hanoi
• 57- Implementation of Recursive Procedures by Stacks
• 58- Queues
• 59- Deques
• 60- Priority Queues
• 61- Trees
• 62- Introduction
• 63- Binary Trees
• 64- Representing Binary Trees in Memory
• 65- Traversing Binary Trees
• 66- Traversal Algorithms Using Stacks
• 67- Header Nodes; Threads
• 68- Binary Search Trees
• 69- Searching and Inserting in Binary Search Trees
• 70- Deleting in a Binary Search Tree
• 71- Heap; Heapsort
• 72- Path Lengths; Huffman's Algorithm
• 73- General Trees
• 74- Graphs and Their Applications
• 75- Introduction
• 76- Graph Theory Terminology
• 77- Sequential Representation of Graphs; Adjacency Matrix; Path Matrix
• 78- Warshall's Algorithm; Shortest Paths
• 79- Linked Representation of a Graph
• 80- Operations on Graphs
• 81- Traversing a Graph
• 82- Posets; Topological Sorting
• 83- Sorting and Searching
• 84- Introduction
• 85- Sorting
• 86- Insertion Sort
• 87- Selection Sort
• 88- Merging
• 89- Merge-Sort
• 90- Radix Sort
• 91- Searching and Data Modification
• 92- Hashing
• 93- Index

Read “Schaum's outline of theory and problems of data structures”:

Read “Schaum's outline of theory and problems of data structures” by choosing from the options below.