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
Ask question #Minima binary search tree is used to locate the number 43 which of the following probe sequences are possible and which are not? explainum 100 words accepted#

Determine the effect of Ruby in implementation of string Ruby has a String class whose instances are mutable sequences of Unicode characters. Symbol class instances are charact

Conversion of Forest into Tree A binary tree may be used to show an entire forest, since the next pointer in the root of a tree can be used to point to the next tree of the for

Type of Qualitative Method: Different  qualitative methods are suitable for different  types of study. Quite often we can  combine  qualitative and quantitative  methods. Many

Explain in detail the algorithmic implementation of multiple stacks.

Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

We might sometimes seek a tradeoff among space & time complexity. For instance, we may have to select a data structure which requires a lot of storage to reduce the computation tim

Stacks are often used in evaluation of arithmetic expressions. An arithmetic expression contains operands & operators. Polish notations are evaluated through stacks. Conversions of

Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

5. Implement a stack (write pseudo-code for STACK-EMPTY, PUSH, and POP) using a singly linked list L. The operations PUSH and POP should still take O(1) time.