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

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

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

時間:2024-05-29  來源:合肥網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

















 

掃一掃在手機打開當前頁
  • 上一篇:代寫BUSS6002、代做Python編程設計
  • 下一篇:COMP3009J代做、代寫Python程序設計
  • 無相關信息
    合肥生活資訊

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

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

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

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

          9000px;">

                2023国产精华国产精品| 欧美一区二区精品在线| 亚洲资源在线观看| 美国毛片一区二区三区| 国产精品午夜在线| 麻豆免费精品视频| 亚洲精品在线免费观看视频| 国产一区二区精品久久91| 久久久久久久久免费| 精品一区二区三区久久| 久久久午夜精品理论片中文字幕| 成人av影院在线| 日韩电影在线看| 欧美日韩一区在线观看| 国产馆精品极品| 日本aⅴ精品一区二区三区| 91视频精品在这里| 香蕉久久一区二区不卡无毒影院 | 亚洲精品免费在线播放| 欧美巨大另类极品videosbest| 亚洲伦在线观看| 一本大道久久精品懂色aⅴ| 久久精品国产色蜜蜜麻豆| 亚洲男人天堂av网| 欧美另类videos死尸| 国产在线麻豆精品观看| 亚洲免费高清视频在线| 久久激情五月激情| av毛片久久久久**hd| 高清视频一区二区| 99精品视频在线播放观看| 麻豆一区二区三| 亚洲电影欧美电影有声小说| 亚洲少妇中出一区| 精品久久一二三区| 国产精品热久久久久夜色精品三区 | 午夜电影一区二区三区| 日韩欧美电影一区| av一区二区不卡| 高清shemale亚洲人妖| 丁香另类激情小说| 日韩中文字幕91| 亚洲成a人v欧美综合天堂下载 | 国产精品久久二区二区| 成人小视频免费在线观看| 高清成人在线观看| 激情综合网av| 欧美午夜电影在线播放| 日韩欧美在线一区二区三区| 国产精品日产欧美久久久久| 亚洲柠檬福利资源导航| 一区二区免费在线播放| 福利电影一区二区三区| 91网站在线播放| 91丨九色丨黑人外教| 欧美日韩精品一区二区三区蜜桃| 欧美探花视频资源| 日韩欧美国产不卡| 国产精品国产三级国产aⅴ无密码| 天堂va蜜桃一区二区三区 | 91免费观看视频在线| 国产精品乱码一区二三区小蝌蚪| 国产成人亚洲精品青草天美| 91亚洲国产成人精品一区二三 | 国产麻豆一精品一av一免费 | 国产亚洲一本大道中文在线| 久久久电影一区二区三区| 亚洲国产精品久久艾草纯爱| 成人av片在线观看| 久久精品夜色噜噜亚洲a∨| 美女mm1313爽爽久久久蜜臀| 欧美在线你懂的| 久久99久国产精品黄毛片色诱| 欧美无砖专区一中文字| 亚洲欧美日本在线| 色噜噜狠狠一区二区三区果冻| 久久久www免费人成精品| 青椒成人免费视频| 国产亚洲婷婷免费| 麻豆成人av在线| 国产精品亚洲午夜一区二区三区| 色综合久久88色综合天天免费| 亚洲精品日韩一| 91精品国产一区二区三区| 亚洲一区二区三区在线看| 久久夜色精品国产欧美乱极品| 丰满少妇久久久久久久| 精品国产免费视频| 久久免费视频色| 欧美v国产在线一区二区三区| 精品国产123| 不卡视频在线看| 国产一区免费电影| 久久久精品免费网站| 中文字幕巨乱亚洲| 精品久久久久av影院| 日韩美女精品在线| 天天综合日日夜夜精品| 国产盗摄女厕一区二区三区| 成人av免费网站| 在线观看网站黄不卡| 欧美色图一区二区三区| 精品成人一区二区| 国产欧美一区二区精品秋霞影院| 一区二区三区四区激情| 视频一区中文字幕国产| 国产九色精品成人porny| 成人免费观看视频| 欧美久久一二三四区| 国产欧美一区视频| 石原莉奈在线亚洲二区| 色综合天天综合网天天狠天天| 欧美理论电影在线| 亚洲免费色视频| 国产成人h网站| 精品少妇一区二区三区视频免付费 | 91在线小视频| 国产日韩影视精品| 激情综合亚洲精品| 久久久久久久综合日本| 蜜臀av性久久久久蜜臀aⅴ| 欧美性受xxxx黑人xyx性爽| 尤物av一区二区| 欧美三级韩国三级日本三斤| 亚洲美女视频一区| 在线欧美一区二区| 一区二区国产视频| 欧美三级视频在线| 亚洲成人在线免费| 欧美一区二区视频在线观看2022 | 亚洲天堂成人网| 成人激情午夜影院| 国产精品麻豆视频| 99在线热播精品免费| 自拍偷在线精品自拍偷无码专区| 成人av中文字幕| 一区二区三区日本| 欧美乱妇20p| 紧缚捆绑精品一区二区| 久久久欧美精品sm网站| 国内精品在线播放| 国产精品网站导航| 欧美亚洲一区三区| 美女看a上一区| 国产欧美日本一区视频| 91麻豆国产香蕉久久精品| 一区二区三区四区蜜桃| 5566中文字幕一区二区电影 | 久久91精品国产91久久小草| 久久久久国产精品厨房| 成人爱爱电影网址| 亚洲国产精品久久久久秋霞影院 | 欧美久久久影院| 激情av综合网| 国产精品无码永久免费888| 色婷婷综合五月| 免费在线观看日韩欧美| 国产精品丝袜久久久久久app| 一本色道久久综合亚洲91 | 亚洲综合另类小说| 欧美一卡2卡3卡4卡| 国产成人精品三级麻豆| 亚洲午夜久久久久久久久电影网| 91精品国产欧美一区二区成人| 国产成人av自拍| 日本午夜一本久久久综合| 国产网站一区二区| 7878成人国产在线观看| 国产suv精品一区二区883| 亚洲制服丝袜av| 国产欧美日韩亚州综合| 欧美日韩午夜在线视频| 成人动漫精品一区二区| 精品一区二区三区的国产在线播放 | 91小视频在线观看| 久久精品久久99精品久久| 亚洲精品日日夜夜| 日韩视频免费观看高清完整版| 91蝌蚪porny| 国产一区二区三区在线看麻豆 | 国产女人aaa级久久久级| av成人动漫在线观看| 国内精品久久久久影院色| 亚洲一区精品在线| 中文字幕亚洲电影| 精品福利二区三区| 欧美一区二区三区影视| 99久久婷婷国产精品综合| 精品在线免费观看| 天堂va蜜桃一区二区三区| 国产精品日韩成人| 国产亚洲一二三区| 日韩三级中文字幕| 色婷婷久久99综合精品jk白丝| 黑人巨大精品欧美黑白配亚洲| 亚洲午夜私人影院| 伊人一区二区三区| 亚洲欧美日韩久久| 亚洲黄网站在线观看| 亚洲综合无码一区二区|