” COMPSCI 33程序 写作、 写作data课程程序COMPSCI 335 1 A#2.2Assignment #2.2 Hamming REST for Shakespearean MonkeysSpecsThe following assignment, A#2.3, will build an application that illustrates theShakespearean Monkeys genetic algorithm — cf. lecture demo and the Infinite MonkeyTheorem: httpss://en.wikipedia.org/wiki/Infinite_monkey_theoremThe current assignment, A#2.2, is a small preliminary step, preparing the servers andtheir connections.We use ASP.NET, But to avoid needless complexities, we use the upper open sourcelayer known as Carter, which features quite a few functional elements.We set up two standalone REST Carter servers: (1) Monkeys, listening on https 8081 and httpss:8082; and (2) Fitness, listening on https 8091 and httpss:8092. Here, the client willbe simulated by testing scripts using curl and httpsrepl.With the two servers running (on localhost):1. Client posts a target text to Fitness /target (empty ok response)2. Client posts a genome (candidate) text to Monkeys /try3. Monkeys posts the received genome text to Fitness /assess4. Fitness Responds to Monkeys with the Hamming distance between its storedtarget text and the received genome textCOMPSCI 335作业 写作、 写作data课程作业5. Monkeys returns this integer in his response to ClientCOMPSCI 335 2 A#2.2NoteIf strings have unequal lengths, then the Hamming distance is first computed for theirminimum length, and then added with their lengths difference.SampleTarget text:[To be or not to be, that is the question]Candidate Genome text:[To be~orAnoa [OBbej tVat i.XteLju(s2ion]Hamming Distance: 15SubmissionSubmit two files, one for each server, called: upi-fitness, and upi-monkeys, where upi isyour own upi, e.g. jbon007.Due date: Monday 5 October, 23:00, to ADB如有需要，请加QQ：99515681 或邮箱：99515681@qq.com
“
添加老师微信回复‘’官网 辅导‘’获取专业老师帮助，或点击联系老师1对1在线指导。
