Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Concurrency is crucial to modern programming for enabling efficient use of resources in multi-core systems. Hash tries are associative data structures which provide a scalable and thread-safe handling of large amounts of data concurrently. In this article, we are going to learn to implement a concurrent hash trie in go, implementation here means we are going to demonstrate the operations like insertion, updation and deletion on a hash trie data structure. Explanation A concurrent hash trie as a data structure combines the benefits of hash maps and tries to allow multiple threads simultaneous access and modification rights associated with ... Read More
Concurrent hash maps can be perceived as efficient data structures for ensuring smooth and parallel execution. Designed to handle concurrent read and write operations efficiently, it is a valuable tool for building highly performant multi-threaded applications. In this article, we learn to implement a concurrent hash map in go. Syntax func NewConcurrentMap(size int) *ConcurrentMap The syntax defines a function named NewConcurrentMap defined to create and return an instance of a customized concurrent hash map named ConcurrentMap. Taking a size parameter to determine internal bucket count for data distribution, it encapsulates the initialization process. Algorithm Start by ... Read More
In the given problem statement we have to create an algorithm to show the Nakagami Distribution in Statistics with the help of Python and its libraries. So in this article we will use matplotlib, numpy and scipy libraries of Python to solve the given problem. What is Nakagami Distribution in Statistics? The Nakagami distribution is basically a probability distribution. It consists of parameters, a sample dataset and a model description for probability distribution. This distribution is mainly used in communication to model signals which reach the receiver with the help of several paths. Understanding the Logic for the Problem The ... Read More
A merkle tree is used in cryptography and computer science to verify the authenticity of a data efficiently. Merkle trees are extremely crucial in the fields of cryptography and blockchain technology for ensuring data integrity and security. In this article, we will learn the significance of Merkle trees and to implement a merkle tree in go. Here we are going to use two different examples to perform this implementation in the first example we will build the Merkle tree recursively through the `MerkleNode` struct with hash, left, and right pointer, and in the second example we will employ an ... Read More
Skip lists are a dynamic data structure which offer efficient insertion, search, and deletion operations. In this article, we will demonstrate the function and explore the algorithmic concepts to implement a Skip List in Go programming language. We are going to write two different examples for this demonstration. In the first example we are going to use a randomization approach and in the second example we will build the Skip List directly from randomised tower structures for quicker traversal. Explanation A Skip List as a data structure, maintains a sorted list of elements, to enable fast searching without the complexity ... Read More
Bloom filters are a space-efficient data structure that find widespread use in various applications involving membership testing. In this article, we are going to explore how to create a Bloom filter in golanguage. Here we are going to write two different examples for this implementation, the first example includes the use hash functions from the FNV-1a algorithm, and in the second example we are going to use a a []bool array in order to determine element presence efficiently. Explanation A Bloom filter can be described as a probabilistic data structure that checks for the existence of an element in a ... Read More
Red-Black Trees are binary search trees with consistent structure and height balance, capable of self-balancing. They are beneficial in efficient insertion, deletion, and search operations. In this article, we will take an in-depth look at how to implement a red-black tree in golanguage, in the first example we are directly going to build the tree, while in the second example we are going to build the tree using structure. Explanation A red black tree is a self-balancing binary search tree that during insertion and deletion operations, ensures balance by making sure each node within the binary search tree is designated ... Read More
In this problem statement we have to show the negative binomial discrete distribution in statistics with the help of Python. So for showing this statistic we will be using the numpy and matplotlib libraries of Python. What is Negative Binomial Discrete Distribution? In statistics, the Negative Binomial distribution represents the number of trials required to get the number of failures. In this the trial can result in success or failure. So we can say that the number of failures occurs before the number of successes is achieved in the trials. It is related to the geometric distribution. The Negative Binomial ... Read More
The problem is to show the moyal distribution in statistics with the help of Python. So we will use numpy and matplotlib libraries of Python to plot the statistics in this article. But first we need to understand what exactly moyal distribution is. What is Moyal Distribution in Statistics? The moyal distribution is a probability distribution, which is basically used in statistics to model the distribution of a set of random variables. Understanding the Logic for the Problem The problem at hand is to create a statistical model for the Moyal distribution with the help of Python libraries. In this ... Read More
In this article we will explain how to count the occurrences or repetition of elements in the given list of records using Python. Sometimes we need to make a count for the repeated number of items in the given dataset so this article will be helpful to solve these kinds of problems. Understanding the Problem The problem we have is to count the repeated items in the given list of records using the Python programming language. So basically we have to show the result of counts of the same or identical items in the given list of records. Let us ... Read More