Scribd
Upload
39 views9 pages

Midterm d200 Sol Spring2023

Cmpt midterm

Uploaded by

Khaled Abunawwas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views9 pages

Midterm d200 Sol Spring2023

Cmpt midterm

Uploaded by

Khaled Abunawwas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

CMPT 125 D200, Spring 2023

Midterm Exam - Solutions


March 3, 2023

Name_________________________

SFU ID: |__|__|__|__|__|__|__|__|__|

Problem 1
Problem 2
Problem 3
TOTAL

Instructions:

1. Duration of the exam is 90 minutes.


2. Write your full name and SFU ID **clearly**.
3. This is a closed book exam, no calculators, cell phones, or any other material.
4. The exam consists of three (3) problems.
5. Write your answers in the provided space.
6. There is an extra page at the end of the exam. You may use it if needed.
7. Explain all your answers.
8. Really, explain all your answers.

Good luck!

1
Problem 1 [40 points]

a) [10 points] What will be the output of the following program? Explain your answer.
#include <stdio.h>
const int​ RED = 0;
const int​ GREEN = 1;
const int​ BLUE = 2;
const int​ YELLOW = 3;

int fun(int* x, int* y) {


long z = 4;
*y = z;
z = 65;
x = y;
*x = YELLOW;
return *y;
}
int main() {
int a = RED, b = GREEN;
int c = fun(&a, &b);
printf("a = %d, b = %d, c = %d\n", a, b, c);
return 0;
}
Answer: the address of a is passed to x, the address of b is passed to y
*y (which is b) is assigned 4.
Then x = y makes x point to b.
*x = YELLOW sets b= 3
return *y returns 3
When returns, the program will print
a = 0, b = 3, c = 3

b) [10 points] Will the code below compile?


If yes, what will be the result of the execution?If not, explain errors/warnings/potential issues.
#include <stdio.h>
int main() {
char str[20] = {0,'A','B',0,'4','5','6','7',0};
int ind=0;
while (str[ind])
ind++;

printf("%s\n", str+5);
return 0;
}
Answer: the while loop will stop at ind=0 because str[0]=0. Str+5 the points to 5. The program will print
567

2
c) [10 points] Will the code below compile?
If yes, what will be the result of the execution?If not, explain errors/warnings/potential issues.
#include <stdio.h>
#include <stdlib.h>

int* what(int start) {


int* arr = malloc(4*sizeof(int));
for(int i=0;i<4;i++)
arr[i] = start+i*i;
return arr;
}
int main() {
int* a1 = what(0);
a1[0] = 200;
int* a2 = what(1);
a2 = a1;
printf("a1 = [%d, %d, %d, %d]\n", a1[0], a1[1], a1[2], a1[3]);
printf("a2 = [%d, %d, %d, %d]\n", a2[0], a2[1], a2[2], a2[3]);
free(a2);
free(a1);
printf("return\n");
return 0;
}
Answer: the program will compile ok. It will print
a1 = [200, 1, 4, 9]
a2 = [200, 1, 4, 9]
return
But then the program will likely crash because of double free.
This is because a1 and a2 point to the same array.
In addition the second array is not freed.

d) [10 points] Will the code below compile?


If yes, what will be the result of the execution?If not, explain errors/warnings/potential issues.
#include <stdio.h>

int array_sum(int arr[], int length) {


arr[0]=0; // do something unexpected
return 0;
}
int main() {
const int arr[] = {0,0,0,0};
array_sum(arr, 3);
return 0;
}
Answer: we are passing a constant array into a function that does not guarantee that the array is constant. This will
cause either warning or compilation error, depending on the compiler.

3
Problem 2 [30 points]

a) [15 points] Write a function that gets an int n>=0 and returns a string containing this int.
Make sure the returned string is allocated on the heap.

For example,
● int2str(10) returns "10".
● int2str(4) returns "4".
● int2str(0) returns "0".
● int2str(625) returns "625".
● int2str(88088) returns "88088".

