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.

 

 

 

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

Ask an Expert

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

Write your message here..

Related Questions

Java code and algorythem, Suppose that you want to develop a program that a... Suppose that you want to develop a program that accepts a postfix expression and asks values for variables in the expression. Then you need to calculate the answer for the expressi

Problem logicall, Given a list containing Province, CustomerName and SalesV... Given a list containing Province, CustomerName and SalesValue (sorted by Province and CustomerName), describe an algorithm you could use that would output each CustomerName and Sal

Mid square method, Mid Square method with good example Mid Square method with good example

Postfix expression, Ask question Write an algorithm for the evaluation of a... Ask question Write an algorithm for the evaluation of a postfix expression using a stack#Minimum 100 words accepted#

Abstract type, define abstract type define abstract type

Explain space complexity, Explain Space Complexity Space Complexity :... Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

Analysis of algorithms, A common person's faith is that a computer can do a... A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

Application of stack, to find binary value of an integer to find binary value of an integer

For loop, for (i = 0; i sequence of statements } Here, the loop e... for (i = 0; i sequence of statements } Here, the loop executes n times. Thus, the sequence of statements also executes n times. Since we suppose the time complexity of th

Conversion of general trees to binary trees, Taking a suitable example expl... Taking a suitable example explains how a general tree can be shown as a Binary Tree. Conversion of general trees to binary trees: A general tree can be changed into an equiv