What is an incomplete type in c++, C/C++ Programming

Incomplete types refer to pointers in which there is no availability of the execution of the referenced location or it points to some location whose value is not available for modification.

int *i=0x400 // i points to address 400

*i=0; //set the value of memory location pointed by i.

Incomplete types are otherwise known as uninitialized pointers.

 

 

Posted Date: 4/8/2013 3:28:25 AM | Location : United States







Related Discussions:- What is an incomplete type in c++, Assignment Help, Ask Question on What is an incomplete type in c++, Get Answer, Expert's Help, What is an incomplete type in c++ Discussions

Write discussion on What is an incomplete type in c++
Your posts are moderated
Related Questions
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b


Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Write a function that has int parameter n, makes another type of mask having n bit 1's from the left most bit and 32- n bit 0's next. The mask is called netmask in this seminar, an

Define a structure of student class:  Write a program to define a structure of student record in C. class student { char name[20]; int roll_no; int marks[2];

Draw a flowchart for a program that allows the user to enter 20 names along with their ages and their Social Security Numbers in three parallel arrays. Programs shou

Consider a group of n robots, numbered R2D1 through R2Dn, and m tasks, numbered 1 through m. Tasks can be different and robots are specialized, hence a given robot can only perform

#At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with the

Define Bitwise-AND Operator: &:? The bitwise-AND operator (&) compares every bit of its first operand to the corresponding bit of its second operand. If both bits are 1 the mat

#A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of