Interested to Buy Any Domain ? << Click Here >> for more details...
How pointer is benefit for design a data structure algorithm?
- 2 Answers
- 4907 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 |
Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it?
What is hashing in c?
Why structure is used in c?
what is the output on the screen? int n; n=printf("my name is %d",printf("kiran %d",printf("kumar"))); printf("\n %d \n",n);
What is scope and lifetime of a variable in c?
What should malloc() do? Return a null pointer or a pointer to 0 bytes?
how logic is used
c program to add and delete an element from circular queue using array
Difference between fopen() and open()?
f(char *p) { p=(char *)malloc(sizeof(6)); strcpy(p,"HELLO"); } main() { char *p="BYE"; f(p) printf("%s",p); } what is the output?
9 Answers Hughes, Tech Mahindra,
What is true about the following C Functions a.Need not return any value b.Should always return an integer c.Should always return a float d.Should always return more than one value.
how can i sort numbers from ascending order and descending order using turbo c..
C 
