Y 1 p px 17 p 24 p zppp p12 eecs280 fall2013 819

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: m_ns+NMM_NS­1 b) t i g p r m _ n s N M M _ N S ­ 1 hn_t.yit[U_YIT ] c) t i g p r > y i t U _ Y I T hn_t­m_ns+NMM_NS­1 d) * t i g p r m _ n s N M M _ N S ­ 1 ) (hn_t.yit[U_YIT ] e) ( t i g p r . y i t [ U _ Y I T ] *hn_t)m_nsNMM_NS­1 f) ( t i g p r ­ m _ n s N M M _ N S ­ 1 *hn_t)>yit[U_YIT ] g) t i g p r > y i t [ U _ Y I T ] hn_t­m_nsNMM_NS­1 EECS 280 Fall 2013 7/19 uniqname: _________________________ Problem 2: Pointers, pointers, pointers (20 points) The figures to the right are abstract representations of memory allocated to a C++ program. Fill in the boxes with the values stored in each memory location after executing the following lines of code. Draw an arrow from one box to another in order to represent a pointer. Be clear! Difficult to parse answers will receive no credit. Use a sheet of paper if you need to experiment before writing your final answer on this page. (1pt for each correct box) / xml /Eape / sapitrt /pi one ox / a h au /xhstevle7 / atA(ps /Pr 6...
View Full Document

This test prep was uploaded on 03/10/2014 for the course EECS 280 taught by Professor Noble during the Winter '08 term at University of Michigan.

Ask a homework question - tutors are online