A binary search works with any array of numbers
True false or multiple choice.
34. Which of the following is the correct preprocessor commands necessary to prevent multiple inclusions of header files? a) #include A????1header.hA????1 b) #define HEADER_HPage 5 #ifndef HEADER_H //declarations for header.h go here #endif c) #ifndef HEADER_H #define HEADER_H // declarations for header.h go here #endif d) #ifndef HEADER_H //declarations for header.h go here #endif
35. A recursive function can have only one stopping case.
36. A recursive function can have only one recursive case.
37. Each recursion causes a new activation frame to be placed on the stack.
38. Each activation frame contains all the functionA????1s code, as well as the automatic variables and formal parameters.
39. The activation frames in nested function calls are handled in a last-in/ first-out order.
40. A binary search works with any array of numbers.
41. How many times is the following code invoked by the call recursive(4)? void recursive( int i ) { using namespace std; if (i < 8) { cout << i << " "; recursive(i); } } a) 2 b) 4 c) 8 d) 32 e) This is an infinite recursion.
42. Give the output of the recursive function below when called with an argument of 5. void recursive( int i ) { using namespace std; if ( i < 8 ) { i++; recursive(i); cout << i << " "; } } a) 6 7 8 b) 5 6 7 c) 8 7 6 d) 7 6 5 e) None of the above. This is an infinite recursion if the function is called with argument 5.
Answers
Status NEW
Posted 29 May 2017 06:05 AM
My Price 5.00
-----------
Attachments
file 1496039142-Answer.docx preview (379 words )
T-----------rue----------- fa-----------lse----------- or----------- mu-----------lti-----------ple----------- ch-----------oic-----------e. ----------- 34-----------. W-----------hic-----------h o-----------f t-----------he -----------fol-----------low-----------ing----------- is----------- th-----------e c-----------orr-----------ect----------- pr-----------epr-----------oce-----------sso-----------r c-----------omm-----------and-----------s n-----------ece-----------ssa-----------ry -----------to -----------pre-----------ven-----------t m-----------ult-----------ipl-----------e i-----------ncl-----------usi-----------ons----------- of----------- he-----------ade-----------r f-----------ile-----------s? -----------a) -----------#in-----------clu-----------de -----------A??-----------??1-----------hea-----------der-----------.hA-----------???-----------?1 -----------b) -----------#de-----------fin-----------e H-----------EAD-----------ER_-----------HPa-----------ge -----------5 #-----------ifn-----------def----------- HE-----------ADE-----------R_H----------- //-----------dec-----------lar-----------ati-----------ons----------- fo-----------r h-----------ead-----------er.-----------h g-----------o h-----------ere----------- #e-----------ndi-----------f c-----------) #-----------ifn-----------def----------- HE-----------ADE-----------R_H----------- #d-----------efi-----------ne -----------HEA-----------DER-----------_H -----------// -----------dec-----------lar-----------ati-----------ons----------- fo-----------r h-----------ead-----------er.-----------h g-----------o h-----------ere----------- #e-----------ndi-----------f d-----------) #-----------ifn-----------def----------- HE-----------ADE-----------R_H----------- //-----------dec-----------lar-----------ati-----------ons----------- fo-----------r h-----------ead-----------er.-----------h g-----------o h-----------ere----------- #e-----------ndi-----------f35-----------. A----------- re-----------cur-----------siv-----------e
Not Rated(0)