Assignment on Design and Analysis of
Algorithms
Instruction: After reading the following approaches, problems or algorithms, write a concrete
notes and do elicitations by taking examples. Your note would be composed of introductory
section, algorithms and its elicitations, complexity analysis, practical application areas, and
conclusions.
1. Back tracking approach*
2. Branch and bound approach* NBs:
3. Probabilistic Algorithms*
i. The first four starred points must
4. P, NP, NP-hard and NP-complete be addressed by all groups.
ii. The remaining 12 questions are
problems* randomly dispatched to different
5. Traveling Salesman Problem groups.
iii. There must be a maximum of five
6. Longest Common Sub-Sequence members in a group.
iv. Your writing must be complete and
7. Ford-Fulkerson method concrete enough to address all the
8. Rod cutting problem issues under the topics.
v. All your works are presentable and
9. Hiring problem you will be given with enough time
to present; all the group members
10. Huffman coding might have chances to present
11. Vertex Covering Problem their work.
vi. Questions will be asked, and
12. 8 Queens Problem answering the questions has its
own value.
13. Graph Coloring
vii. Your evaluation is out of 20% i.e.
14. Hamiltonian Cycle 10% documentation, 5%
presentation and 5% will be your
15. Strassen’s matrix multiplication team spirit.
16. Breadth First Search and Depth viii. Deadlines: Document submission
(Jan 9, 2025 till 6:00PM) and
First Search presentation date (Jan 10, 2025 in
the afternoon as of 2:30 PM).
ix. Any submissions after the due date
will never be considered.
x. All or parts of the topics will
appear on your final exam.
1 By Gezahegn G. CS-III
Dec 12, 2024
