Пікірлер

• 
  @ladro_magro57372 ай бұрын

  you are great! recursion is not

• 
  @Ahmed_Aldosoky6 ай бұрын

  very high

• 
  @ts48757 ай бұрын

  Nice explanation ❤

• 
  @airforceenthusiasts47229 ай бұрын

  A great watch, very informative👍👍

• 
  @user-tj1xq5hg7q9 ай бұрын

  9 years later but thanks dude this helped me so much

• 
  @SvsJFaceoff Жыл бұрын

  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.

• 
  @lililklklkk74 Жыл бұрын

  Is there any way I can print this worksheet?

• 
  @kirtireddy6392 Жыл бұрын

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

• 
  @quack9pm Жыл бұрын

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

• 
  @johnshepherd6995 Жыл бұрын

  That’s literally me rn

• 
  @quack9pm Жыл бұрын

  @@johnshepherd6995 lets gooooo

• 
  @I.need-peace5 ай бұрын

  I’m waaaaaaaaay behind and my exam is after two weeks 😂😂😂😂

• 
  @hmx14694 ай бұрын

  My exam is in 20 mins

• 
  @quack9pm4 ай бұрын

  @@hmx1469 HOW DID YOU DO

• 
  @kathyeffner3017 Жыл бұрын

  Thank you so much! This is very helpful!

• 
  @Imjoinkiller Жыл бұрын

  nice

• 
  @yagz8648 Жыл бұрын

  thanks :)

• 
  @CurtMinich Жыл бұрын

  yes, it was for 9th graders.

• 
  @3169aaaa Жыл бұрын

  for kids..

• 
  @christopherlimon201 Жыл бұрын

  is this a high school midterm it seems too simple

• 
  @misterminich Жыл бұрын

  yes, a 9th grade course in fact

• 
  @xjustinjx3 ай бұрын

  @@misterminich im in college and this was helpful. feels good to be this far behind.

• 
  @blessedadetiba413 Жыл бұрын

  Thank You for this tutorial, it was really helpful.

• 
  @pietro-study2 жыл бұрын

  thank you so much

• 
  @unusualarrow63902 жыл бұрын

  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.

• 
  @anmolkaran57 Жыл бұрын

  "The order of operator precedence is not; then and; then xor and xnor; and finally or. Operators with the same level of precedence are evaluated from left-to-right."

• 
  @woltron4o2 жыл бұрын

  Very good explanation. Thanks.

• 
  @michaelchandriotis72252 жыл бұрын

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

• 
  @winstonwang51432 жыл бұрын

  helped so much preciate it

• 
  @musictme43172 жыл бұрын

  Thanks you!!!!!!

• 
  @stelkostova62192 жыл бұрын

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

• 
  @tonychia22272 жыл бұрын

  where can i get more worksheet like this?

• 
  @logicalsystem40702 жыл бұрын

  Send me the code please

• 
  @miguelmed45622 жыл бұрын

  17.0

• 
  @LolaFansOnly2 жыл бұрын

  Awesome video!

• 
  @warseali37802 жыл бұрын

  thanks

• 
  @mohammadtorab94293 жыл бұрын

  well explained thank you so much.

• 
  @markcase9133 жыл бұрын

  You’re the 🐐

• 
  @kumariamisha46333 жыл бұрын

  Thanks for the video ...

• 
  @maplesheet1133 жыл бұрын

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

• 
  @kunal19863 жыл бұрын

  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

• 
  @kunal19863 жыл бұрын

  Thanks you. Sir🇮🇳

• 
  @mamo9873 жыл бұрын

  goodshit👌

• 
  @ryanvargo49073 жыл бұрын

  Apple and Tesla making biiiiiig moves this week

• 
  @ankitpaul68314 жыл бұрын

  Bal

• 
  @ankitpaul68314 жыл бұрын

  Tumi

• 
  @dilipjain57704 жыл бұрын

  Pls can u help with the fifth ans

• 
  @joshuagisiger143 жыл бұрын

  no

• 
  @ahmedkeyse43384 жыл бұрын

  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?

• 
  @madamadadane79894 жыл бұрын

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

• 
  @Hercules1594 жыл бұрын

  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.

• 
  @Hercules1594 жыл бұрын

  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

• 
  @khaliunbattogtokh72634 жыл бұрын

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

• 
  @misterminich4 жыл бұрын

  replace srand(1); with srand(time(NULL)); as you see in the comment statement

• 
  @khaliunbattogtokh72634 жыл бұрын

  @@misterminich Thank you! :)

• 
  @kylorojen80662 жыл бұрын

  ​@@misterminich Hello sir I have a question what if in the array there are two number 11's? like x[] = {2, 4, 7, 11, 5, 7, 11, 19}; will the program be able to search through more in the program if it's already found?

• 
  @CurtMinich2 жыл бұрын

  @@kylorojen8066 no, this version of the search won't go that far due to the break

• 
  @ryanvargo49074 жыл бұрын

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

• 
  @Vinesse4 жыл бұрын

  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!

• 
  @Nursin-rg1ey4 жыл бұрын

  thanks sir

• 
  @AnuMessi104 жыл бұрын

  Best explanation mate!!

• 
  @ryanvargo49074 жыл бұрын

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

• 
  @OwnedSoda13BBH4 жыл бұрын

  It feels like going into a rabbithole like in inception and trying to climb back out