00:01
We would like here to find the bitwise or, and, and xor of each of these pairs of bitstrings.
00:04
So i'm going to write them out vertically to make this a little bit easier on us.
00:08
1, 0, we've got four 1s here, 1, 1, 1, 1.
00:15
Write this out a little bit more evenly spaced.
00:17
1, 0, 1, 1, 1, 1, 1, 0.
00:20
And then 0, 1, and then a ton of 0s until we get to 1.
00:28
So bitwise or, for these guys, is going to, each of these has a 1 in each of the components.
00:36
So get the or as that.
00:38
Bitwise and, each also have a 0.
00:42
So 0 and 1 is always going to be 0.
00:45
And the xor, we notice that each column here has exactly one 1 and one 0.
00:51
So we get, we get that.
00:55
Which is great and good.
00:57
Let's look at this next one.
00:58
We've got four 1s, four 0s.
01:00
1, 1, 1, 1, 0, 0, 0, 0.
01:04
And then we have alternating 1s and 0s.
01:08
Like that.
01:10
And we'd like to first do, find the bitwise or.
01:14
See, well, this one has two 0s, which is a 0.
01:17
This has a 1, no 1, 1.
01:19
Each of these has a 1.
01:22
Look at their and.
01:23
Let's see.
01:24
Each of these has a 0.
01:27
But these two are only 1s.
01:29
So we got that.
01:31
And the exclusive or, let's see.
01:33
Exclusive or as a shortcut, you can just see if the bits are different, right? these are the same...