Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Programming Articles
Page 1734 of 2547
Go Language Program to Convert Decimal to Roman Numerals
Roman numerals are an ancient numerical system that has found its way into modern applications like clock faces, book chapters, and movie credits. In this article, we are going to Convert Decimal to Roman Numerals. We will look at two different examples, in the first example we will use the recursive approach and in the second example we are going to use the iterative approach. Explanation Roman numerals have been one of the languages to express the marvel of Mathematics. Clock faces, book chapters, and movie credits are just some of the current uses for the old Roman number system. ...
Read MoreGo Language Program to Convert Fahrenheit to Celsius
Temperature conversions are crucial in many scientific expeditions, Fahrenheit is a scale of temperature and celsius is also a temperature scale, but sometimes we need to convert fahrenheit to celsius for medical settings, travels, and more. In this article, we are going to explore conversion of Fahrenheit temperature to corresponding Celsius in Go programming language. Explanation The basic idea can be distilled into the given formula. Here, °C represents value in Celsius and °F represents value in Fahrenheit. °C = (°F - 32) * 5/9 This is the formula used to convert fahrenheit to celsius. Syntax ...
Read MoreGo Language Program to Find the Nth Fibonacci Number
Fibonacci numbers have a unique position in mathematics, computer science and even nature for its particular mathematical qualities. Each number in this series represents the addition of the 2 previous ones, starting at 0 and 1. In this article, we are going to explore an approach to find the Nth Fibonacci number to go efficiently. We will explain two examples in the first example we used the recursive approach as it is easy to implement and fast for moderate values of n, but may be slow for large inputs. In the second example we are going to use the ...
Read MoreGolang program to implement a circular buffer
Circular buffers, a data structure that efficiently manages and cycles through data, provide a valuable solution. In this article, we will implement a circular buffer in go, showcasing its utility and practicality. The examples below demonstrate the operations like initialization, insertion and demonstration of a circular buffer. Explanation A circular buffer (also circular queue or ring buffer) is a fixed-size buffer operating as if the end and the beginning were connected, forming a loop. This ingenious data structure efficiently manages a continuous flow of data, making it an ideal choice for applications requiring data cycling and reuse. This is ...
Read MoreGolang program to implement a quadtree for spatial indexing
Spatial indexing is a crucial technique for efficiently organising and querying spatial data. Quadtree is a popular data structure used for spatial indexing, dividing a two-dimensional space into smaller regions. In this article, we will explore two different examples to implement a Quadtree in Golang. The examples demonstrated below are going to perform operations like initialization, insertion, display and visualisation of data of a quad tree. Explanation A quadtree as a tree data structure ensures that each node can have up to four children, a property commonly needed to partition a 2D space into smaller regions, allowing efficient indexing and ...
Read MoreGolang program to implement a persistent data structure (a stack)
Persistent data structures, such as a stack, are of pivotal significance to programming for organising and chronologically managing data efficiently. This article showcases different examples to implement a persistent data structure in go, focusing on stack. In the first example we use immutable slices to perform the operation, while the second method employs a linked list, here implementation means we are going to demonstrate the operations like insertion, updation and deletion on a persistent data structure. Explanation A persistent data structure allows preserving previous versions when modifications are to occur. In this context, a stack as a data structure ...
Read MoreGolang program to implement a concurrent hash map
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 MoreGolang program to implement a Merkle tree
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 MoreGolang program to implement a Bloom filter
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 MoreGolang program to find the cross product of two vectors
The cross product is an operation performed on two vectors in three-dimensional space that results in a third vector that is orthogonal (perpendicular) to the original vectors. In this article, we will see the Golang program to find the cross product of two vectors, here we will explore two different methods. Explanation Let us assume we have two vectors A and B. The cross product of the two vectors can be calculated by the formula: C = A X B. Components of a cross product vector can be calculated by formula: Cx =Ay ⋅Bz −Az ⋅By Cy ...
Read More