Data structures and discrete math catalogs

Chapter 3rd Stacks and queues
3.1 Stacks
3.2 Stack's Due and examples
3.3 Stack and recursive implementation
3.4 Queues
3.5 Discrete Event Simulation
4th Chapter Series
4.1 Definitions of String types
expression and implementation of 4.2 strings
4.3-string pattern matching algorithm
4.4 String Operation Application Example
5th. Arrays and Generalized tables
5.1 Definition of an array
5.2 Sequential representation and implementation of arrays
5.3 Compression storage of matrices
5.4 Definition of a generalized table
5.5 Storage structure of generalized tables
Representation of 5.6 m-tuple polynomial
5.7 Recursive algorithm for generalized tables Chapter 6th tree and two-fork tree
6.1 Definition and basic terminology of trees
6.2 Two Fork Tree
6.2. Definition of 12-fork Tree
6.2. The nature of the 22-fork Tree
6.2. Storage structure of 32-fork Tree
6.3 Traversing binary tree and clue two fork tree
6.3.1 traversing a binary tree
6.3.2 Clue two fork Tree
6.4 Trees and forests
Storage structure of 6.4.1 tree
Conversion of 6.4.2 Forest and two-fork tree
6.4.3 Tree and Forest traversal
6.5 Tree and Equivalence problem
6.6 Heffman and its application
6.6.1 Optimal binary tree (Heffman)
6.6.2 Huffman encoding
6.7 Backtracking method and tree traversal
6.8 Count of the trees
7th Chapter Diagram
7.1 Definition and terminology of graphs
7.2 Storage structure of graphs
7.2.1 array notation
7.2.2 adjacency Table
7.2.30-word Linked list
7.2.4 adjacency Multiple table
7.3 Traversal of graphs
7.3.1 Depth First Search
7.3.2 Breadth First Search
Connectivity issues for 7.4 graphs
The connected components and spanning tree of 7.4.1 undirected graphs
Strong connected components of 7.4.2 graphs
7.4.3 minimum Spanning Tree
7.4.4 Joint points and re-connected components
7.5 A direction-free graph and its application
7.5.1 topology Ordering
7.5.2 Critical Path
7.6 Shortest Path
7.6.1 the shortest path from one source point to the remaining vertices
7.6.2 the shortest path between each pair of vertices
9th Chapter Search
9.1 Static Lookup Table
9.1.1 Lookup of sequential tables
Searching of 9.1.2 ordered table
9.1.3 Static Tree Table lookup
9.1.4 Lookup of Index Order table
9.2 Dynamic Lookup Table
9.2.12 fork sorting tree and balanced binary tree
9.2.2 and B + trees
9.2.3 Key Tree
9.3 Hash Table
9.3.1 What is a hash table
The construction method of 9.3.2 hash function
9.3.3 methods for dealing with conflicts
The lookup and analysis of 9.3.4 hash table
10th Chapter Internal Sorting
10.1 Overview
10.2 Insert Sort
10.2.1 Direct Insert Sort
10.2.2 Other Insert Sort
10.2.3 Hill Sort
10.3 Quick Sort
10.4 Select Sort
10.4.1 Simple Selection sorting
10.4.2 Tree Selection Sort
10.4.3 Heap Sorting
10.5 Merge Sort
10.6 Cardinality Sorting
10.6. Sorting of more than 1 keywords
10.6.2 Chain cardinality sorting
10.7 Comparative discussion on various internal sorting methods
11th Chapter External Sorting
11.1 Access to external memory information
11.2 Methods for external sorting
11.3 Realization of multi-path balance merging
11.4 Permutation One Select sort
11.5 Best Merging Tree

The 1th chapter proposition logic
1.1 Propositional symbolization and connectives
1.2 Proposition Formula and classification
1.3 Equivalence calculus
1.4 Junction Word full feature set
1.5 Duality and Paradigm
1.6 Theory of reasoning
Analysis of 1.7 cases
Exercises
2nd Chapter One-order logic
2.1 Basic concepts of first-order logic
2.2 First order logical formula and its interpretation
2.3 First-order logic equivalents
Analysis of 2.4 cases
Exercises
The basic concepts and operations of the 3rd chapter set
3.1 Basic concepts of integrated collection
3.2 Basic operations of the Integrated collection
3.3 Count of elements in the set
Analysis of 3.4 cases
Exercises
The 4th Chapter two relations and functions
4.1 Integrated Cartesian product and two-yuan relationship
4.2 Operation of the relationship
4.3 Nature of the relationship
4.4 Closure of the relationship
4.5 equivalence relation and partial order relation
4.6 Definition and nature of functions
Compound and inverse functions of 4.7 functions
Analysis of 4.8 cases
Exercises
Chapter 5th General properties of algebraic systems
5.1 Two-dollar operation and its properties
5.2 Algebraic systems and their descendants and integrable algebras
Homomorphism and isomorphism of 5.3 algebraic systems
Analysis of 5.4 Cases
Exercises
The 6th chapter of several typical algebraic systems
6.1 Semigroups and Groups
6.2 Rings and domains
6.3 Lattice and Boolean algebra
Analysis of 6.4 cases
Exercises
The basic concept of the 7th Chapter diagram
7.1 Non-direction graphs and graphs
7.2 Connectivity of channels, loops and graphs
7.3 Matrix representation of graphs
7.4 Shortest path and critical path
Analysis of 7.5 cases
Exercises
The 8th chapter some special figures
8.1 Two part diagram
8.2 Eulerian graph
8.3 Hamiltonian diagram
8.4 Floor Plan
Analysis of 8.5 cases
Exercises
9th Chapter Tree
9.1 Non-direction tree and spanning tree
9.2 Root trees and their applications
Analysis of 9.3 Cases
Exercises
The 10th chapter of combination Analysis preliminary
10.1 addition rule and multiplication rule
10.2 Counting methods of the basic permutation combinations
The solution and application of 10.3 recursive equation
Analysis of 10.4 Cases
Exercises
Chapter 11th formal language and automata preliminary
11.1 Formal language and formal grammar

Data structures and discrete math catalogs