How pointer is benefit for design a data structure algorithm?
- 2 Answers
- 4381 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / kaushal vinayak
Pointer is that variable who store the address of the
variable.In data structure a node consist of two part data
and link part,where link part consist of hold the address of
the next node which is possible through pointer which
points to next node. through pointer you can go to the next
node in any defined data structure.
| Is This Answer Correct ? | 10 Yes | 0 No |
Answer / deepu.
I am cheking.by useing
pointer we save the
memory.
| Is This Answer Correct ? | 2 Yes | 0 No |
Describe how arrays can be passed to a user defined function
Compare interpreters and compilers.
main() { int i = -3,j=2,k=0,m; m= ++i || ++j && ++k; printf("%d%d%d",i,j,k,m); }
How do you convert strings to numbers in C?
for questions 14,15,16,17 use the following alternatives:a.int b.char.c.string.d.float
What are the advantages and disadvantages of pointers?
How can I manipulate strings of multibyte characters?
24.what is a void pointer? 25.why arithmetic operation can’t be performed on a void pointer? 26.differentiate between const char *a; char *const a; and char const *a; 27.compare array with pointer? 28.what is a NULL pointer? 29.what does ‘segmentation violation’ mean? 30.what does ‘Bus Error’ mean? 31.Define function pointers? 32.How do you initialize function pointers? Give an example? 33.where can function pointers be used?
All technical questions
main() { inta=10,b=20; a>=5?b=100:b=200; printf("%d ",b); }
How can I do peek and poke in c?
What is string constants?
C 
