MSC Semester I - Discrete Mathematics - Online Course

MSC Semester I - Discrete Mathematics - Online Course

30-days Money-Back Guarantee

MSC Semester I - Discrete Mathematics

Updated on Sep, 2026

Teaching and Academics , Math, Discrete Math

Duration - 14.5 hours

Training 5 or more people ?

Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.

Unit – I Mathematical Logic Propositional logic, propositional equivalences, predicates & quantifiers, rules of inference, direct proofs, proof by contraposition, proof by contradiction. Boolean Algebra Boolean functions and their representation, logic gates, minimization of circuits using Boolean identities and K-map. Unit – II Basic Structures Set representations, set operations, functions, sequences and summations. Division algorithm, modular arithmetic, solving congruences, applications of congruences. Recursion Proof by mathematical induction, recursive definitions, structural induction, generalized induction, recursive algorithms. Unit – III Counting Basic counting principle, inclusion–exclusion for two sets, pigeonhole principle, permutations and combinations, binomial coefficients and identities, generalized permutations and combinations. Recurrence Relations Introduction, solving linear recurrence relations, generating functions, principle of inclusion–exclusion, applications of inclusion–exclusion. Relations Relations and their properties, representation of relations, closures of relations, equivalence relations, partial orderings. Unit – IV Graphs Graph definitions, graph terminology, types of graphs, representation of graphs, graph isomorphism, connectivity of graphs, Euler and Hamilton paths and circuits, Dijkstra’s algorithm for shortest path, planar graphs – Euler’s formula and applications, graph coloring and applications. Trees Tree definitions, properties of trees, applications of trees – BST, Huffman coding, tree traversals: pre-order, in-order, post-order, prefix, infix, postfix notations, spanning trees – DFS, BFS, Prim’s and Kruskal’s algorithms.

Check out the detailed breakdown of what’s inside the course

Simple and Easy Learning

Tutorials Point originated from the idea that there exists a class of readers who respond better to online content and prefer to learn new skills at their own pace from the comforts of their drawing rooms.

The journey commenced with a single tutorial on HTML in 2006 and elated by the response it generated, we worked our way to adding fresh tutorials to our repository which now proudly flaunts a wealth of tutorials and allied articles on topics ranging from programming languages to web designing to academics and much more.

40 million readers read 100 million pages every month

Our Text Library Content and resources are freely available and we prefer to keep it that way to encourage our readers acquire as many skills as they would like to. We don't force our readers to sign up with us or submit their details either to use our Free Text Tutorials Library. No preconditions and no impediments, Just Simply Easy Learning!

We have established a Digital Content Marketplace to sell Video Courses and eBooks at a very nominal cost. You will have to register with us to avail these premium services.

Use your certificate to make a career change or to advance in your current career.

Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses

Master prominent technologies at full length and become a valued certified professional.

Recommended articles