-
-
Notifications
You must be signed in to change notification settings - Fork 182
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
* Add kindergarten-garden (#940) * Address comments
- Loading branch information
Showing
13 changed files
with
4,290 additions
and
20 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
58 changes: 58 additions & 0 deletions
58
exercises/practice/kindergarten-garden/.docs/instructions.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,58 @@ | ||
# Instructions | ||
|
||
Given a diagram, determine which plants each child in the kindergarten class is | ||
responsible for. | ||
|
||
The kindergarten class is learning about growing plants. | ||
The teacher thought it would be a good idea to give them actual seeds, plant them in actual dirt, and grow actual plants. | ||
|
||
They've chosen to grow grass, clover, radishes, and violets. | ||
|
||
To this end, the children have put little cups along the window sills, and | ||
planted one type of plant in each cup, choosing randomly from the available | ||
types of seeds. | ||
|
||
```text | ||
[window][window][window] | ||
........................ # each dot represents a cup | ||
........................ | ||
``` | ||
|
||
There are 12 children in the class: | ||
|
||
- Alice, Bob, Charlie, David, | ||
- Eve, Fred, Ginny, Harriet, | ||
- Ileana, Joseph, Kincaid, and Larry. | ||
|
||
Each child gets 4 cups, two on each row. | ||
Their teacher assigns cups to the children alphabetically by their names. | ||
|
||
The following diagram represents Alice's plants: | ||
|
||
```text | ||
[window][window][window] | ||
VR...................... | ||
RG...................... | ||
``` | ||
|
||
In the first row, nearest the windows, she has a violet and a radish. | ||
In the second row she has a radish and some grass. | ||
|
||
Your program will be given the plants from left-to-right starting with the row nearest the windows. | ||
From this, it should be able to determine which plants belong to each student. | ||
|
||
For example, if it's told that the garden looks like so: | ||
|
||
```text | ||
[window][window][window] | ||
VRCGVVRVCGGCCGVRGCVCGCGV | ||
VRCCCGCRRGVCGCRVVCVGCGCV | ||
``` | ||
|
||
Then if asked for Alice's plants, it should provide: | ||
|
||
- Violets, radishes, violets, radishes | ||
|
||
While asking for Bob's plants would yield: | ||
|
||
- Clover, grass, clover, clover |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
{ | ||
"authors": [ | ||
"ahans" | ||
], | ||
"files": { | ||
"solution": [ | ||
"kindergarten_garden.c", | ||
"kindergarten_garden.h" | ||
], | ||
"test": [ | ||
"test_kindergarten_garden.c" | ||
], | ||
"example": [ | ||
".meta/example.c", | ||
".meta/example.h" | ||
] | ||
}, | ||
"blurb": "Given a diagram, determine which plants each child in the kindergarten class is responsible for.", | ||
"source": "Exercise by the JumpstartLab team for students at The Turing School of Software and Design.", | ||
"source_url": "https://turing.edu" | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,48 @@ | ||
#include "kindergarten_garden.h" | ||
|
||
#include <stdio.h> | ||
#include <stdlib.h> | ||
#include <string.h> | ||
|
||
static int student_to_index(const char *student) | ||
{ | ||
static const char *students[] = { "Alice", "Bob", "Charlie", "David", | ||
"Eve", "Fred", "Ginny", "Harriet", | ||
"Ileana", "Joseph", "Kincaid", "Larry" }; | ||
for (size_t i = 0; i < sizeof(students) / sizeof(students[0]); ++i) { | ||
if (strcmp(students[i], student) == 0) { | ||
return i; | ||
} | ||
} | ||
printf("error: student %s not found\n", student); | ||
exit(1); | ||
} | ||
|
||
static plant_t letter_to_plant(char letter) | ||
{ | ||
switch (letter) { | ||
case 'C': | ||
return CLOVER; | ||
case 'G': | ||
return GRASS; | ||
case 'R': | ||
return RADISHES; | ||
case 'V': | ||
return VIOLETS; | ||
} | ||
printf("error: letter %c does not match any plant\n", letter); | ||
exit(1); | ||
} | ||
|
||
plants_t plants(const char *diagram, const char *student) | ||
{ | ||
const char *rows[] = { diagram, strchr(diagram, '\n') + 1 }; | ||
const size_t student_col = student_to_index(student) * 2; | ||
plants_t res; | ||
for (int i = 0; i < 4; ++i) { | ||
const size_t row_index = i / 2; | ||
const size_t col_index = student_col + i % 2; | ||
res.plants[i] = letter_to_plant(rows[row_index][col_index]); | ||
} | ||
return res; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
#ifndef KINDERGARTEN_GARDEN_H | ||
#define KINDERGARTEN_GARDEN_H | ||
|
||
typedef enum { CLOVER = 0, GRASS = 1, RADISHES = 2, VIOLETS = 3 } plant_t; | ||
|
||
typedef struct { | ||
plant_t plants[4]; | ||
} plants_t; | ||
|
||
plants_t plants(const char *diagram, const char *student); | ||
|
||
#endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
# This is an auto-generated file. | ||
# | ||
# Regenerating this file via `configlet sync` will: | ||
# - Recreate every `description` key/value pair | ||
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications | ||
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion) | ||
# - Preserve any other key/value pair | ||
# | ||
# As user-added comments (using the # character) will be removed when this file | ||
# is regenerated, comments can be added via a `comment` key. | ||
|
||
[1fc316ed-17ab-4fba-88ef-3ae78296b692] | ||
description = "partial garden -> garden with single student" | ||
|
||
[acd19dc1-2200-4317-bc2a-08f021276b40] | ||
description = "partial garden -> different garden with single student" | ||
|
||
[c376fcc8-349c-446c-94b0-903947315757] | ||
description = "partial garden -> garden with two students" | ||
|
||
[2d620f45-9617-4924-9d27-751c80d17db9] | ||
description = "partial garden -> multiple students for the same garden with three students -> second student's garden" | ||
|
||
[57712331-4896-4364-89f8-576421d69c44] | ||
description = "partial garden -> multiple students for the same garden with three students -> third student's garden" | ||
|
||
[149b4290-58e1-40f2-8ae4-8b87c46e765b] | ||
description = "full garden -> for Alice, first student's garden" | ||
|
||
[ba25dbbc-10bd-4a37-b18e-f89ecd098a5e] | ||
description = "full garden -> for Bob, second student's garden" | ||
|
||
[566b621b-f18e-4c5f-873e-be30544b838c] | ||
description = "full garden -> for Charlie" | ||
|
||
[3ad3df57-dd98-46fc-9269-1877abf612aa] | ||
description = "full garden -> for David" | ||
|
||
[0f0a55d1-9710-46ed-a0eb-399ba8c72db2] | ||
description = "full garden -> for Eve" | ||
|
||
[a7e80c90-b140-4ea1-aee3-f4625365c9a4] | ||
description = "full garden -> for Fred" | ||
|
||
[9d94b273-2933-471b-86e8-dba68694c615] | ||
description = "full garden -> for Ginny" | ||
|
||
[f55bc6c2-ade8-4844-87c4-87196f1b7258] | ||
description = "full garden -> for Harriet" | ||
|
||
[759070a3-1bb1-4dd4-be2c-7cce1d7679ae] | ||
description = "full garden -> for Ileana" | ||
|
||
[78578123-2755-4d4a-9c7d-e985b8dda1c6] | ||
description = "full garden -> for Joseph" | ||
|
||
[6bb66df7-f433-41ab-aec2-3ead6e99f65b] | ||
description = "full garden -> for Kincaid, second to last student's garden" | ||
|
||
[d7edec11-6488-418a-94e6-ed509e0fa7eb] | ||
description = "full garden -> for Larry, last student's garden" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
#include "kindergarten_garden.h" |
10 changes: 10 additions & 0 deletions
10
exercises/practice/kindergarten-garden/kindergarten_garden.h
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
#ifndef KINDERGARTEN_GARDEN_H | ||
#define KINDERGARTEN_GARDEN_H | ||
|
||
typedef enum { CLOVER = 0, GRASS = 1, RADISHES = 2, VIOLETS = 3 } plant_t; | ||
|
||
typedef struct { | ||
plant_t plants[4]; | ||
} plants_t; | ||
|
||
#endif |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
### If you wish to use extra libraries (math.h for instance), | ||
### add their flags here (-lm in our case) in the "LIBS" variable. | ||
|
||
LIBS = -lm | ||
|
||
### | ||
CFLAGS = -std=c99 | ||
CFLAGS += -g | ||
CFLAGS += -Wall | ||
CFLAGS += -Wextra | ||
CFLAGS += -pedantic | ||
CFLAGS += -Werror | ||
CFLAGS += -Wmissing-declarations | ||
CFLAGS += -DUNITY_SUPPORT_64 -DUNITY_OUTPUT_COLOR | ||
|
||
ASANFLAGS = -fsanitize=address | ||
ASANFLAGS += -fno-common | ||
ASANFLAGS += -fno-omit-frame-pointer | ||
|
||
.PHONY: test | ||
test: tests.out | ||
@./tests.out | ||
|
||
.PHONY: memcheck | ||
memcheck: ./*.c ./*.h | ||
@echo Compiling $@ | ||
@$(CC) $(ASANFLAGS) $(CFLAGS) test-framework/unity.c ./*.c -o memcheck.out $(LIBS) | ||
@./memcheck.out | ||
@echo "Memory check passed" | ||
|
||
.PHONY: clean | ||
clean: | ||
rm -rf *.o *.out *.out.dSYM | ||
|
||
tests.out: ./*.c ./*.h | ||
@echo Compiling $@ | ||
@$(CC) $(CFLAGS) test-framework/unity.c ./*.c -o tests.out $(LIBS) |
Oops, something went wrong.