Discreate Mathematics

Developer info

Product features

Product description

This ultimate unique application is for all students across the world. It covers 113 topics of Discrete Mathematics in detail. These 113 topics are divided in 5 units.

Each topic is around 600 words and is complete with diagrams, equations and other forms of graphical representations along with simple text explaining the concept in detail.

This USP of this application is "ultra-portability". Students can access the content on-the-go from anywhere they like.

Basically, each topic is like a detailed flash card and will make the lives of students simpler and easier.

Some of topics Covered in this application are:

1. Set Theory
2. Decimal number System
3. Binary Number System
4. Octal Number System
5. Hexadecimal Number System
6. Binary Arithmetic
7. Sets and Membership
8. Subsets
9. Introduction to Logical Operations
10. Logical Operations and Logical Connectivity
11. Logical Equivalence
12. Logical Implications
13. Normal Forms and Truth Table
14. Normal Form of a well formed formula
15. Principle Disjunctive Normal Form
16. Principal Conjunctive Normal form
17. Predicates and Quantifiers
18. Theory of inference for the Predicate Calculus
19. Mathematical Induction
20. Diagrammatic Representation of Sets
21. The Algebra of Sets
22. The Computer Representation of Sets
23. Relations
24. Representation of Relations
25. Introduction to Partial Order Relations
26. Diagrammatic Representation of Partial Order Relations and Posets
27. Maximal, Minimal Elements and Lattices
28. Recurrence Relation
29. Formulation of Recurrence Relation
30. Method of Solving Recurrence Relation
31. Method for solving linear homogeneous recurrence relations with constant coefficients:
32. Functions
33. Introduction to Graphs
34. Directed Graph
35. Graph Models
36. Graph Terminology
37. Some Special Simple Graphs
38. Bipartite Graphs
39. Bipartite Graphs and Matchings
40. Applications of Graphs
41. Original and Sub Graphs
42. Representing Graphs
43. Adjacency Matrices
44. Incidence Matrices
45. Isomorphism of Graphs
46. Paths in the Graphs
47. Connectedness in Undirected Graphs
48. Connectivity of Graphs
49. Paths and Isomorphism
50. Euler Paths and Circuits
51. Hamilton Paths and Circuits
52. Shortest-Path Problems
53. A Shortest-Path Algorithm (Dijkstra Algorithm.)
54. The Traveling Salesperson Problem
55. Introduction to Planer Graphs
56. Graph Coloring
57. Applications of Graph Colorings
58. Introduction to Trees
59. Rooted Trees
60. Trees as Models
61. Properties of Trees
62. Applications of Trees
63. Decision Trees
64. Prefix Codes
65. Huffman Coding
66. Game Trees
67. Tree Traversal
68. Boolean Algebra
69. Identities of Boolean Algebra
70. Duality
71. The Abstract Definition of a Boolean Algebra
72. Representing Boolean Functions
73. Logic Gates
74. Minimization of Circuits
75. Karnaugh Maps
76. Dont Care Conditions
77. The Quine MCCluskey Method
78. Introduction to Lattices
79. The Transitive Closure of a Relation
80. Cartesian Product of Lattices
81. Properties of Lattices
82. Lattices as Algebraic System
83. Partial Order Relations on a Lattice
84. Least Upper Bounds and Latest Lower Bounds in a Lattice
85. Sublattices
86. Lattice Isomorphism
87. Bounded, Complemented and Distributive Lattices
88. Propositional Logic
89. Conditional Statements
90. Truth Tables of Compound Propositions
91. Precedence of Logical Operators and Logic and Bit Operations
92. Applications of Propositional Logic
93. Propositional Satisfiability
94. Quantifiers
95. Nested Quantifiers
96. Translating from Nested Quantifiers into English
97. Inference
98. Rules of Inference for Propositional Logic
99. Using Rules of Inference to Build Arguments
100. Resolution and Fallacies
101. Rules of Inference for Quantified Statements
102. Introduction to Algebra
103. Rings
104. Properties of rings
105. Subrings
106. Homomorphisms and quotient rings
107. Groups
108. Properties of groups
109. Subgroups

---

Technical details

• Access information about networks
• Access information about Wi-Fi networks
• Open network sockets