Answer 1

To get the 3rd bit:
n >> 2
shifts the 3rd bit all the way to the right.
(n >> 2) & 1
shifts the 3rd bit all the way to the right and then extracts the rightmost bit.
In general you want to shift by `i - 1` to get the i-th bit.

Answer 2

Use bitwise & "and" with a mask where the Nth bit of the mask is set to 1.

Answer 3

and what do you say about a way to put this two-bit number in an array (each digit in a separate cell) and access it by the array index?
a = [1,0,1,0,1]

Answer 4

Hello! you mean two bit calculus?

Answer 5

your question does not reveal the essence. Please, show an example

Answer 6

Do you index from zero or one?
For a binary number, which bit has the lowest index in your idea? is it the left most bit, or the right most one?
10101010
Is bit 1 (left most) or bit 0 (right most) having index 0?

Answer 7

this is already becoming clearer... what are your thoughts on this?

Answer 8

do you understand what Ipang asked you?

Answer 9

do you use bitwise shift to solve this problem?

Answer 10

Reed Richards just the same. according to the same scheme

Answer 11

Please specify a language in your question tags, you have taken multiple courses it is difficult to deduce a context in regards to which language 👍
(Edit)
Specified language added in tags.
Thank you for understanding 👍

Answer 12

do you have any thoughts on how to do this?

Answer 13

I was going to propose this, but Schindlabua's method is way neater 😆
Just as an alternative though,
(n & (1 << index) ? 1 : 0)
* Where <n> is the number, and <index> is N - 1, so <index> would be 2 if you want to get the 3rd bit.

Answer 14

Third number from right it should be a[2]

Answer 15

NoobTech2.0, similar to what Ipang was saying: You shift a 1 to wherever you need it, and then you binary-or the results.
n | (1 << index)

Answer 16

How to get nth bit from number for which language please specify

Answer 17

how could u do this in python?

Answer 18

Не понимаю🤔