Skip to content

Ntsika Test Done #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
DyanCoded wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Ntsika Test Done #3

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b96d3c5
Test Done
DyanCoded Oct 17, 2025
83b8fd4
Submitting
DyanCoded Oct 17, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
239 changes: 203 additions & 36 deletions student_code.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,31 +1,51 @@
import random


"""Learning Outcome: Functions"""
def sum_of_squares(n: int):
"""
Calculate the sum of the squares of all integers from 1 to n.
total = 0
try:
if n == 0:
return n
elif n > 0:
for _ in range(1, n + 1):
sum = n * n
total += sum
return sum
Comment on lines +11 to +14
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The loop variable is unused and the calculation is incorrect. Line 12 should use the loop variable (e.g., i) instead of n, and should calculate i * i. Currently, this adds n * n a total of n times, producing n^3 instead of the sum of squares.

Suggested change
for _ in range(1, n + 1):
sum = n * n
total += sum
return sum
for i in range(1, n + 1):
total += i * i
return total

Copilot uses AI. Check for mistakes.
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Returns the wrong variable. Should return total instead of sum to provide the accumulated sum of squares.

Suggested change
return sum
return total

Copilot uses AI. Check for mistakes.
except:
raise ValueError
Comment on lines +7 to +16
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Bare except clause catches all exceptions including system exits. Should specify the expected exception type (e.g., except TypeError:) or remove the try-except block entirely since no exception-raising code is present in the try block.

Suggested change
try:
if n == 0:
return n
elif n > 0:
for _ in range(1, n + 1):
sum = n * n
total += sum
return sum
except:
raise ValueError
if n == 0:
return n
elif n > 0:
for _ in range(1, n + 1):
sum = n * n
total += sum
return sum

Copilot uses AI. Check for mistakes.

sum_of_squares(5)

Parameters:
n (int): A non-negative integer up to which the squares will be summed.
def evaluate_performance(grades: list, min_pass: int):
total_grade = 0
num_of_grades = 0
for grade in grades:
total_grade += grade

# print(total_grade)

Returns:
int: The sum of the squares of all integers from 1 to n.
for _ in range(len(grades)):
num_of_grades += 1
Comment on lines +28 to +29
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Unnecessary loop to count list elements. Replace with num_of_grades = len(grades) for clearer and more efficient code.

Copilot uses AI. Check for mistakes.

Raises:
ValueError: If n is a negative integer.
"""
pass
# print(num_of_grades)

def evaluate_performance(grades: list, min_pass: int):
"""
Evaluate the performance based on a list of grades and a minimum passing grade.

ave_of_grades = total_grade / num_of_grades

Parameters:
grades (list): A list of integers representing student grades.
min_pass (int): The minimum average grade required to pass.
# print(ave_of_grades)

Returns:
str: "Pass" if the average grade is greater than or equal to min_pass, otherwise "Fail".
"""
pass
if ave_of_grades >= min_pass:
return "Pass"
elif 0 <= ave_of_grades < min_pass:
return "Fail"

grades = [15, 35, 55, 75, 95]

min_pass = 39

evaluate_performance(grades, min_pass)


def calculate_cumulative_performance(scores: dict):
"""
Expand Down Expand Up @@ -75,7 +95,15 @@ def even_numbers(n: int):
Returns:
list: A list of even integers from 1 to n.
"""
pass
even_numbers_list = []

for i in range(1, n + 1):
if i % 2 == 0:
even_numbers_list.append(i)

return even_numbers_list

even_numbers(19)

def odd_numbers(n: int):
"""
Expand All @@ -87,7 +115,15 @@ def odd_numbers(n: int):
Returns:
list: A list of odd integers from 1 to n.
"""
pass
odd_numbers_list = []

for i in range(1, n + 1):
if i % 2 != 0:
odd_numbers_list.append(i)

return odd_numbers_list

odd_numbers(19)

def sum_multiples_of_num(num: int, length: int):
"""
Expand All @@ -100,7 +136,15 @@ def sum_multiples_of_num(num: int, length: int):
Returns:
int: The sum of multiples of num from 1 to length.
"""
pass
total = 0

for i in range(1, length + 1):
sum = i * num
total += sum

return total

sum_multiples_of_num(2, 6)

def skip_num(n: int, length: int):
"""
Expand All @@ -113,7 +157,16 @@ def skip_num(n: int, length: int):
Returns:
list: A list of integers from 1 to length, excluding n.
"""
pass
numbers_list = []

for i in range(1, length + 1):
if i == n:
continue
else:
numbers_list.append(i)
return numbers_list

