Part II – Implementing Discrete Mathematics in Data and Computer Science
This part of the book covers applications of discrete mathematics to core concepts of computer science, including linear algebra; the complexity of algorithms in the worst case and on average; storing and extracting features from graphs, trees, and networks, graph searches; and finding shortest paths on networks.
This part comprises the following chapters:
- Chapter 6, Computational Algorithms in Linear Algebra
- Chapter 7, Computational Requirements for Algorithms
- Chapter 8, Storage and Feature Extraction of Graphs, Trees, and Networks
- Chapter 9, Searching Data Structures and Finding Shortest Paths