Left-Child Right-Sibling Representation is a different representation of an n-ary tree where instead of maintaining a pointer to each and every child node, a node holds just two pointers, first a pointer to its first child, and the other pointer to its immediate next sibling. This new transformation not only eliminates the need of prior knowledge of the number of children a node has, but also restricts the number of pointers to a maximum of two, so making it so much simpler to code.At each node, link or connect children of same parent from left to right.Parent should be linked ... Read More

The randomized meldable heap(also called as Meldable Priority Queue) supports a number of common operations. These are known as insertion, deletion, and a searching operation, findMin. The insertion and deletion operations are implemented in terms of an additional operation specific to the meldable heap, Meld(A1, A2).MeldThe basic target of the meld (also called as merge) operation is to take two heaps (by taking each heaps root nodes), A1 and A2, and merges them, returning a single heap node as a result. This heap node is the root node of a heap containing all elements from the two subtrees rooted at ... Read More

What is Assembly Tolerance Stack up Analysis?In short, assembly tolerance stacks up analysis is defined as the tolerance value of the whole assembly or a specific gap of the assembly when we are aware about the tolerance values of all its components.Assembly tolerance chain stack up analysis can be accomplished in different ways. The simplest procedure is termed as the worst case method, which we discuss here.Discussion about Worst Case Method of Assembly Tolerance Stack UpLet, we have an assembly of four thick sheets like below −The thickness and tolerance of the four sheets are displayed in the above figure. ... Read More

Definition and importance of Tolerance AnalysisTolerance analysis is the term given to a number of processes used to calculate the overall variation and effect of variation on products stemming (i.e. arisen) from imperfections in manufactured parts.Tolerance analysis is performed by product design engineers as they prepare to components for manufacturing. This is done to ensure according to end users’ demand as well as guarantee so that all manufactured components are fitted together within an assembly.The Definition of Tolerance AnalysisTolerance analysis is defined as the general term for activities related to the subject of potential collected variation in mechanical parts and assemblies. ... Read More

JPEG and PNG both are a type of image format to store images. JPEG uses lossy compression algorithm and image may lost some of its data whereas PNG uses lossless compression algorithm and no image data loss is present in PNG format.Following are the important differences between JPEG and PNG.Sr. No.KeyJPEGPNG1Stands forJPEG stands for Joint Photographic Experts Group.PNG stands for Portable Network Graphics.2Compression Algorithm typeJPEG uses lossy compression algorithm.PNG uses lossless compression algorithm.3Image QualityJPEG image may lose some image data causing quality loss.PNG image is of high quality.4Image sizeJPEG image is generally smaller than PNG image of same image.PNG image ... Read More

Both BFS and DFS are types of graph traversal algorithms, but they are different from each other. BFS or Breadth First Search starts from the top node in the graph and travels down until it reaches the root node. On the other hand, DFS or Depth First Search starts from the top node and follows a path to reaches the end node of the path. Read this article to learn more about these two graph traversal algorithms and how they are different from each other. What is BFS? Breadth First Search (BFS) algorithm traverses a graph in a breadth-ward motion ... Read More

Shared memory is the memory block that can be accessed by more than one program. A shared memory concept is used to provide a way of communication and provide less redundant memory management.Distributed Shared Memory abbreviated as DSM is the implementation of shared memory concept in distributed systems. The DSM system implements the shared memory models in loosely coupled systems that are deprived of a local physical shared memory in the system. In this type of system distributed shared memory provides a virtual memory space that is accessible by all the system (also known as nodes) of the distributed hierarchy.Some ... Read More

Here we will see some search trees and their differences. There are many different search trees. They are different in nature. The basic search tree is Binary Search Tree (BST). Some other search trees are AVL tree, B tree, Red-Black tree, splay tree etc.These trees can be compares based on their operations. We will see the time complexity of these treesSearch TreeAverage CaseInsertDeleteSearchBinary Search TreeO(log n)O(log n)O(log n)AVL treeO(log2 n)O(log2 n)O(log2 n)B TreeO(log n)O(log n)O(log n)Red-Black TreeO(log n)O(log n)O(log n)Splay TreeO(log2 n)O(log2 n)O(log2 n)Search TreeWorst CaseInsertDeleteSearchBinary Search TreeO(n)O(n)O(n)AVL treeO(log2 n)O(log2 n)O(log2 n)B TreeO(log n)O(log n)O(log n)Red-Black TreeO(log n)O(log n)O(log n)Splay ... Read More

The graph is a non-linear data structures. This represents data using nodes, and their relations using edges. A graph G has two sections. The vertices, and edges. Vertices are represented using set V, and Edges are represented as set E. So the graph notation is G(V, E). Let us see one example to get the idea.In this graph, there are five vertices and five edges. The edges are directed. As an example, if we choose the edge connecting vertices B and D, the source vertex is B and destination is D. So we can move B to D but not ... Read More

Here we will see some sorting methods. There are 200+ sorting techniques. We will see few of them. Some sorting techniques are comparison based sort, some are non-comparison based sorting technique.Comparison Based Soring techniques are bubble sort, selection sort, insertion sort, Merge sort, quicksort, heap sort etc. These techniques are considered as comparison based sort because in these techniques the values are compared, and placed into sorted position in ifferent phases. Here we will see time complexity of these techniques.Analysis TypeBubble SortSelection SortInsertion SortMerge SortQuick SortHeap SortBest CaseO(n2)O(n2)O(n)O(log n)O(log n)O(logn)Average CaseO(n2)O(n2)O(n2)O(log n)O(log n)O(log n)Worst CaseO(n2)O(n2)O(n2)O(log n)O(n2)O(log n)some sorting algorithms are ... Read More