аЯрЁБс>ўџ /1ўџџџ.џџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџьЅС‰@ №ПE jbjbq”q” "ііAџџџџџџlииииLLL||||| ˆ|ѕЈЈЈЈЈ‡‡‡ВДДДДДД,§ !ŠрL‡ƒ‡‡‡рЕииЈЈлЈЕЕЕ‡иRЈLЈВЕ`nииии‡ВЕЕЩ Цђ*"LІœ огЇО||Ѓ‚І ѕѕ–Ї!ЕЇ!ІЕУхMore practice problems 1. Suppose you have two 2-bit binary numbers, x1x2 and y1y2. Each one can be 00, 01, 10, or 11, representing the decimal values 0, 1, 2, and 3 respectively. Design a truth table or a logic circuit that determines whether or not the binary numbers x1x2 and y1y2 are equal. 2. Write a recursive method exp that raises a positive (> 0) integer to a non-negative (>= 0) power; i.e. exp(3,2) should return 9. To do this, it helps to think about exponentiation recursively. If we want to raise m to the n power, we can think as follows: m n = 1 if n = 0 m n = m x m n-1 if n>0 Suggested test inputs (correct answer after arrow): exp (3,2) ( 9 exp(83,0) ( 1 exp(124, 1) ( 124 exp(1,124) ( 1 exp(5,4) ( 625 exp(10,3) ( 1000 3. Write a recursive method fib that computes the nth Fibonacci numbers (fib(n)). The Fibonacci numbers are defined as follows: fib(0) = 0 fib(1) = 1 fib(n) = fib(n-1) + fib(n-2) if n>1 Suggested test inputs (correct answer after arrow): fib(0) ( 0 fib(1) ( 1 fib(2) ( 1 fib(3) ( 2 fib(4) ( 3 fib(10) ( 55 fib(20) ( 6765 KLMNTUVWаб !#MQœЄ9<=NOX[cšЄЅВГТУгдрс№ёї  D J } З ю ѕ і    ! " - . : ; A D E ћљљљљїљљљљђђђьђьђьђђфђфђфђфђфђфђђђђђфђфђфђфђфђфђфђђ jр№OJQJ H*OJQJOJQJ5H*5CJE/0189:Lcd™šЈЖШзцїјљњ| } ˆ §ћѕяцћћћћћћфћћфћћћћћћћћћћћ$„ ^„ a$„h^„h„h^„h/0189:Lcd™šЈЖШзцїјљњ| } ˆ “ З И э ю љ    % 2 A D E ўўўќњњњњў*ˆ “ З И э ю љ    % 2 A B C D E §§ћ§§§ћ§§§§§§§§§ €Аа/ Ар=!А"А#€$%А i4@ёџ4NormalCJOJPJQJmH 44 Heading 1$@&5CJ <A@ђџЁ<Default Paragraph Font2B@ђ2 Body Text CJOJQJ8Z8 Plain TextCJOJPJQJ,/@,List„h„˜ў^„h`„˜ў02@"0List 2„а„˜ў^„а`„˜ў:D2: List Continue„hЄx^„h>EB>List Continue 2„аЄx^„а@CR@Body Text Indent„hЄx^„h6b6 Normal Indent „а^„а<ўOr<Short Return AddressEџџџџџџџџџџџџџџEџџџџ!џџ z™EE ˆ E E №8№@ёџџџ€€€ї№’№№0№( № №№B №S №ПЫџ ?№EAF'y:;LMšЈЋЖЙШЫзкцщ,:}€ˆ‹“–юёљќ%(25AF:::::::::::::::::::::џџIT DeptQMacintosh HD:home:ltoma:Teaching:107-Intro:fall04:Exams:final-practice-fall04.docIT DeptJMacintosh HD:home:ltoma:Documents:Microsoft User Data:Word Work File A_174IT DeptQMacintosh HD:home:ltoma:Teaching:107-Intro:fall04:Exams:final-practice-fall04.docIT DeptJMacintosh HD:home:ltoma:Documents:Microsoft User Data:Word Work File A_566IT DeptJMacintosh HD:home:ltoma:Documents:Microsoft User Data:Word Work File A_566IT DeptQMacintosh HD:home:ltoma:Teaching:107-Intro:fall04:Exams:final-practice-fall04.docIT Dept9Macintosh HD:home:ltoma:Desktop:final-practice-fall04.docIT Dept9Macintosh HD:home:ltoma:Desktop:final-practice-fall04.docIT Dept9Macintosh HD:home:ltoma:Desktop:final-practice-fall04.docIT Dept1Macintosh HD:home:ltoma:Desktop:finalpractice.doc“KhŽЧоњџџџџџџџџџP'c$ЎžpМџџџџџџџџџ1x&ДdpџџџџџџџџџНD2мэdІџџџџџџџџџS-š