Computer Science 174 - Spring 1999 - Canny - Midterm 2

Computer Science 174 - Spring 1999 - Canny - Midterm 2 -...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS174 Midterm 2 Spring 99 J. Canny April 6 This is a closed-book exam with 4 questions. You are allowed to use the 4 sides of notes that you brought with you. The marks for each question are shown in parentheses, and the total is 80 points. Make sure you allocate enough time to attempt all the questions. Write all your answers in this booklet. Good Luck! NAME SID Number 1 1. (20 points) Give brief answers to the following: (a) (4 points) In the byzantine agreement algorithm, do all good processors set their output bits permanently on the same round? (b) (4 points) The data-punctuated token trees from class dont work on a string of the same character repeated many times. How would you fix that? (c) (4 points) In the fingerprint algorithms from class, the sequence of characters is con- verted to a polynomial, evaluated, and then reduced modulo a prime. Why is a prime used rather than a non-prime modulus?...
View Full Document

Page1 / 5

Computer Science 174 - Spring 1999 - Canny - Midterm 2 -...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online