国产人妻人伦精品_欧美一区二区三区图_亚洲欧洲久久_日韩美女av在线免费观看

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

 XJCO1921代做、代寫c/c++編程語言

時間:2024-05-29  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯



 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 
請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp

















 

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

    合肥圖文信息
    流體CFD仿真分析_代做咨詢服務(wù)_Fluent 仿真技術(shù)服務(wù)
    流體CFD仿真分析_代做咨詢服務(wù)_Fluent 仿真
    結(jié)構(gòu)仿真分析服務(wù)_CAE代做咨詢外包_剛強(qiáng)度疲勞振動
    結(jié)構(gòu)仿真分析服務(wù)_CAE代做咨詢外包_剛強(qiáng)度疲
    流體cfd仿真分析服務(wù) 7類仿真分析代做服務(wù)40個行業(yè)
    流體cfd仿真分析服務(wù) 7類仿真分析代做服務(wù)4
    超全面的拼多多電商運(yùn)營技巧,多多開團(tuán)助手,多多出評軟件徽y1698861
    超全面的拼多多電商運(yùn)營技巧,多多開團(tuán)助手
    CAE有限元仿真分析團(tuán)隊(duì),2026仿真代做咨詢服務(wù)平臺
    CAE有限元仿真分析團(tuán)隊(duì),2026仿真代做咨詢服
    釘釘簽到打卡位置修改神器,2026怎么修改定位在范圍內(nèi)
    釘釘簽到打卡位置修改神器,2026怎么修改定
    2025年10月份更新拼多多改銷助手小象助手多多出評軟件
    2025年10月份更新拼多多改銷助手小象助手多
    有限元分析 CAE仿真分析服務(wù)-企業(yè)/產(chǎn)品研發(fā)/客戶要求/設(shè)計優(yōu)化
    有限元分析 CAE仿真分析服務(wù)-企業(yè)/產(chǎn)品研發(fā)
  • 短信驗(yàn)證碼 寵物飼養(yǎng) 十大衛(wèi)浴品牌排行 目錄網(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號-3 公安備 42010502001045

    国产人妻人伦精品_欧美一区二区三区图_亚洲欧洲久久_日韩美女av在线免费观看
    国产日韩欧美在线看| 久久久久久久久久码影片| 天天综合中文字幕| 亚洲不卡中文字幕无码| 亚洲精品偷拍视频| 性欧美精品一区二区三区在线播放| 亚洲专区国产精品| 午夜免费福利小电影| 欧美一级片久久久久久久| 色中文字幕在线观看| 欧美一级免费看| 日本不卡二区| 男人的天堂99| 国内精品一区二区三区四区| 国产日韩欧美夫妻视频在线观看| 国产精品一区二区久久久久| 99国产精品久久久久老师| 久久久天堂国产精品女人| 国产xxxx振车| 国产精品久久久久久久久久小说 | 日本精品一区二区三区四区| 热re99久久精品国99热蜜月| 欧美亚洲激情在线| 国产在线视频2019最新视频| 福利精品视频| 久久久久久久久久久久久久久久av | 中文字幕乱码一区二区三区| 亚洲最大成人网色| 品久久久久久久久久96高清| 国产日韩欧美中文| 国产精品av免费| 久久精品成人欧美大片| 欧美激情视频网址| 日韩免费av一区二区| 国产日韩欧美一区二区| 国产国语刺激对白av不卡| 国产精品美女999| 亚洲乱码日产精品bd在线观看| 青草视频在线观看视频| 成人免费视频久久| 精品国产一区二区三区在线观看 | 欧美久久久精品| 日本一区二区三区四区视频 | 亚洲午夜精品久久久久久人妖| 日韩高清av| 国产九九精品视频| 精品国内自产拍在线观看| 中文字幕一区二区三区最新| 欧美日韩一区二| 91精品久久久久久久久久久久久久 | 日本亚洲导航| 国产精品一二区| 久久久精品久久| 视频一区亚洲| 国产免费人做人爱午夜视频| www.久久色.com| 性色av一区二区咪爱| 国产深夜精品福利| 色偷偷噜噜噜亚洲男人| 亚洲视频导航| 国产青春久久久国产毛片| 久久国内精品一国内精品| 亚洲在线免费看| 国产午夜大地久久| 久久久国产在线视频| 日本在线播放一区| 97欧洲一区二区精品免费| 欧美成人久久久| 黄色一级视频片| 久久精品99久久香蕉国产色戒| 视频一区免费观看| 97国产在线播放| 欧美激情网友自拍| 国产日韩欧美一区二区| 国产精品久久久久9999| 欧美性一区二区三区| 久久久久久久久久久亚洲| 亚洲一区二区中文字幕| 国产精品影院在线观看| 久久亚洲国产精品成人av秋霞| 欧美一级二级三级九九九| 国产成人亚洲综合| 日日摸日日碰夜夜爽av| 久久视频这里有精品| 亚洲色欲综合一区二区三区| 国产精品一区久久久| 综合一区中文字幕| 国产精品亚洲综合天堂夜夜| 欧美激情网友自拍| 国产精品揄拍500视频| 亚洲午夜精品久久久久久人妖| 成人欧美一区二区| 在线免费观看一区二区三区| 国产视频不卡| 中文字幕久精品免| 91精品国产91久久久久久| 偷拍视频一区二区| 久久精品国产精品青草色艺 | 九色视频成人porny| 日本高清不卡三区| 日韩视频第一页| 好吊色欧美一区二区三区视频| 国产精品无码一区二区在线| 国内精品久久国产| 国产精品美女www| 国产四区在线观看| 亚洲精品久久久久久一区二区 | 成人av资源网| 懂色一区二区三区av片| 国产福利精品视频| 日韩精品手机在线观看| 久久精品久久精品亚洲人| 国产一二三区在线播放| 在线观看污视频| 久久一区免费| 欧美日韩亚洲一区二区三区四区| 欧美xxxx综合视频| av免费观看网| 日本一区视频在线播放| 国产精品美乳一区二区免费| 国产精品综合不卡av| 少妇精品久久久久久久久久| 国产成人无码a区在线观看视频| 激情小说综合网| 在线观看国产一区| 爽爽爽爽爽爽爽成人免费观看| 狠狠色综合欧美激情| 亚洲在线视频一区二区| 日韩中文综合网| 国产另类自拍| 欧美重口乱码一区二区| 一级特黄妇女高潮| 国产精品爽爽ⅴa在线观看| 国产一区高清视频| 日本人成精品视频在线| 国产精品第1页| 久久视频这里有精品| 黄色国产精品一区二区三区| 亚洲乱码日产精品bd在线观看| 色婷婷av一区二区三区久久| 国产精品中文在线| 欧日韩一区二区三区| 亚洲日本欧美在线| 国产精品久久久久9999爆乳| 久久久一二三四| 国产日韩一区在线| 欧美在线3区| 亚洲www在线观看| 久久精品久久久久久国产 免费| 91精品久久久久久久久久| 国产综合动作在线观看| 青青视频免费在线| 亚洲在线免费视频| 久久艹在线视频| 久久天天躁狠狠躁老女人| 国产精品99久久久久久人| 国产特级黄色大片| 欧美国产日韩激情| 日本va中文字幕| 性色av一区二区三区在线观看| 欧美精品久久久久久久久久| 国产精品久久久| 久久久成人的性感天堂| 国产精品99久久久久久www| 国产裸体写真av一区二区| 欧美 国产 日本| 欧美中文在线观看| 日韩三级在线播放| 日本一区不卡| 色噜噜狠狠一区二区三区| 亚洲熟妇av日韩熟妇在线| 色综合天天综合网国产成人网| 国产精品爽爽爽| 久久精品视频亚洲| 日韩亚洲成人av在线| 日韩在线视频一区| 久久久久久久久久久视频| 久久av一区二区| 久久另类ts人妖一区二区| 91av在线精品| 91精品久久久久久久久久久| 91精品国产综合久久久久久蜜臀| 国产女同一区二区| 国产一区二区三区av在线| 国内免费精品永久在线视频| 精品嫩模一区二区三区| 欧美 日韩 国产在线| 极品日韩久久| 国产尤物99| 国产精品综合久久久久久| 国产裸体免费无遮挡| 国产精品一区二区久久久| 成人免费91在线看| 国产精品一区二区性色av| 浮妇高潮喷白浆视频| 成人毛片网站| 91禁国产网站| 九九九九免费视频| 国产精品视频区| 精品国产乱码久久久久久丨区2区 精品国产乱码久久久久久郑州公司 |