Data Structures - Computer Science Course for Beginners
video description
Date: 2022-03-14
Related videos
Comments and reviews: 10
David
I know that this video is old. I think when you are referring to 2d arrays you have things backward timestamp 34:37 the slide and how you describe it. You refer to the first number as the column and the second as a row. It should be row and then column [1][0] when trying to get adam. I'm only 35 mins in and am really enjoying the explanations. Just thought I'd point this out for people that may not know.
reply
I know that this video is old. I think when you are referring to 2d arrays you have things backward timestamp 34:37 the slide and how you describe it. You refer to the first number as the column and the second as a row. It should be row and then column [1][0] when trying to get adam. I'm only 35 mins in and am really enjoying the explanations. Just thought I'd point this out for people that may not know.
reply
Christian
Hey guys, I am starting my journey in Data Science und like to connect with other people. My plan is to make a certified Course in Data Science with exercises for the portfolio. Anyone here likes to join that journey to share experiences and discuss some interesting topics? I am really happy for every joining guy :)
reply
Hey guys, I am starting my journey in Data Science und like to connect with other people. My plan is to make a certified Course in Data Science with exercises for the portfolio. Anyone here likes to join that journey to share experiences and discuss some interesting topics? I am really happy for every joining guy :)
reply
laystevec
I love this video, but unfortunately the guy was was wrong at approximately 2:54:23 about all undirected graphs being cyclic. Trees should also be denoted as a kind of graph. Undirected trees are not Cyclical. I do love this video and I did hit the like button but the errors should definitely be updated or edited.
reply
I love this video, but unfortunately the guy was was wrong at approximately 2:54:23 about all undirected graphs being cyclic. Trees should also be denoted as a kind of graph. Undirected trees are not Cyclical. I do love this video and I did hit the like button but the errors should definitely be updated or edited.
reply
Finn
Reallly wonderful video, you have a wonderful presentation style. A quick question about the figure at 2:27:07 where you show a binary search tree. I don't understand why -1- does not appear as any of the leafs on this tree. Could you explain that to me?
reply
Reallly wonderful video, you have a wonderful presentation style. A quick question about the figure at 2:27:07 where you show a binary search tree. I don't understand why -1- does not appear as any of the leafs on this tree. Could you explain that to me?
reply
Lakshmi
I watched the -Introduction to programming- video in that you have mentioned that while referencing 2D arrays we have to take [ROW][COLUMN]. But now you are saying [COLUMN][ROW], why is this change in this video?
reply
I watched the -Introduction to programming- video in that you have mentioned that while referencing 2D arrays we have to take [ROW][COLUMN]. But now you are saying [COLUMN][ROW], why is this change in this video?
reply
7OWN
2:56:06 You contradict yourself there. An Undirected Graph can't be Acyclic. You say that a minute before.
This is really ranting with the highest standards. Amazing video! I learned so much. Thank you a lot!
reply
2:56:06 You contradict yourself there. An Undirected Graph can't be Acyclic. You say that a minute before.
This is really ranting with the highest standards. Amazing video! I learned so much. Thank you a lot!
reply
knowledge
Thanks for the super helpful video tutorial on the Data Structures Steven! 36:08 array contains a string within an integer array, is that intentional (threw me off a little bit at first, hence the question)
reply
Thanks for the super helpful video tutorial on the Data Structures Steven! 36:08 array contains a string within an integer array, is that intentional (threw me off a little bit at first, hence the question)
reply
Fl-vio
Linkedlists are pretty easy if you think of them as people linked together, normal linkedlists = each person using one arm , doubly linked lists = both arms
reply
Linkedlists are pretty easy if you think of them as people linked together, normal linkedlists = each person using one arm , doubly linked lists = both arms
reply
Alex
Listening as a refresher. It's been so long, I've forgotten half of the types and almost all the names. Which leads to reinventing the wheel unnecessarily
reply
Listening as a refresher. It's been so long, I've forgotten half of the types and almost all the names. Which leads to reinventing the wheel unnecessarily
reply
Shehryar
Isn't the time complexity for deletion in Stack is O(n). As we always talk of the worst case.What if the element we want to delete is at the bottom.?
reply
Isn't the time complexity for deletion in Stack is O(n). As we always talk of the worst case.What if the element we want to delete is at the bottom.?
reply
Add a review, comment
Other channel videos
14:29:42
