DISCLAIMER: The following videos are for educational purposes only. Cheating or any other activities are highly discouraged!! Using another person's code breaks the academic honesty guidelines. This solution is for those who have finished the problem sets and want to watch for educational purposes, learning experience, and exploring alternate ways to approach problem and is NOT meant for those actively doing the problem sets or to those who copy-paste the code. I have also emailed the staff in regards to academic honesty, so please be careful. Besides, if you copy you rob yourself of a valuable opportunity to learn and discover new things for yourselves. :) At any point if you are stuck please reach out to Discord or Facebook groups, there are literally 1000s of people there (no joke!!) who can help and guide you finish your solution!! Good luck!
Extremely well put out and very well explained! Thank you so much! This really helped me out a lot. The way you explain concepts and their implementation is the best I've ever seen. Can't thank you enough. Keep up the good work and good luck for whatever it is you pursue! Cheers!
Thank you so much for this. My code was nearly identical to yours aside from the hash function, but I kept getting a leak error from not closes the file. So simple! I was also having an issue with my hash function, and I had a feeling it had to do with the string case because of the output I was getting. I didn't even consider something as simple as using tolower(). But you're right, they gave away so much on this problem set, but a part of me is glad they did. It took me a bit to start this problem set because I was intimidated by it, but with the walkthrough and the shorts (and your video), I feel like I have a pretty good grasp of this stuff now. Thanks again!
I just want to say that I'm here a year later having the same leak from not closing the file and I just saw this comment and I just can't express how thankful I'm right now. thank you so much I hope you have a wonderful lifetime .
very nice. It was very challenge for me to doing this pset. your video helped me a lot trying to learn how to code it not easy task, but you did a nice job teaching it thanks
Do we need the if part of the if/else statement for the code at 12:25? Can't we just replace this code: if (table[index] == NULL) { table[index] = new_node; } else { new_node->next = table[index]; table[index] = new_node; } With the code below and achieve the same result? new_node->next = table[index]; table[index] = new_node;
12:27 It's not clear to me why we go n->next = table[index]; table[index]-= n; instead of n->next = table[index+1]; table[index]->next = n; or even just n->next = table[index+1]; table[index]= n; It would seem to me that we want our new node to point to the next index, not the current one. So if the hash gives me value 1, I want the NEXT value in the chain to be 2. So first I connect my new_node to the next link in the chain, then I connect the previous link t new_node, at the correct index. Maybe I'm missing something thanks for any help!
Hey sorry, I don't remember since I made these videos a while back, please post in discord for help. If I were to remmeber, I would say index is always 0 indexed , so you would place it there and then incremenet / decrement it. index + 1 would offset it by 1 and there could be some potential "holes" or gaps in the data structure. So you fill the current spot and move on.
How do you fit more than two elements into a bucket, with those lines? else{ new_node -> next = table[index] } implies that if the location is full, then it point to that location. Does that not mean that the second location will be replaced, if the second location is already full? I feel like the check needs to iterate over until it finds a null, rather than simply assuming the next location is already free?
i know that if we said int something so it should be like that >>>>>>int x = 5; so why we said >>>>> int index = hach(word); and when should i use these way
Cause the new_node's next field points to the next node of the linked list. If you do new_node = table[index], you are basically making new_node's word field and next field = NULL or something else whichever might be present there..Hence, by doing that we are losing the new_word's next and word field.
hey man, I need help :/ I'm stuck at this exercise.. I've done this exercise by myself, without browsing for videos.. and it worked very well, all my results were the same of the staff. even valgrind didnt return any leak of memory to me. but when I use check50, I just can't pass on the last check.. it says that my code isnt free of memory errors, and the output is the next one: :( program is free of memory errors expected "MISSPELLED WOR...", not "### unhandled ..." I did and remade my code, over and over again, I saw lot of videos to try to find out what was my mistake.. and after seeing your video I thought my problem would be done, I did exactly what you did, and the error persists.. what do I do?... please, I don't like to see errors in my code :b obs: my code is almost the same of yours but the hash function, i used a simples one that calculates the index of the letter in the alphabet..
edit: I've copied your code word after word, and the error persists.. so.. I guess the problem isn't in my code, but in the check50's compiler. one observation, I've done a change on N. N as const unsigned int was not even compiling in check50, so I browsed a solution and I used #define N (value), and it compiles in check50. I dont know if there are new features or changes since the course content has been made, so here I am reporting this.
i don`t know what the actual hell is going on with my code but my hastable magically becomes NULL inside the check function, if i print its contents right before the return in load function it`s all in there but then if i print it in the 1st line of the check function it`s null!!! OBS: only when using the small dictionary
so apparently that had nothing to do with the problem, and the problem was at my unload function, and for god knows reason it wouldn`t print anything on the 1st so because of that i thought the problem was at the check function, i hate C
Your videos are great, you explain it really well and I think it a great resource to check my work. Just asking will you be making videos for the new content on the cs50 course like the new content for week 8, 9 and 10?
Thanks for the clear explanations. Just would like to know in the bool check(const char *word), where are the codes that check apostrophes & sub-strings ?
I think a word with apostrophe would give a different hash function than that same word without. Hence, you won't find that word in the table where it's meant to be.
For the has function- I don't understand how we could have ended up with a sum greater than N? How is that possible if we had already defined N as big as the word's ASCII value can get?
if you have a really long word, the sum of the ascii values will of couse be greater than the amount of buckets. For instance, if you only had 3 buckets, and your word was "cat", you would have already exceeded N which is 3.
Really good. But check50/valgrind found an error not pointed for It in your video: we do not close file at end of load(). The file is closed when some is wrong, but not in a successfull loading.
As a rule of thumb, you have to close the file whenever you open it. I included that part later in the video, since valgrind reported some memory errors.
I don't know what to do! I've finished this pset on my own two days ago, i'm sure 110% that my code is working (i've compared it in all the possible ways with the solutions of the staff) but as soon as i run the CS50 check in the terminal all allerts are red! I'm sure my code is fine. What can i do? at this point how can i contact cs50 in order to solve this technical problem? i don't want to submit it becuase, with this technical error (which is not mine) I could compromise my total score in the course so far.
No.. Since we are hashing it the way we like.. We are not hashing our table in the alphabetical order. Think of it like this that... The HASH TABLE's buckets are numbered as 0,1,2,3,4,.......,3299, ....., N And now the words are hashed in a particular array position based on the hashing index obtained. So, anybody coming to search for the word will hash it and go to that position may it be be bat, tab, abt
To add to what Rishi has mentioned above. If two words hash into the same location, that's actually not a problem, since we resolve it by chaining. In fact, assume that we just had one bucket and all words hashed into that location, there is technically nothing wrong with it, it's just that it won't be very efficient, it will just be one long linked list, but it will still work because we know how and where to find the word :)
for (int i = 0; i < N; i++) { while (table[i] != NULL) { node *tmp = table[i]->next; //from lecture free(table[i]); table[i] = tmp; } } you can use this to unload memory too, it was given in the lecture
thank you for the video it was a tremendous help. i found that everything i was doing was ten extra steps. And i tried to malloc more than i should have in an attempt to understand it. my question is this. In line 72 you malloc'd new_node, but i dont see a point where you free() it. as the checker said you didnt leak memory, is it then not the case that you have to free() everything you malloc?
wait. let me know if im wrong. you do free the new_node, but as you iterate through the dictionary, new_node is setting aside different addresses of space for the incoming words and then passing them to table[index]. so when you free the hash table you also free any memory new_node malloc'd.
thank you so much for this video! And a few questions here: Is it essential to set new_node->next to NULL？And why don't we need to free the node pointers(as it also uses malloc function)? Thanks again!
1. No, I believe the new_node->next = NULL is not really needed since it's defaulted to NULL. Just copied from walkthrough which is why it looks like the way it is. 2. We indeed do free the node pointers in the unload function. Basically, pointers are memory addresses, and you allocate certain objects or data in the memory using malloc. Malloc gives you that memory address of where the objects are located. To free the objects, you would need to call free(pointer), where you need to pass in the pointer or the memory address to be freed. In this case, we already know where exactly our memory addresses are since we store them in our table array data structure. So we loop over them and free each of the objects in memory in the unload function. Hopefully that makes sense.
@@algorithmsillustrator3313 I wasn't putting newnode->next = NULL and was getting an error in Valgrind but in the unload function...saying that my cursor variable was uninitialized. After some troubleshooting I realized that I hadn't set newnode->next to anything and voila it removed the issue.
The string is a char array by definition. Whenever we are reading words, we have to store it somewhere so we store it in a buffer or a temporary array.
Maybe your hashing algorithm or some part of your code doesn't work hard to say. Can you try asking in cs50 discord for help? Soemone might have faced similar issues.
@@algorithmsillustrator3313 why does the code not work when you declare the new_node outside the fscanf while loop but it works when you declare it inside the loop?
hi i cant understand something like node *new_node = ............. how did we define it i mean when we says a name we says string name = ............ but here you said FILE * file = ............ and after that you said node * new_node =.............. i think you understand what i'm saying can you explain that to me and thanks !
You can have any hash function you want. You can make it as simple or complex as you want. I have a simple but inefficient hashing algorithm in this case.
Why do you set that "N" value?As I understood the problem it is only necessary to set that value at 26, the number of letters of the alphabet, and still works but it takes longer to execute. Why is this happening? PD: Thanks for the video, it helps me understand a lot.
N is basically the number of buckets you want to allocate. It depends on your hash function. If you set your buckets to 26 for instnace, then you are going to have a lot of collisions since there is only 26 buckets, and will have to chain everything to together in case of collisions, which results in longer execution time. Say your hash function was taking first lowercase letter, in that case, if I gave you all words starting with the letter 'a', then it would chain eveyrthing together and it would be one lengthly linked list, which would lead to bad performance. However, if you allocate more buckets and your hash function distributes words evenly, then you have fewer collisions, and you don't have to spend a lot of time searching for the word in the bucket (since there are very few collisions). Regarding your first question, it was a rough upperbound, my hash function was summing ascii values. So the max value this can take on is the maximum size of a word (45 letters * highest ascii value which is lowercase z in this case). those will be my total number of buckets I allocate. I could have probably reduced my buckets but it was a rough estimate. The key is to also not make too many buckets like 100,000 because then you run out of memory and your data is really sparse , so lots of memory is wasted. Hopefully that makes sense!
can i ask ... do you actually learn all the technical coding stuff before hand? or you just pick up from the walkthrough.... u speak like it is super easy... what's the secret?
No secret. I actually have a comp sci degree from a university and I have been coding for about 6 years now. I like explaining concepts and helping others understand :)
![[2023] CS50 - (Week 5) Speller Solution | Walkthrough & Guide for Beginners | By Anvea](http://i.ytimg.com/vi/wHUpt71YGeY/mqdefault.jpg)
DISCLAIMER: The following videos are for educational purposes only. Cheating or any other activities are highly discouraged!! Using another person's code breaks the academic honesty guidelines. This solution is for those who have finished the problem sets and want to watch for educational purposes, learning experience, and exploring alternate ways to approach problem and is NOT meant for those actively doing the problem sets or to those who copy-paste the code. I have also emailed the staff in regards to academic honesty, so please be careful. Besides, if you copy you rob yourself of a valuable opportunity to learn and discover new things for yourselves. :) At any point if you are stuck please reach out to Discord or Facebook groups, there are literally 1000s of people there (no joke!!) who can help and guide you finish your solution!! Good luck!
Hey just a small question
at 4:17 why did u put "r' " and how did it work
@@rishikesshbalaji3765 It stands for read mode. The apostrophe is a typo
This helped me fix all the problems I was having. Thank You so much please continue to make more like these!!!
Glad it helped!
Extremely well put out and very well explained! Thank you so much! This really helped me out a lot. The way you explain concepts and their implementation is the best I've ever seen. Can't thank you enough. Keep up the good work and good luck for whatever it is you pursue! Cheers!
No problem! Good luck!
Thank you so much for this. My code was nearly identical to yours aside from the hash function, but I kept getting a leak error from not closes the file. So simple! I was also having an issue with my hash function, and I had a feeling it had to do with the string case because of the output I was getting. I didn't even consider something as simple as using tolower(). But you're right, they gave away so much on this problem set, but a part of me is glad they did. It took me a bit to start this problem set because I was intimidated by it, but with the walkthrough and the shorts (and your video), I feel like I have a pretty good grasp of this stuff now. Thanks again!
Glad it helped! Good luck!!
I just want to say that I'm here a year later having the same leak from not closing the file and I just saw this comment and I just can't express how thankful I'm right now.
thank you so much I hope you have a wonderful lifetime .
Your tutorial is very helpful! I like the way you teach.
It is very clear and smooth. It is greatly appreciated.
glad it helped!
very nice.
It was very challenge for me to doing this pset.
your video helped me a lot
trying to learn how to code it not easy task, but you did a nice job teaching it
thanks
Sure no problem. Good luck!
Do we need the if part of the if/else statement for the code at 12:25?
Can't we just replace this code:
if (table[index] == NULL)
{
table[index] = new_node;
}
else
{
new_node->next = table[index];
table[index] = new_node;
}
With the code below and achieve the same result?
new_node->next = table[index];
table[index] = new_node;
We need to check if table[index] has an existing node or not. The latter part basically takes care of an occupied slot.
Really great step by step run through of the problem.
Thanks
12:27 It's not clear to me why we go
n->next = table[index];
table[index]-= n;
instead of
n->next = table[index+1];
table[index]->next = n;
or even just
n->next = table[index+1];
table[index]= n;
It would seem to me that we want our new node to point to the next index, not the current one.
So if the hash gives me value 1, I want the NEXT value in the chain to be 2.
So first I connect my new_node to the next link in the chain, then I connect the previous link t new_node, at the correct index.
Maybe I'm missing something thanks for any help!
Hey sorry, I don't remember since I made these videos a while back, please post in discord for help. If I were to remmeber, I would say index is always 0 indexed , so you would place it there and then incremenet / decrement it. index + 1 would offset it by 1 and there could be some potential "holes" or gaps in the data structure. So you fill the current spot and move on.
Thank you so much for this video, you really helped me a lot
How do you fit more than two elements into a bucket, with those lines?
else{
new_node -> next = table[index]
}
implies that if the location is full, then it point to that location. Does that not mean that the second location will be replaced, if the second location is already full? I feel like the check needs to iterate over until it finds a null, rather than simply assuming the next location is already free?
thanks for helping us to gain a deeper understanding
Glad it was helpful!
i know that if we said int something so it should be like that
>>>>>>int x = 5;
so why we said
>>>>> int index = hach(word);
and when should i use these way
Whenever the function returns int, you can do int index = my_function(word)
when i run this in terminal
./speller texts/lalaland.txt
in the end terminal says:
Could not unload dictionaries/large.
please help
check return values for your functions
At the row 76 of the load function, why is it that "new_node -> next = table[index]", but not "new_node = table[index]"?
Cause the new_node's next field points to the next node of the linked list.
If you do new_node = table[index], you are basically making new_node's word field and next field = NULL or something else whichever might be present there..Hence, by doing that we are losing the new_word's next and word field.
I am getting the error in check function --->"error: use of undeclared identifier 'cursor'" ..what to do ??
check that you defined cursor (i guess watch it again)
also I'm twelve what am I doing here
Thank you Legendary Lightning for helping out. Also are you a cousin of Flash because you possess Legendary Lightning :)
8:24 how can you " hash(word) " before declare the hash function ?
Because the function prototypes or signatures are already declared in dictionary.h
hey man, I need help :/
I'm stuck at this exercise.. I've done this exercise by myself, without browsing for videos.. and it worked very well, all my results were the same of the staff. even valgrind didnt return any leak of memory to me. but when I use check50, I just can't pass on the last check.. it says that my code isnt free of memory errors, and the output is the next one:
:( program is free of memory errors
expected "MISSPELLED WOR...", not "### unhandled ..."
I did and remade my code, over and over again, I saw lot of videos to try to find out what was my mistake.. and after seeing your video I thought my problem would be done, I did exactly what you did, and the error persists.. what do I do?... please, I don't like to see errors in my code :b
obs: my code is almost the same of yours but the hash function, i used a simples one that calculates the index of the letter in the alphabet..
edit: I've copied your code word after word, and the error persists.. so.. I guess the problem isn't in my code, but in the check50's compiler.
one observation, I've done a change on N. N as const unsigned int was not even compiling in check50, so I browsed a solution and I used #define N (value), and it compiles in check50.
I dont know if there are new features or changes since the course content has been made, so here I am reporting this.
i don`t know what the actual hell is going on with my code but my hastable magically becomes NULL inside the check function, if i print its contents right before the return in load function it`s all in there but then if i print it in the 1st line of the check function it`s null!!!
OBS: only when using the small dictionary
so apparently that had nothing to do with the problem, and the problem was at my unload function, and for god knows reason it wouldn`t print anything on the 1st so because of that i thought the problem was at the check function, i hate C
Your videos are great, you explain it really well and I think it a great resource to check my work. Just asking will you be making videos for the new content on the cs50 course like the new content for week 8, 9 and 10?
Not enough time unfortunately sorry!
Thanks for the clear explanations. Just would like to know in the bool check(const char *word), where are the codes that check apostrophes & sub-strings ?
I don't think we need to worry about that or atleast if we need to do is taken care by the files provided by the staff
I think a word with apostrophe would give a different hash function than that same word without. Hence, you won't find that word in the table where it's meant to be.
@@codedprofessor Yup that's correct
For the has function- I don't understand how we could have ended up with a sum greater than N? How is that possible if we had already defined N as big as the word's ASCII value can get?
if you have a really long word, the sum of the ascii values will of couse be greater than the amount of buckets. For instance, if you only had 3 buckets, and your word was "cat", you would have already exceeded N which is 3.
I know inefficient. But could sb. tell me why my code is not working. ```
bool check(const char *word)
{
int hashvalue = hash(word);
node *cursor = table[hashvalue];
if(strcasecmp(cursor->word, word) == 0)
{
return true;
}
while(strcasecmp(cursor->word, word) != 0)
{
cursor = cursor->next;
if (strcasecmp(cursor->word, word) == 0)
{
return true;
}
else if(cursor->next == NULL)
{
break;
}
}
return false;
}
Really good. But check50/valgrind found an error not pointed for It in your video: we do not close file at end of load(). The file is closed when some is wrong, but not in a successfull loading.
As a rule of thumb, you have to close the file whenever you open it. I included that part later in the video, since valgrind reported some memory errors.
I don't know what to do!
I've finished this pset on my own two days ago, i'm sure 110% that my code is working (i've compared it in all the possible ways with the solutions of the staff) but as soon as i run the CS50 check in the terminal all allerts are red!
I'm sure my code is fine. What can i do? at this point how can i contact cs50 in order to solve this technical problem? i don't want to submit it becuase, with this technical error (which is not mine) I could compromise my total score in the course so far.
please get help in the cs50 discord channel (link in descirption). there you can find some helpful hints.
it give's me this error (linker command failed with exit code 1 (use -v to see invocation)). pls help
Question about the hash function: If you have two words that contain the same letters but in different orders won't it be a problem? e.g. bat and tab
No.. Since we are hashing it the way we like.. We are not hashing our table in the alphabetical order.
Think of it like this that...
The HASH TABLE's buckets are numbered as 0,1,2,3,4,.......,3299, ....., N
And now the words are hashed in a particular array position based on the hashing index obtained.
So, anybody coming to search for the word will hash it and go to that position may it be be bat, tab, abt
To add to what Rishi has mentioned above. If two words hash into the same location, that's actually not a problem, since we resolve it by chaining. In fact, assume that we just had one bucket and all words hashed into that location, there is technically nothing wrong with it, it's just that it won't be very efficient, it will just be one long linked list, but it will still work because we know how and where to find the word :)
for (int i = 0; i < N; i++)
{
while (table[i] != NULL)
{
node *tmp = table[i]->next; //from lecture
free(table[i]);
table[i] = tmp;
}
}
you can use this to unload memory too, it was given in the lecture
I guess? Try it out and see if it works
@@algorithmsillustrator3313 it does :D
awesome!!
you are awesome now i understood what should i do thanks 🙏
No problem. Thanks
thank you for the video it was a tremendous help. i found that everything i was doing was ten extra steps. And i tried to malloc more than i should have in an attempt to understand it. my question is this.
In line 72 you malloc'd new_node, but i dont see a point where you free() it. as the checker said you didnt leak memory, is it then not the case that you have to free() everything you malloc?
wait. let me know if im wrong.
you do free the new_node, but as you iterate through the dictionary, new_node is setting aside different addresses of space for the incoming words and then passing them to table[index]. so when you free the hash table you also free any memory new_node malloc'd.
I free all the nodes in unload function. You do this by iterating through all buckets, all nodes and free each one of then.
thank you so much for this video! And a few questions here: Is it essential to set new_node->next to NULL？And why don't we need to free the node pointers(as it also uses malloc function)? Thanks again!
1. No, I believe the new_node->next = NULL is not really needed since it's defaulted to NULL. Just copied from walkthrough which is why it looks like the way it is.
2. We indeed do free the node pointers in the unload function. Basically, pointers are memory addresses, and you allocate certain objects or data in the memory using malloc. Malloc gives you that memory address of where the objects are located. To free the objects, you would need to call free(pointer), where you need to pass in the pointer or the memory address to be freed. In this case, we already know where exactly our memory addresses are since we store them in our table array data structure. So we loop over them and free each of the objects in memory in the unload function. Hopefully that makes sense.
@@algorithmsillustrator3313 I wasn't putting newnode->next = NULL and was getting an error in Valgrind but in the unload function...saying that my cursor variable was uninitialized. After some troubleshooting I realized that I hadn't set newnode->next to anything and voila it removed the issue.
2:50 what does this command mean (ls -l)
when unsure, look at the man page man7.org/linux/man-pages/man1/ls.1.html you can see the '-l' means list the author and other information
how can we put a string in a char array? i didn't understand it in load function we put a string in a char array (word[]) . can u explain it please
The string is a char array by definition. Whenever we are reading words, we have to store it somewhere so we store it in a buffer or a temporary array.
why we created buffer? what is the use of it?
Which buffer? Are you referring to the word buffer? We need it to store words.
@@algorithmsillustrator3313 thx
@25:46 no need to tell the filename ? just make is enough since it's the only c file ?
Yea probably I think so?
Thank you sooo much you really help me
No problem!
i tried to follow you but when i execute the program it only displays "misspelled words" and nothing else until i terminate it.
Maybe your hashing algorithm or some part of your code doesn't work hard to say. Can you try asking in cs50 discord for help? Soemone might have faced similar issues.
@@algorithmsillustrator3313 why does the code not work when you declare the new_node outside the fscanf while loop but it works when you declare it inside the loop?
Because the inner loop is where all the words are constructed and the words from the file is read only inside the loop
is it normal for valgrind to show that I have 160 000 + bytes still reachable?
not sure but probabbly not I guess. Sorry, please reach out to discord group for help
what is int index = hash(word) on line 62?
and also return (sum % n)
1. Gets integer value returned from hashing function
2. To make sure you hash into a valid bucket i use modulus operator
hi i cant understand
something like
node *new_node = .............
how did we define it
i mean when we says
a name
we says string name = ............
but here you said FILE * file = ............
and after that you said node * new_node =..............
i think you understand what i'm saying
can you explain that to me
and thanks !
If I got you right, you should look for structs in C. It will help you to understand.
Please watch the lecture. Mr.Malan has done an excellent job covering it
Is that all the hash function needs?
You can have any hash function you want. You can make it as simple or complex as you want. I have a simple but inefficient hashing algorithm in this case.
Thanks man❤❤
Why do you set that "N" value?As I understood the problem it is only necessary to set that value at 26, the number of letters of the alphabet, and still works but it takes longer to execute. Why is this happening?
PD: Thanks for the video, it helps me understand a lot.
N is basically the number of buckets you want to allocate. It depends on your hash function. If you set your buckets to 26 for instnace, then you are going to have a lot of collisions since there is only 26 buckets, and will have to chain everything to together in case of collisions, which results in longer execution time. Say your hash function was taking first lowercase letter, in that case, if I gave you all words starting with the letter 'a', then it would chain eveyrthing together and it would be one lengthly linked list, which would lead to bad performance. However, if you allocate more buckets and your hash function distributes words evenly, then you have fewer collisions, and you don't have to spend a lot of time searching for the word in the bucket (since there are very few collisions).
Regarding your first question, it was a rough upperbound, my hash function was summing ascii values. So the max value this can take on is the maximum size of a word (45 letters * highest ascii value which is lowercase z in this case). those will be my total number of buckets I allocate. I could have probably reduced my buckets but it was a rough estimate. The key is to also not make too many buckets like 100,000 because then you run out of memory and your data is really sparse , so lots of memory is wasted. Hopefully that makes sense!
Couldn't find any cs50 discords:(
Please see the description of the video
I am getting could not load dictionary/large error
Check the boolean values / return types of the functions and make sure you load returns true upon successful load.
Thanks sir it worked
i dont understand whats "r'" in fopen?
it means read
Yeah I had a typo in the quotes please ignore. I meant to type r which means read
when does we use this method something[something]
like
>>> table[index]
it's basically just creating an array variable. "table" is the variable name and "[index]" is the size of the array.
It says "could not load dictionaries/large"
The file clearly downloaded but it just doesnt seem to work. Would highly appreciate any help
Check the boolean values / return types of the functions and make sure you load returns true upon successful load.
So many errors are coming. They are saying total words is not defined
Make sure you define your variables. If you're stuck ask in cs50 discord, you will almost immediately get help
what is the meaning of "->" and when can i use it
Please watch the lecture for this. It's basically a shorthand way to get access to struct's fields
can i ask ... do you actually learn all the technical coding stuff before hand? or you just pick up from the walkthrough.... u speak like it is super easy... what's the secret?
No secret. I actually have a comp sci degree from a university and I have been coding for about 6 years now. I like explaining concepts and helping others understand :)
Doesn't work
you forgot to close the file
I just noticed you closed it.
Thank you Gustavo. Yes initially I had forgotten to close it but I did it towards the end of the video.
Hi
hello world
geat