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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Blockchain Vs. Distributed Ledger Technology
Is there a distinction between Blockchain technology and distributed ledger technology? No. This is a frequent misunderstanding held by many people. This post will look at what Blockchain is and how it differs from distributed ledger technology. We live in a digital age where sound bites and terminology rule. In today's world, even complex technological solutions are reduced to five words or less. As a result, more astute businesses are attempting to profit from the so-called crypto frenzy. Some people are even changing their names to include the word "blockchain." In the short term, using buzzwords like blockchain technology to ...
Read MoreHow Does Off-Chain & On-Chain Crypto Transactions Differ?
Blockchain technology is transforming the entire digitization system across all industries. The main benefit of blockchain systems is that they ensure transaction transparency for both the grantee and the beneficiary. Organizations have begun to manage data for blockchain-based solutions as either on-chain or off-chain storage approaches in recent years. Data can be stored in a private or public blockchain service to do this. To keep track of all network transactions, Bitcoin uses the Blockchain as a ledger. It uses a network of nodes instead of a single centralized server, with each transaction being checked, recorded, and spread among them. Because ...
Read MoreBlockchain IaaS Vs PaaS Vs SaaS – Key Differences
Cloud computing is the distribution of computing resources on-demand over the internet. Cloud computing allows users to access computational resources without having to maintain actual gear. Cloud computing resources can be delivered in a variety of ways. These delivery models provide different levels of abstraction for the user, and each has pros and cons based on the developer's goals. Infrastructure as a Service (IaaS), Software as a Service (SaaS), and Platform as a Service (PaaS) are three of the most prevalent delivery models (SaaS). For modern businesses, blockchain technology is appealing. However, because the technology is new and unfamiliar to ...
Read MoreC++ program to remove row or column wise duplicates from matrix of characters
We are given a 2D matrix with rows and columns. The matrix consists of elements in char data type. A method is devised to remove the elements which are duplicated in their respective rows or columns. In this method, we check if any element is repeating in its row or column for each character. If it is not repeated, we leave it as it was before. We can store the values occurring in each row and column in a map. After which, we can traverse again and take those values which are appearing only once in their row and column. ...
Read MoreBest CRMs for iPhone: Which iOs app has the features you need?
It's no surprise, then, that CRM software for Mac users, as well as other Apple and iOS devices like the iPhone and iPad, is plentiful. If Apple is your primary device, you'll want to check out our list of the best CRM for Mac, which includes 15 options. The bulk of CRM software is now SaaS, cloud-based apps that operate in your web browser of choice, so you'll be OK whether you're on macOS and using Google Chrome, Safari, or Mozilla Firefox. Customer relationship management software can assist teams working on Apple products in better organizing their work. From managing ...
Read MoreFinding the second largest element in BST using C++
In a binary search tree (BST), the second largest element must be returned. In a binary tree, the second element is the largest element. According to the given BST, 13 is the second largest element. Now we are using the C++ approach to solve this problem. We can traverse the tree inorder, and by observation, we can observe that the second largest element in the given BST is 13. The inorder of the tree will be 1 3 4 6 7 8 10 13 14, and we can observe that the elements are in the sorted array. So we ...
Read MoreC++ program to find the shortest distance between two nodes in BST
In this article, we are given a BST (binary search tree), and we need to find the shortest distance between 2 given nodes in the BST. Let's have a tree and below are the following scenarios. Let’s assume some simple input and output scenarios Now we have to find the distances between nodes 4 and 13. int key1=13, key2=4; res = solve(root, min(key1, key2), max(key1, key2)); output = 6 The shortest distance is 6, which is through 4->6->3->8->10->14->13(the arrows show a path definition and not anything else). Let’s find another distance from two different nodes in the above ...
Read MoreC++ program to Replace a Node with Depth in a Binary Tree
Suppose we have a binary tree and we want to replace the depth of each node with its value. The depth of the node starts from 0 at the root node and increases by 1 for each level we go; for example, we have a binary tree like this; Here we replace, Node Value Depth 1 0 2 1 3 1 4 2 5 2 6 2 7 2 8 3 9 3 We do a simple ...
Read MoreReplace Each Node in Binary Tree With The Sum Of Its Inorder Predecessor And Successor Using C++
We are given a binary tree, and we need to replace all the elements with the sum of its inorder predecessor and successor. Inorder is a traversed path in a graph that reads in the order of left node – root node – right node. The method adds the elements in left and right nodes of the parent node and replaces the value with the obtained sum. Suppose we have a tree with the following formation and characters − We can find and store the inorder of the tree in an array. After that, we can again do an ...
Read MoreRencontres Number (Counting partial derangements) Using C++
Given two integers N and k, we need to count the number of derangements where k points are fixed at their position. Given constraints on k are between 0 and n as the number of fixed points when there are n points cannot be more than n. int N=4, k=2; res = solve(N, k); Note that at least conditions don’t hold on k. There has to be precisely and strictly k points on their original index. This is a mathematical problem. Not explaining the proof and explanation of mathematics, we as computer science majors can use the results ...
Read More