What you'll learn

Crack Problems on Bits and Bytes during coding interviews
Understand how to operate on bit level
Knowing all the tricks to solve complex problems using bitwise operators simply
Implement Bitwise Algorithms using Python 3

Coding Exercises

This course includes our updated coding exercises so you can practice your skills as you learn.

Course content

3 sections • 22 lectures • 2h 45m total length

Converting Decimal to Binary4:04
Convering Binary to Decimal4:09
Representing negative numbers10:19
Bitwise Operators15:36
Results of Bitwise Operators7:41
Bitwise shifting operators9:24
Learn bitwise shifting operators, including left and right shifts, how they move bits, and that left shifts multiply by 2^n while right shifts divide by 2^n.
Little Endian and Big Endian Architecture2:44

Problem 1 - Checking whether the numbers are different7:43
Determine if two numbers have opposite signs using bitwise operators and xor logic, leveraging sign bits and two's complement to print same or different signs.
Problem 2 - Clear the LSB2:01
Problem 2 (Continued)5:41
Problem 3 - Finding out the all alone element in an array9:22
Problem 4 - Add +1 to a given number without using +14:05
Problem 5 - Multiplying by 2.5 without using multiplication operator4:51
Learn to multiply any number by 2.5 without using the multiplication operator by using bitwise left and right shifts and addition.
Problem 6 - Printing whether the number is a power of 2 or not13:41
Problem 7 - Finding out XOR of two numbers without using XOR operator4:25
Problem 8 - Count the number of flippings that have to be done to convert A to B7:41
Compute the number of bit flips needed to convert one number to another by using xor to reveal differing bits and counting the ones, i.e., the hamming distance.
Problem 9 - Swap two nibbles in a byte7:04
Problem 10 - Swapping two numbers using xor7:05
Problem 11 - Finding the absolute value of a number without using abs() function14:36
Compute the absolute value with bitwise operations only, with no branching or abs function, by creating a sign mask via right shift, adding it, then xor-ing with the mask.
Problem 12 - The Russian Peasant Algorithm to multiply two numbers9:50
Problem 13 - Hamming Weight7:54
Problem 13.1 - Coding the Hamming Weight Problem5:33

Requirements

A basic programming knowledge is preferred, but not compulsory

Description

Crack the coding rounds and interviews whenever a question on bit manipulation is asked!

Welcome to the specific course on 'Bit Manipulation Algorithms'. This course will give you a deep understanding on how the numbers work as bits and bytes inside your computer and how to operate on bit level as a programmer?

The course will begin with the basics of converting decimals into bits, operating on those bits using operators such as Bitwise AND, OR, NOT and XOR and the most powerful operators like left and right shifts, the architectural features such as Little Endian and Big Endian.

Problems that are solved using Bitwise Algorithms:

1. Checking whether the two numbers have different signs

2. Clearing the Least Significant Bit

3. Finding out the all alone element in an array

4. Add 1 to the given number without using +1

5. Multiplying a number with 2.5 without using '*2.5'

6. Printing whether the given number is a power of 2

7. Finding out the XOR of two numbers without using XOR

8. Count the number of bits that have to be flipped to convert from A to B given two numbers A and B

9. Swap the two nibbles in a byte.

and so on.

The algorithms will be clearly explained and implementation will be done in anyone of your favorite programming languages. A basic knowledge in programming is preferred but not a strong requirement.

Who this course is for:

Beginner Software and Hardware Aspirants.

What you'll learn

Explore related topics

Coding Exercises

Course content

Fundamentals of Bit Level Operations!7 lectures • 54min

Algorithms and their Implementation15 lectures • 1hr 52min

Exercises0

Requirements

Description

Who this course is for: