CSC104H1 Lecture 3: quiz

87 views2 pages

Document Summary

Recursion (define (t n) (cond [(= n 0) "|"] [else (string-append "}" (t (- n 1)) (t (- n 1)) ; show the result values of the following expressions: (t 0) (t 1) (t 2) (t 3) (define (t n) (cond [(= n 0) "|"] ; show the result values of the following expressions: (t 0) (t 1) (t 2) (t 3) ; here are some powers of 2: (list 64 32 16 8 4 2 1) ; calculate the number represented by each list of bits. ; the appropriate power of 2 and adding the result. Show your work multiplying by (list 1 1 0 0 1 1 0) (list 1 0 1 1 0 0 1) ; for each decimal (regular old base-10) number below, show. ; how to convert it to binary (base 2), working from the. ; add the two binary numbers below, showing all steps.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions