The set bit is a binary representation form of 0 and 1. This digit 1 is called a set bit in reference to the computer. Let’s take an example to understand the setbit calculation − Let’s take an example to understand the setbit calculation − The set bit calculation of integer 96 is Let’s say we want to set the bit to sum of 96. So as shown in the above representation, we will set bit 1 to those array elements whose total will be 96. This way we will form 2 sets of bit. Therefore, if we take ... Read More

The Minimum Bottleneck Spanning tree is an undirected graph whose highest weight is considered as minimum as possible. Let’s take an example to understand the Minimum Bottleneck Spanning tree. In Figure I, we observe that there are three possible ways of spanning trees that have the common edge 2 and it means there is no other tree having a bottleneck value less than 2. Therefore, all these trees verify as Minimum Bottleneck Spanning trees. How we can say that the MST is MBST? There are the following points to understand the MST to be MBST − MBST ... Read More

HDLC stands for High-level Data Link Control which is a collection of the protocol that ensures communication purposes among nodes or network points. It was developed by the International Organization for Standardization (ISO). The data to be transmitted is organized in the form of frames which when transferred to the destination is acknowledged for its appropriate arrival. It can be applied to both point-to-point connections and multipoint connections as it is a bit-oriented protocol. The system of Automatic Repeat Request is implemented via HDLC and also full-duplex communications could be done with the help of HDLC. Due to its ... Read More

A dynamic memory allocation method used in computer programming is called linked list allocation. In this method, a linked list data structure is used to distribute memory. Memory is divided into a number of blocks of similar size when allocating a linked list. In the linked list, each block is symbolized by a node. A pointer to the following piece of memory is present at each node in the linked list. The final node in the linked list has a null pointer that serves as a marker for the list's conclusion. Linked list data structure and its implementation in memory ... Read More

There are two different modes of addressing namely, Direct Addressing Mode and Implied Addressing Mode, to address operands in computer programs. Therefore, the fundamental difference between direct and implied addressing modes is in their method of specifying operands in computer programming. Before discussing the differences between direct and implied addressing modes, let us first know a bit about them individually. What is Direct Addressing Mode? In computer programming, the addressing mode in which the actual memory address of the data is given to specify the operand is termed as direct addressing mode. Therefore, in the case of direct addressing mode, ... Read More

A binary space partition is a data structure used in computer graphics and algorithmic geometry to divide a space into smaller parts. BSP was developed in the environment of 3D computer graphics. BSP includes applications such as operation with geometrical shapes, geospatial, and ray tracing. It is a two-step procedure Step 1 − Creation of BSP tree. Step 2 − Display a tree. Creation of BSP tree Visual Representation of Binary Space Partitioning The binary Space Partitioning algorithm recursively divides the space into two half-spaces. So keep in account that there is a dividing region in every polygon figure. ... Read More

Database users interact with data to update, read and modify the given information on a daily basis. There are various types of database users and we will learn in detail about them. Database users can be divided into the following types − End Users Naive users / Parametric users Sophisticated users Application Programmer or Specialized users or Back-End Developer System Analyst Database Administrator (DBA) Temporary Users or Casual Users These users can access the database and recover the data using various applications. Let’s have a quick understanding of all the types in detail − ... Read More

A group of four positive integers (a, b, c, and d) that satisfy the Pythagorean equation are called Pythagorean quadruples. The equation can be written as: a2 + b2 + c2 = d2 , with ‘d’ being the largest value out of the given numbers. In other words, the square of the fourth integer should be equal to the sum obtained by adding the squares of the previous three numbers. (1, 2, 2, 3) is a Pythagorean quadruplet as (12 + 22 + 22) = (1 + 4 + 4) = (9) = (32). Due to the requirement ... Read More

A number is considered to be a “Selfie Number” if it can be represented using only its own digits and certain mathematical operations. For example, 936 is a selfie number. $$\mathrm{936\:=\:(\sqrt{9})!^{3} \:+\:6!\:=\:216\:+\:720\:=\:936}$$ Here it can be observed that a series of operations are performed on the digits of the original number and the resultant is equal to the original number. Palindromic Selfie Numbers are a special kind of selfie number. They satisfy the selfie multiplicative rule. Consider a number x. Let the number formed by reversing the digits of x be $\mathrm{x^\prime}$. Let y be a ... Read More

In the following article, we discuss two approaches to find the closest numbers from a list of unsorted integers. Let us first understand what is meant by the term ‘closest numbers’. Closest numbers are the pair(s) of numbers which have the least difference between them. Problem Statement Given a list of distinct unsorted integers, we need to find the pair of elements that have the least difference between them. If there are multiple pairs, we need to find all of them. Furthermore, in the article wherever there is a mention of difference, it means absolute difference. Examples Input: [44, 42, ... Read More