Skip to content

Assignment-2 Efficacy Analysis of a Hypothetical Arthritis Drug #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
VincentSchaik wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Assignment-2 Efficacy Analysis of a Hypothetical Arthritis Drug #3

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
fe7f3ac
Assignment-1 anagram_checker completed.
VincentSchaik Aug 20, 2025
d69d619
Assignment 2 with data analysis and anomaly detection.
VincentSchaik Aug 21, 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
23 changes: 12 additions & 11 deletions 02_activities/assignments/assignment_1.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@
},
{
"cell_type": "code",
"execution_count": 15,
"execution_count": 17,
"metadata": {},
"outputs": [
{
Expand All @@ -65,7 +65,7 @@
"True"
]
},
"execution_count": 15,
"execution_count": 17,
"metadata": {},
"output_type": "execute_result"
}
Expand All @@ -75,6 +75,7 @@
"def anagram_checker(word_a, word_b):\n",
" \"\"\"Check if two words are anagrams of each other.\n",
" An anagram is a word formed by rearranging the letters of another.\n",
" For example, \"listen\" is an anagram of \"silent\".\n",
" \n",
" Parameters:\n",
" word_a (str): The first word to check.\n",
Expand All @@ -97,7 +98,7 @@
},
{
"cell_type": "code",
"execution_count": 16,
"execution_count": 18,
"metadata": {},
"outputs": [
{
Expand All @@ -106,7 +107,7 @@
"False"
]
},
"execution_count": 16,
"execution_count": 18,
"metadata": {},
"output_type": "execute_result"
}
Expand All @@ -117,7 +118,7 @@
},
{
"cell_type": "code",
"execution_count": null,
"execution_count": 19,
"metadata": {},
"outputs": [
{
Expand All @@ -126,7 +127,7 @@
"True"
]
},
"execution_count": 3,
"execution_count": 19,
"metadata": {},
"output_type": "execute_result"
}
Expand All @@ -146,7 +147,7 @@
},
{
"cell_type": "code",
"execution_count": null,
"execution_count": 20,
"metadata": {},
"outputs": [
{
Expand All @@ -155,7 +156,7 @@
"True"
]
},
"execution_count": 13,
"execution_count": 20,
"metadata": {},
"output_type": "execute_result"
}
Expand All @@ -165,7 +166,7 @@
"\n",
"def anagram_checker(word_a, word_b, is_case_sensitive):\n",
" \"\"\" Check if two words are anagrams of each other.\n",
" \n",
" An anagram is a word formed by rearranging the letters of another.\n",
" Args:\n",
" word_a (str): The first word.\n",
" word_b (str): The second word.\n",
Expand Down Expand Up @@ -201,7 +202,7 @@
},
{
"cell_type": "code",
"execution_count": 14,
"execution_count": 21,
"metadata": {},
"outputs": [
{
Expand All @@ -210,7 +211,7 @@
"False"
]
},
"execution_count": 14,
"execution_count": 21,
"metadata": {},
"output_type": "execute_result"
}
Expand Down
Loading