0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What are the Real time examples for non linear data structures?
In Systematically search option (Depth First Search), Data storing and retrieving in hard disk based on the "BALANCED TREE(AVL- B- TREE)", printer (QUEUE),In Programming language point of with out Data structure and Algorithms we can't develop a single program -primitive data structures - INTEGER, FLOAT, CHAR , BOOLEAN, ETC..abstract data structures- ARRAY , LINKED LIST , GRAPH, TREE, STACK , QUEUE. ETC..So, In programming every where we are using without knowing about this...try to learn basic thing about programming ....for to become a Good Software Engineer you should know the fundamental of Data Structure and Algorithms.
Who invented data structures?
Data structure is a very basic concept. I don't think it's possible to trace it back to a single person who invented it...
What are the Application of tree and graph in data file structures?
Using binary tree, one can create expression trees. The leaves of the expression tree are operands such as constants, variable names and the other node contains the operator (binary operator). this particular tree seems to be binary because all the operators used are binary operators. it is also possible for a node to have one node also, in case when a unary minus operator is used. we can evaluate an expression tree by applying the operator at the root to the values obtained by recursively evaluating the left and right sub trees.
What are primary data structure?
A primary data structure is a data structure that is created without the use of other data structures, whereas a secondary data structure relies on a primary data structure. A data structure is an organized collection of data elements.[NOTE: Be careful not to confuse the term data structure with the term data type. It is a common mistake. This answer addresses dat structures. Often people who ask about primary data structures or primitive data structures are really asking about primitve data types.]Here is an example where an array is a primary data structure and a binary tree is a secondary data structure based on the array:An array is a primary data structure -- it is a set of sequentially numbered data elements, such as an array of integers or an array of names -- name0, name, name2, ...A binary tree is a data structure where each element (called a node) has a data component and pointers to it's left and right sub-trees. [Think of a directory of folders, but each folder can only have two sub-folders.] We can create an and store an array of nodes to set up the tree in languages like C++ or Java.The root of the tree could be node 1 in the array, it would point to nodes 2 and 3. node 2 would point to nodes 4 and 5, while node 3 would point to nodes 6 and 7 .. and so on. generally node n point to nodes 2n and 2n+1. (You can start with node 0, but the math is a little easier if you start with node 1.)The binary tree in this case is the secondary data structure, while the undelying array is the primary data structure.
What is a degenerate binary search tree?
A degenerate binary tree is one where most or all of the nodes contain only one sub node. It is unbalanced and, in the worst case, performance degrades to that of a linked list. If your add node function does not handle rebalancing, then you can easily construct a degenerate tree by feeding it data that is already sorted.
Which data structures used in T9 dictionary?
Tries, it is a kind of tree data structure that can be used.
What are the Real time examples for non linear data structures?
In Systematically search option (Depth First Search), Data storing and retrieving in hard disk based on the "BALANCED TREE(AVL- B- TREE)", printer (QUEUE),In Programming language point of with out Data structure and Algorithms we can't develop a single program -primitive data structures - INTEGER, FLOAT, CHAR , BOOLEAN, ETC..abstract data structures- ARRAY , LINKED LIST , GRAPH, TREE, STACK , QUEUE. ETC..So, In programming every where we are using without knowing about this...try to learn basic thing about programming ....for to become a Good Software Engineer you should know the fundamental of Data Structure and Algorithms.
What is the fundamental difference between logical and physical data structures?
1) Logical data structures are structures that emphasize on data relationships and how data is related from the view of the user. 2) Physical data structures are data models that emphasize on the use of efficiently and effectively storing data in memory.
What is branching factor in trees?
In computing, tree data structures, and game theory, the branching factor is the number of children at each node
The need for complex data structures?
Explain the need for complex data structures
Who invented data structures?
Data structure is a very basic concept. I don't think it's possible to trace it back to a single person who invented it...
Is a bike leaning against a tree a balanced or unbalanced?
balanced
What are the Application of tree and graph in data file structures?
Using binary tree, one can create expression trees. The leaves of the expression tree are operands such as constants, variable names and the other node contains the operator (binary operator). this particular tree seems to be binary because all the operators used are binary operators. it is also possible for a node to have one node also, in case when a unary minus operator is used. we can evaluate an expression tree by applying the operator at the root to the values obtained by recursively evaluating the left and right sub trees.
What is the linear data structures?
Linear data structures are 1-dimensional arrays, as in: vectors.
How many types of tree data structures are there?
Search Trees Interval Trees Segment Trees Orthogonal Range Trees kd-Trees
Primary data secondary data?
primary data structures
What are primary data and secoundary data?
primary data structures
