## Discrete Mathematics | Hasse Diagrams

A Hasse diagram is a graphical representation of the relation of elements of a partially ordered set (poset) with an implied upward orientation. A point… Read More »

- PDNF and PCNF in Discrete Mathematics
- Mathematics | Renewal processes in probability
- Mathematics | Hypergeometric Distribution model
- Probability and Statistics | Simpson's Paradox (UC Berkeley's Lawsuit)
- Program to calculate Double Integration
- Digital Logic | Self dual functions
- Digital Logic | Functionally complete operations

A Hasse diagram is a graphical representation of the relation of elements of a partially ordered set (poset) with an implied upward orientation. A point… Read More »

Prerequisite – Graph Theory Basics – Set 1 1. Walk – A walk is a sequence of vertices and edges of a graph i.e. if… Read More »

Inverse Functions – In mathematics a function, a, is said to be an inverse of another, b, if given the output of b a returns… Read More »

A type of cuboid in which all the sides i.e length, breadth & height are equal. All faces of cubes are of the same area.… Read More »

Mathematical proof is an argument we give logically to validate a mathematical statement. In order to validate a statement, we consider two things: A statement… Read More »

Probability refers to the extent of occurrence of events. When an event occurs like throwing a ball, picking a card from deck, etc ., then… Read More »

Data can be classified as being on one of four scales: nominal, ordinal, interval or ratio. Each level of measurement has some important properties that… Read More »

1. Independent Sets – A set of vertices I is called independent set if no two vertices in set I are adjacent to each other… Read More »

SEQUENCE: It is a set of numbers in a definite order according to some definite rule (or rules). Each number of the set is called… Read More »

Covariance and Correlation are two mathematical concepts which are commonly used in the field of probability and statistics. Both concepts describe the relationship between two… Read More »

Prerequisite – Introduction and types of Relations Relations are represented using ordered pairs, matrix and digraphs: Ordered Pairs – In this set of ordered pairs… Read More »

Prerequisite – Solving Recurrences, Different types of recurrence relations and their solutions, Practice Set for Recurrence Relations The sequence which is defined by indicating a… Read More »

In the field of Combinatorics, it is a counting method used to compute the cardinality of the union set. According to basic Inclusion-Exclusion principle: For… Read More »

Antiderivative – Defination :A function ∅(x) is called the antiderivative (or an integral) of a function f(x) of ∅(x)’ = f(x). Example : x4/4 is… Read More »

Prerequisite – Predicates and Quantifiers – Set 1, Set 2 Quantifiers are expressions that indicate the scope of the term to which they are attached,… Read More »