data structure project

profileibrahim93
project_description.docx

AUM top.jpg

AUM logo cover.jpg

ECE 368 Data Structure Final Project

Semester: Spring 2013-2014

Project title: Sorting and Searching Algorithm Project

Instructor: Dr. Nour Moustafa

E-mail: [email protected]

Office Phone Ext: 1285

Abstract

The main purpose of this project is to link theory and practical solutions of Data Structure course to practice. The students will be required to implement one of the sorting or searching algorithms in the Algorithm IN C book. Write in a report contains a description, the pros and cons, and an analysis of the Big O( ) of the algorithm. In addition provide a simple example to help the understanding. A report and a copy of the project's source code are required "Source code of your program".

Project Objectives: in completing this project, students will

· Enhance their ability on coding sorting and searching algorithms

· Understand the effect of big O( ) notation on different sorting and searching algorithm in detail

Each team needs to have different algorithms. Once the group decides their algorithm, they should provide me their team list as well as their algorithm.

Deliverables:

· The group member list is due on 10/03.

· Algorithm selection is due on 26/03.

· The first draft of the report is due on 09/04.

· The first attempt of the implementation (coding) is due on 28/04.

· The group needs to prepare a report and a 10-minutes presentation to explain the algorithm pros and cons and it’s Big O ( ) analysis on the implemented algorithm, second draft of the report and code are due on 07/05.

· This project will be due by 11/5/2014 – 8am.

What to Submit:

1. A report describing the selected algorithm including:

· The algorithm,

· Provide an simple example and figures to help the understanding,

· Also include your idea of how to implement the selected algorithm in real life.

2. 10 minutes presentation about 1 and 2 (everything listed above!!).

3. Source code of your program.

Assessment weight: 20% (application value, solution, report organizing, presentation, algorithm implementation)

Group size: 2-3

Grading:

· The first draft of the report 5%

· The first attempt of the implementation (coding) 5%

· Last stage and presentation 10 %

3

Academic Activities and Projects Semester: Spring Academic Year: 2013-2014