This channel is part of CSEdu4All, an educational initiative created by Profs. Anand Seetharam and Arti Ramesh from the State University of New York Binghamton. The goal of CSEdu4All is to make computer science education accessible to all!
We @CSEdu4All believe that CLIMATE CHANGE is real and all money earned through this channel is donated to the ArborDay Foundation (www.arborday.org), a non-profit organization that believes in creating positive change through trees.
Introduction to Algorithms Course: www.binghamton.edu/watson/continuing-education/data-science/intro-to-algorithms.html
Advanced Algorithms Course: www.binghamton.edu/watson/continuing-education/data-science/advanced-algorithms.html
Introduction to Computer Networks: www.binghamton.edu/watson/continuing-education/data-science/intro-to-computer-networks.html
Probability for Data Science: www.binghamton.edu/watson/continuing-education/data-science/probability-data-science.html
Пікірлер
i have a network test tomorrow and couldn't make heads or tails of the slides, it's almost 4 am and you saved me thanks for great explanation
Thank you so much for all your videos they helped me so much in this course!! Very very useful and they all make sense!!
why do you disapble the dis likes if you trust your teaching
Could we apply the Dijkstra algorithm in MANET or do we need to apply Dijkstra algorithm with another protocol such as AODV to enhance it?
Thank you!
you explain well thank u sir
Very good explanation.
my teacher is using same ppt as yours'
baek do nand
what level should i reach before i'm capable of writing out a credible and trustworthy research paper in computer science?
you are the best!!!
Great, thank you
Thanks, this was helpful. To summarize, Read the abstract. Read the introduction. Read the conclusion. Make notes of the same. Read the related work. Read beginning of each section and titles of sub-sections. Read the first line of each sub-sections. After finishing above 7 points you would have good idea on what the research paper is about. And then if you are still interested, then dive in the whole paper.
very useful
For those who dont want a 30 minute video on this topic, this is gold. Better than Gate Smashers / other DSA KZreadr's Crash Courses.
bro wtf this is literally the same slides UTS is using what am I paying for
gaia.cs.umass.edu/kurose_ross/online_lectures.htm
Why did u start from j=1? instead of 0th index or 1st index sir? Pls respond sir i got an exam now shortly
very irritating when you are doing that "khar khar" sound please drink some water
Or conjunction
Conjunction and
thank you anand I had an oral for the subjrect of sattelite and i was preparing i saw your video which was very hrelfull thanks a lot fir easy explanation
very very informative video
very very informative video
How this is true ? n + 5 = O(n^2) Since the left side is linear and the right side is quadratic, the statement is not true for all values of n
Great explanation. Saved me lots of time and stress. Much appreciated
Why the Ack of the seg 2 is 4 ansvthen 8 I cant get it please
I thought this video would be time waste . But this is actually helpful.
Ty
bro you the real G
my professor use the same slides but he didn't explain it very well
Very nice video. Thank you very much!
no clue wat blud waffled about but hope i pass my exam fr 🗣🔥
What all cases does the threshold(ssthresh) increase here?
Super clear,, thank you so much
ماذا عن الواجهات في جافا
Why is the DHCP request a broadcast? Can't a client figure out DHCP server's IP address from the DHCP offer's source address?
very good
Sir, it's a fantastic video u need to upload a thumbnail.
Thank you for this!
i just figured out my university's professor pdfs are originally yours, and you got shorter/better explanation hahah
These pdfs are actually Jim Kurose's. He's the author of the book Computer Networking- A top down approach. He also has a youtube channel where he explains all the topics in the book using these same slides which actually belong to him.
thank you alot, will definitely check him out@@ummeroomanwahab5393
Which college
Excellent explanation!
Please share the slides?
Thank you for this amazing tutorial
What are the pros/cons of QuickSort? Ditto for Merge sort? When is one better than the other?
thanks for explaining so well
thats good, i understand the substitution as exponential from the double recursive call in the function better thanks!
Can we add the related work in introduction itself? Please reply
Nice work
Thank you!!
shitiest explanantion ever