If there is N Boolean variable then to compute

0

If there is N Boolean variable then to compute all the possible combination of elements, what is the time complexity?

a) O(N log N)

b) O(N*N)

c) O(N*N*N)

d) O(2^N)

Ravi Garg edited question
    0
    Harveer Chahar (anonymous)

    ok sir nd thanx……..

    Harveer Chahar answered
      0
      Kundan Kumar (anonymous)

      2^N

      Kundan Kumar answered
        0
        Harveer Chahar (anonymous)

        but how?

        Harveer Chahar answered
          0
          Sonali Kapoor (anonymous)

          The total no. of Boolean values possible with n variables is 2^n so time complexity is O(2^n). ok.

          Sonali Kapoor answered
            Add image to editor add image from link

            Question stats

            • Active
            • Views375 times
            • Answers4 answers
            • Followers1 follower
            Question and answer is powered by AnsPress