#define nod 8
int main()
{
int arr[nod], N;
/*Assume arr is populated with individual
digits of 8-digit integer N as explained in Q1f*/
int i, sum = 0;
for (i=nod ; i>0 ; i--)
/* Write a single statement here to get
the desired result in sum. Just write this
statement in your answer sheet.*/
printf ("%d", sum);
} FIGURE-1
int main()
{
int i=0;
for (;i<20;i++)
{
switch (i)
{
case 0: i+=5;
case 1: i+=2;
case 5: i+=5;
default: i+=4;
}
printf ("%d\n",i);
}
return 0;
}
FIGURE-2
int fun ()
{
int i=0;
for (;i<20;i++)
{
switch (i)
{
case 0: i+=5;
case 1: i+=2;
case 5: i+=5;
default: i+=4;
}
return i;
}
}
int main()
{
int j = fun();
printf ("%d\n", j);
return 0;
}
FIGURE-3
int main() {
int n, i, j, k;
printf("\nEnter no. of digits");
scanf("%d", &n);
int Lin[n], Arr[n][n];
for(i=0;i<n;i++) //Input each digit
scanf ("%d",&Lin[i]);
for(i=0; i<n; i++)
{
for(j = 0;j<n-i;j++)
Arr[N1][N2] = Lin[N3];
for (k=0;k<i;k++)
Arr[N4][N5] = Lin[N6];
}
return 0;
}
FIGURE-4
Birla Institute of Technology & Science, Pilani
Second Semester 2016-2017, CS F111 Computer Programming
Mid Semester Test (Open Book)
Date: March 08, 2017 Time: 11.00 - 12.30 PM Max. Marks: 78
[NOTE: Answer all parts of a question sequentially. Assume necessary header files are included. Also, you are
not required to validate the input taken from the user by any program.]
Q1. On first page of your answer sheet write (only) the answers of the following eight parts neatly. Do rough work
at the back of your answer sheet. [4+4+4+4+4+4+4+8 = 36M]
a) If A = (-131)10 and B = (231)10, what is the value of C if (A+B) = (C)16 ? Assume 16-bit 2's complement
number representation here.
b) If A = (-131)10 and B = (231)10, what is the maximum positive value of C in base-10 if the following
expression does not result in overflow: ((A AND B) + C). Assume 16-bit, 2's complement number
representation here.
c) Let A = 10111101 be an unsigned binary number. Convert it into base-6 number representation.
d) Convert the following 32-bit IEEE 754 number to its equivalent decimal number:
1 10001110 01010000000000000000000
e) While converting any decimal number to IEEE 754 floating
point number representation, why we get biased exponent by
adding 127 to actual exponent?
f) Let there be an 8-digit positive integer whose individual digits
are stored in an array of size 8 with least significant digit
stored at index 7 and most significant digit at index 0.
Complete the program (shown in FIGURE-1) which stores the
reverse of this 8-digit integer in variable sum. For example,
positive integer 32406321 is stored in an array as
[3,2,4,0,6,3,2,1]. After program execution, variable sum stores
the number 12360423.
g) What is the output of two programs shown in FIGURE-2 and FIGURE-3?
h) Consider an n-digit
number d1d2……dn which is
to be stored in a 1D array
Lin of size n. From this 1D
array it is required to
populate a 2D array Arr of
size nxn as follows: The
0th row of Arr should
contain d1d2……dn. The 1st
row should contain
d2d3…dn d1. The 2nd row
should contain
d3d4……dnd1d2 and so on.
The (n-1)th row of Arr
should contain
dnd1d2……dn-1. In the
program (shown in FIGURE-4), what should be substituted in place of indexes N1 to
N6 to get the desired result?
