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
Simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations and the effect of introducing nu

write an algorithm for multiplication of two sparse matrices using Linked Lists

The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through

How does cpu''s part tming and controls generate and controls signls in computer?

In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the

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

Implementations of Kruskal's algorithm for Minimum Spanning Tree. You are implementing Kruskal's algorithm here. Please implement the array-based Union-Find data structure.

Which data structure is required to change infix notation to postfix notation?    Stack function is used to change infix notation to postfix notatio n

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

what is tower of management with example