In probability theory, according to Boole's inequality, also denoted as the union bound, for any finite or countable set of events, the probability that at least one of the events happens is no higher than the sum of the probabilities of the individual events.In mathematics, the probability theory is denoted as an important branch that studies about the probabilities of the random event. The probability is denoted as the measurement of chances of happening an event which is an outcome of an experiment.For Example − tossing a coin is denoted as an experiment and getting head or tail is denoted ... Read More

Computer programming entirely revolves around data. It is data over which all the business logic gets implemented and it’s the flow of data which comprises the functionality of an application or project. Hence, it becomes critical to organize and store the data for its optimized use and perform effective programming with good data model. From the surface, both data type and data structure appear to be the same thing, as both deal with the nature and organizing of data, but there is a big difference between the two. One describes the type and nature of data, while the other represents ... Read More

Data plays a crucial role in understanding the business trends. Many organizations generate and process huge volumes of data. This huge and complex data is referred to as "Big Data". Big data is of three types: structured data, semi structured data, and unstructured data. What is Structured Data? Structured data is generally stored in tables in the form of rows and columns. Structured data in these tables can form relations with another tables. Humans and machines can easily retrieve information from structured data. This data is meaningful and is used to develop data models. Structured data is used by ... Read More

Primarily, there are two types of data types − Primitive and Non-primitive. Primitive data types are predefined types of data, which are supported by the programming language. Non-primitive data types are not defined by the programming language, but are instead created by the programmer. With this brief introduction to data types, let's start this article and differentiate Stack and Queue data structures. Both Stack and Queue are types of data structures to store data in a particular order. A stack data structure is a type of linear list which allows the insertion or deletion of an element ... Read More

Linear Data StructuresA Linear data structure have data elements arranged in sequential manner and each member element is connected to its previous and next element. This connection helps to traverse a linear data structure in a single level and in single run. Such data structures are easy to implement as computer memory is also sequential. Examples of linear data structures are List, Queue, Stack, Array etc.Non-linear Data StructuresA non-linear data structure has no set sequence of connecting all its elements and each element can have multiple paths to connect to other elements. Such data structures supports multi-level storage and often ... Read More

The process to alter the structure of a database is basically categorized into two ways, one is Normalization and the other is Denormalization. The basic difference between normalization and denormalization is that the database normalization removes the redundancy of data and anomalies in a poorly designed table, while denormalization combines multiple table data into one so that it can be queried quickly. Read through this article to find out more about normalization and denormalization and how they are different from each other. What is Normalization? Normalization is used to remove redundant data from the database and to store non-redundant and ... Read More

The Stack is Last In First Out (LIFO) data structure. This data structure has some important applications in different aspect. These are like below −Expression Handling −Infix to Postfix or Infix to Prefix Conversion −The stack can be used to convert some infix expression into its postfix equivalent, or prefix equivalent. These postfix or prefix notations are used in computers to express some expressions. These expressions are not so much familiar to the infix expression, but they have some great advantages also. We do not need to maintain operator ordering, and parenthesis.Postfix or Prefix Evaluation −After converting into prefix or ... Read More

The recursion is a process by which a function calls itself. We use recursion to solve bigger problem into smaller sub-problems. One thing we have to keep in mind, that if each sub-problem is following same kind of patterns, then only we can use the recursive approach.A recursive function has two different parts. The base case and the recursive case. The base case is used to terminate the task of recurring. If base case is not defined, then the function will recur infinite number of times (Theoretically).In computer program, when we call one function, the value of the program counter ... Read More

Huffman coding is lossless data compression algorithm. In this algorithm a variable-length code is assigned to input different characters. The code length is related with how frequently characters are used. Most frequent characters have smallest codes, and longer codes for least frequent characters.There are mainly two parts. First one to create Huffman tree, and another one to traverse the tree to find codes.For an example, consider some strings “YYYZXXYYX”, the frequency of character Y is larger than X and the character Z has least frequency. So the length of code for Y is smaller than X, and code for X ... Read More

The all pair shortest path algorithm is also known as Floyd-Warshall algorithm is used to find all pair shortest path problem from a given weighted graph. As a result of this algorithm, it will generate a matrix, which will represent the minimum distance from any node to all other nodes in the graph.At first the output matrix is same as given cost matrix of the graph. After that the output matrix will be updated with all vertices k as the intermediate vertex.The time complexity of this algorithm is O(V3), here V is the number of vertices in the graph.Input − ... Read More