ÇÁ·Î±×·¡¹Ö ¾ð¾î·Ð 2ÆÇ ¼Ö·ç¼Ç (ÀúÀÚ Kenneth C. Louden , 2nd ed Programming Languages Principles and Practice) (±¸¸ÅÀÚ ÆǸÅÁßÁö)

Programming Languages - Principles and Practice 2nd Edition
by Kenneth C. Louden Thomson Brooks/Cole 2002

Answers to Selected Exercises
? Copyright Kenneth C. Louden 2002

Chapter 1
1.2. (a)
function numdigits(x: integer): integer; var t,n: integer; begin n :¡ë 1; t :¡ë x; while t ]¡ë 10 do begin n :¡ë n + 1; t :¡ë t div 10; end; numdigits :¡ë n; end;

(c)
numdigits x ¡ë if x [ 10 then 1 else numdigits(x / 10) + 1

(e)
function numdigits(x: Integer) return Integer is t: Integer :¡ë x; n: Integer :¡ë 1; begin while t ]¡ë 10 loop n :¡ë n + 1; t :¡ë t / 10; end loop; return n; end numdigits;

(g)
class NumDigits { public static int numdigits(int x) { int t ¡ë x, n ¡ë 1; while (t ]¡ë 10) { n++; t ¡ë t / 10; } return n; } }

Kenneth C. Louden

Programming Languages ? Principles and Practice 2nd Ed.

Answers - 2

1.5. (a) The remainder function, which we shall write here as % (some languages use rem or remainder), is defined by the integer equation a ¡ë (a / b) * b ¡¦(»ý·«)