recategorized by
687 views

1 Answer

0 votes
0 votes
For any binary strings check the last $k$ bits in the given strings:

If the last $k$ bits are completely $0$ then the number is evenly divisible by $2^k$ else it is not divisible

Here $4$ can be represented by $2^2$, in option $(A)$ last 2 bits are completely zero. so it is divisible by $4$.

Option $(A)$ is correct.
edited by

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Mar 27, 2020
351 views
The bitwise $\text{OR}$ of $35$ with $7$ in $C$ will be :$35$$7$$42$$39$
0 votes
0 votes
1 answer
2
go_editor asked Mar 27, 2020
318 views
When an inventor is placed between both inputs of an $\text{S-R}$ flip flop, the resulting flip flop is :$JK$ flip-flop$D$ flip-flop$T$ flip-flopNone of these
0 votes
0 votes
1 answer
3
go_editor asked Mar 27, 2020
848 views
A half-adder is also known as :$\text{AND}$ Circuit$\text{NAND}$ Circuit$\text{NOR}$ Circuit$\text{EX-OR}$ Circuit
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
383 views
The Register or main memory location which contains the effective address of the operand is known as:PointerIndexed registerSpecial LocationsScratch Pad