diff --git a/subjects/appendrange/README.md b/subjects/appendrange/README.md index 3190b4d2..0b0140da 100644 --- a/subjects/appendrange/README.md +++ b/subjects/appendrange/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that takes an `int` min and an `int` max as parameters. That function returns a slice of `int` with all the values between min and max. +Write a function that takes an `int` min and an `int` max as parameters. That function returns a slice of `int`s with all the values between min and max. Min is included, and max is excluded. diff --git a/subjects/ascii-art-web/README.md b/subjects/ascii-art-web/README.md index 08309414..efd64b81 100644 --- a/subjects/ascii-art-web/README.md +++ b/subjects/ascii-art-web/README.md @@ -4,7 +4,11 @@ Ascii-art-web consists in creating and running a server, in which it will be possible to use a web **GUI** (graphical user interface) version of your last project, [ascii-art](../ascii-art). -Your webpage must allow the use of different [banners](../ascii-art). +Your webpage must allow the use of the different banners: + +- [shadow](../ascii-art/shadow.txt) +- [standard](../ascii-art/standard.txt) +- [thinkertoy](../ascii-art/thinkertoy.txt) Implement the following HTTP endpoints: diff --git a/subjects/ascii-art/color/README.md b/subjects/ascii-art/color/README.md index 45bff366..f9c092db 100644 --- a/subjects/ascii-art/color/README.md +++ b/subjects/ascii-art/color/README.md @@ -11,9 +11,9 @@ The output should manipulate colors using the **flag** `--color=`, in whi - The flag must have exactly the same format as above, any other formats must return the following usage message: ```console -Usage: go run . [STRING] [BANNER] [OPTION] +Usage: go run . [STRING] [OPTION] -EX: go run . something standard --color= +EX: go run . something --color= ``` ### Instructions diff --git a/subjects/boolean/README.md b/subjects/boolean/README.md index e098eb92..997b51e2 100644 --- a/subjects/boolean/README.md +++ b/subjects/boolean/README.md @@ -2,14 +2,12 @@ ### Instructions -Create a `.go` file. +Create a new directory called `boolean`. -- The code below has to be copied in that file. +- The code below has to be copied in a file called `main.go` inside the `boolean` directory. - The necessary changes have to be applied so that the program works. -- The program must be submitted inside a folder with the name `boolean`. - ### Code to be copied ```go diff --git a/subjects/btreeapplybylevel/README.md b/subjects/btreeapplybylevel/README.md index 49854009..c9594c1b 100644 --- a/subjects/btreeapplybylevel/README.md +++ b/subjects/btreeapplybylevel/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `BTreeApplyByLevel`, that applies the function given by `fn` to each node of the tree given by `root`. +Write a function, `BTreeApplyByLevel`, that applies the function given by `f`, to each node of the tree given by `root`. ### Expected function diff --git a/subjects/btreeapplyinorder/README.md b/subjects/btreeapplyinorder/README.md index ac93b868..4b4c99f1 100644 --- a/subjects/btreeapplyinorder/README.md +++ b/subjects/btreeapplyinorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function in order to each element in the tree (see "in order tree walks"). +Write a function that applies a given function `f`, **in order**, to each element in the tree. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function diff --git a/subjects/btreeapplypostorder/README.md b/subjects/btreeapplypostorder/README.md index 80bf85b9..4c5f6121 100644 --- a/subjects/btreeapplypostorder/README.md +++ b/subjects/btreeapplypostorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function using a postorder walk to each element in the tree. +Write a function that applies a given function `f`, to each element in the tree using a postorder walk. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function diff --git a/subjects/btreeapplypreorder/README.md b/subjects/btreeapplypreorder/README.md index b60cd9a5..5c9f154a 100644 --- a/subjects/btreeapplypreorder/README.md +++ b/subjects/btreeapplypreorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function using a preorder walk to each element in the tree. +Write a function that applies a given function `f` to each element in the tree using a preorder walk. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function diff --git a/subjects/btreeinsertdata/README.md b/subjects/btreeinsertdata/README.md index 7b637a78..558ba57d 100644 --- a/subjects/btreeinsertdata/README.md +++ b/subjects/btreeinsertdata/README.md @@ -2,10 +2,14 @@ ### Instructions -Write a function that inserts new data in a binary search tree following the properties of binary search trees. +Write a function that inserts new data in a `binary search tree` following the special properties of a `binary search trees`. The nodes must be defined as follows : +### Notions + +- [binary search trees](https://en.wikipedia.org/wiki/Binary_search_tree) + ### Expected function ```go diff --git a/subjects/btreeisbinary/README.md b/subjects/btreeisbinary/README.md index 7d57aa7b..d3a03faf 100644 --- a/subjects/btreeisbinary/README.md +++ b/subjects/btreeisbinary/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `BTreeIsBinary`, that returns `true` only if the tree given by `root` follows the binary search tree properties. +Write a function, `BTreeIsBinary`, that returns `true` only if the tree given by `root` follows the binary search tree [properties](https://en.wikipedia.org/wiki/Binary_search_tree#Definition). ### Expected function diff --git a/subjects/btreesearchitem/README.md b/subjects/btreesearchitem/README.md index 67b29d08..a364f57a 100644 --- a/subjects/btreesearchitem/README.md +++ b/subjects/btreesearchitem/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that searches for a node with a data element equal to `elem`and that returns that node. +Write a function that returns the `TreeNode` with a `data` field equal to `elem` if it exists in the tree, otherwise return `nil`. ### Expected function diff --git a/subjects/collatzcountdown/README.md b/subjects/collatzcountdown/README.md index f2547dd3..3bbf69a7 100644 --- a/subjects/collatzcountdown/README.md +++ b/subjects/collatzcountdown/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `CollatzCountdown`, that returns the number of steps necessary to reach 1 using the collatz countdown. +Write a function, `CollatzCountdown`, that returns the number of steps necessary to reach 1 using the [collatz countdown](https://en.wikipedia.org/wiki/Collatz_conjecture). - It must return `-1` if `start` is equal to `0` or negative. diff --git a/subjects/compact/README.md b/subjects/compact/README.md index 709d5c72..2a3470be 100644 --- a/subjects/compact/README.md +++ b/subjects/compact/README.md @@ -2,10 +2,10 @@ ### Instructions -Write a function `Compact` that takes a pointer to a slice of `string` as the argument. +Write a function `Compact` that takes a pointer to a slice of `string`s as the argument. This function must: -- Return the number of elements with non-zero value. +- Return the number of elements with [non-zero value](https://tour.golang.org/basics/12). - Compact, i.e., delete the elements with zero-values in the slice. diff --git a/subjects/convertbase/README.md b/subjects/convertbase/README.md index 06269e65..bb830281 100644 --- a/subjects/convertbase/README.md +++ b/subjects/convertbase/README.md @@ -2,7 +2,13 @@ ### Instructions -Write a function that returns the conversion of a `string` number from one `string` baseFrom to one `string` baseTo. +Write a function that receives three arguments: + +- `nbr`: A string representing a numberic value in a [base](https://simple.wikipedia.org/wiki/Base_(mathematics)). + +- `baseFrom`: A string representing the base `nbr` it's using. + +- `baseTo`: A string representing the base `nbr` should be represented in the returned value. Only valid bases will be tested. diff --git a/subjects/enigma/README.md b/subjects/enigma/README.md index 84d2efee..d4136e02 100644 --- a/subjects/enigma/README.md +++ b/subjects/enigma/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function called `Enigma` that receives pointers to as arguments and move its values around to hide them. +Write a function called `Enigma` that receives pointers as arguments and move its values around to hide them. This function will put : diff --git a/subjects/fibonacci/README.md b/subjects/fibonacci/README.md index cb90c944..68e66353 100644 --- a/subjects/fibonacci/README.md +++ b/subjects/fibonacci/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a **recursive** function that returns the value of the fibonacci sequence matching the index passed as parameter. +Write a **recursive** function that returns the value at the position `index` in the fibonacci sequence. The first value is at index `0`. diff --git a/subjects/free-project/README.md b/subjects/free-project/README.md new file mode 100644 index 00000000..4c1e46b2 --- /dev/null +++ b/subjects/free-project/README.md @@ -0,0 +1,35 @@ +## free-project + +### Instructions + +The free project is the opportunity to show what you have learned by making your +own webpage. + +You need to submit at least one `index.html` page, have some styling in a +`style.css` file and add a a `script.js` file, all of them must be properly +linked and used. + +Focus on building something that interest you, anything you want as long as you +use the given files for it: + +- Interactive trivia pages of something you love +- Business oriented ? Build your own branding with your online CV +- Artistic soul ? Make your own generative art +- You have a story to tell ? Make a point and click adventure +- Looking for a fun but ambitious idea ? Try a basic game (lots of JS) + +**Don't hesitate to use the code from the previous raid to get a head start.** + +> Not inspired ? Just focus on improving your previous raid: +> +> - Customize the colors +> - Change the subject +> - Add a new section, pictures +> - Do all the bonuses +> - Make sections collapsable + +### Extra + +If you want to go the extra mile here is to way to gain extra credits: +- Responsive (Make your web page work on mobile and desktop) +- Publish It ! (Use a service, like [github pages](https://pages.github.com/) or [cloudflare pages](https://pages.cloudflare.com/) to host your page, it's free) diff --git a/subjects/free-project/audit/README.md b/subjects/free-project/audit/README.md new file mode 100644 index 00000000..96862459 --- /dev/null +++ b/subjects/free-project/audit/README.md @@ -0,0 +1,13 @@ +#### Required + +###### Is the `index.html` webpage displayed properly ? + +###### Is css applied from the `style.css` file ? + +###### Are scripts loaded from `script.js` file and no errors shown in the console ? + +#### Optional + +###### +Did you use a service to publish it ? (github pages or equivalent) + +###### +Does the webpage work on multiple window size ? (phone, tablets, computers...) diff --git a/subjects/go-reloaded/README.md b/subjects/go-reloaded/README.md index 589f1570..80edee73 100644 --- a/subjects/go-reloaded/README.md +++ b/subjects/go-reloaded/README.md @@ -64,12 +64,12 @@ $cat result.txt There is no greater agony than bearing an untold story inside you. $ cat sample.txt -Ponctuation tests are ... kinda boring ,don't you think !? +Punctuation tests are ... kinda boring ,don't you think !? $ go run . sample.txt result.txt $cat result.txt -Ponctuation tests are... kinda boring, don't you think!? +Punctuation tests are... kinda boring, don't you think!? ``` This project will help you learn about : diff --git a/subjects/go-reloaded/audit/README.md b/subjects/go-reloaded/audit/README.md index 9c630462..2a9ecf12 100644 --- a/subjects/go-reloaded/audit/README.md +++ b/subjects/go-reloaded/audit/README.md @@ -2,18 +2,18 @@ ###### Has the requirement for the allowed packages been respected? (Reminder for this project: (only [standard packages](https://golang.org/pkg/) -##### In a file called `sample.txt`, place the following text (without the quotation marks): "If I make you BREAKFAST IN BED (low, 3) just say thank you instead of: how (cap) did you get in my house (up, 2) ?". Now run the student program with the arguments: `sample.txt result.txt`. +##### In a file called `sample.txt`, place the following text (without the double quotes): "If I make you BREAKFAST IN BED (low, 3) just say thank you instead of: how (cap) did you get in my house (up, 2) ?". Now run the student program with the arguments: `sample.txt result.txt`. ###### Is the text present in `result.txt` equal to: "If I make you breakfast in bed just say thank you instead of: How did you get in MY HOUSE?" -##### In a file called `sample.txt` place the following text (without the quotation marks): "I have to pack 101 (bin) outfits. Packed 1a (hex) just to be sure". Now run the student program with the arguments: `sample.txt result.txt`. +##### In a file called `sample.txt` place the following text (without the double quotes): "I have to pack 101 (bin) outfits. Packed 1a (hex) just to be sure". Now run the student program with the arguments: `sample.txt result.txt`. ###### Is the text present in `result.txt` equal to: "I have to pack 5 outfits. Packed 26 just to be sure"? -##### In a file called `sample.txt` place the following text (without the quotation marks): "Don't be sad ,because sad backwards is das . And das not good". Now run the student program with the arguments: `sample.txt result.txt`. +##### In a file called `sample.txt` place the following text (without the double quotes): "Don't be sad ,because sad backwards is das . And das not good". Now run the student program with the arguments: `sample.txt result.txt`. ###### Is the text present in `result.txt` equal to: "Don't be sad, because sad backwards is das. And das not good" -##### In a file called `sample.txt` place the following text (without the quotation marks): "harold wilson (cap, 2) : ' I’m a optimist ,but a optimist who carries a raincoat . '". Now run the student program with the arguments: `sample.txt result.txt`. +##### In a file called `sample.txt` place the following text (without the double quotes): "harold wilson (cap, 2) : ' I’m a optimist ,but a optimist who carries a raincoat . '". Now run the student program with the arguments: `sample.txt result.txt`. ###### Is the text present in `result.txt` equal to: "Harold Wilson: 'I’m an optimist, but an optimist who carries a raincoat.'" diff --git a/subjects/iterativepower/README.md b/subjects/iterativepower/README.md index 52b0228e..05542790 100644 --- a/subjects/iterativepower/README.md +++ b/subjects/iterativepower/README.md @@ -2,7 +2,7 @@ ### Instructions -Write an **iterative** function that returns the power of the `int` passed as parameter. +Write an **iterative** function that returns the value of `nb` to the power of `power`. Negative powers will return `0`. Overflows do **not** have to be dealt with. diff --git a/subjects/join/README.md b/subjects/join/README.md index fdf73457..6fb436ee 100644 --- a/subjects/join/README.md +++ b/subjects/join/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that simulates the behaviour of the `Join` function in Go. This function returns the concatenation of all the strings of a slice of strings **separated** by a separator passed in argument. +Write a function that returns the concatenation of all the `string`s of a slice of `string`s **separated** by the separator passed in the argument `sep`. ### Expected function diff --git a/subjects/makerange/README.md b/subjects/makerange/README.md index 588781ca..feccdab2 100644 --- a/subjects/makerange/README.md +++ b/subjects/makerange/README.md @@ -3,7 +3,7 @@ ### Instructions Write a function that takes an `int` min and an `int` max as parameters. -That function returns a slice of `int` with all the values between min and max. +That function returns a slice of `int`s with all the values between min and max. Min is included, and max is excluded. diff --git a/subjects/math-skills/README.md b/subjects/math-skills/README.md index 133bef81..a32b7708 100644 --- a/subjects/math-skills/README.md +++ b/subjects/math-skills/README.md @@ -5,9 +5,9 @@ The purpose of this project is for you to calculate the following: - Average -- Standard Deviation -- Variance - Median +- Variance +- Standard Deviation ### Instructions @@ -35,9 +35,9 @@ After reading the file, your program must execute each of the calculations asked ```console Average: 35 -Standard Deviation: 65 -Variance: 5 Median: 4 +Variance: 5 +Standard Deviation: 65 ``` Please note that the values are rounded integers. @@ -52,6 +52,6 @@ This project will help you learn about: - Statistics and Mathematics - [Average](https://en.wikipedia.org/wiki/Average) - - [Standard Deviation](https://en.wikipedia.org/wiki/Standard_deviation) - - [Variance](https://en.wikipedia.org/wiki/Variance) - [Median](https://en.wikipedia.org/wiki/Median) + - [Variance](https://en.wikipedia.org/wiki/Variance) + - [Standard Deviation](https://en.wikipedia.org/wiki/Standard_deviation) diff --git a/subjects/pilot/README.md b/subjects/pilot/README.md index e3b7f370..c12200d7 100644 --- a/subjects/pilot/README.md +++ b/subjects/pilot/README.md @@ -2,7 +2,11 @@ ### Instructions -Append to the code below what is needed so that the program compiles. +- Create a directory called `pilot`. +- Inside the directory `pilot` create a file `main.go`. +- Copy the code below to `main.go` and add the code needed so that the program compiles. + +> Note: You can only add code, not delete. ### Usage diff --git a/subjects/point/README.md b/subjects/point/README.md index 7d532066..0c4c901b 100644 --- a/subjects/point/README.md +++ b/subjects/point/README.md @@ -2,14 +2,12 @@ ### Instructions -Create a `.go` file. +Create a new directory called `point`. -- The code below has to be copied in that file. +- The code below has to be copied in a file called `main.go` inside the `point` directory. - The necessary changes have to be applied so that the program works. -- The program must be submitted inside a folder with the name `point`. - ### Code to be copied ```go diff --git a/subjects/printwordstables/README.md b/subjects/printwordstables/README.md index 21cd4f55..d738ea84 100644 --- a/subjects/printwordstables/README.md +++ b/subjects/printwordstables/README.md @@ -2,9 +2,7 @@ ### Instructions -Write a function that prints the words of a `string` slice that will be returned by a function `SplitWhiteSpaces`. - -Each word is on a single line (each word ends with a `\n`). +Write a function that receives a `string slice` and prints each element of the slice in a seperate line. ### Expected function diff --git a/subjects/recursivepower/README.md b/subjects/recursivepower/README.md index 3e2c6163..b4e92614 100644 --- a/subjects/recursivepower/README.md +++ b/subjects/recursivepower/README.md @@ -2,7 +2,7 @@ ### Instructions -Write an **recursive** function that returns the power of the `int` passed as parameter. +Write a **recursive** function that returns the value of `nb` to the power of `power`. Negative powers will return `0`. Overflows do **not** have to be dealt with. diff --git a/subjects/split/README.md b/subjects/split/README.md index f98fdc5b..dae5d8f3 100644 --- a/subjects/split/README.md +++ b/subjects/split/README.md @@ -2,9 +2,7 @@ ### Instructions -Write a function that separates the words of a `string` and puts them in a `string` slice. - -The separators are the characters of the separator string given in parameter. +Write a function that receives a string and a separator and returns a `slice of strings` that results of splitting the string `s` by the separator `sep`. ### Expected function diff --git a/subjects/splitwhitespaces/README.md b/subjects/splitwhitespaces/README.md index de3247ba..96769706 100644 --- a/subjects/splitwhitespaces/README.md +++ b/subjects/splitwhitespaces/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that separates the words of a `string` and puts them in a `string` slice. +Write a function that separates the words of a `string` and puts them in a `string slice`. The separators are spaces, tabs and newlines. diff --git a/subjects/unmatch/README.md b/subjects/unmatch/README.md index 5e071a7f..25de0b7a 100644 --- a/subjects/unmatch/README.md +++ b/subjects/unmatch/README.md @@ -4,7 +4,7 @@ Write a function, `Unmatch`, that returns the element of the slice that does not have a correspondent pair. -- If all the number have a correspondent pair, it shoud return `-1`. +- If all the number have a correspondent pair, it should return `-1`. ### Expected function