- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 349 Articles for Data Structure Algorithms
636 Views
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
192 Views
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
4K+ Views
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
2K+ Views
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
3K+ Views
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
5K+ Views
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
4K+ Views
In different cases, we perform different searching schemes to find some keys. In this section we will see what are the basic differences between two searching techniques, the sequential search and binary search.Sequential SearchBinary SearchTime complexity is O(n)Time complexity is O(log n)Finds the key present at first position in constant timeFinds the key present at center position in constant timeSequence of elements in the container does not affect.The elements must be sorted in the containerArrays and linked lists can be used to implement thisIt cannot be implemented directly into the linked list. We need to change the basic rules of ... Read More
17K+ Views
The abstract datatype is special kind of datatype, whose behavior is defined by a set of values and set of operations. The keyword “Abstract” is used as we can use these datatypes, we can perform different operations. But how those operations are working that is totally hidden from the user. The ADT is made of with primitive datatypes, but operation logics are hidden.Here we will see the stack ADT. These are few operations or functions of the Stack ADT.isFull(), This is used to check whether stack is full or notisEmpry(), This is used to check whether stack is empty or ... Read More
1K+ Views
Here we will see one example on convex hull. Suppose we have a set of points. We have to make a polygon by taking less amount of points, that will cover all given points. In this section we will see the Jarvis March algorithm to get the convex hull.Jarvis March algorithm is used to detect the corner points of a convex hull from a given set of data points.Starting from left most point of the data set, we keep the points in the convex hull by anti-clockwise rotation. From a current point, we can choose the next point by checking ... Read More
988 Views
A set of integers are given in the sorted order and another array freq to frequency count. Our task is to create a binary search tree with those data to find minimum cost for all searches.An auxiliary array cost[n, n] is created to solve and store the solution of sub problems. Cost matrix will hold the data to solve the problem in bottom up manner.Input − The key values as node and the frequency.Keys = {10, 12, 20} Frequency = {34, 8, 50}Output − The minimum cost is 142.These are possible BST from the given values.For case 1, the cost ... Read More