99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

代寫CS2910、代做c/c++語言程序

時間:2024-02-19  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



CS2910 Assessed Coursework 2
v2.0
This assignment must be submitted by 10am on the 8th of March 2024.
Feedback will be provided by 11th April 2024.
1 Learning outcomes assessed
This assignment assesses knowledge and understanding of finding paths using uninformed
search implemented in Prolog. In particular, the outcomes assessed are:-
• knowledge and understanding of uninformed search strategies such as depth-first search;
• application of uninformed search strategies to search problems represented as trees and
graphs;
• implementation of uninformed search strategies in Prolog;
• extensions of uninformed search strategies with a cost weighting.
2 Instructions
Submit this coursework using Moodle by clicking here. Your submission should consist of a
cs2910.zip file, compressing a file named cs2910CW2.pl, containing all parts of the coursework.
It is your responsibility to check that the submitted file:
1. is named correctly;
2. has no syntax errors;
3. runs with SWI Prolog 7.6+;
4. is not empty; and
5. is not corrupted.
1
Warning: If any of the above conditions (1...5) is violated, your mark will be set to 0.
You will be given an opportunity to resubmit for feedback purposes but the marks will
not count for assessment. Submission after the deadline will be accepted but it will automatically be recorded as being late and is subject to College Regulations on late submissions.
NOTE:
All the work you submit should be solely your own work. Coursework submissions
are routinely checked for this. Any assessment offence will be investigated subject to
the College regulations.
2
3 Searching using Prolog
3.1 Finding a path
Consider the plan of a house as shown in Fig. 1. Write a Prolog description of this plan
that allows a Prolog program search for paths between locations indicated on the plan. For
example, if one is Outside and wishes to find a path to the WC, then a possible answer can
be: Outside → Porch 1 → Kitchen → Leaving Room → Corridor → WC. Your program should
Figure 1: Top view of a two bedroom house showing how different locations in and out of
the house are connected.
avoid loops and be as general as possible, in that, given any two locations representing an
origin O and a destination D, it returns:
• a path P from O to D, if it exists;
• every possible path P from O to D, if there are more than one;
• meaningful error messages, if the wrong input is provided for O and D.
Comment the code submitted for this part to contain the name of the search algorithm that
you selected to find the path. [40%]
3.2 Paths ending at a common destination
Define a Prolog program that searches bi-directionally from two origins O1 and O2 to meet
up at a common destination D. It is up to you how you define that, perhaps by reusing parts
of the program you developed for section 3.1, however this time you do not have to check that
3
the input parameters are correct, simply assume they are. Your program should combine a
path P1 from O1 to D, with a path P2 from O2 to D, if they exist, to produce a combined path
P, showing how you reach meeting point D from O1 and O2 respectively. You are expected
to produce all possible combinations P1 and P2 to construct P non-deterministically, if we
ask for more answers. Test your program using Fig. 1 by asking different queries and see
whether your work produces the expected outcomes. Maximum marks will be obtained
for also providing a program that returns only the shortest paths P1 and P2 combined to
produce P. [30%]
3.3 Paths with Costs
Rewrite the problem description for the program you defined in section 3.1, to include the
individual cost C (an integer describing the distance in meters) between locations of the
house as shown in Fig. 2. Once you have a new representation that takes individual cost
between locations into account, rewrite also you search program to calculate the total cost
of a path, so that when you return a path P as a solution, you also return Ctotal. Your new
program should also return every path, if there is more than one, returning the cheap ones
first, and then the more expensive ones, in rank order. Then use your new program to define
how to meet up from two origins O1 and O2 to a destination D (as in 3.2), only if the cost
Ctotal is the same from both O1 and O2 respectively.
Figure 2: Cost between locations.
Test your program using Fig. 1 by asking different queries and see whether your work produces the expected outcomes. [30%]
4
Marking criteria
• Full marks will be given for implementations that address the requirements of all the
tasks and their sub-tasks as specified in this document.
• Marks will be allocated to the logic of the implementation strategies proposed as well
as their implementation .
• Marks will also be allocated in solutions which show understanding of Prolog unification, especially on the use of lists, the use of existing primitives that manipulate and
generate lists (like append/3, findall/3 or setof/3), including the relevance of all
these to the specific search requirements.
• Code quality: indentation, comments, variable naming, use of ‘ ’ variables, and appropriate use of Prolog control operators (e.g. the cut operator (!)).
• It is expected that the files you will submit are created using Linux and not
Windows, as the marking will be done on a Linux machine. The code should run
in SWI Prolog version installed on linux.cim.rhul.ac.uk. Implementations in any
other Prolog or programming language will not be accepted.
• Your code should compile successfully for full marks. If part of your code does not
compile, then wrap it in a comment of the form:
/* Partial Code:
....
End of Partial Code */
and we will try to mark any logic that is relevant to the required task.
請加QQ:99515681  郵箱:99515681@qq.com   WX:codehelp 

