加勒比久久综合,国产精品伦一区二区,66精品视频在线观看,一区二区电影

合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

 XJCO1921代做、代寫(xiě)c/c++編程語(yǔ)言

時(shí)間:2024-05-29  來(lái)源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯(cuò)



 School of Computing: Assessment brief 
Module title Programming Project 
Module code XJCO1921 
Assignment title Assignment 2 – Project Code 
Assignment type and 
description 
You will now implement the maze game, using test-driven development 
to create a defensively designed program following a given 
specification. 
Rationale Using modern and professional development techniques, you will work 
on a simple project demonstrating your understanding of different 
techniques, such as dynamic memory allocation and structure usage. 
You will focus on creating good quality code which is well documented, 
modular, and maintainable; these are all important considerations when 
writing code in the industry. 
Word limit and 
guidance 
You should spend 16-20 hours working on this assessment. 
Weighting 60% 
Submission deadline Thursday 30 May 2024 16:00 UK BST (23:00 Beijing Time) 
Submission method Gradescope 
Feedback provision Marked rubric 
Learning outcomes 
assessed 
- apply professional programming practices to programming projects. 
- design, implement, debug and test a modular programming solution to 
a real-world problem. 
Module lead Zheng Wang, Xiuying Yu 
1. Assignment Guidance 
You will produce, in C, a program which fits the following specifications: 
 
Maze Game 
Usage: ./maze <mazefile path> 
 
You are creating a basic game, where players navigate through a maze. Note that we no longer 
require passing the maze size as the input arguments. 
 
The maze will be loaded from a file, the filename for which is passed as a command line 
argument. Mazes are made up of four characters: 
Mazes are made up of four characters: 
Character Purpose 
‘#’ A wall which the player cannot move across 
‘ ‘ (a space) A path which the player can move across 
‘S’ The place where the player starts the maze 
‘E’ The place where the player exits the maze 
 
A maze has a height and a width, with a maximum of 100 and a minimum of 5. Your program will 
dynamically allocate an appropriate data structure to store the maze. 
 
The height and width do not have to be equal – as long as both are within the accepted range. 
 
Within a maze, each ‘row’ and ‘column’ should be the same length – the maze should 
be a rectangle. 
 When the game loads, the player will start at the starting point ‘S’ and can move through the maze 
using WASD movement: 
 
Note: For this assignment, each input will be separated with a newline character – this is not 
keypress triggered. This is for the purpose of autograding. 
 
The player can move freely through path spaces (‘ ‘) but cannot move through walls or off 
the edge of the map. Some helpful prompts (messages) should be provided if this is 
attempted. 
 
The map should NOT be shown to the player every time they make a move (again for the 
purpose of autograding), but they can enter ‘M’/’m’ to view an image of the map, with their 
current location shown by an ‘X’. 
 
When the user reaches the exit point ‘E’, the game is over and will close. The player 
should be given some message stating that they have won. There is no ‘lose’ condition. 
Key Direction 
W/w Up 
A/a Left 
S/s Down 
D/d Right 
Q/q Quit the game Maze file specification 
 
A valid maze: 
 
