|
|
|
Last revised September 9, 2018
The
contents of this website, the links contained therein directly and
indirectly, and the contents of the said links, are copyrighted.
They are provided exclusively for
non-profit educational use by the students currently enrolled in this
course and for the duration of this semester. No other use or any use
by others is allowed
without authorization of the professor in this course and copyright
holder or holders.
Homework
The Homework page for CSC 401 is part of the requirements for CSC 501 and is subject to change as I will cover the course material. You are
welcome to do your homework in advance, but by doing so you accept the risk
that the homework you have done might have been changed or deleted.
Some test and final questions may be similar to some homework problems,
so although homework yields no credit (unless noted otherwise), doing
all homework is likely to help you get a better grade in this course.
Go to Homework for CSC 401 for the most recent homework.
Click
here for the most recent graduate homework.
Graduate H/W # 1
No credit.
Do by February 22, 2016.
Prove cases 1 and 2 of Theorem 3.17 (Master Theorem) of Section 3.7.1, page 139.
|
Graduate H/W # 2
No credit.
Do by March 21, 2016.
(i) Implement
parallel Mergesort program in Java, as described in section 14.5.
(ii) Provide the
complete trace of its execution on these three arrays:
1, 2, 3, 4, 5.
1, 5, 2, 4, 3.
5, 4, 3, 1, 2.
(iii)
Provide in-depth comparison of the time complexity of your program with
the sequantial version of Mergesort of section 4.6. Use the above three
arrays as illustrative examples of your comparison.
|
Graduate H/W # 3
No credit.
Do by: April 23, 2016.
(i) Implement
All-pairs Shortest Paths program in Java, as described in section 9.4.
Required output: distance matrix.
(ii) Run your program
for graphs indicated in exercises 9.7 and 9.8 pp. 447-448.
(iii) Answer question
9.8 b. page 448.
(iv) Do exercise 9.6
page 447.
|
|
|
|
|
|
|
