ISBN : 978-81-963532-2-3 (E-Book) sizeK, thereareexactlyKdifferentstrings of length r. Thus. η N/η≤η Or,N≤η Sinceoperatorsandoperandsusuallyalternateinaprogram,theupperboundcanbefurther η1 η2 refinedintoN≤ηη 1 η .Also,Nmustincludenotonlytheorderedsetofnelements,butit 2 shouldalsoincludeallpossiblesubsetsofthatorderedsets,i.e.thepowersetofNstrings(Thisparticularrea soningof Halstead is not veryconvincing!!!). Therefore, N Or,takinglogarithm onbothsides, η1 η2 N=logη+log 2 Soweget, η1 η2 N=log Or, N =logη η1 + logη η2 (η η ) 2 1 2 (approximately,byignoring logη) 2 (η η ) 2 1 2 η1 η2 2= η η η 1 2 η+1 159 Software Engineering Keerthana P, Manasa KN, Ganga D Bengal
165 Publizr Home