Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Can anyone help me check iff my answers are correct? studying for an exam. Also, what is number 2? Thank you. MY ANSWERS: 1) Use
Can anyone help me check iff my answers are correct? studying for an exam. Also, what is number 2? Thank you.
MY ANSWERS:
1) Use the following lines of code to answer the next several questions. Assume the array b[] is loaded into memory at address location 2000 and an integer on this system has a size of 2, a float a size of 4 and a double a size of 8. You may use an answer more than once int bl]-(7,9,3,1]; int *bPtr = b; A) 2010 C) 2008 E) 2006 G) 3 B) 2004 D) 2002 F) 2000 H) 9 a. What is the ADDRESS of the value at location b[2]? b. What is the VALUE at location *bPtr? If I do this ++bPtr; for questions 21 and 22 (just one time!), c. What is the VALUE at location *bPtr ? d. what will printi(%p", bPtr) display ? K) none of the above 2) IfI define a character array as follows: char names[] = "halloweenisgone"; What will the following "printf" output (IGNORE ALL COMPILE ERRORS)? intx-1; for (x-2; x 3 int main( void ) 4 int a; int *aPtr; a-7 aPtr-&a return 0; 7 10 3) The following statement: printf("%p", &a); will print a) 1CD46AA3 b) NULL d) none of the above 4) The following statement: printf("%d", *aPtr); will print a) 1CD46AA3 b) NULL d) none of the above 5) The following statement: printf("%p", aPtr); will print a) 1CD46AA3 b) NULL d) none of the above 6) Write the function prototype for a function called makeup that takes two pointers to double type numbers as parameters and returns an int value. Write just the header - nothing else / themselves 7) T F Pointers store the addresses of memory locations. They do not have an address forStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started