Help me to understand my assignment question
Wait! I am not asking the solution for my assignment. Since I am new to programming, I am finding it difficult to understand what kind of answer is expected for my assignment. My assignment problem is as follows:
Implement Heap sort to arrange the given ‘n’ numbers in descending order. Also, prepare the following:
* Problem statement
* Description/UseCases/Scenarios
* Design/Algorithm/Flowchart
* Code - C or Java
* TestCases/TestResults
* Output screenshots
I have already prepared the code for the problem in C and I have the output screenshots of my code. But I don't understand what kind of answer to provide for the Problem statement, Description/UseCases/Scenarios, Design/Algorithm/Flowchart and TestCases/TestResults. In fact, I don't understand what they all mean. Please help me figure out what they mean.
I don't know if these kind of questions are off-topic here. But please do try to help me.
Implement Heap sort to arrange the given ‘n’ numbers in descending order. Also, prepare the following:
* Problem statement
* Description/UseCases/Scenarios
* Design/Algorithm/Flowchart
* Code - C or Java
* TestCases/TestResults
* Output screenshots
I have already prepared the code for the problem in C and I have the output screenshots of my code. But I don't understand what kind of answer to provide for the Problem statement, Description/UseCases/Scenarios, Design/Algorithm/Flowchart and TestCases/TestResults. In fact, I don't understand what they all mean. Please help me figure out what they mean.
I don't know if these kind of questions are off-topic here. But please do try to help me.
The problem statement is basically what was given to you; what problem does your program solve? What does it do?
Description/use cases/scenarios: When do you use your program? Why would you want a program that can do what it does?
Design/algorithm/flowchart: How does your program work? Show how you implemented the heap sort and used it to produce the results the problem was asking for. Use a flowchart to show the flow of execution.
Test cases/results: How do you know the program works? Show a few example inputs you gave and confirm that is gives the correct output for all of them. This should probably tie in to your output screenshots.
Description/use cases/scenarios: When do you use your program? Why would you want a program that can do what it does?
Design/algorithm/flowchart: How does your program work? Show how you implemented the heap sort and used it to produce the results the problem was asking for. Use a flowchart to show the flow of execution.
Test cases/results: How do you know the program works? Show a few example inputs you gave and confirm that is gives the correct output for all of them. This should probably tie in to your output screenshots.
Topic archived. No new replies allowed.