Homework 7

•Write a program to calculate the probability:

–
Input:

• •G=(V,E)

• •Pr (two nodes have a common key) =a

–
Output:

• •Let E’ (which is a subset of E) denote the subset of secure channels, calculate the probability that G=(V,E’) is a connected graph.

–Due: June 4th

Homework 6

n

nExercise: Write a program to find another pair of (b,N) such that N is a composite number and bN-1=1 (mod N).

Hint: Prof. Wu has already shown that a pair (b,N)=(8,9). Can you find another pair where both b and N are smaller than 100?

Note: You need to submit both your program and the value of b and N.

n
Due: May 29th

5/19 投影片已上網

5/19 我要補充說明 Securing Wireless Sensor Networks, 內容和上星期五韓永祥教授談的應該很類似。希望對同學們瞭解 algorithm 如何應用在其他領域有所幫助。

報告順序因此有些順延，請大家留意一下 http://solomon.ipv6.club.tw/Course/Algorithm/ 的時間表。

Quincy Wu
May 17

5/17 投影片已上網

這星期二我們講 Prime Number Testing. 請大家到
http://solomon.ipv6.club.tw/Course/Algorithm/
下載講義。

Quincy Wu
May 16