ADVANCED DISCRETE MATHEMATICS

RAJPUT, UDAY SINGH

2012년 5월 · PHI Learning Pvt. Ltd.

eBook

400

페이지

eBook 정보

Written in an accessible style, this text provides a complete coverage of discrete mathematics and its applications at an appropriate level of rigour. The book discusses algebraic structures, mathematical logic, lattices, Boolean algebra, graph theory, automata theory, grammars and recurrence relations. It covers the important topics such as coding theory, Dijkstra’s shortest path algorithm, reverse polish notation, Warshall’s algorithm, Menger’s theorem, Turing machine, and LR(k) parsers, which form a part of the fundamental applications of discrete mathematics in computer science. In addition, Pigeonhole principle, ring homomorphism, field and integral domain, trees, network flows, languages, and recurrence relations. The text is supported with a large number of examples, worked-out problems and diagrams that help students understand the theoretical explanations. The book is intended as a text for postgraduate students of mathematics, computer science, and computer applications. In addition, it will be extremely useful for the undergraduate students of computer science and engineering.

콘텐츠 둘러보기

저자 정보

UDAY SINGH RAJPUT, PhD, is Assistant Professor in the Department of Mathematics and Astronomy, Lucknow University, Lucknow. With over two decades of teaching experience at undergraduate and postgraduate levels, Dr. Rajput has published more than 30 research papers in national and international journals of repute. His areas of research include graph theory, MHD flows, and operations research.

UDAY SINGH RAJPUT, PhD, is Assistant Professor in the Department of Mathematics and Astronomy, Lucknow University, Lucknow. With over two decades of teaching experience at undergraduate and postgraduate levels, Dr. Rajput has published more than 30 research papers in national and international jo...