Basic concept of the primitive data structures, Data Structure & Algorithms

Q. Explain the basic concept of the primitive data structures.                                            

Ans.

The concept of Primitive Data Structure

These are the general structure and are directly operated upon by the machine instructions. These commonly have various representations on various computers. Integer floating point number, character constraints, pointer, string constants, etc fall in this category.

189_primitive data structures.png

 

 

 

Posted Date: 7/12/2012 8:14:48 AM | Location : United States







Related Discussions:- Basic concept of the primitive data structures, Assignment Help, Ask Question on Basic concept of the primitive data structures, Get Answer, Expert's Help, Basic concept of the primitive data structures Discussions

Write discussion on Basic concept of the primitive data structures
Your posts are moderated
Related Questions
What is a height balanced tree? Height Balanced Tree (AVL Tree) An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most

MID SQUARE METHOD


Big oh notation (O) : The upper bound for the function 'f' is given by the big oh notation (O). Considering 'g' to be a function from the non-negative integers to the positive real

/* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

explain two strategies to implement state charts with the help of an example of each.

Q .  Write down the non-recursive algorithm to traverse a tree in preorder. Ans: T he Non- Recursive algorithm for preorder traversal is written below: Initially i

A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

WHAT IS THE PURPOSE OF STACK IN C

A driver takes shortest possible route to attain destination. The problem which we will discuss here is similar to this type of finding shortest route in any specific graph. The gr