ESE 224 Spring 2015 Course Project Description
Over the course of this semester, you learn various coding concepts in C++ that are applicable to programming in general. This class project is designed to show you how many of these concepts can be used together in a single application and will test your familiarity with programming these concepts. This project is intended for 2-4 people groups.
We will provide a rigid skeleton guide which you MUST follow, but how to implement components in the skeleton is your decision. This means that any public method signature should not be modified (its return type, name, and parameters). However, you are free to remove, add, or edit any private methods you feel necessary. The private methods are included as a guideline to structuring and organizing your code. The private variables should also not be modified, as much of the public functions rely on these private variables. This means we (i.e
四道 C++ 程序代写
Problem #1 (25 points)
Note that no global variables and data are allowed. All methods (as if you need them) must be
written explicitly and no library/package methods are allowed.
1. Write a function named as extractMostSeenEvenDigitProblem1YourName(),
which will
i. Receive an integer as argument; and
ii. Search and display the digits as shown in the output below; and
iii. Return the digit that has the largest occurrence.
1. A sample a program with main() would produce the sample output below – Your code must
take care of other possible output scenarios as well.
*********************************************************
* MENU *
* 1. Calling extractMostSeenEvenDigitProblem1YourName() *
* 2. Quit *
*********************************************************
Select an option (1 or 2): 1
Enter an integer: 302480443
Calling displayDigitProblem1YourName() –
There is/are 9 digit(s) with 4 even digit(s).
With the 4 even digits,
4 occurs 3 time(s)
0 occurs 2 time(s)
2 occurs 1 time(s)
8 occurs 1 t
unmanned lawn mowers c程序代写
代写c程序 二维数组 指针 内存申请与释放
dfs recrusive 遍历所有路径
// ~ Overview ~ //
This exercise will familiarize you with 2-dimensional arrays and
some more file operations.
// ~ Learning Goals ~ //
(1) To learn to perform file operations
(2) To learn to create and manipulate 2-dimensional arrays using
malloc and free function.
(3) To apply recursion to solve a maze traversal problem
// ~ Submitting Your Assignment ~ //
You must submit one zip file to blackboard. This zip file must
contain:
(1) pa_answer02.c
(2) pa02.c
You create the zip file using the following command.
> zip pa02.zip pa_answer02.c pa02.c
// ~ Overview ~ //
This exercise will give you more practice with file operations,
memory allocation, and recursion.
You own a business that performs mowing using unmanned lawn mowers
(ULM). Suppose you have just agreed to a contract to provide mowing
service to a corn maze operator. Based on a pre-processed satellite
images of corn maze, where the walls of the corn maze are stored as ‘X’ and
the paths are store
c语言扫雷游戏 minesweeper实现
minesweeper C 程序代写
1. (Time: 2 – 3 hours) For your final project you will be implementing the computer
game minesweeper. The game of minesweeper works as follows:
1. There is a rectangular grid of tiles
2. Hidden under some of the tiles are mines
3. Your goal is to mark all the tiles that contain mines and uncover all the tiles
4. If you uncover a tile that contains a mine you lose the game
5. If you uncover a tile that doesn’t contain a mine, it tells you how many mines
that don’t contain mines
are hidden in the eight surrounding squares
Here are some example boards with all of their contents revealed so that you can get an
idea as to what they look like.
Example 1:
2 * * 2 0
1 5 * 3 0
0 * * 2 0
0 1 2 3
Example 2:
9 0 0 0 0 0 1 1 1 0 0
8 0 0 0 0 0 1 * 1 0 0
7 0 1 1 1 0 1 1 2 1 1
6 0 1 * 1 1 1 1 1 * 1
5 0 1 1 1 1 * 1 1 1 1
4 1 1 1 0 1 1 1 0 0 0
3 1 * 1 0 0 0 0 0 0 0
2 1 1 1 0 0 0 0 0 0 0
1 1 2 1 1 0 1 1 2 2 2
0 * 2 * 1 0 1 * 2 * *
0 1 2 3 4 5 6 7 8 9
Requirements
1. Name your exe