首页 新闻 聚焦 科技 财经 创业 综合 图片 视频

IT界

旗下栏目: 行业 生态 IT界 创新

COMPSCI 33程序代做、代做data课程程序

来源:互联网 发布时间:2020-10-02
COMPSCI 33程序代做、代做data课程程序
COMPSCI 335 1 A#2.2
Assignment #2.2 – Hamming REST for Shakespearean Monkeys
Specs
The following assignment, A#2.3, will build an application that illustrates the
Shakespearean Monkeys genetic algorithm -- cf. lecture demo and the Infinite Monkey
Theorem:
https://en.wikipedia.org/wiki/Infinite_monkey_theorem
The current assignment, A#2.2, is a small preliminary step, preparing the servers and
their connections.
We use ASP.NET, But to avoid needless complexities, we use the upper open source
layer known as Carter, which features quite a few functional elements.
We set up two standalone REST Carter servers: (1) Monkeys, listening on http 8081 and
https:8082; and (2) Fitness, listening on http 8091 and https:8092. Here, the client will
be simulated by testing scripts using curl and httprepl.
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 …/try
3. Monkeys posts the received genome text to Fitness …/assess
4. Fitness Responds to Monkeys with the Hamming distance between its stored
target text and the received genome text
COMPSCI 335作业代做、代做data课程作业
5. Monkeys returns this integer in his response to Client
COMPSCI 335 2 A#2.2
Note
If strings have unequal lengths, then the Hamming distance is first computed for their
minimum length, and then added with their lengths difference.
Sample
Target text:
[To be or not to be, that is the question]
Candidate Genome text:
[To be~orAnoa [OBbej tVat i.Xt<eLju(s2ion]
Hamming Distance: 15
Submission
Submit two files, one for each server, called: upi-fitness, and upi-monkeys, where upi is
your own upi, e.g. jbon007.
Due date: Monday 5 October, 23:00, to ADB
 
如有需要,请加QQ:99515681 或邮箱:99515681@qq.com 微信:codehelp
  免责声明:珠穆朗玛网对于有关本网站的任何内容、信息或广告,不声明或保证其正确性或可靠性,用户自行承担使用网站信息发布内容的真假风险。
责任编辑:珠穆朗玛网