Assignment 4数据分析assignment代写 CompareDesigns: Write 1.5-2 page essay (max 12-point font), comparing and contrasting the Backtracking versus Branch-and-BoundComplete 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 complexityf)Add code to capture comparison of keys and assignment ofrecords:Graph these results and compare across datasets andalgorithmsCompare to runtime results and comparison of keys and assignments ofDocument 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代写数据分析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 byTurnItIn3)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-treec)Binary Search Tree versus 3-2treed)Selection Algorithm 8.5 versus Algorithm 8.6 versus Algorithm7Record 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 videoGrading Rubric 数据分析assignment代写

所有的编程代写范围：essayghost为美国、加拿大、英国、澳洲的留学生提供C语言代写、代写C语言、C语言代做、代做C语言、数据库代写、代写数据库、数据库代做、代做数据库、Web作业代写、代写Web作业、Web作业代做、代做Web作业、Java代写、代写Java、Java代做、代做Java、Python代写、代写Python、Python代做、代做Python、C/C++代写、代写C/C++、C/C++代做、代做C/C++、数据结构代写、代写数据结构、数据结构代做、代做数据结构等留学生编程作业代写服务。