CSE 5314 Homework Set 1

Presentations Tentatively February 24 & 26

Reservations at http://reptar.uta.edu/NOTES5314/hw1.txt

Each student should choose three problems from at least two different chapters.

1.	1.1 A. Kamdar

2.	1.2 H. Kearny

3.	1.3 Y. Bai

4.	1.4 Y. Bai

5.	1.5 S. Sanyal

6.	1.6

7.	1.7 S. Kalasapur

8.	1.8 R. Huang

9.	1.9 W. Choi

10.	1.10 S. Sanyal

11.	1.11

12.	1.12 W. Choi

13.	1.13

14.	2.1 S. Sanyal

15.	2.2

16.	2.3 A. Kamdar

17.	2.4 J. Qingchun

18.	2.5 R. Huang

19.	2.6

20.	3.1 R. Huang

21.	3.2 J. Qingchun

22.	3.3 Y. Bai

23.	3.4 T. Rethard

24.	3.5 (corrected) Prove that CLOCK is not a marking algorithm.
        H. Kearny

25.	3.5 (corrected) Prove that FWF is a marking algorithm.
        S. Kalasapur

26.	3.6 T. Rethard

27.	3.7 W. Choi

28.	3.8 S. Kalasapur

29.	3.9 J. Qingchun

30.	3.10 A. Kamdar

31.	4.1

32.	4.2 T. Rethard

33.	Simplify the proof of Lemma 4.1 

34.	4.3

35.	4.5 H. Kearny

36.	4.6