0% found this document useful (0 votes)
16 views2 pages

CS 211 Fall 2024 Project Guideline - Student Version-1

Uploaded by

margenmohamed
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
0% found this document useful (0 votes)
16 views2 pages

CS 211 Fall 2024 Project Guideline - Student Version-1

Uploaded by

margenmohamed
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/ 2

CS211 Data Structure and Algorithms Project Guideline (Fall 2024)

Below are the guidelines for completing your project and writing the project report.

Section 1: Introduction and Problem Identification

1.1: Clearly describe the objective of your project.


1.2: Provide a detailed explanation of the problem being addressed.
1.3: Outline the input, output, requirements, and challenges associated with your project.

Section 2: Problem Formulation

2.1: Describe the algorithm you intend to use.


2.2: Identify and justify the data structure chosen for your algorithm.
2.3: Present the pseudo-code for your algorithm.
2.4: Provide a justification for why your algorithm is correct.
2.5: Analyze the time complexity of your algorithm in Big-O notation for best, worst, and
average cases.
2.6: Explain how to calculate the “number of steps” for different cases (best, worst, and average).

Section 3: Solving the Problem

3.1: Detail the implementation process of your algorithm, including:

• Explanation of methods and their roles.


• The sequence of execution of the methods.
3.2: Develop and document test cases, including:
• Best case, worst case, average case, and boundary conditions.
• Present the test cases in a table format for clarity.

Section 4: Experiments

4.1: Execute your program with input sizes ranging from small to large (e.g., nn small to big) and
test various scenarios from Section 3.2.
4.2: Systematically collect input and output data during experiments and tests.
4.3: Document the input and output data for different scenarios, including screen captures or
sample outputs where applicable.
• Use tables for better organization and presentation.

Section 5: Analyzing Test Results

5.1: Plot the collected data (input vs. output) and create a graph to visualize the number of steps.
5.2: Compare the plotted data with the Big-O notation derived in Section 2.5.

Section 6: Conclusion

6.1: Summarize the insights and challenges encountered during the project.
6.2: Reflect on the findings and discuss potential improvements, including:

• Alternative algorithms or data structures and reasons for not using them.
• Suggestions for future enhancements to extend the project.

Appendix

Attach the complete Java code for your project.

Submission

• Report Length: The project report should be 5–10 pages, excluding the code.
• First Presentation: (Date TBA) Present your project to the instructor, who may ask
questions and suggest changes.
• Final Submission: (Date TBA) Submit your completed project along with the final
project report.

Marking Policy

• 9–10: Exceeds Expectation (EE) – Student has completed all assigned tasks exceptionally
well.
• 7–8: Meets Expectation (ME) – Student has met all required tasks satisfactorily.
• 5–6: Needs Improvement (NI) – Some tasks are incomplete or need improvement.
• 0–4: Unsatisfactory (U) – Project is incomplete or fails to meet the requirements.

You might also like