Skip to content

Commit 8e3e80c

Browse files
committed
small changes in class
1 parent 3405c1f commit 8e3e80c

7 files changed

+147
-99
lines changed

Assigments/Assignment_4.ipynb

+2-2
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@
5252
"cell_type": "markdown",
5353
"metadata": {},
5454
"source": [
55-
"#### 3) Create the function **concatenate()** so that it receives as arguments an indefinite number of dictionaries. Hence, concatenate them in the given order, generating a single dictionary that must be returned as a function. Test cases will not have keys in common. See the examples:\n",
55+
"#### 3) Create the function **concatenate()** so that it receives as arguments an indefinite number of dictionaries. Hence, concatenate them in the given order, generating a single dictionary that must be returned as the function result. Test cases will not have keys in common. See the examples:\n",
5656
"\n",
5757
">```python\n",
5858
">>>> concatenate({1:'a',3:'c'},{2:'b',4:'d'},{5:'e',6:'f'})\n",
@@ -171,7 +171,7 @@
171171
"\n",
172172
"#### 7) There is a file called \"alice.txt\", which is the first chapter of the book Alice in Wonderland. The text has already been properly cleaned, punctuation was removed, as well as special characters and unnecessary spacing. There is a semi-ready function that reads the file and loads the text into the string-type variable called \"alice\"; you have to modify this function to return a dictionary whose keys are the unique words in the text, and the values are the number of times each word is repeated in the chapter (frequency distribution) - do not use the method collections.Counter.\n",
173173
"\n",
174-
"#### Extra: Try to discover the top 10 most used words. See the image below to get an idea of the answer (The bigger the word, the more often it is repeated).\n",
174+
"#### Extra: Try to discover the top 10 most used words. See the image below to get an idea of the answer (The bigger the word, the more frequent it appears).\n",
175175
"\n",
176176
"![](../Data/Figs/alice.png)\n",
177177
"\n",

Assigments/Assignment_4_solutions.ipynb

+2-2
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@
5252
"cell_type": "markdown",
5353
"metadata": {},
5454
"source": [
55-
"#### 3) Create the function **concatenate()** so that it receives as arguments an indefinite number of dictionaries. Hence, concatenate them in the given order, generating a single dictionary that must be returned as a function. Test cases will not have keys in common. See the examples:\n",
55+
"#### 3) Create the function **concatenate()** so that it receives as arguments an indefinite number of dictionaries. Hence, concatenate them in the given order, generating a single dictionary that must be returned as the function result. Test cases will not have keys in common. See the examples:\n",
5656
"\n",
5757
">```python\n",
5858
">>>> concatenate({1:'a',3:'c'},{2:'b',4:'d'},{5:'e',6:'f'})\n",
@@ -171,7 +171,7 @@
171171
"\n",
172172
"#### 7) There is a file called \"alice.txt\", which is the first chapter of the book Alice in Wonderland. The text has already been properly cleaned, punctuation was removed, as well as special characters and unnecessary spacing. There is a semi-ready function that reads the file and loads the text into the string-type variable called \"alice\"; you have to modify this function to return a dictionary whose keys are the unique words in the text, and the values are the number of times each word is repeated in the chapter (frequency distribution) - do not use the method collections.Counter.\n",
173173
"\n",
174-
"#### Extra: Try to discover the top 10 most used words. See the image below to get an idea of the answer (The bigger the word, the more often it is repeated).\n",
174+
"#### Extra: Try to discover the top 10 most used words. See the image below to get an idea of the answer (The bigger the word, the more frequent it appears).\n",
175175
"\n",
176176
"![](../Data/Figs/alice.png)\n",
177177
"\n",

0 commit comments

Comments
 (0)