Question 1 [13] The multiple choice answers are as follows: 1.1 A 1.2 D 1.3 B 1.4 B 1.5 C

Transcription

1 Question 1 [13] The multiple choice answers are as follows: 1.1 A 1.2 D 1.3 B 1.4 B 1.5 C Please see the LibreOffice document for the detailed memo for each multiple choice question. Bladsy 1 van 11 / Page 1 of 11

2 Question 2 [10] #!/usr/bin/env python # -*- coding: utf-8 -*- The following empirical relation describes the concentration of insulin in the blood at time t : C(t) = C_0 e^{\left( \frac{-30t}{m} \right)}, where C_0 = 85 is the initial concentration, t is the time [min], and m is the mass [kg] of patient. Write a Python program that reproduces Figure \ref{fig:fig1}, with all annotations included (that is, axis labels, titles, etc). The graph is produced from the equation above with m = [60, 70, 80, 90, 100]. The time t is discretized using 50 equally spaced points between 0 and 5 minutes. Note that the legend is located at the top right and the major gridlines are visible. The title annotation is produced using a font size of 16 and the axis annotations are produced using a font size of 14. Fundamental Concepts (FC): 1) Able to create x and y data, for the plots, using the correct functions 2) Able to plot x and y data with different linestyles 3) Able to create graph annotations Possible FC Mistakes: - Incorrect range of time or mass values (missing edge cases) - Mistake with calculating the Ct data for the plots - Incorrect linestyles used - Missing annotations (1 FC per missing annotation) - Not adjusting fontsize at all (show at least once) Additional Implementation (AI): 1) Correct legend location and labels 2) Grid lines turned on 3) Correct fontsizes Bladsy 2 van 11 / Page 2 of 11

3 Marks (Percentage): 0-0 fundamental concepts in place 20-1 fundamental concepts in place 40-2 fundamental concepts in place All fundamental concepts in place. 3 or more FC implementation mistakes All fundamental concepts in place. 1 or 2 FC implementation mistakes AND 3 or less AI mistakes All fundamental concepts in place. No FC implementation mistakes AND 2 or less AI mistakes. from matplotlib import pyplot import numpy # version C0 = 85 mass = range(60, 101, 10) time = numpy.linspace(0, 5, 50) pyplot.figure(1) lstyle = [ k-, k--, k-., k:, k. ] for i in range(len(mass)): legend_label = "m = " + str(mass[i]) Ct = C0 * numpy.exp( (-30.0 * time) / mass[i] ) pyplot.plot(time, Ct, lstyle[i], label=legend_label) pyplot.title("insulin concentration over time.", fontsize=16) pyplot.xlabel("time [min]", fontsize=14) pyplot.ylabel("insulin concentration [%]", fontsize=14) pyplot.legend(loc="upper right", fontsize=14) pyplot.grid() pyplot.show() The different versions of the question answers shown above are not the only solutions available, many others exist. Bladsy 3 van 11 / Page 3 of 11

4 Question 3 [12] #!/usr/bin/env python # -*- coding: utf-8 -*- A palindrome number is a number that represents the same number when read either from left-to-right or from right-to-left. For example: 9009 is a palindrome, as it represents 9009 when read either backwards or forwards. You are given the function \texttt{is\_palindrome} in the \texttt{numbers.py} module: def is_palindrome(num): "" Returns True if a number (num) is a palindrome number, else returns False "" if (str(num) == str(num)[::-1]) and (num > 9): return True return False Write a function \texttt{palindrome\_list} (\textbf{in a separate module}) that takes one input, namely an integer N. The function must compute and \textbf{return a list} of all palindrome numbers, that are smaller than N. The list of palindrome numbers must only contain unique entries, that is no duplicate entries in the list. For example: \texttt{palindrome\_list(50)} must return [11, 22, 33, 44]. Fundamental Concepts (FC): 1) Able to import and use a function from another module - No import of / from numbers --> missing FC 1 - Incorrect calling of is_palindrome(num) --> missing FC 1 Bladsy 4 van 11 / Page 4 of 11

5 2) Able to create a function with proper inputs and returns - No "def" or inputs --> missing FC 2 - Overwriting inputs --> missing FC 2 - Not returning anything --> mising FC 2 - Returning an undefined name --> mising FC 2 3) Grow a list of unique accending palindrome numbers - Not initializing a list --> missing FC 3 - Not growing the list correctly --> missing FC 3 - Garbage in the list --> missing FC 3 Possible FC Mistakes: - Import numbers.py in place of numbers - Incorrect function name - Returning the wrong object (object must be defined) - Mistake with if statement condition Additional Implementation (AI): 1) Incorrect range for the looping structure (ie edge case >= num) Marks (Percentage): 0-0 fundamental concepts in place 20-1 fundamental concepts in place 40-2 fundamental concepts in place All fundamental concepts in place. 2 or more FC implementation mistakes All fundamental concepts in place. 1 FC implementation mistakes All fundamental concepts in place. No FC implementation mistakes AND 1 AI mistake ########## numbers.py ########## def is_palindrome(num): if (str(num) == str(num)[::-1]) and (num > 9): return True return False Bladsy 5 van 11 / Page 5 of 11

