Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Byte-Sized-Chunks: Bit Manipulation Problems
Rating: 4.6 out of 5(39 ratings)
2,520 students

Byte-Sized-Chunks: Bit Manipulation Problems

Learn how to set, test or reverse bits - interview favorites, made easy with a visual approach that you will love
Created byLoony Corn
Last updated 3/2016
English

What you'll learn

  • Crack bit manipulation problems, whether in interviews or at work

Course content

1 section • 7 lectures • 1h 15m total length

  • You, This Course, and Us!0:58
  • Bit Manipulation - I10:07
    We dig into the bitwise AND, OR and NOT operations - visually inspecting how they work.
  • Bit Manipulation - II8:39

    We continue with bit manipulation - the right shift and left shift operators are very powerful, but they have 2 issues that you should be sure to understand: overflow, and fill.

  • Useful Bit Manipulation Techniques13:13
    Before diving headlong into bit manipulation problems it's helpful to learn a few useful tricks which help you build a strong foundation to visualize working with bits.
  • Get And Set The Nth Bit13:30

    Functions to get the nth bit of an integer and to set the nth bit of an integer. These are the building block functions and the concepts underlying these will be used for harder bit manipulation problems.

  • Print And Count Bits18:54

    Print all the bits used to represent an integer from the most significant bit to the least significant. Learn some subtle details about the shift right (>>) with negative numbers!

    Count the number of 1s in an integer, and learn a neat trick which allows you to do it in complexity O(number of 1s).

  • Reverse The Bits In An Integer10:10
    Reverse the bits in an integer. This pulls together a whole bunch of stuff from the last few problems. As in the case of hard problems, visualizing the process is key to solving this!

Requirements

  • This course requires some basic understanding of a programming language, preferably C, C++, C# or Java. Bit manipulation algorithms and syntax are virtually identical all of these languages (of course the syntax is hardest in C:-))

Description

Note: This course is a subset of our 20+ hour course 'Break Away: Programming Interviews' so please don't sign up for both:-)

Programming interviews are like standard plays in professional sport - and bit manipulation questions are very common in certain types of interviews!

This course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart

Bit manipulation problems are an interview favorite, and they also pop up in some real-word programming cases, particularly low-level or very computationally intensive tasks.

What's covered:

  • The bitwise AND, OR, NOT operators: Visually understand exactly how the bitwise AND, OR and NOT operators work
  • Bitwise Shifting - Overflow and Fill: The bitwise shift operators can be quite tricky - we cover these in some detail
  • Bit Manipulation - get and set a specific bit
  • Counting Set Bits with a nifty trick to do so in time complexity O(# of 1s)
  • Reverse Bits in a number

Who this course is for:

  • Nope! Please don't enroll for this class if you have already enrolled for our 21-hour course 'Break Away: Programming and Coding Interviews'
  • YEP! New engineering graduate students who are interviewing for software engineering jobs
  • YEP! Professionals from other fields with some programming knowledge looking to change to a software role
  • YEP! Software professionals with several years of experience who want to brush up on core concepts

Report abuse