Foundations of Discrete Mathematics with Algorithms and Programming
1st Edition
Published on 17. October 2018
Book
Hardback
518 pages
978-0-8153-7848-8 (ISBN)
Description
Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level. This book presents the basics of Discrete Mathematics and its applications to day-to-day problems in several areas. This book is intended for undergraduate students of Computer Science, Mathematics and Engineering. A number of examples have been given to enhance the understanding of concepts. The programming languages used are Pascal and C.
More details
Language
English
Place of publication
Bosa Roca
United States
Publishing group
Taylor & Francis Inc
Target group
College/higher education
Product notice
sewn/stitched
Cloth over boards
Illustrations
139 s/w Abbildungen
139 Illustrations, black and white
Dimensions
Height: 234 mm
Width: 163 mm
Thickness: 33 mm
Weight
862 gr
ISBN-13
978-0-8153-7848-8 (9780815378488)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
R. Balakrishnan | Sriraman Sridharan
Foundations of Discrete Mathematics with Algorithms and Programming
E-Book
10/2018
Chapman & Hall/CRC
€185.99
Available for download
R. Balakrishnan | Sriraman Sridharan
Foundations of Discrete Mathematics with Algorithms and Programming
E-Book
10/2018
1st Edition
Chapman & Hall/CRC
€185.99
Available for download
Persons
Dr R Balakrishnan is an Adjunct Professor in the Department of Mathematics, Bharathidasan University, Tiruchirappalli, India. His areas of interest are Algebraic Graph Theory and Graph Coloring.
Content
Sets, Relations and Functions. Combinatorics. Basics of Number Theory. Introduction To Graph Theory. Introduction To Algorithms. Introduction To Logic. A Answers To Even. B Answers To Sets. C Answers To Combinatorics. D Answers To Basics. E Answers To Introduction. F Answers To Algorithms. G Answers To Introduction.