Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
304 Programming and Data Structures
for(i=0;'<5/'i++)
{
printf ("\n\t%d at location",*(*p+i));
printf ("\t% u at location ",*(p+i));
printf ("%u",p+i);
I
printf ("\n\n Integer requires 2 bytes, address require 4 bytes");
O UTPU T;
Oat location 4036 at location 4046
1 at location 4038 at location 4050
2 at location 4040 at location 4054
3 at location 4042 at location 4058
4 at location 4044 at location 4062
Integer requires 2 bytes, address require 4 bytes
Explanation In the above program the first f o r loop assigns addresses of elements of an integer
array to a pointer array The f i r s t p r i n t f () statement prints element, se
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343