Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
(Dr. Subbarao V Wunnava: Write the solutions neatly: 100 pts total: Good Luck) NO ATTACHMENTS
04 28 2015: rework all the 4 problems for your benefit:
ANSWER ONLY ANY 3 OUT OF 4 AND STRIKE OUT THE QUESTION NOT TO BE GRADED
Code No: _ _ _ _ _ _Student Name: _____________________ _ _Student ID__________________
1
111]. ANSWER THE FOLLOWING CLEARLY:
.a) How much Memory in bytes required to store the string: AaBbCc_DdEeFf_GgHhJj_KKKKKK_LLLLLL_MMMMM_NNNNN
32 times, following Unicode. What would be the memory size in bytes, if ASCII code is used instead of Unicode?
.c total _ _ _ _ _ _ _sum _ _ _ _ _ _ _
.d) R = ( (rand() %8) %5 ); What are the possible values for R?
.e) double D[900] array has been declared; Dptr = &D[0]; Dptr decimal value is 2679376; What are the
. addresses of D[100]th element and the last element of the array D[].
.d Ans _ _ __ _ _ _ _
.e) Using structures and binary representation, how many digital bits are needed to represent two 52
card decks together (2 bits, 4 bits, 7 bits, 12 bits, None of these (how many))
.e Ans _ _ _ _ _ _ _
DEAR ALL: THANKS FOR THE OPPORTUNITY TO BE ASSOCIATED WITH YOU IN THIS CLASS. BEST OF LUCK