Assignment 4
数据分析assignment代写 CompareDesigns: Write 1.5-2 page essay (max 12-point font), comparing and contrasting the Backtracking versus Branch-and-Bound
Complete the below exercises:
Assignment 4 数据分析assignment代写
1)CompareDesigns: Write 1.5-2 page essay (max 12-point font), comparing and contrasting the Backtracking versus Branch-and-Bound design approaches, using your own words. Discuss how they compare to brute-force approach. In addition, discuss the differences and similarities (implementation and performance) between the solution for knapsack problem using Backtracking (Algorithm 5.7) versus Branch and Bound (Algorithm 6.2). The essay needs to be graduate level depth and breadth and at least 50% original thought. Note that work which is not written in student’s own words will not earn credit. Changing words to their synonyms is not sufficient and often changes the meaning of the context or makes it read as garbage because technical terms are changed incorrectly.
2) CompareSorts:
a)Implement the Selection Sort (Algorithm 7.2 pp. 292) and Insertion Sort (Algorithm 7.1 pp. 288-289) in Python programming language.
b)Program files should have your name at the top in a comment, with short description of what is implemented in that program/file. Make sure your file(s) have appropriatenames for this exercise. Program should write output to the Console and have hard coded input in main.数据分析assignment代写
c)In the video explain each of the algorithms and implementations, run the testprogram and discuss the output.
d)Capture runtime (how long it took tosort):
- Use 3 different data sets: random values, already sorted, and sorted in oppositeorder of at least 2,000-10,000 elements each data set for each sorting algorithms.
- That means run for 5 different number of elements for each data set (e.g. 2000, 4000, 6000, 8000, 10000) to compare the runtime and see a growth trend when you graph it.
- That means you will have 3 types of datasets (random, sorted, reverse sorted) times5 different inputs (number of elements) for a total of 15 runtime results for each algorithm.数据分析assignment代写
e)Graph the results using line graph (a) comparing the 3 dataset type results for the same algorithm to analyze and discuss the differences/similarities of growth rate trend for different input type and how it compares to time complexity (b) comparing the same dataset type for the different algorithms and again analyze and discuss the differences/similarities of growth rate trend for same input but different sortingalgorithm and how it compares to time complexity
f)Add code to capture comparison of keys and assignment ofrecords:
- Graph these results and compare across datasets andalgorithms
- Compare to runtime results and comparison of keys and assignments of
- Document runtime data used, how it was generated, and the results (values and graphs) as well as the comparison of time complexity relative to datasets runtime, comparison of keys, and assignment of records.数据分析assignment代写
g)Document your conclusions based on your experiment discussing impacts of different data sets on performance, time complexity versus runtime complexity, andperformance relative to comparison of keys and assignment of records. Discuss whether your experiment support the time complexity for best-average-worst cases.
h)Determine and document which algorithm is more appropriate to find the smallestvalue when algorithm is sorting for increasing order. Explain why the algorithm you chose is more appropriate.数据分析assignment代写
i)In the video explain the implementation of each algorithm; show the programs running for one set of data and explain theoutput;
j)Submit all sorting code in one zip/rar file and analysis report as PDF or Word document to be checked byTurnItIn
3)CompareSearch: 数据分析assignment代写
Describe each algorithm and discuss the advantages of using each of the following instead of the other. The short essay answers need to be graduate level depth and breadth and at least 50% original thought. Note that work which is not written in student’s own words will not earn credit. Changing words to their synonyms is not sufficient andoften changes the meaning of the context or makes it read as garbage because technical terms are changed incorrectly.
a)Binary Search versus Interpolation Search(A8.1)
b)Binary Search Tree with balancing mechanism versusB-tree
c)Binary Search Tree versus 3-2tree
d)Selection Algorithm 8.5 versus Algorithm 8.6 versus Algorithm7
Record a video about 10-15min long with the information and explanation as indicated by the above exercise instructions.数据分析assignment代写
Submission instructions: Submit one file (Word or PDF) with essays, textual answers and analysis (needs to run through TurnitIn and cannot be in zip file); second file (rar or zip) with all the source code; and third file with the zip/rar of video
Grading Rubric 数据分析assignment代写
| Points | Criteria |
| 30 | CompareDesign:
· The compare and contrast is complete, written in student’s own words, represents graduate level depth and breath, has at least 50% original thought, uses appropriate examples to support the discussion, and does not plagiarize any of the materials. · Discussion includes comparison of the two approaches and pros and cons for knapsack solution using Backtracking (Algorithm 5.7) versus Branch and Bound (Algorithm 6.2). 数据分析assignment代写 |
| 40 | CompareSorts:
· Programs use object oriented program approach. Programs have the appropriate naming convention, author’s name, and brief description of the implementation in each file |
| · Code implements the Selection Sort (Algorithm 7.2 p. 292) and Insertion Sort (Algorithm 7.1 pp. 288-289) in Python programming language, has no syntax errors, appropriate hardcoded input in main, appropriate output, and appropriate file and class/method names for this exercise.数据分析assignment代写
· There is document with runtime analysis (data and results) of both algorithms using different data sets (already sorted, sorted in opposite order, and random) and for 5 different input length; data is graphed correctly; there is time efficiency analysis, comparison of the algorithms’ performance relative to runtime, comparison of keys and assignment of records; and student’s conclusions based on the overall experiment and analysis. · Video correctly explains the solution and implementation of each algorithm; shows the programs running for one set of data; and explains the output |
|
| 30 | CompareSearch:
· The compare and contrast is complete for each answer, written in student’s own words, represents graduate level depth and breath, has at least 50% original thought, uses appropriate examples to support the discussion, and does not plagiarize any of the materials.数据分析assignment代写 · The answer includes how the algorithms work and what advantages/disadvantages they have relative to each other. |
其他代写: 代写CS C++代写 java代写 r代写 金融经济统计代写 matlab代写 web代写 app代写 作业代写 物理代写 数学代写 考试助攻 python代写
