sdananjaya

09-01-2011, 05:18 PM

Algorithm Simulator:

Objective:

The objective of this assignment is to develop a simulator for at least two algorithms that you are familiar with.

Features that you should include in your solution:

You can select at least two of the following algorithm for simulation.

1. Insertion sort algorithm

2. Selection sort algorithm

3. Quick sort algorithm

4. Merge sort algorithm

5. Heap sort algorithm

6. Bubble sort algorithm

7. Shell sort

8. Radix sort

9. Depth first search algorithm

10. Breadth first search algorithm

11. Kruskal’s algorithm

12. Prim’s algorithm

13. Dijkstra’s algorithm

14. Shannon Fano algorithm

15. Huffman algorithm

16. Rabin karp algorithm

You can use any programming language for the simulator development. The simulator should work as a e-learning tool for beginners to the algorithm field. User should be able to upload input values to the system and it should simulate each line execution of the algorithm.

Instruction for submission and demonstration

You should include:

1. A printout of all source code for the programs with proper in-line documentation.

2. Description for any cases for which your program is not working correctly.

3. Sample inputs and outputs from your running programs.

Your submission must have a cover page, which must include:

1. The words “Design and Analysis of Algorithms 214”.

2. Your name and DIT number.

3. A signed statement that the assignment is your own work.

3. Put all your source code in directory with your DIT number. The soft-copy of your assignments should be uploaded to the course web on the specified due date for the assignment. Late assignments will not be accepted.

4. Due dates and other arrangements may only be altered with the consent of the majority of the students enrolled in the unit and with the consent of the lecturer.

5. Demonstration requirements:

1. You may be required demonstrate your working program and/or sitting in a quiz during practical sessions.

2. The source code MUST be that submitted.

3. The programs should run on the department’s machines.

Failure to meet the above-mentioned requirements will result in the fail the subject.

Objective:

The objective of this assignment is to develop a simulator for at least two algorithms that you are familiar with.

Features that you should include in your solution:

You can select at least two of the following algorithm for simulation.

1. Insertion sort algorithm

2. Selection sort algorithm

3. Quick sort algorithm

4. Merge sort algorithm

5. Heap sort algorithm

6. Bubble sort algorithm

7. Shell sort

8. Radix sort

9. Depth first search algorithm

10. Breadth first search algorithm

11. Kruskal’s algorithm

12. Prim’s algorithm

13. Dijkstra’s algorithm

14. Shannon Fano algorithm

15. Huffman algorithm

16. Rabin karp algorithm

You can use any programming language for the simulator development. The simulator should work as a e-learning tool for beginners to the algorithm field. User should be able to upload input values to the system and it should simulate each line execution of the algorithm.

Instruction for submission and demonstration

You should include:

1. A printout of all source code for the programs with proper in-line documentation.

2. Description for any cases for which your program is not working correctly.

3. Sample inputs and outputs from your running programs.

Your submission must have a cover page, which must include:

1. The words “Design and Analysis of Algorithms 214”.

2. Your name and DIT number.

3. A signed statement that the assignment is your own work.

3. Put all your source code in directory with your DIT number. The soft-copy of your assignments should be uploaded to the course web on the specified due date for the assignment. Late assignments will not be accepted.

4. Due dates and other arrangements may only be altered with the consent of the majority of the students enrolled in the unit and with the consent of the lecturer.

5. Demonstration requirements:

1. You may be required demonstrate your working program and/or sitting in a quiz during practical sessions.

2. The source code MUST be that submitted.

3. The programs should run on the department’s machines.

Failure to meet the above-mentioned requirements will result in the fail the subject.