given the piece of code
int a[50];
int *pa;
pa=a;
to access the 6th element of the array which of the
following is incorrect?
a.*(a+5)
b.a[5]
c.pa[5]
d.*(*pa + 5)
Answers were Sorted based on User's Feedback
Answer / karthik
void main()
{
int a[50]={1,2,3,4,1,55};
int *pa;
pa=a
printf("%d",*(pa+5));
}
we will the sixth element
its not pointer to the pointer ie *(*pa+5);
| Is This Answer Correct ? | 38 Yes | 4 No |
Answer / jaya prakash
Answer is D.
It is not a pointer to pointer.So we cannot use two stars.
| Is This Answer Correct ? | 6 Yes | 1 No |
The wrong answer is
d> *(*pa+5)
here value pointed to by pa is accessed and added 5 to it
then trying to print the value at that address, which gives
us an warning with some garbage value.
| Is This Answer Correct ? | 5 Yes | 1 No |
Answer / vignesh1988i
d) is the wrong choice...... because , first variable pa
refers to a address of the array... * of that pa will give
you the first value of the array.. ie a[0] , then that value
will be getting added with 5 and the * which is outside wont
have any value towards this manuplation...... so this will
show an error...... illegal use of pointers.....
thank u
| Is This Answer Correct ? | 2 Yes | 0 No |
What does %d do?
How will you allocate memory to double a pointer?
#define f(g,h) g##h main O int i=0 int var=100 ; print f ("%d"f(var,10));} what would be the output?
Suppose I want to write a function that takes a generic pointer as an argument and I want to simulate passing it by reference. Can I give the formal parameter type void **, and do something like this? void f(void **); double *dp; f((void **)&dp);
What is action and transformation in spark?
a C prog to swap 2 no.s without using variables just an array?
What is the difference b/w Structure & Union?
Explain is it better to bitshift a value than to multiply by 2?
How do I create a directory? How do I remove a directory (and its contents)?
how can use subset in c program and give more example
write a program to copy a string without using a string?
how to determine the complexity of an algorithm as log(n)