char* int2str(unsigned int n) {


int count_digit = 0;
int tmp = n;
while (tmp>=10) {
tmp = tmp/10;
count_digit++;
}
count_digit++; // here 0<=tmp<=9
// count_digit contains the number of digits in n
// printf("count_digit = %d\n", count_digit);

char* str = malloc(count_digit+1);


str[count_digit] = '\0'; // set the null terminator
// populate the string digit by digit
// starting from least significant digit, each time dividing by 10
int index = count_digit-1;
tmp = n;
while (tmp>=10) {
str[index] = '0' + tmp%10;
tmp = tmp/10;
index--;
}
str[0] = '0' + tmp; // here 0<=tmp<=9
return str;
}

4
b) [15 points] Write a function that gets an array of non-negative ints of length n>0,
and returns a string representing this array in the following format:
● array_to_string([2,123,103], n=3) returns "[2,123,103]".
● array_to_string([22,3,40,100], n=4) returns "[22,3,40,100]".
● array_to_string([41], n=1) returns "[41]".

No spaces between numbers and commas

Make sure the returned string is allocated on the heap.


Remember to free all unnecessary intermediate data allocated on the heap.
You may use the standard functions if necessary (e.g., use the library string.h).
char* array_to_string(const int* arr, int n) {
// first we compute the length of the output
int length = n+1; // this accounts for the square brackets and commas
for (int i = 0; i < n; i++) {
char* tmp_i = int2str(arr[i]);
length += strlen(tmp_i); // add the length of the i’th string
free(tmp_i); // don’t forget to free tmp_i
}

char* ret = malloc(length+1); // this is the string we return


ret[0] = '['; ret[1] = '\0'; // start with '['
char* end_ptr = ret+1; // end_ptr always points to the end of ret
for (int i = 0; i < n; i++) {
char* tmp_i = int2str(arr[i]); // use the function from part a)
int len_i = strlen(tmp_i);
strcat(end_ptr, tmp_i); // strcat(ret,tmp_i) is also ok, but less efficient
end_ptr = end_ptr + len_i;
if (i<n-1) { // add comma after string, except for the last one
strcat(end_ptr, ","); // strcat(ret,",") is also ok, but less efficient
end_ptr = end_ptr + 1;
}
free(tmp_i); // don’t forget to free it
}
strcat(end_ptr, "]"); // end with ']'
return ret;
}

5
Problem 3 [30 points]

a) [15 points] Write a function that gets an int n and returns a string of length n, of the form
"01234567890123...".
That is, the i’th character in the string (counting from zero) is the unit digit of i.

For example,
● get_string(4) returns "0123".
● get_string(0) returns "".
● get_string(10) returns "0123456789".
● get_string(12) returns "012345678901".
● get_string(25) returns "0123456789012345678901234".

Make sure the returned string is allocated on the heap.


You may use the standard functions if necessary (e.g., use the library string.h).

char* get_string(int n) {

char* str = malloc(n+1);

if (str==NULL) // malloc failed


return NULL;

for(int i=0; i<n; i++)


str[i] = i%10;
str[n] = 0;
return str;

6
b) [15 points] Write a function that gets an int n>0 and returns an array of strings of length n,
where the i’th string is get_string(i) from the previous item. You may assume n>0.

For example,
● get_n_strings(1) returns [""] .
● get_n_strings(4) returns ["","0","01","012"] .
● get_n_strings(7) returns ["","0","01","012","0123","01234","012345"] .

Make sure the returned structure is allocated on the heap.


You may use the standard functions if necessary (e.g., use the library string.h).

char** get_n_strings(int n) {

// allocate n pointers to strings


char** ret = malloc(n*sizeof(char*));

for(int i=0; i<n; i++)


ret[i] = get_string(i); // use the function from part a)

return ret;

7
Extra page

8
Empty page

You might also like