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
Write an algorithm in form of a flowchart that takes temperatures input over a 100 day period (once per day) and outputs the number of days when temperature was below 20C and numbe

In the earlier unit, we have discussed about the arrays. Arrays are data structures of fixed size. Insertion & deletion involves reshuffling of array elements. Thus, arraymanipulat

#question.show that the following inequality is correct or incorrect. n!=O(n^n)

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

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

how to draw a 5 inch square on the screen using * symbol

For the Oscillating sort to be applied, it is necessary for the tapes to be readable in both directions and able to be quickly reversed. The oscillating sort is superior to the po

We would like to implement a 2-4Tree containing distinct integer keys. This 2-4Tree is defined by the ArrayList Nodes of all the 2-4Nodes in the tree and the special 2-4Node Root w

Determine about the Post conditions assertion A  post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

SPARSE MATRICES Matrices along with good number of zero entries are called sparse matrices. Refer the following matrices of Figure (a)