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
Data Structure Articles
Page 146 of 164
Difference Between Stack and Heap
In this post, we will understand the difference between Stack and HeapStackIt is a linear data structure.Memory is allocated in a contiguous (continuous) block.The memory for a stack is allocated and deallocated automatically using the instructions of the compiler.It costs less to build and maintain a stack.It is easy to implement.It is fixed in size; hence it is not flexible.Its only disadvantage is the shortage of memory, since it is fixed in size.If all the blocks are not occupied, memory gets wasted too.It takes less time to access the elements of a stack.It has an excellent locality of reference.HeapIt is ...
Read MoreDifference Between Trigger and Procedure
In this post, we will understand the difference between trigger and a procedure.TriggersIt is implicitly invoked when an event such as INSERT, DELETE, and UPDATE occurs in a table of a database.Nesting of triggers can be achieved using a table.A trigger can’t be called or defined inside another trigger.Transactional statements such as ‘COMMIT’, ‘ROLLBACK’, ‘SAVEPOINT’ can’t be used in triggers.They are used to maintain referential integrity.This is done by keeping a record of the activities performed on a table.No values are returned in a trigger.No value can be passed as a parameter to a trigger.Syntax to define a trigger:CREATE TRIGGER ...
Read MoreDifference Between Star and Snowflake Schema
In this post, we will understand the difference between star schema and snowflake schema.Star SchemaHierarchies of dimensions are stored in a dimensional table.It contains a fact table that is surrounded by dimension tables.In this schema, a single join creates the relationship between a fact table and any dimension tables.It is a simple database design.It has high levels of data redundancy.The processing of cube is quick.A single dimension table contains the aggregated data.It is a de-normalized data structure.The queries run quickly in comparison to other schema.It uses start join query optimization technique. Hence, the queries perform well.Tables can be connected with ...
Read MoreExplain the Difference Between Linear and Non-linear Data Structure
In this post, we will understand the difference between linear data structure and non-linear data structure.Linear Data StructureThe elements of such a structure are arranged sequentially.Every element can be accessed by traversing through the linear structure.All the elements of a linear structure are at a single level, i.e there is no hierarchy.They are easy to implement and use.They utilize more memory, hence they are not very memory-friendly.The time complexity of linear data structure usually increases when the size of the structure increases.Examples include- list, array, stackThe below shows an example of a list in Python.my_list = [45, 42, 12, 34, ...
Read MoreAlgorithm to construct an Expression Tree in Data Structure
Expression treesExpression trees are those in which the leaf nodes have the values to be operated, and internal nodes contain the operator on which the leaf node will be performed.Example4 + ((7 + 9) * 2) will have an expression tree as followsAlgorithm to Construct an Expression TreeLet T be the expression tree.If T is not NULL: If T->data is an operand: return T.data A = solve(T.left) B = solve(T.right) --> Calculate operator for 'T.data' on A and B, and call recursively, return calculate(A, B, T.data)How to construct an expression tree?To construct an Expression Tree for ...
Read MoreYen's k-Shortest Path Algorithm in Data Structure
Instead of giving a single shortest path, Yen’s k-shortest path algorithm gives k shortest paths so that we can get the second shortest path and the third shortest path and so on.Let us consider a scenario that we have to travel from place A to place B and there are multiple routes available between place A and place B, but we have to find the shortest path and neglect all the paths that are less considered in terms of its time complexity in order to reach the destination.Let us understand with an example-Consider the given example as the bridge which ...
Read MoreFloyd Cycle Detection Algorithm to detect the cycle in a linear Data Structure
Floyd Cycle is one of the cycle detection algorithms to detect the cycle in a given singly linked list.In the Floyd Cycle algorithm, we have two pointers that initially point at the head. In Hare and Tortoise’s story, Hare moves twice as fast as Tortoise, and whenever the hare reaches the end of the path, the tortoise reaches the middle of the path.AlgorithmInitialize Hare and Tortoise at the head node of the List.Initially, the hare moves twice as fast as the tortoise.Move the hare and tortoise both and find if the hare reaches the end of the Linked List, return ...
Read MoreSegment Trees in Data Structure
In this section we will see what is the segment tree. Before discussing that, let us see one problem.Suppose we have an array arr[0, …, n-1], We can do following operations −Find the sum of elements from index l to r, where 0 ≤ l ≤ r ≤ n-1Change the value of a specified element of the array to a new value x. We need to do arr[i] = x. The i in range 0 to n – 1.We can solve this problem by using the Segment tree. The segment tree can help us to get the sum and query ...
Read MoreInterval Trees in Data Structure
In this section we will see what is the interval tree. As the name suggests, that the interval trees are the trees which are associated with the intervals. So before discussing about the interval trees, let us see the elementary intervals.An interval is basically a range. So if one interval is written as [a, b] it indicates that the range is starting from a, and ending at b.Now suppose there is an interval [10, 20]. So there are three range values. First one is -∞ to 10, 10 to 20 and finally 20 to ∞Now, suppose we will create second ...
Read MoreB-tree Deletion in Data Structure
Here we will see, how to perform the deletion of a node from B-Tree. Suppose we have a BTree like below −Example of B-Tree −Deletion has two parts. At first we have to find the element. That strategy is like the querying. Now for deletion, we have to care about some rules. One node must have at-least m/2 elements. So if we delete, one element, and it has less than m-1 elements remaining, then it will adjust itself. If the entire node is deleted, then its children will be merged, and if their size issame as m, then split them ...
Read More