add list of assignments

1 files changed, 35 insertions, 0 deletions

diff --git a/0x05/README.md b/0x05/README.md
new file mode 100644
index 0000000..88e7f3f
--- /dev/null
+++ b/0x05/README.md
@@ -0,0 +1,35 @@
+# Computer Science 372: Design and Analysis of Algorithms
+## Assignment 5: Project
+
+* Weight: 15% of your final grade
+* Due: Before you write the final Examination
+
+Select and complete one of the following projects, and submit it for evaluation and feedback.
+
+1. Implement the Vertex Cover problem; that is, given graph G and integer k, answer the question of whether or not there is a vertex cover of size k or less. Begin by using a brute-force algorithm to check all possible sets of vertices of size k to find an acceptable vertex cover, and measure the running time on a number of input graphs. Then try to reduce the running time using any heuristics you can think of. Next, try to find approximate solutions to the problem in the sense of finding the smallest set of vertices that forms a vertex cover and analyzing its running time.
+2. Do the Problem 35-1 from the textbook – Bin packing.
+
+You can implement the solution in Java, C/C++, or Python although Java is preferred. Do not use any downloaded code or any API/template.
+
+## What to Hand In
+
+This applies to both problems. Hand in one file written in English and named 'idnumber-name-p1.zip', where you provide your student ID number and name.
+
+All the following files must be included:
+
+1. Experimental report. Submit a PDF or Microsoft Word. Other file formats are not acceptable. The report should include the following:
+  a. A description of your software and hardware environment for developing the project.
+  b. The design of the algorithm.
+  c. Testing input data and the results and complexity analysis. You should include some screen shots showing the running scenarios and the running results.
+  d. A user manual explaining how to run your project.  
+  e. Discussions and reflection on knowledge gained.
+  f. References.
+2. The commented source code and the executable file.
+
+## Grading Criteria
+
+* Proving when needed, coding, and its correctness and/or efficiency (40 marks)
+* The design of the algorithm (20 marks)
+* The test data, results, and analysis (15 marks)
+* User manual (15 marks)
+* Overall impression (10 marks)