About Product
Although this book is intended as a sequel to ‘Foundations of Discrete Mathematics’ by the same author, it can be read independently of the latter, as the relevant background needed has been reviewed in Chapter 1. The subsequent chapters deal with graph theory (with applications), analysis of algorithms (with a detailed study of a few sorting algorithms and a discussion of tractability), linear programming (with applications, variations, Karmarkar’s polynomial time algorithm, integer and quadratic programming), applications of algebra (to Polya’s theory of counting, Galois theory, coding theory and theory of designs). A chapter on matroids familiarises the reader with this relatively new branch of discrete mathematics.Even though some of the topics are relatively advanced, an attempt has been made to keep the style elementary, so that a sincere student can read the book on his own. A large number of comments, exercises, and references are included to broaden the reader’s scope of vision. A detailed index is provided for easy reference.If you want to buy this book online, kindly click on the following link:Amazon.in
Tags:
Mathematics;
Foundation course;
