Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
A binary search known as logarithmic search is a search algorithm that searches for an element in a sorted array. The algorithm recursively divides the array into two halves, if the element is found at the mid position then return otherwise call the divide and check again until the element is found.WorkingThe algorithm works by comparing the middle element of the sorted array with the element that is to be searched.If the search element is equal to the middle element, then return the index of the element.If the search element is greater than the middle element, search in the left ... Read More
Gogo is a tool to bookmark directories with long and complicated paths in the Unix shell. Because the long parts are difficult to remember and cumbersome to type in. In this article we'll see how to install go go and use it.Installing gitWe first need to have git installed in our system which will be needed for gogo installation. To install git in an Ubuntu system follow the below command.$ sudo apt install gitRunning the above code gives us the following result −[sudo] password for ubuntu: Reading package lists... Done Building dependency tree Reading state information... Done The following additional ... Read More
To use case-insensitive switch-case in JavaScript, make the input all upper or all lowercase.ExampleYou can try to run the following code to learn how to use a case-insensitive switch: JavaScript Strings var str = "amit"; str = str.toUpperCase(); switch (str) { case 'AMIT': document.write("The name is AMIT "); break; case 'JOHN': document.write("The name is JOHN "); break; default: document.write("Unknown name") } document.write("Exiting switch block");
A multiway tree is defined as a tree that can have more than two children. If a multiway tree can have maximum m children, then this tree is called as multiway tree of order m (or an m-way tree).As with the other trees that have been studied, the nodes in an m-way tree will be made up of m-1 key fields and pointers to children.multiway tree of order 5To make the processing of m-way trees easier some type of constraint or order will be imposed on the keys within each node, resulting in a multiway search tree of order m ... Read More
Basic conceptThe multidimensional binary search tree (abbreviated k-d tree) is defined as a data structure for storing multikey records. This structure has been implemented to solve a number of "geometric" problems in statistics and data analysis.A k-d tree (short for k-dimensional tree) is defined as a space-partitioning data structure for organizing points in a k-dimensional space. Data structure k-d trees are implemented for several applications, for example, searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are treated as a special case of binary space partitioning trees.Informal descriptionThe k-d tree is a binary tree ... Read More
The rebalancing Algorithms can be performed in following way −Day-Stout-Warren AlgorithmWe can implement actually rebalance method using the Day-Stout-Warren Algorithm.It's linear in the number of nodes.The following is a presentation of the basic DSW Algorithm in pseudo code.A node is allocated called as the "pseudo-root" and make the tree's actual root as the right child of the pseudo-root.Call tree-to-vine function for converting tree to sorted linked list with the pseudo-root as its argument.Call vine-to-tree function for converting sorted linked list to tree again with the pseudo-root and the size (number of elements) of the tree as its argument.The tree's actual ... Read More
We select a memory block first.Then we select local Bloom Filter within each block.It might cause imbalance between memory blocksThis filter is efficient, but poor false positive rate(FPR).At first instance, blocked Bloom filters should have the same FPR (False Positive Rate) as standard Bloom filters of the same size.Blocked Bloom Filter consists of a sequence of block b comparatively less than standard Bloom filters (Bloom filter blocks), each of which fits into one cache-line.Blocked Bloom filter scheme is differentiated from the partition schemes, where each bit is inserted into a different block.Blocked Bloom Filter is implemented in following ways −Bit ... Read More
Counter SizeWe must select counters large enough for avoiding overflow.Size is 4 bits/counter suggested by Poisson approximation.Average load implementing k = (ln 2)m/n counters is ln 2.Probability a counter has load minimum 16:≈e-ln2(ln 2)16/16!≈6.78E-17We consider 4 bits/counter for comparisons.Counter OverflowWhen a counter does overflow, it may be arrived at its maximum value.This situation can later cause a false negative only if eventually the counter goes down to 0 when it should have remained at nonzero.The expected time to this situation is very large but is something we need to keep in mind for any application that does not permit false ... Read More
Basic ConceptA Counting Bloom filter is defined as a generalized data structure of Bloom filter that is implemented to test whether a count number of a given element is less than a given threshold when a sequence of elements is given. As a generalized form, of Bloom filter there is possibility of false positive matches, but no chance of false negatives – in other words, a query returns either "possibly higher or equal than the threshold" or "definitely less than the threshold".Algorithm descriptionMost of the parameters, used under counting bloom filter, are defined same with Bloom filter, such as n, ... Read More
There are three performance metrics for Bloom filters that can be traded off: computation or execution time (corresponds to the number k of hash functions), size of filter (corresponds to the number m of bits), and probability of error (corresponds to the false positive ratef = (1 − p)k )The Bloom filter (BF) introduces an error tolerance to enhance lookup performance and space efficiency. The Bloom filter either returns true or false. Thus, the result of Bloom filter is fallen under any one of the following classes: true positive, false positive, true negative, and false negative. Maximum number the Bloom ... Read More