Summary of Algorithmic Concepts
Rod Stephens · 2019
This appendix summarizes the key concepts covered in each of the book's chapters. The book first describes algorithm basics. A stack is a data structure that provides last-in, first-out access to items. One can implement a stack in a linked list or array, although he/she may need to resize the array if it becomes full. A queue is a data structure that provides first-in, first-out access to items. He/she can implement a queue in a linked list or circular array, although he/she may need to resize the array if it becomes full. Many algorithms use trees, so it is important to remember at least the most basic tree properties. One can model many problems with decision trees. Game trees are a special kind of decision tree. The book also describes network algorithms, string algorithms, cryptographic algorithms, complexity theory, distributed algorithms, and interview puzzles.