Still Thankful for this sir

you are great! recursion is not

very high

Nice explanation ❤

A great watch, very informative👍👍

9 years later but thanks dude this helped me so much

For the third question, wouldn't the simplified version of the expression just be A? This is how I solved it: ~(~(A(A + B)) + (B~A)) ~(~(A + AB) + (B~A)) ~(~(A) + (B~A)) ~(~A + (B~A)) ~(~A) A It looks like you first put parentheses is ~A. It also looks like you didn't delete a parenthesis after doing AA + AB.

Is there any way I can print this worksheet?

Absolutely amazing video. My teacher assigned this worksheet, and I was ready to give up completely. Keep up the amazing instruction!

Watching this for my college mid-term because im so behind

Thank you so much! This is very helpful!

nice

thanks :)

yes, it was for 9th graders.

for kids..

is this a high school midterm it seems too simple

Thank You for this tutorial, it was really helpful.

thank you so much

I think it might have to do with order of precedence, the ACSL Wiki states that OR is a higher precedence than AND. Other than that, I can't really see any problems with it.

Very good explanation. Thanks.

thannk you so much ive been trying different difficult methods on rounding numbers up and this is the best and easiest

helped so much preciate it

Thanks you!!!!!!

Hello, Can you please give me an example of how to make a picturebox bounce of a labe/picturebox?

where can i get more worksheet like this?

Send me the code please

17.0

Awesome video!

thanks

well explained thank you so much.

You’re the 🐐

Thanks for the video ...

minich.com/education/wyo/vb/programming_assignments/maze3.php

In fourth for loop I think the if statement will be executed when we reach 12 as it is divisible by 2 as well as 3

Thanks you. Sir🇮🇳

goodshit👌

Apple and Tesla making biiiiiig moves this week

Bal

Tumi

Pls can u help with the fifth ans

int numbers [] = {3, 10, 11, 2, 6, 9, 5}; public static int ComputeOddNumbers(int [] numbers) { int sum = 0; for (int i = 0; i < numbers.length; i++) { if (numbers[i] == 1) { sum = sum + numbers[i]; } } return sum; } } can anyone help me to print out the result from the main method? what am I suppose to write when I want to print out this method from the main method?

It's a little difficult to keep track of the code with the mouse tracker going about, do you still have the code?

How do I make recursion function for this function . F6 = F4 + F5 , F6 = F4 + F4+F3 , F6 = 2F4 +F3. - Input function(0,13,10) - 10 - you need to find the fibonacci still 10. You are given 6 potition that is 6 and first position is 0. Example F1 = 0 and F6 = 13. 1,1,2,3,5,8,13. The out for 10 positions is 89.

coinChange(coin - coins[index],coins[],index)+coinChange(coin,coins[],index + 1) - Please can you let me know what is getting added during stack up. I am not sure what value it is trying to sum up

Hello, what do I need to do in order to put random 5 integers not just 23, 45, 11, 87, and 49? Thank you.

I’m new to python, thanks for the tutorial!

I know this was put up 6 years ago, but this is the MOST helpful video on recursion I have ever seen. The area regarding the nodes was tremendously helpful and I just wanted to thank you!

thanks sir

Best explanation mate!!

It’s a nice looking program; however, a Virginia Tech scholar such as myself could do a whole lot better.