## Finding nth term of any Polynomial Sequence

Given a few terms of a sequence, we are often asked to find the expression for the nth term of this sequence. While there is… Read More »

## Problem on permutations and combinations | Set 2

Prerequisite : Permutation and Combination Given a polygon of m sides, count number of triangles that can be formed using vertices of polygon. Answer :… Read More »

## Combination and Permutation Practice Questions | Set 1

Prerequisite : Permutation and Combination n students appear in an examination, find the number of ways the result of examination can be announced. Answer is… Read More »

## Relationship between number of nodes and height of binary tree

Prerequisite – Binary Tree Data Structure In this article, we will discuss various cases for relationship between number of nodes and height of binary tree.… Read More »

## Mathematics | Power Set and its Properties

Prerequisite – Introduction of Set theory, Set Operations (Set theory) For a given set S, Power set P(S) or 2^S represents the set containing all… Read More »

## Mathematics | Total number of possible functions

In this article, we are discussing how to find number of functions from one set to another. For understanding the basics of functions, you can… Read More »

## Mathematics | Graph Theory Basics – Set 1

A graph is a data structure that is defined by two components : A node or a vertex. An edge E or ordered pair is… Read More »

## Number of possible Superkeys in DBMS

Prerequisite – Relational Model Introduction and Codd Rules Any subset of attributes of a table that can uniquely identify all the tuples of that table… Read More »

## Digital logic | Functional Completeness

A set of operations is said to be functionally complete or universal if and only if every switching function can be expressed by means of… Read More »

## Mathematics | Graph theory practice questions

Problem 1 – There are 25 telephones in Geeksland. Is it possible to connect them with wires so that each telephone is connected with exactly… Read More »

## Betweenness Centrality (Centrality Measure)

In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. For every pair of vertices in a connected… Read More »

## Mathematics | Properties of Boolean algebra

Switching algebra is also known as Boolean Algebra. It is used to analyze digital gates and circuits It is logic to perform mathematical operation on… Read More »

## Mathematics | Probability Distributions Set 1 (Uniform Distribution)

Prerequisite – Random Variable In probability theory and statistics, a probability distribution is a mathematical function that can be thought of as providing the probabilities… Read More »

## Doolittle Algorithm : LU Decomposition

In numerical analysis and linear algebra, LU decomposition (where ‘LU’ stands for ‘lower upper’, and also called LU factorization) factors a matrix as the product… Read More »

## Mathematics | Representation of Boolean Functions

A Boolean function is described by an algebraic expression consisting of binary variables, the constants 0 and 1, and the logic operation symbols For a… Read More »