skip_num(17, 50)

def break_test(n: int, length: int):
"""
Expand All @@ -126,7 +179,21 @@ def break_test(n: int, length: int):
Returns:
list: A list of integers from 1 to length, excluding n and stopping before it.
"""
pass
list_of_numbers = []
break_list = []

while len(list_of_numbers) < length:
list_of_numbers.append(random.randint(1, 10))

for i in list_of_numbers:
if i == n:
return break_list
else:
break_list.append(i)

return break_list

break_test(1, 10)

def sum_numbers_until_zero(nums: list):
"""
Expand All @@ -138,7 +205,17 @@ def sum_numbers_until_zero(nums: list):
Returns:
int: The sum of integers in the list up to (but not including) the first zero.
"""
pass
sum_of_numbers = 0

for i in nums:
if i == 0:
return sum_of_numbers
else:
sum_of_numbers += i

sum_numbers_until_zero_nums = [12, 13, 20, 0, 100]

sum_numbers_until_zero(sum_numbers_until_zero_nums)

def count_positive_numbers(nums: list):
"""
Expand All @@ -150,7 +227,17 @@ def count_positive_numbers(nums: list):
Returns:
int: The count of positive integers in the list.
"""
pass
count = 0

for i in count_positive_numbers_nums:
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable count_positive_numbers_nums instead of the function parameter nums. Should iterate over nums parameter instead.

Suggested change
for i in count_positive_numbers_nums:
for i in nums:

Copilot uses AI. Check for mistakes.
if i >= 0:
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Counts zero as positive, but zero is neither positive nor negative. The condition should be if i > 0: to count only positive numbers as indicated by the function name.

Suggested change
if i >= 0:
if i > 0:

Copilot uses AI. Check for mistakes.
count += 1

return count

count_positive_numbers_nums = [1, -2, 3, -4, 5, -6, 7, -8]

count_positive_numbers(count_positive_numbers_nums)

def sum_dictionary_values(dictionary: dict):
"""
Expand All @@ -174,7 +261,17 @@ def sum_unique_elements(elements: list):
Returns:
int: The sum of unique integers in the list.
"""
pass
total = 0
sum_unique_elements_set = set(sum_unique_elements_nums)
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable sum_unique_elements_nums instead of the function parameter elements. Should use set(elements) instead.

Suggested change
sum_unique_elements_set = set(sum_unique_elements_nums)
sum_unique_elements_set = set(elements)

Copilot uses AI. Check for mistakes.

for i in sum_unique_elements_set:
total += i

return(total)

sum_unique_elements_nums = [1, 2, 3, 4, 5, 2, 3]

sum_unique_elements(sum_unique_elements_nums)

def skip_divisible_by_num(n: int, length: int):
"""
Expand All @@ -187,10 +284,19 @@ def skip_divisible_by_num(n: int, length: int):
Returns:
list: A list of integers from 1 to length, excluding those divisible by n.
"""
pass
num_list = []
for i in range(1, length + 1):
if i % n == 0:
continue
else:
num_list.append(i)
return num_list

# print(skip_divisible_by_num(3, 16))

"""Learning Outcome: Processing Data"""


def square_numbers(nums: list):
"""
Calculate the square of each number in a list.
Expand All @@ -201,7 +307,17 @@ def square_numbers(nums: list):
Returns:
list: A list containing the squares of the input integers.
"""
pass
squared_numbers = []

for i in list_of_square_num:
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable list_of_square_num instead of the function parameter nums. Should iterate over nums parameter instead.

Suggested change
for i in list_of_square_num:
for i in nums:

Copilot uses AI. Check for mistakes.
square_num = i * i
squared_numbers.append(square_num)

return squared_numbers

list_of_square_num = [1, 2, 3, 4, 5]

square_numbers(list_of_square_num)

def transform_string(input: str, transform: str):
"""
Expand Down Expand Up @@ -229,7 +345,24 @@ def sum_and_average(nums: list[int]):
Returns:
tuple: A tuple containing the sum and average of the numbers.
"""
pass
total = 0

new_list = []

for i in sum_and_average_list:
total += i

average = total / len(sum_and_average_list)
Comment on lines +352 to +355
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable sum_and_average_list instead of the function parameter nums. Should iterate over nums parameter instead.

Suggested change
for i in sum_and_average_list:
total += i
average = total / len(sum_and_average_list)
for i in nums:
total += i
average = total / len(nums)

Copilot uses AI. Check for mistakes.
Comment on lines +352 to +355
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable sum_and_average_list instead of the function parameter nums. Should use len(nums) instead.

