Scribd Logo
Upload

Welcome to Scribd!

  • 14.2 Bit Manipulation II - Apni Kaksha

    Uploaded by

    20UICS081SUNNY KUMAR
    17 views2 pages
    The document discusses techniques for bit manipulation including counting set bits by using n & (n - 1) which sets the first set bit to zero, checking if a number is a power of two by using !(n & (n - 1)) which is non-zero if n only has one set bit, and generating subsets by checking if the jth bit is set to include the jth element with a total of 2^n subsets possible. It provides examples and explanations for each technique and recommends practice questions to count bits and check for powers of four.

    Original Description:

    Original Title

    14.2 Bit Manipulation II - Apni Kaksha (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses techniques for bit manipulation including counting set bits by using n & (n - 1) which sets the first set bit to zero, checking if a number is a power of two by using !(n & (n - 1)) which is non-zero if n only has one set bit, and generating subsets by checking if the jth bit is set to include the jth element with a total of 2^n subsets possible. It provides examples and explanations for each technique and recommends practice questions to count bits and check for powers of four.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views2 pages

    14.2 Bit Manipulation II - Apni Kaksha

    Uploaded by

    20UICS081SUNNY KUMAR
    The document discusses techniques for bit manipulation including counting set bits by using n & (n - 1) which sets the first set bit to zero, checking if a number is a power of two by using !(n & (n - 1)) which is non-zero if n only has one set bit, and generating subsets by checking if the jth bit is set to include the jth element with a total of 2^n subsets possible. It provides examples and explanations for each technique and recommends practice questions to count bits and check for powers of four.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Bit Manipulation - II

    Prerequisites: ​knowledge of binary number system

    Count set bits


    n & (n - 1) sets the first set-bit to zero.
    Explanation: n = XXX100
    n - 1 = XXX011
    n & ( n - 1 ) = XXX000

    Power of two
    From our past knowledge of the binary number system,
    Numbers of the type 2​n ​have only 1 set bit.
    Explanation: n = 000100
    n - 1 = 000011
    n & ( n - 1 ) = 000000
    !( n & ( n - 1 ) ) = 000001
    If the number only had one set bit, then n & ( n - 1 ) would be zero.
    Generate Subset
    Explanation: if the j​th​ bit is set, then we take the j​th​ element.
    There are a total of 2​n ​subsets.

    Practice Questions:
    1. Counting bits
    2. Power of four

    You might also like