− Has a single starting point ‘S’ 
− Has a single exit point ‘E’ 
− Contains only the start and exit characters, spaces (‘ ‘), walls (‘#’), and newline (‘\n’) 
characters 
− Has every row the same length 
− Has every column the same height 
− Has a maximum width and height of 100 
− Has a minimum width and height of 5 
− Does not require every row and column to start or end with a ‘#’ 
− May have a trailing newline at the end of the file (one empty row containing only ‘\n’) 
 
A selection of valid mazes is provided in your starting repository – you should ensure that 
your code accepts all these mazes. 
 
Note that file extension is not important – there is no requirement for a maze file to be stored 
as a .txt file provided that the contents of the file are valid. 
 
 Standard Outputs 
 
To allow some automatic testing of your functionality, we require some of your outputs to 
have a specific format. To prevent you from being overly restricted, this will only be the 
final returned value of your code rather than any print statements. 
 
Return Codes 
 
Scenario Value to be returned by your executable 
Successful running 0 
Argument error 1 
File error 2 
Invalid maze 3 
Any other non-successful exit 
Note: it is unlikely that you will need to use 
this code 
 Maze Printing Function 
 
The maze printing function (‘M’/’m’) must output the maze in the following way: 
 
− No additional spaces added 
− Newline before the first row is printed 
− Newline after the final row 
− If the player’s current position overlaps with the starting point, this should display ‘X’ 
rather than ‘S’ 
 
The code required to do this is provided in the template as print_maze() and may be used without 
referencing me. 
 Additional Challenge Task – Maze Generator 
 
This is an optional additional task that will involve researching and developing a more 
complex piece of code – you do not need to complete this section to achieve a 2:1/2:2 
grade. This task may take longer than the recommended time given above – I recommend 
only attempting any part of it if you found the original task trivial to complete. 
 
 The task 
In addition to allowing users to solve mazes, you will create an additional program `mazegen` 
which allows users to generate a valid and solvable maze with the specified width and 
height, to be saved in ‘filename’. 
 
For example: 
 ./mazeGen maze4.txt 20 45# 
 
 will save a maze that is 20 x 45 into ‘maze4.txt’, creating that file if it does not already exist. 
 
A valid maze means that it fits the rules given in the “maze file specification section”, as well as 
being solvable (there is at least one solution to the maze- it is possible to start at S and exit at 
E). 
 
There are some existing algorithms that can create mazes, and you should experiment with 
using these to produce ‘quality’ mazes that are not trivial to solve and present some challenges 
to the player. You should document your process of developing the maze creation algorithm, 
as this will form a part of the assessment. 
 
It is recommended that you keep a log including some maze files generated by each iteration, 
what you intend to change for the next iteration based on these maze files, and just some 
general comments about what you think was good or bad about this particular solution. 
 
Some things to consider for each iteration are: 
− Did the program produce a variety of designs of maze? 
− Did the program produce only valid mazes? 
− How did the program perform with larger dimensions (100 x 100 for example) 
− What did the program do particularly well? 
o Can you identify what part of the code caused this? 
− What did the program do particularly poorly? 
o Can you identify what part of the code caused this? 
− What will you try next time? 
 
For this task, you will present your maze generation program to a member of the module 
team during a lab session and discuss: 
− How your program works 
− How you iteratively developed it 
− The limitations of your solution 
− Any improvements you would like to make to it in the future 
 2. Assessment tasks 
Produce the C code for a program that solves the tasks detailed above. 
You should ensure that your code is: 
- Structured sensibly 
- Modular 
- Well-documented 
- Defensive 
- Working as intended 
You can use the code skeleton you produced in Assignment 1, or a basic skeleton is provided via 
Minerva. 
You can use any number of additional header and C files and should produce or adapt a makefile 
that allows the program to compile successfully on a GitHub Codespace instance. You may not use 
any non-standard C libraries. You should make sure your code runs in Linux. 
You should also use your test script and data from assignment 1 to help you produce defensive and 
working code. You can adapt and add to these throughout your development process. If you did not 
create a test script, or your test script does not work, then you can manually test your code. 
Good programming practices 
You should follow good software development practices. For this exercise, you are asked to: 
• Follow modular development by making sure the code is modular and well structured; code 
with proper comments 
• Use Makefile for code compilation; 
• Use a git repository for version control 
Notes: 
1. Makefile: You should also submit a Makefile with at least two targets: all and clean. "make 
all" compiles your code to generate an executable binary, while "make clean" removes all 
object files (.o), all executables, and any temporary files created during your run. 
2. Version control: We will check the commit logs of your git repository. We expect to see 
steady progress towards completion, as revealed in the pattern of git commits. One of the 
implications of this is that we will be penalising any student who develops their code without 
git and then dumps it all into git at the last minute. 
 
 
 3. General guidance and study support 
You should refer to the lab exercises and lecture notes to support you. Use the lab sessions to ask 
for help. 
 
4. Assessment criteria and marking process 
A full breakdown of the assessment criteria can be found in section 8. 
Your code will be tested with different maze files and user inputs containing errors - the exact nature 
of these errors will not be told to you before marking, so ensure that you validate a wide range of 
potential user errors. Note that we will be running our own test cases to mark the assignments and 
doing our best to devise creative ways to break your code! You should therefore develop your test 
cases to beat us to it. 
Your code will be manually checked for code quality. 
If you complete the additional challenge task, you will submit your code for plagiarism checking but 
will present your code to a member of the SWJTU module staff for assessment. 
 5. Presentation and referencing 
If you need to reference any resources, use a simple comment, for example: 
// This test is adapted from an example provided on https://byby.dev/bash-exit-codes 
You should not be directly copying any code from external resources, even with a reference. 
Generative AI: 
If you are referencing a Generative AI model, you must provide the full conversation. 
In ChatGPT, you can generate a link to the full conversation: 
 And provide the reference as follows: 
 
// Lines 1 – 7 were adapted from code provided by the following conversation with 
chatGPT: https://chat.openai.com/share/c356221d-fb88-4970-b39e-d00c87ae1e0b 
 
 
 In Copilot, you will need to export the conversation as a text file: 
 
 Save this with a filename including the date and 2-3 word summary of what the conversation 
was about (’1**03 inputs in C.txt’) and ensure this is submitted with your work. 
\You can reference this in your code: 
 
// Lines 1 – 7 were adapted from code provided by the CoPilot conversation 
recorded in ’1**03 inputs in C.txt’ 
 
 
If you are using a different Generative AI model, these instructions may differ – you 
must still provide a link to or copy of the full conversation and reference in the same 
manner above. 
 
 
Use of Generative AI in this Assessment 
 
This assessment is rated ‘amber’ according to the university guidelines around generative AI. 
 
This means that you can use genAI models such as ChatGPT or CoPilot to explain concepts 
that may be useful in this assessment, but you must NOT ask it to write your code for you 
nor give it any part of my specification. 
 
The following link is an example of what I would consider ‘reasonable use’ of chatGPT for this 
assessment: 
 
https://chat.openai.com/share/c356221d-fb88-4970-b39e-d00c87ae1e0b 
 6. Submission requirements 
Submit your source code via Gradescope. There is a separate submission point for the 
extension work. 
 
Ensure that: 
 
− Any .c or .h files are not inside a subdirectory 
− The makefile is not inside a subdirectory 
− Your executables are named: maze and mazegen 
− You have followed the return code instructions above 
− Your code compiles on Linux 
 
You will receive some instant feedback which should confirm that your upload is in the 
correct format and is using the correct return values – please ensure you correct any 
failing tests. 
 
Note: Passing these tests is not a guarantee that your code will gain full marks from the 
autograder – just that it is the correct format/returns for the grader to run. 
 
 7. Academic misconduct and plagiarism 
Leeds students are part of an academic community that shares ideas and develops new ones. 
 
You need to learn how to work with others, how to interpret and present other people's ideas, and how to 
produce your own independent academic work. It is essential that you can distinguish between other 
people's work and your own, and correctly acknowledge other people's work. 
 
All students new to the University are expected to complete an online Academic Integrity tutorial and test, 
and all Leeds students should ensure that they are aware of the principles of Academic integrity.  
 
When you submit work for assessment it is expected that it will meet the University’s academic integrity 
standards.  
 
If you do not understand what these standards are, or how they apply to your work, then please ask the 
module teaching staff for further guidance. 
 
By submitting this assignment, you are confirming that the work is a true expression of your own work and 
ideas and that you have given credit to others where their work has contributed to yours. 
 
 8. Assessment/ marking criteria grid 
 
Category 1st 2:1 / 2:2 Pass / 3rd Fail 
請(qǐng)加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp

















 

掃一掃在手機(jī)打開(kāi)當(dāng)前頁(yè)
  • 上一篇:代寫(xiě)B(tài)USS6002、代做Python編程設(shè)計(jì)
  • 下一篇:COMP3009J代做、代寫(xiě)Python程序設(shè)計(jì)
  • 無(wú)相關(guān)信息
    合肥生活資訊

    合肥圖文信息
    2025年10月份更新拼多多改銷(xiāo)助手小象助手多多出評(píng)軟件
    2025年10月份更新拼多多改銷(xiāo)助手小象助手多
    有限元分析 CAE仿真分析服務(wù)-企業(yè)/產(chǎn)品研發(fā)/客戶(hù)要求/設(shè)計(jì)優(yōu)化
    有限元分析 CAE仿真分析服務(wù)-企業(yè)/產(chǎn)品研發(fā)
    急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    急尋熱仿真分析?代做熱仿真服務(wù)+熱設(shè)計(jì)優(yōu)化
    出評(píng) 開(kāi)團(tuán)工具
    出評(píng) 開(kāi)團(tuán)工具
    挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
    挖掘機(jī)濾芯提升發(fā)動(dòng)機(jī)性能
    海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
    海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
    合肥機(jī)場(chǎng)巴士4號(hào)線
    合肥機(jī)場(chǎng)巴士4號(hào)線
    合肥機(jī)場(chǎng)巴士3號(hào)線
    合肥機(jī)場(chǎng)巴士3號(hào)線
  • 短信驗(yàn)證碼 目錄網(wǎng) 排行網(wǎng)

    關(guān)于我們 | 打賞支持 | 廣告服務(wù) | 聯(lián)系我們 | 網(wǎng)站地圖 | 免責(zé)聲明 | 幫助中心 | 友情鏈接 |

    Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網(wǎng) 版權(quán)所有
    ICP備06013414號(hào)-3 公安備 42010502001045

    香蕉成人久久| 久久不见久久见免费视频7| 国内成人在线| 国产在线日韩精品| 成人精品国产亚洲| 先锋影音久久久| 久久精品国产清高在天天线| 欧美全黄视频| 日韩专区精品| 国产精品女主播一区二区三区| 9国产精品午夜| 成人在线日韩| 欧美亚洲网站| 欧美7777| 免费在线欧美视频| 国产一区日韩一区| 亚洲免费一区三区| 成人豆花视频| 三级不卡在线观看| 欧美三区四区| 欧美va久久久噜噜噜久久| 欧美另类综合| 久久香蕉国产| 国内毛片久久| 精品亚洲二区| 欧美视频三区| 综合在线一区| 麻豆91在线观看| www.一区| 国产超碰精品| 香蕉伊大人中文在线观看| 国产亚洲毛片在线| 免费不卡中文字幕在线| 精品美女在线视频| 欧美日韩午夜| 日韩中文字幕| 日韩在线观看中文字幕| 亚洲动漫精品| 国产一区日韩| 日韩极品在线| 亚洲国产网址| 国产一区二区三区四区大秀| 亚洲色图国产| 裸体一区二区三区| 日欧美一区二区| 美女免费视频一区| 日本午夜精品久久久久| 久久天堂av| 成人精品国产亚洲| 亚洲国产99| 日韩精品亚洲一区二区三区免费| 国产极品久久久久久久久波多结野| 正在播放日韩精品| 日韩成人综合| 亚洲精品66| 国产一区高清| 影音先锋久久资源网| 麻豆国产欧美一区二区三区| 亚洲毛片视频| 国产麻豆精品久久| 日韩福利视频一区| 北条麻妃一区二区三区在线| 国产成人tv| 99久久九九| 好吊一区二区三区| 亚洲欧美日韩国产一区二区| 免费看欧美美女黄的网站| 日本激情一区| 丝袜美腿一区| 免费在线播放第一区高清av| 亚洲国产精品一区| 欧美国产中文高清| jizz性欧美23| 欧美 日韩 国产一区二区在线视频 | 欧美日韩麻豆| 亚洲午夜电影| 六月天综合网| 国产精品亚洲一区二区三区在线观看| 国产精品99久久久久久董美香 | 蜜桃av噜噜一区| 欧洲成人一区| 国产精品a级| 精品999日本久久久影院| 啪啪国产精品| 亚洲欧美高清| 日本精品在线中文字幕| 中文av一区| 99re热精品视频| 不卡日本视频| 成人影院在线| 另类中文字幕网| 视频精品一区二区三区| 成人a'v在线播放| 欧美激情黄色片| 久久国内精品自在自线400部| www久久久| 九色丨蝌蚪丨成人| 三级一区在线视频先锋| 婷婷精品久久久久久久久久不卡| 亚洲图片小说区| 久久久久综合| 国产剧情av在线播放| 麻豆视频一区二区| 亚洲一区二区免费在线观看| 天天色综合色| 日韩欧美中字| 欧美一级片网址| 婷婷成人在线| 日日av拍夜夜添久久免费| 国产不卡精品| 激情久久久久久久| 欧美a级在线观看| 久久爱www成人| 尤物在线精品| 色999久久久精品人人澡69| 日韩电影不卡一区| 亚洲免费成人| 欧美在线日韩| 一本色道69色精品综合久久| 亚洲少妇诱惑| 麻豆精品视频在线| 天天做夜夜做人人爱精品| 中文一区一区三区高中清不卡免费| 亚洲人www| 国产精品91一区二区三区| 日本综合视频| 一区中文字幕| 国模精品视频| 亚洲小说图片| 老司机午夜精品视频| 一区二区不卡| 午夜精品免费| 日本欧美一区二区在线观看| 色婷婷久久久| 99精品国自产在线| 欧美中文一区| 天天免费亚洲黑人免费| 日韩三级av高清片| 久久久久久自在自线| 国产欧美二区| 老色鬼久久亚洲一区二区| 亚洲综合中文| 亚洲制服av| 欧美中文高清| 麻豆精品网站| 日韩欧美在线精品| 成人精品视频| 中文字幕一区二区三区四区久久| 水野朝阳av一区二区三区| 国产一区二区电影在线观看| 免费看黄色91| 日韩精品社区| 伊人久久在线| 国产精品一区二区中文字幕| 日韩在线短视频| 麻豆精品av| 国产欧美一级| 自拍视频亚洲| 国产精品欧美三级在线观看| 久久亚洲国产精品一区二区| 久久99久久人婷婷精品综合| 国产精品久久久久久久免费观看| 视频精品一区二区三区| 欧美天堂在线| 欧美va亚洲va日韩∨a综合色| 亚洲精品人人| 国产精品久久久久久久久久10秀| eeuss鲁片一区二区三区| 国产乱子精品一区二区在线观看| 欧美一站二站| 欧一区二区三区| 日韩在线中文| 九色精品91| 国产一区二区三区四区二区| 天堂在线中文网官网| 亚洲调教视频在线观看| 欧美影院精品| 蜜桃av在线播放| 欧美伦理在线视频| 日韩免费电影在线观看| 欧美精品资源| 黄色av一区| 青草伊人久久| 日韩和的一区二区| 日韩中文字幕区一区有砖一区| 99精品国产一区二区三区2021| 欧美成人黄色| 男人操女人的视频在线观看欧美| 青青草国产免费一区二区下载| 国产精品久久久久久模特| 免费观看日韩电影| 久久久久国内| 国产一区日韩| 国产日韩欧美一区| 免费亚洲电影在线| 美女毛片一区二区三区四区| 欧美极品中文字幕| 国产欧美一级| 亚洲伊人av| 亚洲免费精品|