Theres a lot of "A-HA" moments for me this week, it is incredibly motivational for me to keep on learning CS. Thank you Professor Malan and the CS50 team!
for those scratching your head at 49:20, perhaps this will help. what is the relationship between arrays and pointers/addresses? --- In C, arrays and pointers are closely related. Here's a breakdown of their relationship: 1. Array Name as a Pointer: When you define an array in C, the array name acts as a pointer to the first element of the array. For instance, if you have int arr[10];, arr can be thought of as a pointer to arr[0]. 2. Pointer Arithmetic: You can perform arithmetic on pointers just as you can with arrays. When you increment a pointer that points to an array, it points to the next element of the array. This is because the size of the type the pointer points to is considered in the arithmetic. 3. Indexing: You can access elements of an array using the subscript notation []. Under the hood, this is converted to pointer arithmetic. The expression arr[i] is equivalent to *(arr + i). This means "get the value at the address arr plus i times the size of the array's element type". --- Thanks chatgpt
21:15 Pointers 24:40 43:38 & is the address of a variable. 45:19 typedef 1:15:55 NULL means "address zero", "error". 1:21:28 writing means "changing information", like setting a value or assigning it a value. 1:22:30 memory leak 1:30:30 at first "pointer", then "pointee", and then "dereferencing". 1:36:00 passing by value == passing by copy 1:40:55 passing by reference == passing by pointer overflow 1:46:27 stack overflow, heap overflow overflow 1:48:08 buffer overflow overflow 1:48:49 buffer overflow 1:54:55 clang 1:55:40 segmentation fault (core dumped) 1:59:10 segmentation fault (core dumped) 2:02:32 some common functions for file i/o 2:09:35 uint8_t 2:10:50 binary mode
2:12:20 copy files fread(address of where to load, how big is the byte, how many bytes do I wanna copy at a time, where do I read those bytes from aka source) fwrite(address of where to write, how big is the byte, how many bytes do I wanna copy at a time, where do I write those bytes to aka destination)
Thank you, David, for your amazing teaching skills! I can't believe I'm being able to understand aaaaall this information having started learning computer science this year
I am here after trying to understand lecture 5. Probably is good idea to refresh these lecture's concepts. Keep learning folks, one day at time, step by step
I was just watching the lecture 4 of CS50-2023x and during the break, I have stumbled onto this video. Not sure now if I should continue watching that one or start from here again.
I started CS50 since 2021 but did not make it to the endpoint. Now I have decided to resume it while serving at the military. I really love watching Professor Malan's lectures:)
there is something guys about changing the string s to char *s, if you do this without the cs50.h you can't change the value of a char in a string, i was going back and forth with chatgpt until i tested it myself, even if professor david changed string s to char *s the actual string which is "Hi!" cannot be changed by trying to change char H like this : s[0] = 'h'; , you're probably asking yourself why and it's because the get_string function is returning an actual array that we store it's address in char *s and not the same thing when creating a string on the fly with the pointer, two different things, if you're creating a string on the fly without using [ ] to tell C it's an array you won't be able to change the characters in the string, I'm telling this to anyone got stuck with this asking himself this question, professor david probably didn't reveal this so things doesn't escalate quickly and I'm only 55min in so probably he's gonna reveal it later.
@@ethylmusic yeah, at the time it took me a while to get this while the compiler kept giving me errors then i found out it's read only and can't change it until i copy the string to an actual allocated memory and it seems that the get_string function actually does that.
Just want to add something on pointer arithmetic. If you had a pointer to an integer (which consists of 4 bytes) and allocate memory for two integers and for some reason, you want to put values in it using the dereference (*) symbol, you should not do the following: int *n = malloc(sizeof(int) * 2) *n = 1 *(n + 4) = 2 or *(n + sizeof(int)) = 2 Instead, you should do this: int *n = malloc(sizeof(int) * 2) *n = 1 *(n + 1) = 2 No need to type in the quantity of bytes for the specific data type (in this case, it's 4 since it's an integer). C already knows that.
Is this the same as an array of ints but just dynamically allocated? Does C know because of the type (int) that n points to or does it infer from the argument of malloc()?
I hate that I wasn't able to be there in person but thank you to those of you who were there and asked those great questions (some which were what I wanted to know about)!
Are you talking about calling malloc() in a loop that goes from 0 to strlen(s)? Firstly, that'll allocate 0 bytes, 1 byte, 2 bytes...strlen(n) bytes, which is not what you want. Secondly, there's no guarantee that those bytes will be contiguous, so doing: char *s = malloc(1); char *t = malloc(1); char *u = malloc(1); will not create a string that can be subscripted, as s, t, and u may not point to adjacent memory locations. What will work is: char *s = malloc(3); giving you 3 adjacent bytes in memory. Hope this helps!
In the file I/O section at the end, you're probably wondering, how did he call fwrite(...) in a loop, without it overwriting the first byte every time, shouldn't he have some sort of byte counter? I think they should consider mentioning this in cs50 2025 and onwards, essentially, the type "FILE* ", which is a file pointer, secretly holds a byte counter, so whenever you use fwrite, or fread, or similar, C will remember how many bytes you read or wrote, and it will keep track of it for you, just to clear up the confusion. TLDR: C keeps the number of bytes written/read to files for you, so you don't have to count, and that's why it works in loops, it automatically increments itself.
This is why fseek() exists. If you want to read from a file multiple times, you need to manually fseek to the start of the file, otherwise it'll just pick up where you left off (giving you nothing if you read the entire file the first time around).
21:15 Pointers 24:40 43:38 & is the address of a variable. 45:19 typedef 1:15:55 NULL means "address zero", "error". 1:21:28 Writing means "changing information", like setting a value or assigning it a value.
Gotta be honest, using the CS50 library is more than "training wheels", it hinders anyone not actually in CS50. Learning about char *s was fantastic but then immediately get_int screws the whole thing up again. Scanf kind of works but doesn't allow for different integers. Fantastic course, so happy it exists, but this was the first project in 4 lessons I've been able to ACTUALLY do. Kind of.
2:00:00 can also limit the scanf input, but means you have to statically declare the char array first, which may be limiting/wasteful of memory i.e. *_char c[100];_* then *_scanf("%99s", s);_*
1:00:00 my pc uses the same address for both! apparently the compiler knows the strings are the same and uses an optimisation technique known as 'string interning'!
In the Tideman Algorithm swapping is by reference instead of value. When you’re working array indices, you’re essentially working with the actual memory locations - the entire structure no need for pointers; not basic variables `int`… The array elements hold the data. Know the difference between [Passing by Value] and [Passing by Reference].
56:12, I have a question about comparison. While we comparing two string, we compare its first char's addresses. Also, while we comparing two integer, why didn't we compare its addresses? I thought, while comparing two equal integer, their addresses will be different. For example, int n = 5; int x=5; . There will be two different addresses for n and x, and if we compare addresses they must be different
because in int we compare their values not their address, because in string your variable contain a address of the first char and in int your variable contain a integer not their address.
21:17 so a pointer is simpy a varible which stores the memeory address of some other variable inside the variable called pointer . So do pointer variables* also have their own address? and can the adrees of pointer variables can be stored in another pointer variable?
Yes. Examples: // x is a char char x; // y is a pointer to a char that stores the address of x char *y = &x // z is a pointer to a pointer to a char that stores the address of y. char **z = &y
@@ZerubbabelT. that's a great question! If we declare "char x" then x is of type "char" i.e. x can store a char. Now iff we declare "char *y" then y is of type "pointer to a char" i.e. y can store the address of a char. And finally, if we declare "char **z" then z is of type "pointer to a pointer to a char" i.e. z can store the address of something that stores the address of a char. Each star add a level of indirection.
I lost my streak of watching one lecture per day, but I convinced myself to resume watching from where I left off. Today, I finished watching lecture 4 and I am determined to complete CS50 by the first week of February. After that, I plan to solve the problem sets and then I am thinking of learning JavaScript next.
At 38:45, why put & before s[0] when it was not necessary in a line above and it still worked ? Also, printf format specified we're looking for an address with "%p".
Correct, Both are the same & points to the same address, the first one just points to the first address as a whole while the other points out to the address of the first char in that array. Hope it gives more clarity.
it's kinda sad that he didn't explain with the code how the CS50 get_string actually works. Unfortunately, for now this is the only training wheel I can't take off
im confused about the usage of star and ampersand. for example *s is a pointer pointing to the address in the memory . but &s pointing to the memory adress too? what is that ?
It stores and accesses the pointer in the same way it accesses any other variable, such as storing a char without bothering with any pointers. However, if the pointer was replaced with a simple char variable, the computer would only return that character and wouldn't know to look for the rest of the values in the string which is why the pointer is necessary.
@@proudathiest for local memories, it stores on the stack part of the memory. The CPU store the last adress of that stack. The compiler only needs to remember how much you push the stack memory. Imagine a shelf, you put one book, then another on top, and so on. And you write how many books you stacked. Well, if you want the first book(variable) you just have to go down for how many books you put on top of it. The compiler does that for you. Hope you got what im saying
27:19 Professor Malan said the memory address 'p' is storing an integer. Are memory addresses signed? does the computer track negative spaces in memory?
Hello, I have a question. I want to know whether Zig language can be better than Rust or not, and why Rust has been getting so much hate for some time now, and what is your opinion about Zig or Rust or C for creating very bad malware?
char *s points at the first (0th) location of the string. Which means the string will be read from that location till the null (\0) to highlight the whole string. Meanwhile char s[] highlights the whole string (list of chars) right away. hope this helped
hey mah i spend like 16 hours on it and i gave up . i am not able to do the last 2 functions. i dont even have an idea on how to do it. You got any advise for me?
@@RameezRassel 16 hours is nothing, haha 😅 Here was my idea, that finally worked: To detect a cycle, look, if the loser of the pair you are trying to lock is a winner of an already locked pair. If so, is the winner of the pair you are trying to lock the loser in the locked pair? When this is the case, you've detected a very simple cycle. For example, when A is winner over B in the first locked pair and you try to lock in B over A. This is obvious and fairly simple. But if the winner of the pair you are trying to lock is not the loser, you have to check the next pair down the line. So in this case, look if the loser of the first locked pair is the winner of another locked pair. If so, does the loser of this pair equal the winner of the pair you are initially trying to lock in? If yes, a cycle is detected. If not, look for the next locked pair. Hint: a recursive function is very useful for this. I actually did a few exercises with recursion beforehand to really wrap my head around the concept. Good luck, you can do it!
@@100drips hey thanks a lot mahn. Really Appreciate it. I was doing my research and it turns out there is an algorithm for traversing throughout graphs. It's called DFS I tried learning it but couldn't wrap my head around it . I think I understand ur logic now I have to code it. We'll see
I also tried to copy (int) instead of string and I found that the original and the copy don't exist in the same location.Why is that? int s = get_int("s: "); int t = s; printf("%p ", &s); printf("%p ", &t);
you are not using pointers, everything is being determined statically at compiliation - those variables will be in the stack instead of at run time/dynamically in the heap
I am a litle bit confuse here. So we create an variable called pointers that contains an adress where a value of an other variable is stored ok? But the pointer has also an adress rigth? for me, all of this seems to lead to an infinite spiral of adresses. May someone help me
no, you are understanding it bad, the pointer only saves the memory direction but not the variable and it also has its own memory direction but it doesnt saves it in his own memory, it only stays there
@@ninjamar_while this is true for the “123” part, the 0x isn’t a part of the value and is just standard convention for indicating that the following number is hexadecimal
I love how David is really trying to hear people's questions, and he encourages them with cookies, or jokes.
Best educator imho
If you are reading this, I hope you finish cs50 and go on to do well in whatever endeavor you choose.
I will and i hope you will to, good luck!
Thank you so much. I gave up on CS50 for awhile due to other things but seeing this post, I feel I should get back on it. Thank you
Theres a lot of "A-HA" moments for me this week, it is incredibly motivational for me to keep on learning CS. Thank you Professor Malan and the CS50 team!
Feeling honored to experience buffer overflow during the overflow section.
Even if you have been writing programmes for 20 years, it is an excellent series that must be completed to the end. Thank you David and Harvard.
that little disappearing magic trick at 1:28:20 was subtle but nice
CS50 2024 lectures are really awesome!
for those scratching your head at 49:20, perhaps this will help.
what is the relationship between arrays and pointers/addresses?
---
In C, arrays and pointers are closely related. Here's a breakdown of their relationship:
1. Array Name as a Pointer: When you define an array in C, the array name acts as a pointer to the first element of the array. For instance, if you have int arr[10];, arr can be thought of as a pointer to arr[0].
2. Pointer Arithmetic: You can perform arithmetic on pointers just as you can with arrays. When you increment a pointer that points to an array, it points to the next element of the array. This is because the size of the type the pointer points to is considered in the arithmetic.
3. Indexing: You can access elements of an array using the subscript notation []. Under the hood, this is converted to pointer arithmetic. The expression arr[i] is equivalent to *(arr + i). This means "get the value at the address arr plus i times the size of the array's element type".
---
Thanks chatgpt
very helpful
finally got thru tideman after a week and a half of struggle and am so happy to be watching this finally 😭😭
lol me too, gl for this week's assignment
Lmao exactly same for me over here.
See you around folks!
@@emmanuelprudente6463 im on week 7 now, as long as u can push past week 5 it gets easier after it seems
I have cried as well. A lot. 😂 (And ddb helped a LOT)
Starting 2024x here as this is where I was in the 2023x series (and I could definitely benefit from rewatching this one)
same... :)
21:15 Pointers 24:40
43:38 & is the address of a variable.
45:19 typedef
1:15:55 NULL means "address zero", "error".
1:21:28 writing means "changing information", like setting a value or assigning it a value.
1:22:30 memory leak
1:30:30 at first "pointer", then "pointee", and then "dereferencing".
1:36:00 passing by value == passing by copy
1:40:55 passing by reference == passing by pointer
overflow 1:46:27 stack overflow, heap overflow
overflow 1:48:08 buffer overflow
overflow 1:48:49 buffer overflow
1:54:55 clang
1:55:40 segmentation fault (core dumped)
1:59:10 segmentation fault (core dumped)
2:02:32 some common functions for file i/o
2:09:35 uint8_t
2:10:50 binary mode
THANKS
2:12:20 copy files
fread(address of where to load, how big is the byte, how many bytes do I wanna copy at a time, where do I read those bytes from aka source)
fwrite(address of where to write, how big is the byte, how many bytes do I wanna copy at a time, where do I write those bytes to aka destination)
@@BestHomeOman most welcome
Thank you, David, for your amazing teaching skills! I can't believe I'm being able to understand aaaaall this information having started learning computer science this year
I am here after trying to understand lecture 5. Probably is good idea to refresh these lecture's concepts. Keep learning folks, one day at time, step by step
I was just watching the lecture 4 of CS50-2023x and during the break, I have stumbled onto this video. Not sure now if I should continue watching that one or start from here again.
Same thing with me. That’s exactly what I am thinking
u r just into lecture 4… of course continue with this
its same content only a news "version"
the 2024 versions are almost exactly the same and the course itself now asks you to do the 2024 version, and carries over progress from 2023
I am overwhelmed by the info introduced and very glad to know it and move with my C computing and programming. Thank you David
I started CS50 since 2021 but did not make it to the endpoint. Now I have decided to resume it while serving at the military. I really love watching Professor Malan's lectures:)
YES , keep it up champ🏆
thank you for your service !!!
Don't kill innocent people.
can't wait to solve the assignment with these new tools. thank you david and whole cs50 team
What about tideman
@@hawamigil4291 pls no
@@hawamigil4291 we dont talk about tideman
there is something guys about changing the string s to char *s, if you do this without the cs50.h you can't change the value of a char in a string, i was going back and forth with chatgpt until i tested it myself, even if professor david changed string s to char *s the actual string which is "Hi!" cannot be changed by trying to change char H like this : s[0] = 'h'; , you're probably asking yourself why and it's because the get_string function is returning an actual array that we store it's address in char *s and not the same thing when creating a string on the fly with the pointer, two different things, if you're creating a string on the fly without using [ ] to tell C it's an array you won't be able to change the characters in the string, I'm telling this to anyone got stuck with this asking himself this question, professor david probably didn't reveal this so things doesn't escalate quickly and I'm only 55min in so probably he's gonna reveal it later.
string literal vs string in array is the reason for this. the former is immutable
@@ethylmusic yeah, at the time it took me a while to get this while the compiler kept giving me errors then i found out it's read only and can't change it until i copy the string to an actual allocated memory and it seems that the get_string function actually does that.
Just want to add something on pointer arithmetic.
If you had a pointer to an integer (which consists of 4 bytes) and allocate memory for two integers and for some reason, you want to put values in it using the dereference (*) symbol, you should not do the following:
int *n = malloc(sizeof(int) * 2)
*n = 1
*(n + 4) = 2 or *(n + sizeof(int)) = 2
Instead, you should do this:
int *n = malloc(sizeof(int) * 2)
*n = 1
*(n + 1) = 2
No need to type in the quantity of bytes for the specific data type (in this case, it's 4 since it's an integer). C already knows that.
Is this the same as an array of ints but just dynamically allocated?
Does C know because of the type (int) that n points to or does it infer from the argument of malloc()?
I love you David. You are such a wonderful teacher.
22:58 pointers - getting the address(&n) of the integer stored in memory
24:11 pointers - getting the integer of that address
I hate that I wasn't able to be there in person but thank you to those of you who were there and asked those great questions (some which were what I wanted to know about)!
That was a PHENOMENAL lecture but brother did it escalate...
1:09:55 could also write 'for (int i = 0, n = strlen(s) + 1; i < n; i++)' as per for malloc
Are you talking about calling malloc() in a loop that goes from 0 to strlen(s)?
Firstly, that'll allocate 0 bytes, 1 byte, 2 bytes...strlen(n) bytes, which is not what you want.
Secondly, there's no guarantee that those bytes will be contiguous, so doing:
char *s = malloc(1);
char *t = malloc(1);
char *u = malloc(1);
will not create a string that can be subscripted, as s, t, and u may not point to adjacent memory locations. What will work is:
char *s = malloc(3);
giving you 3 adjacent bytes in memory.
Hope this helps!
In the file I/O section at the end, you're probably wondering, how did he call fwrite(...) in a loop, without it overwriting the first byte every time, shouldn't he have some sort of byte counter? I think they should consider mentioning this in cs50 2025 and onwards, essentially, the type "FILE* ", which is a file pointer, secretly holds a byte counter, so whenever you use fwrite, or fread, or similar, C will remember how many bytes you read or wrote, and it will keep track of it for you, just to clear up the confusion. TLDR: C keeps the number of bytes written/read to files for you, so you don't have to count, and that's why it works in loops, it automatically increments itself.
Thanks！You answer my question.
@@zeshenzheng np!
This is why fseek() exists. If you want to read from a file multiple times, you need to manually fseek to the start of the file, otherwise it'll just pick up where you left off (giving you nothing if you read the entire file the first time around).
Love it again ❤ Thank you, David! This lesson teaches me how we can efficiently open a file by using just its first address.
what an energetic teacher. Thanks David
Thank you so much Professor Malan.
Must finish before the end of summer…. Must finish before the end of summer….. keep going …
same bro we can do it!
how wonderful teaching skill
21:15 Pointers 24:40
43:38 & is the address of a variable.
45:19 typedef
1:15:55 NULL means "address zero", "error".
1:21:28 Writing means "changing information", like setting a value or assigning it a value.
Gotta be honest, using the CS50 library is more than "training wheels", it hinders anyone not actually in CS50. Learning about char *s was fantastic but then immediately get_int screws the whole thing up again. Scanf kind of works but doesn't allow for different integers. Fantastic course, so happy it exists, but this was the first project in 4 lessons I've been able to ACTUALLY do. Kind of.
Please tell me I'm not the only one whose brain collapsed...
you are not my brain also got fried
you not alone it diffucult for me too but don't give up !!
No, I had to distract myself with the Euro Cup for a bit before coming back to this week's PSET
Welcome to the gang
😂😂😂
Fantastic explanations!
2:00:00 can also limit the scanf input, but means you have to statically declare the char array first, which may be limiting/wasteful of memory i.e. *_char c[100];_* then *_scanf("%99s", s);_*
the toughest lecture and problems for me so far!
Love the lecures. Had to laugh at "mostly just an excuse to use the foam fingers."
The duck actually taught me a bit of this in the Substitution pset 😂
Just superb!
Memory in C, Always the fun part.. Fantastic job as always.
each video introduction: All right . This is CS50 LECTURE 3: ALGORITHMS
Brilliant teacher
Very useful lecture. Thanks a lot !!
1:00:00 my pc uses the same address for both! apparently the compiler knows the strings are the same and uses an optimisation technique known as 'string interning'!
I LOVE CS50
Thank you Sir, for amazing teaching😃 will be always thankful for giving us CS50
2:13:53 I even copied source code from cp.c and still have an error "segmentation fault (core dumped)". what`s wrong?
glad to see that the training wheel joke landed this year😂
I believe Mr. Malan deserves AC!
In the Tideman Algorithm swapping is by reference instead of value. When you’re working array indices, you’re essentially working with the actual memory locations - the entire structure no need for pointers; not basic variables `int`… The array elements hold the data. Know the difference between [Passing by Value] and [Passing by Reference].
the arrow would only point the other way before
56:12, I have a question about comparison. While we comparing two string, we compare its first char's addresses. Also, while we comparing two integer, why didn't we compare its addresses? I thought, while comparing two equal integer, their addresses will be different. For example, int n = 5; int x=5; . There will be two different addresses for n and x, and if we compare addresses they must be different
because in int we compare their values not their address, because in string your variable contain a address of the first char and in int your variable contain a integer not their address.
best week of C i bet
Pure gold. Thank you Cs50 team
21:17 so a pointer is simpy a varible which stores the memeory address of some other variable inside the variable called pointer . So do pointer variables* also have their own address? and can the adrees of pointer variables can be stored in another pointer variable?
Yes. Examples:
// x is a char
char x;
// y is a pointer to a char that stores the address of x
char *y = &x
// z is a pointer to a pointer to a char that stores the address of y.
char **z = &y
@@andrewpolakaus woh that's nice, thanks!
@@andrewpolakaus Why double astrex on z?
@@ZerubbabelT. that's a great question!
If we declare "char x" then x is of type "char" i.e. x can store a char.
Now iff we declare "char *y" then y is of type "pointer to a char" i.e. y can store the address of a char.
And finally, if we declare "char **z" then z is of type "pointer to a pointer to a char" i.e. z can store the address of something that stores the address of a char.
Each star add a level of indirection.
@@andrewpolakaus Got it. Thanks
29:42 opening the mailbox (pointer) and using * -- go to that location and show me what is there
24:25 awwwful syntax
1:34:17 Caleb missing the opportunity to down one of the glasses and demonstrate clearing the memory allocation
that would have not kept the original glasses swaped
Thanks ❤
mind blowing
Muito obrigado. / Merci beaucoup.
I listen to this to go to sleep.. This is where I go to when I drift away and start day dreaming 😆
this was the final boss level for me
2:06:36 line 12 - shouldn't we have deregerenced the name and number? Or does the fact that we used %s return the dereferenced pointer already?
if I may, char * array (or any array) is an exception to that rule, no need to de-reference
Understood++
I lost my streak of watching one lecture per day, but I convinced myself to resume watching from where I left off. Today, I finished watching lecture 4 and I am determined to complete CS50 by the first week of February. After that, I plan to solve the problem sets and then I am thinking of learning JavaScript next.
no one cares
@@urosuros2072 hahahaha don't be that harsh man lol
@@urosuros2072 did I ever mentioned your name and said that, if you don't like it just leave dude
That's also what I'm doing! I try hard not to fall asleep lol
Doing the problem sets right after the lectures would be a better idea because your brain is still fresh with knowledge from the lecture.
there is a hidden message on the raw file for the recover problem from the problem set :)
i suddenly feel like a real programmer now
36:18 oh 32 bit max out at 2 billion addreses. So that's why the FAT32 doesn't go very high in partition like exFAT. Makes sense.
At 38:45, why put & before s[0] when it was not necessary in a line above and it still worked ? Also, printf format specified we're looking for an address with "%p".
Correct, Both are the same & points to the same address, the first one just points to the first address as a whole while the other points out to the address of the first char in that array. Hope it gives more clarity.
Had the same question. why is & even needed if not in line 7 before the s needed
Very interesting
1:53:08 I started sweating when he said 'string input'.
can garbage values be used for randomness as long as the same number is not repeated in 1:26:35
no
14:19 Does that mean each pixel consume 8-bit or 1 byte of memory?
DONE
I miss the old intro 😢 but the course is amazing regardless
Is it convention or preference to say "oh" when encountering a zero?
it's kinda sad that he didn't explain with the code how the CS50 get_string actually works. Unfortunately, for now this is the only training wheel I can't take off
It's explained in previous lectures. If you check out their library you will see how get_string works
Did you mean playlist? When you say library or that's something different from that?@@clarerussell1
I second the previous comment. Just go to the library to see what get_string actually is
thx
21:02 Why am I not getting hexadecimal number?Instead its decimal number
im confused about the usage of star and ampersand. for example *s is a pointer pointing to the address in the memory . but &s pointing to the memory adress too? what is that ?
If the computer needs a pointer (s) to go to the address of the first char, how does it find s in memory to get to the char?
It stores and accesses the pointer in the same way it accesses any other variable, such as storing a char without bothering with any pointers. However, if the pointer was replaced with a simple char variable, the computer would only return that character and wouldn't know to look for the rest of the values in the string which is why the pointer is necessary.
@@mosstah But how does it access any variable? If I write int x = 10, and then use x later in the code, how does it find that x is 10?
@@proudathiest for local memories, it stores on the stack part of the memory. The CPU store the last adress of that stack. The compiler only needs to remember how much you push the stack memory. Imagine a shelf, you put one book, then another on top, and so on. And you write how many books you stacked. Well, if you want the first book(variable) you just have to go down for how many books you put on top of it. The compiler does that for you. Hope you got what im saying
@@gabrielangel1996 Thankyou! I've just spent an hour looking at stack pointers and it finally makes sense!
27:19 Professor Malan said the memory address 'p' is storing an integer. Are memory addresses signed? does the computer track negative spaces in memory?
addresses are unsigned integers
I love youuu
@42:32 David says that *s is the address, but isn`t it actually a pointer to the first character in the character array?
yes, &s is the address
Please what kind of VScode is David using, because my VScode terminal is not working?
Hello, I have a question. I want to know whether Zig language can be better than Rust or not, and why Rust has been getting so much hate for some time now, and what is your opinion about Zig or Rust or C for creating very bad malware?
hello I have a question 43:00 char *s and char s[] is the same ?
char *s points at the first (0th) location of the string. Which means the string will be read from that location till the null (\0) to highlight the whole string.
Meanwhile char s[] highlights the whole string (list of chars) right away.
hope this helped
Professor Malin is an actual robot
1:31:34: 'ye sharing, whatever' LOL
after 3 weeks of trying to solve tidemen, i can finally watch this lecture :D
hey mah i spend like 16 hours on it and i gave up . i am not able to do the last 2 functions. i dont even have an idea on how to do it. You got any advise for me?
@@RameezRassel 16 hours is nothing, haha 😅
Here was my idea, that finally worked:
To detect a cycle, look, if the loser of the pair you are trying to lock is a winner of an already locked pair. If so, is the winner of the pair you are trying to lock the loser in the locked pair? When this is the case, you've detected a very simple cycle. For example, when A is winner over B in the first locked pair and you try to lock in B over A. This is obvious and fairly simple.
But if the winner of the pair you are trying to lock is not the loser, you have to check the next pair down the line. So in this case, look if the loser of the first locked pair is the winner of another locked pair. If so, does the loser of this pair equal the winner of the pair you are initially trying to lock in? If yes, a cycle is detected. If not, look for the next locked pair. Hint: a recursive function is very useful for this.
I actually did a few exercises with recursion beforehand to really wrap my head around the concept.
Good luck, you can do it!
@@100drips hey thanks a lot mahn. Really Appreciate it. I was doing my research and it turns out there is an algorithm for traversing throughout graphs. It's called DFS I tried learning it but couldn't wrap my head around it . I think I understand ur logic now I have to code it. We'll see
@@RameezRassel Bro were you able to code it?
01:46:00
wanted to study at harvard; but failed; dont worry we have david
I also tried to copy (int) instead of string and I found that the original and the copy don't exist in the same location.Why is that?
int s = get_int("s: ");
int t = s;
printf("%p
", &s);
printf("%p
", &t);
you are not using pointers, everything is being determined statically at compiliation - those variables will be in the stack instead of at run time/dynamically in the heap
Must review notes. I barely understood the lecture
I am a litle bit confuse here. So we create an variable called pointers that contains an adress where a value of an other variable is stored ok? But the pointer has also an adress rigth? for me, all of this seems to lead to an infinite spiral of adresses. May someone help me
no, you are understanding it bad, the pointer only saves the memory direction but not the variable and it also has its own memory direction but it doesnt saves it in his own memory, it only stays there
"It turns out that understanding pointers is not as terrifying as in previous years.
i have a doubt . Why dont we use *s instead of s to print out the string
That was explained in the "Strings" chapter of the video
phase 1) pointers huh
phase 2) I feel dead inside
1:16:43
How is p an integer when it contains alphabetical values?
Like 0x123 has 'x' in it`s value?
0x123 is hexadecimal, which is a type of notation for numbers
@@ninjamar_while this is true for the “123” part, the 0x isn’t a part of the value and is just standard convention for indicating that the following number is hexadecimal
@@mosstah yeah, it helps distinguish between decimal