掃一掃在手機打開當前頁
  • 上一篇:代寫Business Decision Analytics
  • 下一篇:代做CS 532、Collaboration 代寫
  • 無相關信息
    合肥生活資訊

    合肥圖文信息
    急尋熱仿真分析?代做熱仿真服務+熱設計優化
    急尋熱仿真分析?代做熱仿真服務+熱設計優化
    出評 開團工具
    出評 開團工具
    挖掘機濾芯提升發動機性能
    挖掘機濾芯提升發動機性能
    海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
    海信羅馬假日洗衣機亮相AWE 復古美學與現代
    合肥機場巴士4號線
    合肥機場巴士4號線
    合肥機場巴士3號線
    合肥機場巴士3號線
    合肥機場巴士2號線
    合肥機場巴士2號線
    合肥機場巴士1號線
    合肥機場巴士1號線
  • 短信驗證碼 豆包 幣安下載 AI生圖 目錄網

    關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
    ICP備06013414號-3 公安備 42010502001045

    99爱在线视频这里只有精品_窝窝午夜看片成人精品_日韩精品久久久毛片一区二区_亚洲一区二区久久

          欧美一区二区三区日韩| 国产精品欧美经典| 亚洲一区在线看| 国产一区久久久| 欧美日韩另类在线| 麻豆成人在线观看| 欧美一区不卡| 一区二区三区久久精品| 黄色精品一区| 国产精品一区二区女厕厕| 欧美成人一区二免费视频软件| 亚洲男同1069视频| 亚洲免费福利视频| 亚洲乱码国产乱码精品精可以看| 国产一区二区三区四区在线观看| 国产精品va在线| 欧美精品国产精品日韩精品| 久久综合九色综合欧美狠狠| 久久riav二区三区| 欧美亚洲视频| 欧美一区二区三区精品电影| 亚洲一区免费看| 亚洲午夜成aⅴ人片| 一区二区三区久久| 亚洲欧美不卡| 羞羞答答国产精品www一本| 亚洲资源av| 午夜精品久久久久久99热| 亚洲一区3d动漫同人无遮挡| 亚洲大片av| 好吊一区二区三区| 亚洲国产婷婷香蕉久久久久久99| 在线视频国产日韩| 在线精品亚洲| 亚洲乱码视频| 亚洲欧美国产视频| 欧美一区二区三区免费观看视频| 午夜精品理论片| 久久精品72免费观看| 久久狠狠一本精品综合网| 久久久亚洲成人| 欧美成人免费全部观看天天性色| 欧美精品国产精品日韩精品| 欧美日一区二区三区在线观看国产免| 欧美色精品天天在线观看视频| 国产精品国产三级国产aⅴ浪潮| 国产精品欧美久久久久无广告| 国产精品亚洲综合一区在线观看| 国产亚洲欧美一级| 亚洲国产天堂久久综合| 一区二区三区不卡视频在线观看 | 国产综合亚洲精品一区二| 黄色一区二区三区四区| 亚洲精品一二区| 亚洲欧美韩国| 男女精品网站| 国产精品专区h在线观看| 激情欧美一区二区| 亚洲视频电影图片偷拍一区| 欧美一区二视频| 欧美日本一区二区高清播放视频| 国产精品视频在线观看| 亚洲激情专区| 欧美主播一区二区三区| 欧美日韩国产一区二区| 精品动漫3d一区二区三区免费版 | 国产人久久人人人人爽| 在线观看av不卡| 亚洲欧美日韩高清| 欧美日韩亚洲三区| 在线观看中文字幕不卡| 新片速递亚洲合集欧美合集 | 亚洲欧洲一区二区天堂久久| 亚洲免费婷婷| 欧美视频四区| 亚洲精品在线一区二区| 久久久久久久综合色一本| 欧美午夜宅男影院在线观看| 在线免费观看日本欧美| 欧美一二三区在线观看| 欧美日韩视频在线一区二区| 激情久久一区| 久久久国产精品亚洲一区 | 欧美在线国产精品| 国产精品欧美日韩| 一区二区三区日韩欧美精品| 欧美sm视频| 1769国产精品| 农村妇女精品| 精品动漫3d一区二区三区| 午夜亚洲福利在线老司机| 国产精品卡一卡二卡三| 亚洲尤物精选| 国产精品亚洲美女av网站| 亚洲欧美日韩天堂一区二区| 欧美三日本三级少妇三99| 一本到高清视频免费精品| 欧美日韩精品免费看| 亚洲精品日韩激情在线电影| 欧美高清不卡在线| 日韩亚洲欧美精品| 国产精品爱久久久久久久| 亚洲一区二区网站| 国产精品一区一区三区| 欧美伊久线香蕉线新在线| 国产亚洲欧美日韩一区二区| 久久久国产精品一区| 在线观看成人一级片| 欧美国产日韩免费| 一区二区三区鲁丝不卡| 欧美精品亚洲精品| 一区二区三欧美| 国产日韩欧美精品| 久久久国产一区二区三区| 狠狠色综合日日| 欧美日韩视频不卡| 欧美影院久久久| 亚洲第一毛片| 欧美日韩国产片| 欧美与黑人午夜性猛交久久久| 国产综合av| 欧美日韩国产精品专区 | 欧美日韩亚洲国产精品| 亚洲桃花岛网站| 在线精品一区| 欧美亚洲第一页| 久久综合狠狠综合久久综青草 | 亚洲美女黄色片| 国产日韩精品一区观看| 麻豆成人91精品二区三区| 一区二区三区导航| 在线日韩一区二区| 国产精品免费视频xxxx| 嫩草伊人久久精品少妇av杨幂| 这里是久久伊人| 亚洲激情在线播放| 国产亚洲网站| 国产精品v亚洲精品v日韩精品| 久久亚洲国产精品日日av夜夜| 亚洲手机视频| 亚洲福利视频一区二区| 国产精品一区二区久久精品 | 欧美日本在线播放| 久久中文精品| 欧美一级视频| 一本到高清视频免费精品| 亚洲第一精品久久忘忧草社区| 国产精品自拍网站| 欧美日韩免费观看一区=区三区| 久久精品水蜜桃av综合天堂| 亚洲免费在线看| 亚洲美女视频在线观看| 亚洲国内自拍| 伊大人香蕉综合8在线视| 国产精品影音先锋| 欧美四级伦理在线| 欧美色视频日本高清在线观看| 牛人盗摄一区二区三区视频| 久久久久综合一区二区三区| 亚洲欧美一区二区视频| 亚洲一区二区精品| 亚洲性感美女99在线| 一区二区三区av| 亚洲桃花岛网站| 亚洲性线免费观看视频成熟| 日韩视频在线观看一区二区| 亚洲三级免费观看| 亚洲片在线观看| 99国产精品私拍| 99视频精品| 亚洲小说欧美另类婷婷| 亚洲欧美卡通另类91av| 午夜在线a亚洲v天堂网2018| 欧美一二三区精品| 久久夜色撩人精品| 免费看亚洲片| 欧美另类99xxxxx| 国产精品高潮呻吟久久av无限 | 国产欧美一区二区三区久久人妖| 国产精品综合不卡av| 国产欧美日韩综合一区在线播放 | 久久精品视频导航| 久热精品视频在线观看| 欧美激情按摩在线| 国产精品国产三级国产aⅴ浪潮 | 国产日韩欧美a| 国产亚洲精品久久久| 国产亚洲精品久久久久婷婷瑜伽| 黄色av日韩| 99精品视频网| 久久精品在线观看| 欧美国产日韩xxxxx| 国产精品欧美风情| 亚洲福利在线视频| 亚洲新中文字幕| 美女视频网站黄色亚洲| 国产精品久久一卡二卡| 激情文学综合丁香| 一本久道久久综合狠狠爱| 欧美一区二区福利在线|