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
If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

merging 4 sorted files containing 50 10 25 and 15 records will take time

whate is meant by the term heuristic

how to define the size of array

what is folding method?

Djikstra's algorithm (named after it is discovered by Dutch computer scientist E.W. Dijkstra) resolves the problem of finding the shortest path through a point in a graph (the sour

Write a C++ program with header and source les to store street addresses using the Doubly Linked List ADT. Modify the Node class from Lab Assignment 3 so that it becomes a node in

Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int

How do you rotate a Binary Tree?  Rotations in the tree: If after inserting a node in a Binary search tree, the balancing factor (height of left subtree - height of right