1 00:00:04,750 --> 00:00:11,080 ‫Welcome to Booth algorithm demonstration on the basis to board for this demonstration we're using two 2 00:00:11,590 --> 00:00:17,260 ‫four digit seven segments plays on an external breadboard where each of the segments are tied together 3 00:00:17,620 --> 00:00:25,960 ‫through a 56 ohm resistor that is fed into the J J B C ma ports on the basis table and we also have 4 00:00:25,990 --> 00:00:34,300 ‫each in the digit so X on the 8 different digits of the 7 time displays are tied through and NTN transistor 5 00:00:35,050 --> 00:00:41,900 ‫transistor but the 470 ohm resistor connected to the base in each of these are tied into the J.C and 6 00:00:41,920 --> 00:00:45,400 ‫JD Pima ports are the bases to board. 7 00:00:45,400 --> 00:00:51,880 ‫We're also using two slide switches switch one and switch zero switch one is used to determine whether 8 00:00:51,880 --> 00:00:59,530 ‫we're adding or subtracting to our input one or two that we're going to be multiplying or switch 0 terminus 9 00:00:59,530 --> 00:01:07,930 ‫which which input we're going to be just being displayed so inputs 1 and 2 are displayed on the 7 segment 10 00:01:07,930 --> 00:01:10,610 ‫display located on the base keyboard. 11 00:01:10,750 --> 00:01:14,970 ‫So I toggle the switch it toggles between input 1 and 2. 12 00:01:15,010 --> 00:01:15,970 ‫They're both 0 right now. 13 00:01:15,970 --> 00:01:19,620 ‫So when I toggle switch 0 you don't see a difference. 14 00:01:19,870 --> 00:01:24,460 ‫And the push buttons we're use have different and different uses. 15 00:01:24,460 --> 00:01:32,990 ‫So button 0 1 and 2 are used to add or subtract depending upon what input switch one is. 16 00:01:33,070 --> 00:01:35,940 ‫If it's pulled low we're going to subtract that part high. 17 00:01:35,950 --> 00:01:36,720 ‫We're going to add. 18 00:01:36,970 --> 00:01:44,560 ‫And it's one 10 in 100 other MTs you either add or subtract and button three is that execute or start 19 00:01:44,560 --> 00:01:47,340 ‫command the Xuxa perform the multiplication. 20 00:01:47,550 --> 00:01:54,280 ‫It's a boost algorithm is designed to perform sine multiplication so we can multiply 2 negative numbers 21 00:01:54,580 --> 00:01:57,590 ‫one negative and positive or two positive numbers. 22 00:01:57,610 --> 00:01:59,990 ‫So let's get started with a little big example here. 23 00:02:00,010 --> 00:02:01,440 ‫Demonstration. 24 00:02:01,810 --> 00:02:07,220 ‫So to start out we are displaying we'll pull this high or displaying or input 1. 25 00:02:07,480 --> 00:02:12,670 ‫And since we have our switch down we're going to be subtracting so I press 1 we subtract and you know 26 00:02:12,670 --> 00:02:13,700 ‫if we have a negative number. 27 00:02:13,720 --> 00:02:18,600 ‫This is a negative one negative 2 3 4 5. 28 00:02:18,850 --> 00:02:21,450 ‫So input 1 is now a negative 5. 29 00:02:21,550 --> 00:02:26,510 ‫If I switch the pull of switch down or to splaying or input 2 which is still 0. 30 00:02:26,680 --> 00:02:33,600 ‫So of course will permit or switch 1 and we subtract once in our negative one and we'll pull high. 31 00:02:33,610 --> 00:02:36,610 ‫Now add in all the positive now. 32 00:02:36,910 --> 00:02:44,200 ‫So we'll make our input to a positive for if we look now before both of our inputs are we have negative 33 00:02:44,200 --> 00:02:46,180 ‫5 and positive 4. 34 00:02:46,180 --> 00:02:51,190 ‫So if we multiply negative 5 10 positive for the value of negative 20. 35 00:02:51,190 --> 00:02:57,220 ‫So when I hit the execute button it up for multiplication of negative five times 4 which gives us a 36 00:02:57,220 --> 00:02:58,730 ‫result of negative 20. 37 00:02:58,750 --> 00:03:03,340 ‫We can see in our result register and so we can do two negative numbers. 38 00:03:03,340 --> 00:03:08,930 ‫So instead of positive instead of positive 4 we'll start subtracting and make that negative. 39 00:03:09,040 --> 00:03:11,220 ‫So we'll make that negative too. 40 00:03:11,230 --> 00:03:19,750 ‫So now we have negative 2 primes negative 5 which is a value of tens of we hit our execute you now see 41 00:03:19,750 --> 00:03:25,700 ‫we have a positive 10 and we can do any different combinations so we can make these very large too will 42 00:03:25,810 --> 00:03:32,940 ‫make it negative to 15 and we'll make it negative 1 or 2. 43 00:03:32,950 --> 00:03:40,210 ‫So if you take negative one or two times negative to 15 that is equal to that or execute button that 44 00:03:40,210 --> 00:03:43,090 ‫is equal to 20 1930. 45 00:03:43,150 --> 00:03:44,410 ‫So you can take that combination. 46 00:03:44,410 --> 00:03:49,390 ‫We can make this 215 negative 15 positive by doing that. 47 00:03:49,480 --> 00:03:55,240 ‫We know that our result will be negative because we now have a negative time of positive or positive 48 00:03:55,240 --> 00:03:59,700 ‫as 185 times negative 1 0 to get our exit queue. 49 00:04:00,010 --> 00:04:01,430 ‫And that is a negative. 50 00:04:01,480 --> 00:04:03,740 ‫Eighteen thousand eight hundred seventy. 51 00:04:03,850 --> 00:04:09,790 ‫And so you can do eight different combination as low as negative nine hundred ninety nine and as high 52 00:04:09,790 --> 00:04:12,520 ‫as nine hundred ninety nine. 53 00:04:12,520 --> 00:04:16,480 ‫And that is the root algorithm demonstration running on the bases to board.