How many are having tomorrow exam

@kishorekumars6685

Жыл бұрын

Me

@bread_enjoyer

Жыл бұрын

In 5 mins lol

@volvox420

Жыл бұрын

having sem tomorrow

@Tycoons

Жыл бұрын

Today 🤞

@ritamkar8858

Жыл бұрын

Hehhe

When someone like me can understand most of this, you know you're explaining the topic very well. Thanks for this!

@skofficial387

7 ай бұрын

How to check 1101 ? What is the formula???

Thankyou so much. I could read the steps of this algorithm but didn't understand why those steps were even performed in the first place. Found this video and got answer, thankyou.

Oh i just got interested in this topic. Thanks for the video!

Thank u so much, very clear!

You should be admired for your hard work

@skofficial387

7 ай бұрын

How to check 1101 ? What is the formula???

nice work uploaded

incredible thanks

u saved me a lot of time.....thanks

Sir,,,, i only understand when You teach. I WISH YOU WERE MY PERSONAL TUTOR.

Best explanation

I was watching funny video. When I suddenly open this lecture video, I forgot about the previous comedy and continued watching this lecture. I mean totally Awesome tutor.

I love the old guy accent which was so understanding and soothing 😏

@KkuKuku-ck9wh

Ай бұрын

😮😮😮

Way of teaching is wow

Very clear

@skofficial387

7 ай бұрын

How to check 1101 ? What is the formula???

We need algorithms corses using ++C

How can we determine the size of n?

Thank you thank you thank you.. 🙏🙏🙏🙏🙏🙏

thanks

How to check 1101 ? What is the formula???

Who's having exam tomorrow? 🙋‍♂️

@chodu_ramadu

3 ай бұрын

Today

Sir,,, what's your name? .... I dont find you in any other lectures.

I'm here 🙋

@user-sc1wi7nz2n

8 ай бұрын

To kaa karein Mata ji, 😑😐😶

Thank you. You explain the advantage very well but it is not the worse case so how we can call it better. For example what about multiplication of binary 01010101 with 10101010 Does it also has advantage over previous method?

@johncochran8497

3 ай бұрын

Many claim that Booth's algorithm is faster than the conventional approach. But that is wrong. Both have the same average time. It's that one of them is faster than the other on specific numbers. To illustrate, consider. For each bit location in the multiplier both algorithms will either 1. Do nothing. 2. Perform an addition. There is no third option. It's either skipped, or there's an addition. Now, you might be thinking that But Booth's algorithm doesn't just add, it adds or subtracts. To which one must consider that the first operation in Booth's algorithm is always a subtraction. And each time afterwards, whenever something is done, it's the opposite of what was done previously. So Booth's algorithm will subtract, add, subtract, add, ... So, if you take a look at a N bit multiplier, there are 2^n different patterns for all possible 2^n numbers. For conventional multiplication, all ones is the worst case situation since it requires N additions. But for Booth's algorithm, alternating ones and zeros are the worse case. In fact, although the average number of additions is identical for both conventional and Booth's algorithm once you consider all 2^n possible multipliers, the conventional algorithm is faster more often than Booth's algorithm. That paradox is simply explained by noticing that when the conventional algorithm "wins" in terms of speed, it wins by a very small margin. But when Booth's algorithm "wins", it wins by a large margin. For instance, Booth's algorithm with a 1111111111111111 multiplier does 1 addition, while the conventional algorithm does 16. So Booth's wins by 16 to 1 with a margin of 15. But 0101010101010101, with Booth, it takes 16 additions while the conventional takes 8. So it's 16 to 8 with a winning margin of only 8. Now, with all that said, Booth's algorithm does have a major advantage over the conventional algorithm in that it handles SIGNED numbers more efficiently than the conventional algorithm. It's possible to handle signed numbers with the conventional algorithm, but in doing so a bit of post-processing needs to be done after the multiplication. For instance, to do a signed multiply with the conventional algorithm, you have two choices. 1. Take note of the sign of the result. Then make both numbers positive, multiply, then negate if result should be negative. or 2. Perform multiplication as if the numbers were unsigned. After multiplication is done, examine each original number and if that number is negative subtract the OTHER number from the upper half of the result.

what if the sequence is 101101 how to use this formula?

@BeastMode070subscribe

Жыл бұрын

2^5 + 2^4-2^2+1

@user-sc1wi7nz2n

8 ай бұрын

😢Did you find answer to this question? 😢

@skofficial387

7 ай бұрын

How to check 1101 ? What is the formula???

@skofficial387

7 ай бұрын

​@@user-sc1wi7nz2nsame questions

@skofficial387

7 ай бұрын

Please reply us ...

Aw man I never knew the rizzard was so good at math

yes we get rid of the additions, but we need to somehow be able to understand 1 sequences

हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏🙏🙏❤❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩

Yayyyy

How many are having today exam

Hmmm

COA

sem end exam gang here lol

How many are having tomorrow exam 😂😂😂 So you are engineer ❤

Why you take 2's compliment instead of taking compliment because number is compliment

@abhiiiydv

Жыл бұрын

It is because in computers, negative numbers are stored in the form of 2's complement of positive numbers. So, in order to convert the negative number back to original number, 2's complement is necessary.

@user-sc1wi7nz2n

8 ай бұрын

​@@abhiiiydvWhat if sequence is 101101 ? How to use this formula?

I, here

booth 👻👻👻

@inxeoz

Жыл бұрын

@user-sc1wi7nz2n

8 ай бұрын

Its bhoot and not booth 👻👻👻

Having today Exam ???

Too many questions unanswered. For example if we have multiplier with multiple sequences of 1s, e.g. 1100011100011 , also whilst the shifts were counted in terms of performing the multiplication the shifts required to work through the multiplier are not. In essence I don't like this video. Sorry.

how many are from kiit

please change your intro

@the_memer_bro_21

Жыл бұрын

🤣🤣🤣🤣🤣

@user-sc1wi7nz2n

8 ай бұрын

​​@@the_memer_bro_21Why you laughing memer bro, 😢

@user-sc1wi7nz2n

7 ай бұрын

Why??

How many are having tomorrow exam 😂😂😂 So you are engineer ❤