Fundamentals of Algorithms with Applications
Michael T. Goodrich's Fundamentals of Algorithms with Applications gives good coverage to algorithmic principles and their application. It covers growth functions, basic data structures, sorting, selection, dynamic programming, graph algorithms-the principles of algorithm design. Advanced topics such as NP-completeness, approximation algorithms, and randomized algorithms are also explored. Goodrich's book is well-recognized for its lucid explanations of the exercises on these complex topics to make them understandable and lively. Theoretically sound, with practical applications, this book suits both students and professionals in developing problem-solving skills and computational understanding.
Author(s): Michael T. Goodrich
NA Pages 
Lecture Notes on Design and Analysis of Algorithms
These ecture notes give a comprehensive introduction to the basic techniques in the design and analysis of algorithms. It covers major methodologies, including greedy methods, which build up solutions piece by piece; dynamic programming (DP), which breaks down problems into simpler subproblems, solves them, and memorizes their solutions; and backtracking, which incrementally generates candidates for solutions and discards those that cannot satisfy criteria. It also discusses the method of Branch and Bound, where all branches on a solution space are systematically explored until the best possible solution is obtained. These methods are crucial in the design of nice algorithms with a view to efficiency, and they form the basis of complex computational problems that require solutions.
Author(s): Annamalai University
96 Pages
Lecture Notes On Design And Analysis Of Algorithms
Dr. Subasish Mohapatra's Lecture Notes on Design and Analysis of Algorithms, published on August 2, 2022, is a big 125-pages book to cover many of the algorithmic core ideas. It contains the core ideas such as growth of functions and recurrences, with great detail on the solving of these via substitution, recursion trees, and the Master Method. Discussion of detailed Divide and Conquer algorithms, along with worst-case running times for problems such as merge sort, quick sort, and binary search, is also covered. Heaps, heap sort, priority queues, and sorting lower bounds are discussed. Detailed discussions of dynamic programming techniques cover the matrix chain multiplication problem, longest common subsequence problem, and general strategies. Discussions of robust algorithms based on dynamic programming that cover applications such as the activity selection problem, fractional knapsack problem, and Huffman coding. It also comprises graph algorithms, for instance: BFS, DFS, minimum spanning trees, Kruskal's, and Prim's.
Author(s): Dr. Subasish Mohapatra
125 Pages
Lecture Notes On Design And Analysis Of Algorithms
Lecture Notes on Design and Analysis of Algorithms by Mr. S.K. Sathua, Dr. M.R. Kabat, and Dr. R. Mohanty, published November 14, 2020, is an 80-page document that provides a vital summary of some of the significant notions of algorithms. It first of all provides the basics of the growth of functions and recurrences, while techniques for the solution of these recurrences include substitution and recursion trees. These notes introduce the Master Method for analyzing divide and conquer algorithms and provide worst-case analysis of merge sort, quick sort, and binary search. Other topics it covers are heaps, heap sort, priority queues, and sorting lower bounds, thus proving very valuable for comprehending core principles in algorithm analysis and design.
Author(s): Mr. S.K. Sathua, Dr. M.R. Kabat and Dr. R. Mohanty
80 Pages
Data Structures And Algorithms by Sugih Jamin
The book Data Structures and Algorithms by Sugih Jamin covers all the basic concepts of Computer Science in a very balanced way. It involves topics such as linked lists, stacks, and queues to more advanced topics such as binary search trees, heaps, and balanced search trees. Jama's text emphasizes an implementation perspective and algorithmic patterns, which will facilitate a more effective way of understanding and applying the concepts presented. This book will be very useful for the students and professionals who want to establish a sound foundation in data structures and algorithms by providing a solid theoretical background supported by practical examples that explain how problems are solved.
Author(s): Sugih Jamin
NA Pages
Distributed Algorithms Lecture Notes
Prof. Nancy Lynch's Distributed Algorithms Lecture Notes has a great amount of detail concerning algorithms designed for distributed systems within which important aspects are that of multiple processors executing without centralized control. This paper investigates the model assumptions and organization strategies tasked with the two basic timing models. It also looks at synchronous, asynchronous, and partially synchronous models and synchronous networks. They discuss various models, thus enable the researchers to understand what one is actually up against and what strategies one can use in order to design algorithms working effectively in distributed environments. Hence, Lynch's notes are a must-have for any researcher who aims to know how to manage communication and coordination in distributed systems. Therefore, ideal for use by students and professionals dealing with distributed computing and networked systems.
Author(s): Prof. Nancy Lynch
NA Pages
Advanced Algorithms Lectures by Shuchi Chawla
Advanced Algorithms Lectures by Shuchi Chawla give an insight into advanced techniques in the design and analysis of algorithms. The lectures cover topics such as greedy algorithms, dynamic programming, and network flow applications. Advanced topics, including randomized algorithms and Karger's min-cut algorithm, NP-completeness, together with linear programming, primal-dual algorithms, and semi-definite programming, are discussed. Chawla also deals with models like Probably Approximately Correct (PAC) and boosting within this framework. This set of lectures comprehensively covers advanced algorithmic methodologies along with their applications and constitutes an excellent resource for students and researchers interested in advanced classes of algorithmic techniques and their applications to pressing real-world problems.
Author(s): Shuchi Chawla
195 Pages
