"Computer Algorithms: Correctness Proofs and Performance Analyses” by Shashank K. Mehta contains many algorithms and data structures. It also covers the necessary mathematical background and is suitable for students from different classes. This is the major strength of the book. Not only does it contain information on core areas of mathematics, but it pushes further into information that is usually unseen in other books.
Every algorithm is described by a pseudocode together with formal proofs of its correctness and time complexity, which allows readers to grasp not only the principles of algorithm implementation but also the reasons behind its efficiency. To help clarify the concepts introduced, examples are also given at various points in the book.
The book, "Computer Algorithms: Correctness Proofs and Performance Analyses,” is intended for both basic-level and upper-level courses. Thus, it is appropriate to use in the classes for undergraduate and postgraduate students in Computer Science and Engineering. It includes topics like string homomorphism and isomorphism, proof of graph matching algorithms, Gallai-Edmonds decomposition, and the Matroid intersection by Klein, as well as general algorithm design and analysis knowledge.
Computer Algorithms: Correctness Proofs and Performance Analyses Table of Contents:
- Basics of Computer Algorithms
- Elementary Data Structures
- Graph Exploration Algorithms
- String Matching and String Isomorphism
- Divide and Conquer and Dynamic Programming
- Matching in an Unweighted Graph
- Greedy Paradigm and Matroid Algorithms
- Flow and Circulation Networks
- System of Linear Equations and Matrix Operations
- Linear Programs and Simplex Algorithm
- Interior Point Methods for Linear Programs
- Weighted Matching: An Application of Primal-Dual Technique
- Complexity of Elementary Arithmetic and Polynomial Operations
- Modular Arithmetic Computations
- Discrete Fourier Transform
- Two Integer-Algorithms
Who is this course for?
- This study's target population of interest is undergraduate computer science and engineering students.
- The targeted population in this study is the postgraduate students in the computer science and engineering field.
- Lecturers in the first and senior-level algorithms course
- Implementers and researchers on the subject of algorithms in search of a reference guide
