a.zhanguttin
/
public
forked from root/public
1
0
Fork 0
Code Issues 1 Pull Requests Projects Releases Wiki Activity
Browse Source

fixing the audit

content-update
MSilva95 4 years ago
parent
e72e5ca3d0
commit
cebd711568
1 changed files with 84 additions and 93 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 177
      subjects/lem-in/lem-in.audit.en.md

177
subjects/lem-in/lem-in.audit.en.md
unescape_control_characters View File

@ -1,30 +1,18 @@
#### Functional
##### Is the program able to read an ant farm in the standard input ?
```console
student$ ./lem-in example00.txt
```
##### Try to run `"./lem-in example00.txt"`.
###### Does the program returns an error message if there is no possible solution ?
###### Is the program able to read the ant farm in this standard input?
###### Does the program accepts ant farms with comments ?
###### Does the program accept only the commands `##star` and `##end`?
###### Does the program accept only the commands `##star` and `##end` ?
###### Are the commands printed in the standard output ?
##### Try running the program with a valid example of your choice.
```console
number_of_ants
the_rooms
the_links
Lx-y Lz-w Lr-o ...
```
###### Are the movements printed with the right format? One line per turn, `N` movements per turn, movements defined by `Lx-y` `x` being the ant `y` being the room ?
```console
Lx-y
Lx-y Lx-y
Lx-y Lx-y Lx-y
@ -32,13 +20,7 @@ Lx-y Lx-y
Lx-y
```
###### Is the solution making the ants cross the farm from start to end properly ?
###### Are the ants alone in each room ?
###### At the end are all the ants present in the `##end` room ?
##### Try to run the program with an example of your choice multiple times to check if the result is always correct.
###### Are the commands and the ants movements printed with the right format? One line per turn, `N` movements per turn, movements defined by `Lx-y` `x` being the ant and `y` being the room, as it shows above?
##### Try running the program with [example00](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -55,16 +37,16 @@ student$ ./lem-in example00.txt
2-3
3-1
L1- 2
L1- 3 L2- 2
L1- 1 L2- 3 L3- 2
L2- 1 L3- 3 L4- 2
L3- 1 L4- 3
L4- 1
L1-2
L1-3 L2-2
L1-1 L2-3 L3-2
L2-1 L3-3 L4-2
L3-1 L4-3
L4-1
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [example01](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -105,18 +87,18 @@ c-k
n-m
h-n
L1- t L2- h L3- 0
L1- E L2- A L3- o L4- t L5- h L6- 0
L1- a L2- c L3- n L4- E L5- A L6- o L7- t L8- h L9- 0
L1- m L2- k L3- e L4- a L5- c L6- n L7- E L8- A L9- o L10- t
L1- end L2- end L3- end L4- m L5- k L6- e L7- a L8- c L9- n L10- E
L4- end L5- end L6- end L7- m L8- k L9- e L10- a
L7- end L8- end L9- end L10- m
L10- end
L1-t L2-h L3-0
L1-E L2-A L3-o L4-t L5-h L6-0
L1-a L2-c L3-n L4-E L5-A L6-o L7-t L8-h L9-0
L1-m L2-k L3-e L4-a L5-c L6-n L7-E L8-A L9-o L10-t
L1-end L2-end L3-end L4-m L5-k L6-e L7-a L8-c L9-n L10-E
L4-end L5-end L6-end L7-m L8-k L9-e L10-a
L7-end L8-end L9-end L10-m
L10-end
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [example02](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -134,11 +116,11 @@ student$ ./lem-in example02.txt
1-2
3-2
L1- 3 L2- 3 L3- 3 L4- 3 L5- 3 L6- 3 L7- 3 L8- 3 L9- 3 L10- 3 L11- 3 L12- 3 L13- 3 L14- 3 L15- 3 L16- 3 L17- 3 L18- 3 L19- 3 L20- 3
L1-3 L2-3 L3-3 L4-3 L5-3 L6-3 L7-3 L8-3 L9-3 L10-3 L11-3 L12-3 L13-3 L14-3 L15-3 L16-3 L17-3 L18-3 L19-3 L20-3
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [example03](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -161,16 +143,16 @@ student$ ./lem-in example03.txt
3-0
4-3
L1- 1
L1- 4 L2- 1
L1- 5 L2- 4 L3- 1
L2- 5 L3- 4 L4- 1
L3- 5 L4- 4
L4- 5
L1-1
L1-4 L2-1
L1-5 L2-4 L3-1
L2-5 L3-4 L4-1
L3-5 L4-4
L4-5
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [example04](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -194,16 +176,16 @@ richard-erlich
erlich-jimYoung
jimYoung-peter
L1- gilfoyle L3- dinish
L1- peter L2- gilfoyle L3- jimYoung L5- dinish
L2- peter L3- peter L4- gilfoyle L5- jimYoung L7- dinish
L4- peter L5- peter L6- gilfoyle L7- jimYoung L9- dinish
L6- peter L7- peter L8- gilfoyle L9- jimYoung
L8- peter L9- peter
L1-gilfoyle L3-dinish
L1-peter L2-gilfoyle L3-jimYoung L5-dinish
L2-peter L3-peter L4-gilfoyle L5-jimYoung L7-dinish
L4-peter L5-peter L6-gilfoyle L7-jimYoung L9-dinish
L6-peter L7-peter L8-gilfoyle L9-jimYoung
L8-peter L9-peter
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [example05](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -276,44 +258,27 @@ F4-end
I4-I5
I5-end
L1- A0 L4- B0 L6- C0
L1- A1 L2- A0 L4- B1 L5- B0 L6- C1
L1- A2 L2- A1 L3- A0 L4- E2 L5- B1 L6- C2 L9- B0
L1- end L2- A2 L3- A1 L4- D2 L5- E2 L6- C3 L7- A0 L9- B1
L2- end L3- A2 L4- D3 L5- D2 L6- I4 L7- A1 L8- A0 L9- E2
L3- end L4- end L5- D3 L6- I5 L7- A2 L8- A1 L9- D2
L5- end L6- end L7- end L8- A2 L9- D3
L8- end L9- end
L1-A0 L4-B0 L6-C0
L1-A1 L2-A0 L4-B1 L5-B0 L6-C1
L1-A2 L2-A1 L3-A0 L4-E2 L5-B1 L6-C2 L9-B0
L1-end L2-A2 L3-A1 L4-D2 L5-E2 L6-C3 L7-A0 L9-B1
L2-end L3-A2 L4-D3 L5-D2 L6-I4 L7-A1 L8-A0 L9-E2
L3-end L4-end L5-D3 L6-I5 L7-A2 L8-A1 L9-D2
L5-end L6-end L7-end L8-A2 L9-D3
L8-end L9-end
student$
```
###### Does it present the right result as above ?
###### Does it present the quickest path possible with the same number of turns as the result above?
##### Try running the program with [badexample00](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
```
student$ ./lem-in badexample00.txt
0
4 5 4
##start
0 1 4
1 3 6
##end
5 6 4
2 3 4
3 3 1
0-1
2-4
1-4
0-2
4-5
3-0
4-3
ERROR: invalid data format
student$
```
###### Does it present the right result as above ?
###### Does it present the right result as above?
##### Try running the program with [badexample01](https://public.01-edu.org/subjects/lem-in/lem-in-examples.en).
@ -322,27 +287,53 @@ student$ ./lem-in badexample01.txt
ERROR: invalid data format
student$
```
###### Does it present the right result as above ?
###### Does it present the right result as above?
##### Try running the program with example06.txt and with 100 ants.
###### Is the real time less than 0.5 seconds ?
###### Is the real time less than 0.5 seconds?
##### Try running the program with example07.txt and with 1000 ants.
###### Is the real time less than 1.5 seconds ?
###### Is the real time less than 1.5 seconds?
##### Try running the program with a valid example of your choice.
###### Are the ants alone in each room?
##### Try running the program with a valid example of your choice.
###### At the end can you confirm that all the ants present in the `##end` room?
##### Try to run the program with an example of your choice multiple times.
###### Are the results always correct?
###### Does the program handles all the error cases with a message?
###### Is the solution making the ants cross the farm from `##start` to `##end` properly?
#### General
##### +Can you see a graphical representation of the ant farm ?
###### +Does the program present an ant farm visualizer?
###### +Is it possible to see the ants moving?
###### +Is the visualizer in 3D?·4
#### Basic
###### +Does the project run quickly and effectively (favoring of recursive, no unnecessary data requests, etc.) ?
###### +Is the output of the program well structured ?
###### +Is there a test file for this code ?
###### +Are the tests checking each possible case ?
###### +Does the code obey the [good practices](https://public.01-edu.org/subjects/good-practices.en) ?
###### +Does the project run quickly and effectively (favoring of recursive, no unnecessary data requests, etc.)?
###### +Is there a test file for this code?
###### +Are the tests checking each possible case?
###### +Does the code obey the [good practices](https://public.01-edu.org/subjects/good-practices.en)?
#### Social
###### +Did you learn anything from this project ?
###### +Would you recommend/nominate this program as an example for the rest of the school ?
###### +Did you learn anything from this project?
###### +Would you recommend/nominate this program as an example for the rest of the school?

Write Preview
Loading…
Cancel
Save