- Видео 11
- Просмотров 1 179 813
John Bowers
Добавлен 3 дек 2011
Why Mathematical Induction Works
This video will not teach you how to prove by induction. The purpose of this video is to lead you to the insight for why induction works and hopefully demystify the inductive step a little bit.
Просмотров: 1 697
Видео
Implementing inheritance with v-tables
Просмотров 4544 года назад
Lecture for my CS430 Programming Languages class. How to implement basic inheritance with v-tables.
CS 430 Parameter Passing Lab Solutions
Просмотров 5494 года назад
Solutions to the parameter passing lab.
Subprogram Design Issues (CS 430)
Просмотров 5834 года назад
A quick overview of some of the design issues for subprogram parameters. Examples are in Python because it implements the ones I wanted to talk about. This is material for CS 430 Programming Languages at James Madison University and is supplemental to "Concepts of Programming Languages" by Robert Sebesta. No idea why RUclips made the video quality so low, but we'll have to figure it out later.
Subprogram and Parameter Passing Intro
Просмотров 1,3 тыс.4 года назад
Introduction to the Subprogram and Parameter Passing module of CS 430 at JMU.
CS 430 Parameter Passing Modes
Просмотров 2,8 тыс.4 года назад
Overview of parameter passing modes in, out, and inout, and their implementations pass-by-value, pass-by-result, pass-by-copy, pass-by-reference, and pass-by-name.
Extended Euclidean Algorithm Example
Просмотров 324 тыс.7 лет назад
In this video I show how to run the extended Euclidean algorithm to calculate a GCD and also find the integer values guaranteed to exist by Bezout's theorem.
Subprogram Implementation Basics
Просмотров 18 тыс.7 лет назад
This video introduces subprogram implementation basics for simple subprograms and subprograms with stack-dynamic variables.
Solved Recurrence Tree Method
Просмотров 478 тыс.8 лет назад
An example of solving this recurrence using the substitution or "plug-and-chug" method can be found here: ruclips.net/video/Ob8SM0fz6p0/видео.html
Solved Recurrence - Iterative Substitution (Plug-and-chug) Method
Просмотров 314 тыс.8 лет назад
This is an example of the Iterative Substitution Method for solving recurrences. Also known sometimes as backward substitution method or the iterative method. An example of solving the same recurrence using the Tree method can be found here: ruclips.net/video/sLNPd_nPGIc/видео.html Note that there is another method of solving recurrences that is unfortunately called the substitution method by t...
thank you for making videos about back substitution and the tree method, I was so confused during my lecture
still helping in 2025
what a legend, this thaught me better than my prof at uni in discrete math lecture
freaking genius love you sensei
You saved me
perfect!
awesome explanation. however at 11:49 you flip the 4 and 2 and make it positive. why? That stopped me for a couple minutes.
Amazing
bless u
great job, i hope you are a millionaire
Super helpful! Thanks
My final is tomorrow, I learned this like a month back but i gotta jog my memory thanks
maaaaaaaan thank you so much I couldnt find it anywhere and my exams are in two days. God bless you!
I wish I had seen this video before doing my homework. it would save me a ton of time. English isn't even my native language, but it was so easy to understand.
after struggling for almost a day, finally i understood by watching your video. Thank you so much
Brain totally falls apart once substitutions start. Every kid considering compsci needs to see equations like this first. Being a literal thinker its hard to keep track of the logic and one offs maintaining variables etc. remembering all these steps past 1 hour is impossible for average person even though what happened is understood
Thanks
THANK YOU
Explained really well
ur the goat
Jesse we need to learn Algorithm Design Analysist
thank you
Man fuck this, I give up
OMG, interesting process
Hello nice and thankyou but kindly explain the last part ehere you got 0(nlogn)
Thank you so much!
Thanks Man! This was really nice explanation
4 hours before the mid term and I finally understand how dynamic scoping works. Still helpful 7 years later
Yup, I'm cooked. Seriously why can I not understand this, when it seems relatively straight forward? Ugh...
you are a life saver!
you saved me!!!! Everybody else have sucked. None has told me to treat the underlined numbers as variables. Understood it at once when u said that :D
You saved my CGPA, John. Thanks a bunch!
amazing explanation. this helped me for my discrete math course! God bless!
That was amazing...
You should be the author of textbook
im going to smooch u on da mouf
6 years later and you just helped me understand the extended part of euclidean algorithm after watching probably close to 20 other videos. Thank you!
very helpful, thank you sir
thanks mate for this video.
Wow, so freaking easy. Thanks man.
wow I hate math
You're awesome!
YOU are THE G.O.A.T
Could smell the pen ink
In case you were wondering, this is still super helpful to people (at least, me!) 7 years later. Thanks.
very very good explained , thanks Batman
One of the best videos related to the topic, thank you sir.
THANKS
Just brilliant, the variables was a game changer!
The absolute bestest explanation I could find for this, THANK YOU!!