If there is N Boolean variable then to compute Data Structure and Programming 0 Ravi Garg 3 Rep. December 12, 2015 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 January 14, 2016 4 answers ActiveVotedNewestOldest 0 Harveer Chahar (anonymous) January 8, 2016 ok sir nd thanx…….. Harveer Chahar answered January 8, 2016 0 Kundan Kumar (anonymous) January 8, 2016 2^N Kundan Kumar answered January 8, 2016 0 Harveer Chahar (anonymous) January 8, 2016 but how? Harveer Chahar answered January 8, 2016 0 Sonali Kapoor (anonymous) January 8, 2016 The total no. of Boolean values possible with n variables is 2^n so time complexity is O(2^n). ok. Sonali Kapoor answered January 8, 2016 Toggle fullscreen Write Add image to editor add image from link NamePost answer Follow 1 Question stats ActiveJanuary 14, 2016Views404 timesAnswers4 answersFollowers1 follower Question and answer is powered by AnsPress