How pointer is benefit for design a data structure algorithm?
- 2 Answers
- 5131 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 |
why use "return" statement a) on executing the return statement it immediately transfers the control back to the calling program b) it returns the value present in the parentheses return, to the calling program c) a & b d) none of the above
Explain what are the standard predefined macros?
what is computer
What is the difference between exit() and _exit() function?
What is Function Pointer? Explain with example?
Write a program to print distinct words in an input along with their count in input in decreasing order of their count..
When can you use a pointer with a function?
How are Structure passing and returning implemented by the complier?
Can we change the value of constant variable in c?
plz answer..... a program that reads non-negative integer and computes and prints its factorial
What does main () mean in c?
What is the best way to comment out a section of code that contains comments?
C 
