Bit Manipulation Problems

Insertion You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M int N such that M starts at bit j and ends at bit i. You can assume that bits j through i have enough space to fit all of M. Example : Inp...