6 ########## module.py ########### # version from numbers import is_palindrome def palindrome_list(num): pal_list = [] for i in range(num): if is_palindrome(i): pal_list.append(i) return pal_list # version from numbers import is_palindrome def palindrome_list(num): cnt = 1 pal_list = [] while cnt < num: if is_palindrome(cnt): pal_list.append(cnt) cnt += 1 return pal_list The different versions of the question answers shown above are not the only solutions available, many others exist. Bladsy 6 van 11 / Page 6 of 11

7 #!/usr/bin/env python # -*- coding: utf-8 -*- Created on Fri Mar 15 09:22:17 Logan Page YOU CAN TEST QUESION 3 WITH THE FOLLOWING SCRIPT ASSUMING OF COURSE THAT THE "palindrome_list" FUNCTION IS SAVED IN "question3.py" and the "is_palindrome" FUNCTION IS SAVED IN "numbers.py" import question3 as q3 print q3.palindrome_list(50) Bladsy 7 van 11 / Page 7 of 11

8 Question 4 [15] #!/usr/bin/env python # -*- coding: utf-8 -*- Consider the \textit{reversi} board in Fig.~\ref{fig:example}. The row ( r ) and column ( c ) indices are indicated on the border. A position on the board is indicated by [r,c]. The 1 s indicates your disks, the 2 s your opponents disks and 0 s empty positions. A valid position for a move is an empty position that flanks the opponents disks. A flank is created when your disks encloses your opponents disks either vertically, horizontally or diagonally. For example the the disk location [4, 1] in Fig.~\ref{fig:board_1}, and location [6, 4] in Fig.~\ref{fig:board_2} are both valid as they flank the opponents disks. Write a python function \texttt{is\_valid\_location} that takes two inputs, namely the board values (as a \texttt{numpy array}); and a [r, c] position (as a \texttt{numpy array}). The function must return \texttt{true} if [r, c] is a valid move, otherwise the function must return \texttt{false}. Fundamental Concepts (FC): 1) Check for a flank (valid_move) along a direction for the given board and [r, c] inputs 2) Repeat 1 for all directions 3) Consolidate 1 and 2 information to determine validity of move (is a valid move) Bladsy 8 van 11 / Page 8 of 11

9 Possible FC Mistakes: - Incorrect ranges (edge of board errors) - Not checking if [r, c] location is empty - End of flank wrong edge indexes (1 offset) - Not excluding 0, 0 direction for checking all directions - Ammend after marking a few papers Additional Implementation (AI): 1) Ammend after marking a few papers Marks (Percentage): 0-0 fundamental concepts in place 20-1 fundamental concepts in place 40-2 fundamental concepts in place All fundamental concepts in place. More than 2 FC implementation mistakes All fundamental concepts in place. 1 or 2 - FC implementation mistakes OR AI mistakes All fundamental concepts in place. No FC implementation mistakes AND all AI in place. import numpy def flank_search(board, pos, row_inc, col_inc): r = pos[0] + row_inc c = pos[1] + col_inc while (0 <= r and r <= 7) and (0 <= c and c <= 7) and board[r][c] == 2: r = r + row_inc c = c + col_inc if (0 <= r and r <= 7) and (0 <= c and c <= 7): if board[r][c] == 1: return True return False Bladsy 9 van 11 / Page 9 of 11

10 def is_valid_location(board, pos): found_dir = False for i in range(-1, 2, 1): for j in range(-1, 2, 1): if i!= 0 or j!= 0: search_dir = flank_search(board, pos, i, j) if search_dir == True: found_dir = True if found_dir == True: return True return False The different versions of the question answers shown above are not the only solutions available, many others exist. Bladsy 10 van 11 / Page 10 of 11

11 #!/usr/bin/env python # -*- coding: utf-8 -*- Created on Fri Mar 15 09:22:17 Logan Page YOU CAN TEST QUESION 4 WITH THE FOLLOWING SCRIPT ASSUMING OF COURSE THAT THE "is_valid_location" FUNCTION IS SAVED IN "question4.py" import numpy import question4 as q4 board = numpy.array([[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 2, 0, 0], [0, 0, 0, 1, 2, 0, 0, 0], [0, 0, 2, 2, 2, 2, 2, 2], [0, 0, 2, 1, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]]) print q4.is_valid_location(board, [4, 1]) print q4.is_valid_location(board, [2, 6]) print q4.is_valid_location(board, [3, 5]) Bladsy 11 van 11 / Page 11 of 11