2019/speller

Author: dlloyd09

_pages/2019/spring/psets/4/speller/hashtable/speller.adoc

@@ -1,5 +1,5 @@
 ---
-layout: 2018/fall
+layout: 2019/spring
 ---
 
 = Speller
@@ -39,9 +39,8 @@ TIME IN TOTAL:
 
 === Downloading
 
-Log into link:https://cs50.io/[CS50 IDE] and then, in a terminal window, execute each of the below.
+Log into link:https://ide.cs50.io/[CS50 IDE] and then, in a terminal window, execute each of the below.
 
-1. Execute `update50` to ensure your IDE is up-to-date. That command might take a few minutes to finish.
 1. Execute `cd` to ensure that you're in `~/workspace/` (i.e., a directory called `workspace` that's in your home directory, aka `~`).
 1. Execute `mkdir pset4` to make (i.e., create) a directory called `pset4` in your home directory.
 1. Execute `cd pset4` to change into (i.e., open) that directory.
@@ -66,7 +65,7 @@ In `speller.c`, we've put together a program that's designed to spell-check a fi
 
 ==== `dictionary.h`
 
-Open up `dictionary.h`, and you'll see some new syntax, including a few lines that mention `DICTIONARY_H`. No need to worry about those, but, if curious, those lines just ensure that, even though `dictionary.c` and `speller.c` (which you'll see in a moment) `#include` this file, `clang` will only compile it once. 
+Open up `dictionary.h`, and you'll see some new syntax, including a few lines that mention `DICTIONARY_H`. No need to worry about those, but, if curious, those lines just ensure that, even though `dictionary.c` and `speller.c` (which you'll see in a moment) `#include` this file, `clang` will only compile it once.
 
 Next notice how we `#include` a file called `stdbool.h`. That's the file in which `bool` itself is defined. You've not needed it before, since the CS50 Library used to `#include` that for you.
 
@@ -92,7 +91,7 @@ And `const`, meanwhile, just says that those strings, when passed in as argument
 
 Now open up `dictionary.c`. Notice how, atop the file, we've defined a `struct` called `node` that represents a node in a hash table. And we've declared a global array, `hashtable`, with enough room for `N` pointers to nodes, where `N` is initialized above that array to `26`, one bucket for each letter in the (English) alphabet.
 
-A bit below those lines have we implemented a function called `hash` that hashes a word, returning `0` for any word that starts with an `a` (or `A`), `1` for any word that starts with a `b` (or `B`), `25` for any word that starts with a `z` (or `Z`), and so on for every letter in between. 
+A bit below those lines have we implemented a function called `hash` that hashes a word, returning `0` for any word that starts with an `a` (or `A`), `1` for any word that starts with a `b` (or `B`), `25` for any word that starts with a `z` (or `Z`), and so on for every letter in between.
 
 Below that have we written part of a function called `load` that will soon (thanks to you!) load a dictionary of words into the hash table. We've written some code that initializes all of the buckets (i.e., pointers) in `hashtable` to `NULL`. And we've written some code that opens `dictionary`, which is the file name of a dictionary to load. And we've also written some code that iterates over that dictionary and reads the words therein, one at a time, into a buffer (i.e., `string`) called `word`. But we stop short of inserting those words into `hashtable`. Thereafter, we do close the file, though, and then return `true` to indicate (we hope!) success.
 
@@ -306,7 +305,7 @@ To test your code less manually (though still not exhaustively), you may also ex
 
 [source]
 ----
-check50 cs50/2018/fall/speller
+check50 cs50/2019/spring/speller
 ----
 
 Note that `check50` will also check for memory leaks, so be sure you've run `valgrind` as well.
@@ -326,7 +325,7 @@ And if you'd like to put your code to the test against classmates' code (just fo
 
 [source]
 ----
-check50 cs50/2018/fall/challenges/speller
+check50 cs50/2019/spring/challenges/speller
 ----
 
 Then visit the URL that `check50` outputs to see where you rank!
@@ -336,5 +335,5 @@ Then visit the URL that `check50` outputs to see where you rank!
 Execute the below, logging in with your GitHub username and password when prompted. For security, you'll see asterisks (`*`) instead of the actual characters in your password.
 
 ```
-submit50 cs50/2018/fall/speller
+submit50 cs50/2019/spring/speller
 ```

_pages/2019/spring/psets/4/speller/trie/speller.adoc

@@ -1,5 +1,5 @@
 ---
-layout: 2018/fall
+layout: 2019/spring
 ---
 
 = Speller
@@ -51,7 +51,7 @@ Log into link:https://cs50.io/[CS50 IDE] and then, in a terminal window, execute
 1. Execute `ls`. You should see a directory called `speller`, which was inside of that ZIP file.
 1. Execute `cd speller` to change into that directory.
 1. Execute `ls`. You should see this problem's distribution:
-   
+
 ```
 dictionaries/  dictionary.c  dictionary.h  keys/  Makefile  speller.c  texts/
 ```
@@ -66,7 +66,7 @@ In `speller.c`, we've put together a program that's designed to spell-check a fi
 
 ==== `dictionary.h`
 
-Open up `dictionary.h`, and you'll see some new syntax, including a few lines that mention `DICTIONARY_H`. No need to worry about those, but, if curious, those lines just ensure that, even though `dictionary.c` and `speller.c` (which you'll see in a moment) `#include` this file, `clang` will only compile it once. 
+Open up `dictionary.h`, and you'll see some new syntax, including a few lines that mention `DICTIONARY_H`. No need to worry about those, but, if curious, those lines just ensure that, even though `dictionary.c` and `speller.c` (which you'll see in a moment) `#include` this file, `clang` will only compile it once.
 
 Next notice how we `#include` a file called `stdbool.h`. That's the file in which `bool` itself is defined. You've not needed it before, since the CS50 Library used to `#include` that for you.
 
@@ -304,7 +304,7 @@ To test your code less manually (though still not exhaustively), you may also ex
 
 [source]
 ----
-check50 cs50/2018/fall/speller
+check50 cs50/2019/spring/speller
 ----
 
 Note that `check50` will also check for memory leaks, so be sure you've run `valgrind` as well.
@@ -324,7 +324,7 @@ And if you'd like to put your code to the test against classmates' code (just fo
 
 [source]
 ----
-check50 cs50/2018/fall/challenges/speller
+check50 cs50/2019/spring/challenges/speller
 ----
 
 Then visit the URL that `check50` outputs to see where you rank!
@@ -334,5 +334,5 @@ Then visit the URL that `check50` outputs to see where you rank!
 Execute the below, logging in with your GitHub username and password when prompted. For security, you'll see asterisks (`*`) instead of the actual characters in your password.
 
 ```
-submit50 cs50/2018/fall/speller
+submit50 cs50/2019/spring/speller
 ```