Discrete Mathematics Notes eBook

Discrete Mathematics Notes eBook
60% Off

Discrete Mathematics Notes eBook

7978 Views
Publisher: VTU eLearning
Availability: In Stock
INR 10.00 INR 4.00 ( 60% Off )
Effective Price after using Coupon Code: SAVE20
Download & Read Books Offline (Desktop/Laptop/Android Device) :
Customers who Bought this Ebook also Bought
  • Description

About this eBook

Introduction of a number of case studies involving
problems of Computer
Technology. Outcomes of this course are
A complete knowledge on various discrete structures available in literature.
Realization of some satisfaction of having learnt that discrete structures are indeed useful in computer science and engineering and thereby concluding that no mistake has been done in studying this course.
Gaining of some confidence on how to deal with problems which may arrive in computer science and engineering in near future.
Above all, students who studied this course are found to be better equipped in a relative sense as far as preparation for entrance examinations involving placement opportunities.
What is Discrete Mathematics then
Mathematics is broadly divided into two parts i the continuous mathematics and ii the discrete mathematics depending upon the presence or absence of the limiting processes.
In the case of continuum Mathematics, there do exists some relationship linkage between various topics whereas Discrete Mathematics is concerned with study of distinct, or different, or un-related topics of mathematics curriculum it embraces
several topical areas of mathematics some of which go back to early stages of mathematical development while others are more recent additions to the discipline. The present course restricts only to introducing discrete structures which are being used as tools in theoretical computer science.
A course on Discrete mathematics includes a number of topics such as study of sets, functions and relations, matrix theory, algebra, Combinatorial principles and discrete probability, graph theory, finite differences and recurrence relations, formal logic and predicate calculus, proof techniques - mathematical induction, algorithmic thinking, Matrices, Primes, factorization, greatest common divisor, residues and application to