Suggested change
for i in sum_and_average_list:
total += i
average = total / len(sum_and_average_list)
for i in nums:
total += i
average = total / len(nums)

Copilot uses AI. Check for mistakes.

new_list.append(total)
new_list.append(average)
sum_and_average_set = set(new_list)

return sum_and_average_set
Comment on lines +350 to +361
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Returns a set instead of a tuple as specified in the docstring. Should return (total, average) or tuple(new_list) instead of converting to a set, which loses ordering.

Suggested change
new_list = []
for i in sum_and_average_list:
total += i
average = total / len(sum_and_average_list)
new_list.append(total)
new_list.append(average)
sum_and_average_set = set(new_list)
return sum_and_average_set
for i in sum_and_average_list:
total += i
average = total / len(sum_and_average_list)
return (total, average)

Copilot uses AI. Check for mistakes.

sum_and_average_list = [1, 2, 3, 4, 5]

sum_and_average(sum_and_average_list)

def word_frequency_count(words: list[str]):
"""
Expand All @@ -253,7 +386,17 @@ def filter_even_numbers(nums: list[int]):
Returns:
list: A list containing only the even integers from the input list.
"""
pass
even_nums = []

for i in filtering_nums:
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable filtering_nums instead of the function parameter nums. Should iterate over nums parameter instead.

Suggested change
for i in filtering_nums:
for i in nums:

Copilot uses AI. Check for mistakes.
if i % 2 == 0:
even_nums.append(i)

return even_nums

filtering_nums = [1, 2, 3, 4, 5, 6, 7, 8, 9]

filter_even_numbers(filtering_nums)

"""Learning Outcome: Simple Algorithms(Problem Solving)"""

Expand All @@ -272,6 +415,10 @@ def find_median(nums: list[int]):
"""
pass

median_nums = [1, 2, 3, 4, 5]

# print(find_median(median_nums))

def reverse_string(input: str):
"""
Reverse the given string.
Expand All @@ -282,7 +429,11 @@ def reverse_string(input: str):
Returns:
str: The reversed string.
"""
pass
return reverse_string_input[::-1]

reverse_string_input = "qwerty"

reverse_string(reverse_string_input)

def largest_number(nums: list[int]):
"""
Expand All @@ -294,7 +445,17 @@ def largest_number(nums: list[int]):
Returns:
int or None: The largest number in the list, or None if the list is empty.
"""
pass
largest_num = 0

for i in largest_number_nums:
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uses global variable largest_number_nums instead of the function parameter nums. Should iterate over nums parameter instead.

Suggested change
for i in largest_number_nums:
for i in nums:

Copilot uses AI. Check for mistakes.
if i > largest_num:
largest_num = i
# print(largest_num)
Comment on lines +448 to +453
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Initialization to 0 fails for lists containing only negative numbers. Should initialize to nums[0] or float('-inf') to handle all cases correctly, or return None for empty lists as per docstring.

Suggested change
largest_num = 0
for i in largest_number_nums:
if i > largest_num:
largest_num = i
# print(largest_num)
if not nums:
return None
largest_num = nums[0]
for i in nums:
if i > largest_num:
largest_num = i

Copilot uses AI. Check for mistakes.
return largest_num

largest_number_nums = [1, 3, 5, 9, 3, 7, 4, 6]

largest_number(largest_number_nums)

def is_prime(n: int):
"""
Expand All @@ -306,7 +467,13 @@ def is_prime(n: int):
Returns:
bool: True if the number is prime, False otherwise.
"""
pass
for i in range(2, n):
if i % n == 0:
return False
else:
return True

Comment on lines +471 to +475
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Logic is inverted. The condition checks if i is divisible by n, but should check if n is divisible by i (i.e., if n % i == 0:). This makes the function always return True for n > 2.

Suggested change
if i % n == 0:
return False
else:
return True
if n % i == 0:
return False
return True

Copilot uses AI. Check for mistakes.
Comment on lines +470 to +475
Copy link

Copilot AI Oct 21, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Returns immediately after checking only the first divisor (2). The function should continue checking all divisors and only return True after the loop completes without finding any divisors.

Suggested change
for i in range(2, n):
if i % n == 0:
return False
else:
return True
if n < 2:
return False
for i in range(2, n):
if n % i == 0:
return False
return True

Copilot uses AI. Check for mistakes.
is_prime(7)

def count_character_occurrences(word_sentence: str, char_count: str):
"""
Expand All @@ -319,4 +486,4 @@ def count_character_occurrences(word_sentence: str, char_count: str):
Returns:
int: The number of occurrences of the character in the sentence.
"""
pass
pass