problem-solving_numerical-representation_theory_problem 1"

[gayatripurigilla]

Defect Description:the number of bits required to represent a given number n is ceil(log2(n)) and this can be found by dividing the given number by 2 until the quotient is zero but,we have to count the number of steps we got until the quotient becomes zero which is not mentioned.steps to reproduce:1.click on problem solving lab.2.click on list of experiments.3.then go to numerical representation.4.click on theory.5.go through the problem 1expected result:the number of bits required to represent a given number n can be obtained by counting the steps until n/2 becomes zero(including).actual result:we have to count the number of steps in order to determine the number of bits required but it is not given.label:category:bugtype of issue:functionality

[TSaiRamReddy]

Commit id : c550095d8c0eb09e0a7ae23a9db799328632b6fc

[sreecharanksvn]

valid fix @TSaiRamReddy

[SindhuraReddy99]

Valid fix @TSaiRamReddy

[niveditareddy]

Valid fix@TSaiRamReddy