Course Hero - We put you ahead of the curve!
You have requested the below document.
Sign up now to view this document for free!
- Title: sp99 homequiz 2 solution
- Type: Solutions
- School: Berkeley
- Course: CS 152
- Term: Spring
Coursehero >> California >> Berkeley >> CS 152
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: UCSB >> CS >> 40 Fall, 2004
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: UCSB >> CS >> 40 Fall, 2004
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: UCSB >> CS >> 40 Fall, 2004
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Spring, 2003
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Stanford >> CS >> 256 Winter, 2007
Path: Stanford >> CS >> 256 Winter, 2007
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: Berkeley >> CS >> 152 Fall, 1999
Path: UIllinois >> PHYS >> 598 Fall, 2007
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, and exam answer keys.
of University California, Berkeley College of Engineering Computer Science Division EECS Spring 1999 John Kubiatowicz Homework Quiz (HW #2) Solutions February 16, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homework #2. Good Luck! Your Name: SID Number: Discussion Section: Total: 1 A better multiply for the Single Instruction Computer In the homework, you were introduced to the "Subtract and branch if negative" instruction: sbn a, b, c # Mem[a] = Mem[a] Mem[b]; If Mem[a] < 0 goto c; Problem 3.30 asked you to develop a multiply routine that was not particularly efficient. Consider the following alternative for a 16-bit computer. This performs c = a * b, modifying b in the process: c = 0; for (index = 32768; index >= 1; index = index / 2) { If (b >= index) { b = b index; c = c - index * a; } } c = -c; To implement this, we will assume a macro facility that lets us generate groups of instructions many times. 1. Create a macro called "inner" which performs the inner instructions of our multiply. This takes 4 memory locations as input: a, b, index, and scaled_a, and computes: if (b >= index) {b = b index; c = c scaled_a;} Assume one temporary memory location (temp). Note that your code can contain an empty label called "exit:" at the end. inner(b, c, index, scaled_a, temp): sbn b, index, nogo # sbn c, scaled_a, exit # nogo: sbn temp,temp,.+1 # sbn temp,index,.+1 # sbn b,temp,.+1 # exit: do test (b < index) b >= index. Fix C Create -index Fix up B (undo test) 2. Create a macro called "double" which puts (2*Mem[in]) Mem[out], using Mem[temp] as a temporary location. This must not alter the "in" memory location: double(out, in, temp): sbn temp,temp,.+1 sbn temp,in,.+1 sbn temp,in,.+1 sbn out,out,.+1 sbn out,temp,.+1 # # # # # temp = 0 temp = -in temp = -2in out 0 = out = 2in 2 3. Using your macros, write a routine "multiply" that will take a and b as input, and place the result in c. Make this work for 4 bit variables. Assume that the memory location "one" contains the constant 1. Also, assume that you can use your macros like instructions: For instance: double(two,one,mytemp) inner(q,r,other,two,anothertemp) The macro facility expands each macro call into the set of instructions in the macro definition, while substituting the actual arguments for formal ones. Thus, for instance, the first call to "double" above will substitute twoout,onein,and mytemptemp in your definition of double. Hint: you must first create a bunch of constants like 2 and (2 * a), then use them. Multiply_4_bit: double(two,one,temp) # double(four,two,temp) # double(eight,four,temp) # double(two_a,a,temp) # double(four_a,two_a,temp) # double(eight_a,four_a,temp) # sbn neg_c,neg_c,.+1 # inner(b,neg_c,eight,eight_a,temp)# inner(b,neg_c,four,four_a,temp) # inner(b,neg_c,two,two_a,temp) # inner(b,neg_c,one,one_a,temp) # sbn c,c,.+1 # sbn c,neg_c,.+1 # done: Create const 2 Create const 4 Create const 8 Create const 2 * a Create const 4 * a Create const 8 * a neg_c = 0 Deal with bit 8 Deal with bit 4 Deal with bit 2 Deal with bit 1 c = 0 c = -neg_c 4. If you were to make a 16-bit version of this, what is the worst-case number of cycles that it would take? Is this much better than the multiply from the homework? Each double takes 5 cycles. The maximum number of cycles for an inner operation is 4 cycles (the negative path). A 16 bit version would have 15 * 2 * 5 cycles from double ops, 16 * 4 cycles from inner ops and 3 cycles of random sbn instructions. So, 150+64+3 = 217 cycles. This is much better than the solution in your homework (which had a loop of multiple instructions that could have up to 65535 iterations). 3
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:
sp99_midterm1
Path: Berkeley >> CS >> 152 Spring, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 1999 John Kubiatowicz Midterm I March 3, 1999 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Problem 1 2 3 4 5...
Predicate logic quantifiers Integers proof by inductionPath: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $\'* + #! ! , )\' , ! * ! ! \"! ! # , )\' , * ! # # $ $ ) ! # ) ).-/0).*/ ! -0* $ !$ ) ! # ) * ! ! -1 ! ! ).-/0* %$ ) ! # ! ! 2! 2 \' ( ! ! \" ! ! \' ( 34,-0 5 3 , 0 5 ! * ) \' 6! * ) \' !...
lect1b_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $ ! , 3\" 4 56 ! ( # 7 - \'8 9# \' 8 9# \' 8 !9# \"4 \"4 ! \" \" # \" ( ( 7 7 4 \"4 ( ( 7 7 ( 7 7 7 \"4 ( ( ( 7 7 7 ( ( $ : # ! ! \" \" ! \" \"4 38;* \" ! ! ( > -% ? !...
MidTerm_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Answers Midterm CS40, Thursday October 28 Question 1. (a) (a b) c (a b) c ( a b) c ( a c) ( b c) (a c) (b c) (p q p q) (De Morgan) distribution and commutation (p q p q, twice) (b) With the substitutions a = a1 an-1 and b = ...
MidTerm_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Name: Student No. Midterm CS40, Thursday October 28 (40 points total) Question 1 (5+5 points). (a)Derive the equivalence (a b) z (a z) (b z), using the elementary laws: idempotence, double negation, De Morgan, commutation, association, distri...
lect1_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $#$% ! / ! 3 7 8 #< ) )% * + $ \' 9 ! 9 )=3# #3 : % -#/ ! ; % - + !:> % < ? ! * # + # ) # # ) * + # + A + 42 9 #@ ? # : ? 3# :> ! :> + * + 9 # ? # :> % - 9 3# 9...
hw8_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework Answers CS40, Friday November 19 Question 1. (a) 1/108 0.00926: There are 63 = 216 possibilities for the outcomes of the 3 dice, each with equal (uniform) probability 1/216. The case D1 = 3, D2 + D3 = 3 has 2 possibilities (D1 , D2 , D3 ) =...
hw7_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday November 19 Material: 8.68.10 (42 points total) due Monday November 29, 5pm Question 1 (3+4+5 points). You throw a die with outcome D1 {1, . . . , 6}, after which you throw two other dice with outcomes D2 and D3 (again from the...
hw6_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday November 12 Material: 8.3 (45 points total) due Friday November 19, 5pm Question 1 (2+2+2+2 points). What are the following values? (a) 0! (b) 8! (c) C(10, 6) (d) 100 97 Question 2 (3+3 points). Write out the following expressio...
hw6_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday November 12 Question 1. (a) 0! = 1 (b) 8! = 40320 (c) C(10, 6) = 210 (d) 100 = 161700 97 Question 2. 1 1 (a) n = n(n - 1)(n - 2)(n - 3)/24 = 24 n4 - 1 n3 + 11 n2 - 4 n. 4 24 4 n+4 3 2 13 1 3 (b) n+1 = (n + 4)(n + 3)(n + 2)/6 = 6...
hw5_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday November 5 Material: 5.3, 8.1, 8.2 (45 points total) due Friday November 19, 5pm Question 1 (3+3+3 points). Prove or give a counterexample for the following statements: (a) If f (n) = O(g(n) and h(n) = O(k(n), then f (n) - h(n) ...
hw5_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday November 5 Question 1. (a) Not true. Counterexample: take f (n) = 2n, g(n) = h(n) = k(n) = n. The statememt now becomes f (n) - h(n) = n = O(n) - k(n) = O(0), which is not true. (b) Not true because 2n = O(2n/2 ). For a given k ...
hw4_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday October 15 Material: 3.13.5 (45 points total) due Monday October 25, 5pm Question 1 (3+4 points). Define sn = 1 + 3 + 5 + + (2n - 1) such that S1 = 1, s2 = 4, s3 = 9, et cetera. We want to prove that sn = n2 for all n N+ by ...
hw4_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Answers Homework CS40, Friday October 15 Question 1 (induction). n n+1 (a) For all n N+ , if sn = j=1 (2n - 1) = n2 , then sn+1 = j=1 (2n - 1) = (n + 1)2 . 2 (b) Assume that indeed sn = n . Note that sn+1 = sn + 2(n + 1) - 1, hence sn+1 = n2 + 2n + ...
hw3_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Monday October 11 Material: Sections 2.1, 2.2, 2.52.8, 3.13.3 (48 points total) due Monday October 18, 5pm Question 1 (4+5 points). Let X, Y, S be sets, and f : X S and g : Y S functions. In algebraic geometry one uses so-called fibe...
hw3_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework Answers CS40, Monday October 11 Question 1 (fibered products). (a) Because X = Y = S and f (x) = g(x) for all x X, the definition gives X S Y = {(x, y) : x, y X, x = y} = {(x, x) : x X}, which is the set of pairs (x, x) for all x X. (b) ...
hw2_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Friday October 1 Material: Sections 1.11.5, 2.1, 2.2 45 points total / due Monday October 11 Question 1 (3+2+3) Here is a quote from Dan Quayle, then Vice-President of the United States, about the planet Mars: \"Mars is essentially in t...
hw2_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework Answers CS40, Friday October 1 Question 1 (Dan Quayle\'s logic). (a) The argument that Dan Quayle uses is: \"If there is water on Mars, then there is oxygen on Mars. If there is oxygen on Mars, then we can breathe on Mars. There is water on Ma...
hw1_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework CS40, Tuesday September 28 Material: Sections 1.1, 1.2, 1.3 and part of 1.5 (24 points total) due Friday October 1 Question 1 (2+2+2 points1 ). Write down the truth tables of the following three propositions 1. (p q) r 2. (p q) (q p) 3....
hw1_answers_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Homework Answers CS40, Tuesday September 28 Question 1 (truth tables). p q F F F F F T F T T F T F T T T T r (p q) r F F T T F F F T F F T T F F T T p q r (p q) ( p r) F F F T T F F T F T F T T F T T T F F T T F T T T T F T T T T T p q F F F T ...
Final_CS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Name: Perm. Number: Final CS40, Wednesday December 8 (80 points total) Question 1 (3+3+4+4+6 points). Let f be a function f : A B, where A and B are finite sets of sizes |A| = n and |B| = m. We are going to count the possible functions f . (a) Giv...
Final_answersCS40Path: UCSB >> CS >> 40 Fall, 2004
Description: Name: Perm. Number: Final CS40, Wednesday December 8 (80 points total) Question 1 (3+3+4+4+6 points). Let f be a function f : A B, where A and B are finite sets of sizes |A| = n and |B| = m. We are going to count the possible functions f . (a) Giv...
Counting III more combinatorics and probability theoryPath: UCSB >> CS >> 40 Fall, 2004
Description: CS40, Fall 2004 Wim van Dam Room 5109, Engr. 1 vandam@cs.ucsb.edu http:/www.cs.ucsb.edu/~vandam/ CS40, Wim van Dam, UCSB Formalities More homework announced and due Friday (Nov 19) Adjusted late homework policy: between Friday and Monday 5pm: 2...
Counting IV probability theory and expected valuesPath: UCSB >> CS >> 40 Fall, 2004
Description: CS40, Fall 2004 Wim van Dam Room 5109, Engr. 1 vandam@cs.ucsb.edu http:/www.cs.ucsb.edu/~vandam/ CS40, Wim van Dam, UCSB Formalities Homework due Friday (Nov 19), late homework policy: between Friday and Monday 5pm: 20 points after Monday 5pm: no...
Counting and Probability I adding and multiplying events inclusion exclusion principlePath: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $ % % 1 ! ! ! * * ! * !, 9 ! * ) ! !% \" \" ! !*, 0 * ! ! 0 */ ! *,# 34 \" ! ! ! ! \"* - !, , % \" * % : ! *0 ! 0 ! ! , \" ! ! * ! \" 1 5 ! / ) % % * * , ) ! !# ! :; \"! ! #...
Counting II permutations and combinationsPath: UCSB >> CS >> 40 Fall, 2004
Description: CS40, Fall 2004 Wim van Dam Room 5109, Engr. 1 vandam@cs.ucsb.edu http:/www.cs.ucsb.edu/~vandam/ CS40, Wim van Dam, UCSB Formalities Homework is announced and is due. .next Friday (Nov 19) No class this Thursday WvD will be away for the rest of...
sp03_homequiz_6_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 2001 John Kubiatowicz Homework Quiz (HW #6) November 21, 2001 CS152 Computer Architecture and Engineering This quiz combines two of the problems from hom...
sp03_prereq_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Prerequisite Quiz February 3, 2003 CS152 Computer Architecture and Engineering This prerequisite quiz will be used in determining...
Big-O notation complexity theory P versus NPPath: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $ \" -+ \" ! % -\' /+ \' 0 + # )* + % -! -* ! ! ,! ! \"- + ! ! ! ! (* ! ! % . % . - ! % ! \"+ 1\"! ! ! 2/ % . !# 2 ( % . \' 3 1! 4 \' 5 ! + 6 ! -7 ! # 7 8 9 ! !% + * * ! ! : * ! ! ! *! \" \" ! * ! # ;# < ! * # = > *...
sp03_homequiz_2_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #2) SOLUTIONS February 12, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problem...
sp03_homequiz_3_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #3) SOLUTIONS March 5, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems fr...
sp03_homequiz_4_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 2001 John Kubiatowicz Homework Quiz (HW #4) October 17th, 2001 CS152 Computer Architecture and Engineering This quiz covers one of the problems from home...
sp03_homequiz_5_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 2001 John Kubiatowicz Homework Quiz (HW #5) November 7, 2001 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewo...
Complexity of computation big-O notationPath: UCSB >> CS >> 40 Fall, 2004
Description: !\"#$% $! # ,. 100 ! ! % 3) 4 5 9! % % 46 4# \" \" % 2 ! 2 0; ( ! < ! \' 75 % 48 2 *# + > \' : 9! ) \' = ! 0 0 0 0 7 0 4 ! ! ! 22 ? ! 1 *\"! 0!* 2 2 0 ! !2 ! @ ! ! \" ! @ !* % 2 ! 2 ! *8 < ! 0< 2 ! ...
midterm2_solnPath: Berkeley >> CS >> 152 Spring, 2003
Description: CS152 Spring `03 Midterm II Page 1 University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Midterm II SOLUTIONS May 7th, 2003 CS152 Computer Architecture and Engineering Your Name: S...
midterm1_solPath: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Midterm I March 12, 2003 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Problem 1 2 3 4 ...
sp03_homequiz_6Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #6) April 23, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewo...
sp03_homequiz_5Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #5) April 9, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewor...
sp03_homequiz_2Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #2) February 12, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems from hom...
sp03_homequiz_3Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #3) March 5, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewor...
sp03_homequiz_4Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Homework Quiz (HW #4) SOLUTIONS March 19th, 2003 CS152 Computer Architecture and Engineering This quiz covers one of the problems...
midterm2Path: Berkeley >> CS >> 152 Spring, 2003
Description: CS152 Spring `03 Midterm II Page 1 University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Midterm II May 7th, 2003 CS152 Computer Architecture and Engineering Your Name: SID Number:...
midterm1Path: Berkeley >> CS >> 152 Spring, 2003
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2003 John Kubiatowicz Midterm I March 12, 2003 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Problem 1 2 3 4 ...
fa99_midterm1_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Midterm I SOLUTIONS October 6, 1999 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Proble...
fa99_midterm2_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: CS152 Fall \'99 Midterm II Page 1 University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Midterm II SOLUTIONS November 17, 1999 CS152 Computer Architecture and Engineering Your Name: S...
fa99_prereq_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Prerequisite Quiz SOLUTIONS September 1, 1999 CS152 Computer Architecture and Engineering This prerequisite quiz will be used in de...
fa99_homequiz_6_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #6) SOLUTIONS November 10, 1999 CS152 Computer Architecture and Engineering This quiz combines two of the proble...
fa99_homequiz_5_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #5) SOLUTIONS October 27, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems f...
fa99_homequiz_4_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #4) SOLUTIONS October 13, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems f...
fa99_homequiz_3_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #3) September 29, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from home...
fa99_homequiz_2_solnPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #2) September 15, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from home...
IntroPath: Stanford >> CS >> 256 Winter, 2007
Description: CS256 Winter 2007 Facts sheet Instructor: Zohar Manna Office: Gates 481 Email: zm@theory.stanford.edu Office hours: By appointment. Teaching Assistant: Matteo Slanina Office: Gates 460 Email: matteo@cs.stanford.edu Office Hours: Tuesday & Thursday...
CS256 Win07Path: Stanford >> CS >> 256 Winter, 2007
Description: Formal Methods for Concurrent and Reactive Systems CS256, Winter 2007, Stanford University Latest News Logistics Documents Latest News Grades have been posted on Axess. You can pick up your graded finals and sample solutions from Wendy. Good job eve...
fa99_midterm2Path: Berkeley >> CS >> 152 Fall, 1999
Description: CS152 Fall \'99 Midterm II Page 1 University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Midterm II November 17, 1999 CS152 Computer Architecture and Engineering Your Name: SID Number:...
fa99_prereqPath: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Prerequisite Quiz September 1, 1999 CS152 Computer Architecture and Engineering This prerequisite quiz will be used in determining ...
fa99_homequiz_5Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #5) October 27, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewo...
fa99_homequiz_6Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #6) November 10, 1999 CS152 Computer Architecture and Engineering This quiz combines two of the problems from hom...
fa99_midterm1Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Midterm I October 6, 1999 CS152 Computer Architecture and Engineering Your Name: SID Number: Discussion Section: Problem 1 2 3 4 T...
fa99_homequiz_2Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #2) September 15, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from home...
fa99_homequiz_3Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #3) September 29, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from home...
fa99_homequiz_4Path: Berkeley >> CS >> 152 Fall, 1999
Description: University of California, Berkeley College of Engineering Computer Science Division EECS Fall 1999 John Kubiatowicz Homework Quiz (HW #4) October 13, 1999 CS152 Computer Architecture and Engineering This quiz covers one of the problems from homewo...
solutionhw10Path: UIllinois >> PHYS >> 598 Fall, 2007
Description: Solutions to Homework Set 10 Dielectric Sphere: The solution outside will be of the form out (r, ) = -E0 rP1 (cos ) + = while, inside in (r, ) = A1 rP1 (cos ). These terms have been selected to match the asymptotically uniform electric field at infin...