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 by Arnab Chakraborty
Page 360 of 377
Level Linked (2,4)-Trees in Data Structure
In this section we explain how (2, 4)-trees can support efficient finger searches by the introduction of level links. The ideas explained in this section also implements to the more general class of height-balanced trees denoted (a, b)-trees, for b ≥ 2a.A (2, 4)-tree is defined as a height-balanced search tree where all leaves have the same depth and all internal nodes have degree two, three or four. Elements are stored at the leaves, and internal nodes only store search keys to guide searches. Since each internal node has degree at least two, it follows that a (2, 4)-tree has ...
Read MoreDynamic Finger Search Trees in Data Structure
A dynamic finger search data structure should in addition to finger searches also perform the insertion and deletion of elements at a position given by a finger.Finger search trees is defined as a variant of B-trees supporting finger searches in O(log d) time and updates in O(1) time, assuming that only O(1) moveable fingers are maintained.Traversing a finger d positions requires O(log d) time.The finger search trees (that means AVL-trees, red-black trees) constructions either consider a fixed constant number of fingers or only support updates in amortized constant time.Constructions supporting an arbitrary number of fingers and with worst case update ...
Read MoreFinger Searching in Data Structure
A finger search on a data structure is defined as an extension of any search operation that structure supports, where a reference (finger) to an element in the data structure is given along with the query. While the search time for an element is most frequently denoted as a function of the number of elements in a data structure, finger search times are treated as a function of the distance between the element and the finger.In a set of m elements, the distance d(a, b) between two elements a and b is their difference in rank. If elements a and ...
Read MoreConstruct BST from given preorder traversal - Set 1 in C++
Suppose we have one pre order traversal. From this traversal. we have to generate the tree So if the traversal is like [10, 5, 1, 7, 40, 50], then the tree will be like −To solve this, we will use this trick. The trick is to set a range {min… max} for each node. At first we will initialize the range as {INT_MIN… INT_MAX}. The first node will definitely be in range, so after that we will create root node. To construct the left subtree, set the range as {INT_MIN… root->data}. If a values is in the range {INT_MIN… root->data}, ...
Read MoreConstruct a Turing Machine for language L = {ww | w ∈ {0,1}}
Here we will see how to make a Turing machine for language L = {WW |W belongs to {0, 1}}. So this represents a kind of language where we will use only two characters 0s and 1s. The w is a string. So if w = 10110, so the Turing machine will accept the string z = 1011010110.To solve this, we will use this approach. The first thing is to find the midpoint of the string, we will convert a 0 to x and 1 to y. After continuously doing it a point is reached when all 0’s and 1’s ...
Read MoreConstruct a Turing Machine for language L = {0n1n2n | n≥1}
Here we will see how to make a Turing machine for language L = {0n1n2n | n ≥ n}. So this represents a kind of language where we will use only three characters 0s, 1s and 2s. The w is a string. So if w = 000111222, The Turing machine will accept it.To solve this, we will use this approach. First replace one 0 from front by x, then keep moving right till we get one 1 and replace this 1 by y. Again, keep moving right till we get one 2, replace it by z and move left. Now ...
Read MoreConstruct a Turing machine for L = {aibjck | i*j = k; i, j, k ≥ 1}
Here we will see how to make a Turing machine for language L = {AiBjCk | i * j = k; i, j, k ≥ 1}. So this represents a kind of language where we will use only three characters A, B and C. The w is a string. So if w = AABBBBCCCCCCCC, The Turing machine will accept it.To solve this, we will use this approach.First replace an A with x and move right. Then skip all the A’s and move rightWhen the head reach to the first B then replace one B with y, then move right skipping ...
Read MoreTop Reasons to Learn C++
Here we will see some good reasons behind taking the language C++ as our favorite programming language. We know that C++ is one of the most popular object oriented programming language. These are the reasons behind taking the C++ into consideration.C++ Popularity and High salary −C++ is one of the most popular language in the world. It is used nearly 4.4 million developers worldwide. The C++ developers hold highest paying jobs in the industry with an average base pay of $100000 per year.C++ has abundant library supportv −C++ has Standard Template Library (STL). This helps to write code compactly and ...
Read MoreMulti-Way Trees
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 MoreRebalancing Algorithms
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