A shift left moves every bit one place toward the MSB. In this course's notation (Q3 Q2 Q1 Q0), bits move toward Q3, the serial input enters Q0, and the old Q3 drops out. Wiring: D0 = SI, D1 = Q0, D2 = Q1, D3 = Q2.
For arithmetic, a 0 enters on the right. Each bit moves to a position worth twice as much, so the value doubles:
00000101 (5) → 00001010 (10) → 00010100 (20).
Shifting left k places multiplies by 2ᵏ.
When it goes wrong: if a 1 is shifted out of an unsigned register, the result is too big to fit, which is overflow. For a two's complement value, the result is wrong if the sign bit changes. For example, 01011000 (+88) shifted left gives 10110000, which reads as −80.
The same operation serves signed and unsigned numbers, which is why "logical shift left" and "arithmetic shift left" are the same thing. Only right shifts come in two flavors (logical shift right and arithmetic shift right).
Why it matters: shifts are far cheaper than multipliers. Compilers turn x × 8 into a shift by 3, and x × 10 into (x shifted left 3) + (x shifted left 1).