0.1 Table of content

Data Structures and Algorithms

Contents

1. Introduction to Algorithms
   • Problem solution
   • Data models
   • Data models in programming languages
   • Data structures
   • Algorithms analysis
2. Linked lists
   • Singly linked lists
   • Doubly linked lists
   • Circular linked lists
   • Table transform
3. Stack and Queue
   • Stack
   • Queue
   • Priority queue
4. Recursion
   • Introduction to recursion
   • Recursion analysis
   • Tail recursion
   • Recursion and stack
   • Course-of-values recursion
   • Potential recursion
   • Transfinite recursion
   • Simultaneous recursion
   • Back tracking
   • Conclusion
5. Binary search trees
   • Introduction to binary trees
   • Expected node depth
   • Analyzing height
   • Post mortem
   • Heap
6. Sorting
   • Basic sort algorithms
     • Insertion sort
     • Selection sort
     • Bubble sort
   • Effectively sorting algorithms
     • Shell sorting
     • Heap sort
     • Quicksort
     • Merge sort
7. Graphs
   • Graph representation
   • Graph analysis
   • Minimum spanning trees
     • Boruvska’s algorithms
     • Kruskal’s algorithms
     • Jarnik-Prim’s algorithms
   • Shortest paths
     • Properties of shortest paths
     • Dijkstra’s algorithms
     • Breadth-first search
     • Bellman-Ford algorithms
     • Johnson’s algorithms
   • Union-find problem
   • Connectivity
     • Non-direction connectivity
     • Direction connectivity
   • Topological sort
8. Hashing
   • Introduction to hashing algorithms
   • Hash list
   • Hash table
   • Hash tree
   • Choosing hash function
   • Universal hashing
   • Perfect hashing