Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
12 views1 page

DAA Assignment

The document outlines a group assignment focused on various algorithmic approaches and problems, including backtracking, branch and bound, and probabilistic algorithms. It specifies the structure of the notes, including introductory sections, complexity analysis, and practical applications, while also detailing group dynamics, deadlines, and evaluation criteria. The assignment emphasizes the importance of thorough documentation and presentation, with specific due dates for submissions and potential exam relevance.

Uploaded by

Caleb fikadu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views1 page

DAA Assignment

The document outlines a group assignment focused on various algorithmic approaches and problems, including backtracking, branch and bound, and probabilistic algorithms. It specifies the structure of the notes, including introductory sections, complexity analysis, and practical applications, while also detailing group dynamics, deadlines, and evaluation criteria. The assignment emphasizes the importance of thorough documentation and presentation, with specific due dates for submissions and potential exam relevance.

Uploaded by

Caleb fikadu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

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* i. The first four starred points must be addressed
by all groups.
2. Branch and bound approach*
ii. The remaining 12 questions are randomly
3. Probabilistic Algorithms* dispatched to different groups.
iii. There must be a maximum of five members in
4. P, NP, NP-hard and NP-complete problems*
a group.
5. Traveling Salesman Problem iv. Your writing must be complete and concrete
enough to address all the issues under the
6. Longest Common Sub-Sequence
topics.
7. Ford-Fulkerson method v. All your works are presentable and you will be
8. Rod cutting problem given with enough time to present; all the
group members might have chances to present
9. Hiring problem their work.
10. Huffman coding vi. Questions will be asked, and answering the
questions has its own value.
11. Vertex Covering Problem vii. Your evaluation is out of 20% i.e. 10%
12. 8 Queens Problem documentation, 5% presentation and 5% will
be your team spirit.
13. Graph Coloring viii. Deadlines: Document submission (May 16,
14. Hamiltonian Cycle 2024 for all) and presentation date (May 17,
2024 in the afternoon as of 2:30 PM for
15. Strassen’s matrix multiplication regular, May 19, 2024 in the morning as of
16. Breadth First Search and Depth First Search 8:00AM for Weekend, May 21, 2024 in the
evening as of 5:00PM for night class).
ix. Any submissions after the due date will never
be considered.
x. All or parts of the topics will appear on your
final exam.

NBs:

By Gezahegn G. CS-III April 26, 2024


1

You might also like