+
The purpose of this assignment is to learn to
###Key Press Events - NonBlocking Games
+###Key Press Events - Blocking Games
+###Variables, Colors, and Sprite Symbols
+###Important Functions
+
+
+
+## Learning Outcomes
+
+1. Encapsulation
+2. Conditions
+3. Loops
+4. Arrays
+
+
+## Goals
-Goals
------
The purpose of this assignment is to learn to
1. Create a game where the player drives a car around an ever-changing track.
-Programming
------------
+
+## Description
+
### Tasks
- Initialize a 2D array the size of your game grid.
- Initialize the NamedColors and symbols for your car, walls and background.
@@ -19,9 +32,8 @@ Programming
- Create a function that places random objects that the player could crash into and trigger a game over.
- Create a win scenario.
-More Details to Get You Started
--------------------------------
-###Key Press Events - NonBlocking Games
+### More Details to Get You Started
+#### Key Press Events - NonBlocking Games
- keyUp()
- keyDown()
- keyLeft()
@@ -33,7 +45,7 @@ More Details to Get You Started
- keyA()
- keyD()
-###Key Press Events - Blocking Games
+#### Key Press Events - Blocking Games
- getKeyPress(); Returns a string.
- "ArrowLeft"
- "ArrowRight"
@@ -45,20 +57,29 @@ More Details to Get You Started
- "d"
- etc...
-###Variables, Colors, and Sprite Symbols
+#### Variables, Colors, and Sprite Symbols
- NamedSymbol.symbolname;
- NamedColor.colorname;
- drawSymbol(column, row, NamedSymbol, NamedColor);
- setBGColor(column, row, NamedColor);
-###Important Functions
+#### Important Functions
- The gameLoop() function loops until the game is over.
- quit() stops the game.
- start() starts the game and calls the initialize() function once before it starts the gameLoop() function.
- render() sends your updated game grid to the server once. This is a blocking game function.
-### Help
+
+## Extensions
+
+
+## Help
+
+#### For Java
+[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1games_1_1_non_blocking_game.html)
+
#### For C++
[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1game_1_1_non_blocking_game.html)
+
#### For Python
[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1non__blocking__game_1_1_non_blocking_game.html)
\ No newline at end of file
diff --git a/assignments/data/21-RaceCar/c++.zip b/assignments/data/21-RaceCar/c++.zip
index 6852991d7..b44c047ac 100644
Binary files a/assignments/data/21-RaceCar/c++.zip and b/assignments/data/21-RaceCar/c++.zip differ
diff --git a/assignments/data/21-RaceCar/java.zip b/assignments/data/21-RaceCar/java.zip
index 0d1c360a8..24917ceff 100644
Binary files a/assignments/data/21-RaceCar/java.zip and b/assignments/data/21-RaceCar/java.zip differ
diff --git a/assignments/data/21-RaceCar/python.zip b/assignments/data/21-RaceCar/python.zip
index 8497410e1..253dd6946 100644
Binary files a/assignments/data/21-RaceCar/python.zip and b/assignments/data/21-RaceCar/python.zip differ
diff --git a/assignments/data/22-Snake/README.html b/assignments/data/22-Snake/README.html
index b2fd46f51..c8c6157bf 100644
--- a/assignments/data/22-Snake/README.html
+++ b/assignments/data/22-Snake/README.html
@@ -1,4 +1,11 @@
-The purpose of this assignment is to learn to
###Key Press Events - NonBlocking Games
+###Key Press Events - Blocking Games
+###Variables, Colors, and Sprite Symbols
+###Important Functions
+
+
+
+## Learning Outcomes
+
+1. Queues
+2. Loops
+
+
+## Goals
-Goals
- -----
The purpose of this assignment is to learn to
1. The classic game of Snake. Move a "snake" (line of sprites) along a 2D grid attempting to run over a randomly placed object to help it grow.
2. If it runs into itself the game is over and the player has lost.
3. The object of the game is to make the snake as big as possible.
-Programming
------------
+
+## Description
+
### Tasks
- Initialize a 2D array the size of your game grid.
- Initialize the NamedColors of your background, snake, and object.
@@ -19,9 +30,9 @@ Programming
- Create a function that handles the condition of the snakes head interacting with the food object. Make sure the snakes body grows and the object is gone after a collision.
- Implement a condition which triggers a game over if the snakes head collides with its body.
-More Details to Get You Started
+### More Details to Get You Started
-------------------------------
-###Key Press Events - NonBlocking Games
+#### Key Press Events - NonBlocking Games
- keyUp()
- keyDown()
- keyLeft()
@@ -33,7 +44,7 @@ More Details to Get You Started
- keyA()
- keyD()
-###Key Press Events - Blocking Games
+#### Key Press Events - Blocking Games
- getKeyPress(); Returns a string.
- "ArrowLeft"
- "ArrowRight"
@@ -45,20 +56,29 @@ More Details to Get You Started
- "d"
- etc...
-###Variables, Colors, and Sprite Symbols
+#### Variables, Colors, and Sprite Symbols
- NamedSymbol.symbolname;
- NamedColor.colorname;
- drawObject(column, row, NamedSymbol, NamedColor);
- setBGColor(column, row, NamedColor);
-###Important Functions
+#### Important Functions
- The gameLoop() function loops until the game is over.
- quit() stops the game.
- start() starts the game and calls the initialize() function once before it starts the gameLoop() function.
- render() sends your updated game grid to the server once. This is a blocking game function.
-### Help
+
+## Extensions
+
+
+## Help
+
+#### For Java
+[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1games_1_1_non_blocking_game.html)
+
#### For C++
[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1game_1_1_non_blocking_game.html)
+
#### For Python
[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1non__blocking__game_1_1_non_blocking_game.html)
diff --git a/assignments/data/22-Snake/c++.zip b/assignments/data/22-Snake/c++.zip
index 1eb0c0f00..96ff78c44 100644
Binary files a/assignments/data/22-Snake/c++.zip and b/assignments/data/22-Snake/c++.zip differ
diff --git a/assignments/data/22-Snake/java.zip b/assignments/data/22-Snake/java.zip
index f8e08d17d..5aafe2776 100644
Binary files a/assignments/data/22-Snake/java.zip and b/assignments/data/22-Snake/java.zip differ
diff --git a/assignments/data/22-Snake/python.zip b/assignments/data/22-Snake/python.zip
index 5b4d036fa..055c8056b 100644
Binary files a/assignments/data/22-Snake/python.zip and b/assignments/data/22-Snake/python.zip differ
diff --git a/assignments/data/23-MountainPaths/README.html b/assignments/data/23-MountainPaths/README.html
index e19580678..434d89b2c 100644
--- a/assignments/data/23-MountainPaths/README.html
+++ b/assignments/data/23-MountainPaths/README.html
@@ -1,13 +1,22 @@
-This assignment is adapted from a **Nifty assignment +from 2016 proposed by Baker Franke. See **Source
+This assignment is adapted from a **Nifty assignment -from 2016 proposed by Baker Franke. See **Source
You are given elevation data of a mountainous region in the form of a 2D array of integers (see example image below of one of the datasets). Your goal is to find a path that takes @@ -29,7 +38,7 @@
get dataset, visualize as an image You will use BRIDGES to define a lat/long range (rectangular bounding box of your choice) to access the elevation data (returned in an object @@ -64,7 +73,7 @@
One can make variants of this assignment. Indeed, the greedy algorithm presented above is a heuristic; it does not return the path that sees the lowest change of elevation across the entire mountain. It only makes a @@ -86,24 +95,24 @@
BRIDGES Team: Contact the BRIDGES team for any issues with the BRIDGES API. This is an active project.
-ElevationData Documentation +DataSource +ColorGrid documentation +Color documentation +Bridges class documentation
+ElevationData Documentation +DataSource +ColorGrid documentation +Color documentation +Bridges Class documentation
+Elevation Data Documentation +ColorGrid documentation +Color documentation +Bridges documentation +DataSource
diff --git a/assignments/data/23-MountainPaths/README.md b/assignments/data/23-MountainPaths/README.md index 87bd6dbeb..031b52fac 100644 --- a/assignments/data/23-MountainPaths/README.md +++ b/assignments/data/23-MountainPaths/README.md @@ -1,5 +1,22 @@ -Mountain Paths - Determining a path of low elevation through a mountain -======================================================================= +# Assignment 23 - Mountain Paths - Determining a path of low elevation through a mountain + +## Example Output + +
+
+
+## Source
+This assignment is adapted from a **[Nifty](http://nifty.stanford.edu/) assignment
+from 2016 proposed by Baker Franke. See **[Source](http://nifty.stanford.edu/2016/franke-mountain-paths/)
+
+
+## Learning Outcomes
+
+1. Greedy Algorithm
+2. 2D Arrays
+3. Data Visulization
+4. Modifying Datastructures
+
## Goals
@@ -7,24 +24,21 @@ Mountain Paths - Determining a path of low elevation through a mountain
2. Understanding Greedy algorithms and its application to a real-world application
3. CS concepts: 2D array addressing, greedy algorithms
-## Source
-This assignment is adapted from a **[Nifty](http://nifty.stanford.edu/) assignment
-from 2016 proposed by Baker Franke. See **[Source](http://nifty.stanford.edu/2016/franke-mountain-paths/)
## Description
+
You are given elevation data of a mountainous region in the form of a 2D array of integers
(see example image below of one of the datasets). Your goal is to find a path that takes
you through the points with the lowest elevation changes, in an effort to minimize the
overall effort in walking through the path. For this you will use a `greedy' approach and
make local decisions in determining the successive points in the path.
-
+
Input gray scale image of a terrain with gray shades mapped to elevation. Elevation ranges from low (dark shades) to high (lighter shades)
The image above shows a mountainous region; lighter regions are higher elevation,
and the red line shows the path taken by a walker.
-
### Algorithm To Determine the Path:
@@ -41,9 +55,7 @@ of the image (say the leftmost column), then make moves based on the pixels to t
each time choosing the pixel that results in the smallest change. Your goal is to reach
the right edge of the image.
-
-
-## Tasks
+### Tasks
1. *get dataset, visualize as an image* You will use BRIDGES to define a lat/long range (rectangular bounding box of your choice) to access the elevation data (returned in an object
containing the elevation values). You will need to calculate maximum elevation value, as you
@@ -73,9 +85,7 @@ of the grid, your choices will be reduced.
path (see example above). You can have a simple User Interface to specify the starting
point and rerun your program to display different paths.
-
-
-## Variants
+## Extensions
One can make variants of this assignment. Indeed, the greedy
algorithm presented above is a heuristic; it does not return the path
@@ -94,44 +104,29 @@ local choice. Here are some possibilities:
3. Graduate students can consider the problem of optimizing simultaneously the distance
traversed and the total change of elevation as a bi objective optimization problem.
-## Additional Help:
+
+## Help:
[BRIDGES Team:](http://bridgesuncc.github.io/) Contact the BRIDGES team for any
issues with the BRIDGES API. This is an active project.
-
-#### for Java
-
+#### For Java
[ElevationData Documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1data__src__dependent_1_1_elevation_data.html)
-
[DataSource](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1connect_1_1_data_source.html)
-
[ColorGrid documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color_grid.html)
-
[Color documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color.html)
-
[Bridges class documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1connect_1_1_bridges.html)
-#### for C++
+#### For C++
[ElevationData Documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1dataset_1_1_elevation_data.html)
-
[DataSource](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_data_source.html)
-
[ColorGrid documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color_grid.html)
-
[Color documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color.html)
-
[Bridges Class documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html)
-
-#### for Python
-
+#### For Python
[Elevation Data Documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1data__src__dependent_1_1elevation_1_1_elevation_data.html)
-
[ColorGrid documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color__grid_1_1_color_grid.html)
-
[Color documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color_1_1_color.html)
-
[Bridges documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1bridges_1_1_bridges.html)
-
[DataSource](http://bridgesuncc.github.io/doc/python-api/current/html/data__source_8py.html)
diff --git a/assignments/data/23-MountainPaths/c++.zip b/assignments/data/23-MountainPaths/c++.zip
index 448333ed0..f96f46fb9 100644
Binary files a/assignments/data/23-MountainPaths/c++.zip and b/assignments/data/23-MountainPaths/c++.zip differ
diff --git a/assignments/data/23-MountainPaths/java.zip b/assignments/data/23-MountainPaths/java.zip
index 6cc71fbf7..62e0f8ab0 100644
Binary files a/assignments/data/23-MountainPaths/java.zip and b/assignments/data/23-MountainPaths/java.zip differ
diff --git a/assignments/data/23-MountainPaths/python.zip b/assignments/data/23-MountainPaths/python.zip
index 500b1b9c6..b4dd089f5 100644
Binary files a/assignments/data/23-MountainPaths/python.zip and b/assignments/data/23-MountainPaths/python.zip differ
diff --git a/assignments/data/24-ImageCompressionKdTree/README.html b/assignments/data/24-ImageCompressionKdTree/README.html
index ee17ddff4..0de8b8969 100644
--- a/assignments/data/24-ImageCompressionKdTree/README.html
+++ b/assignments/data/24-ImageCompressionKdTree/README.html
@@ -1,13 +1,20 @@
-
+
K-D trees (K stands for the number of dimensions) are a spatial equivalent of the more familiar binary search trees, that usually have integer keys to facililtate efficient (log n) search). K-D trees belong to the class of spatial search tree structures, that include quadtrees, @@ -22,7 +29,7 @@
Illustrates a 2D region's partitioning with horizontal (X) and vertically (Y) oriented partitioners
In the figures above, a 2D region is being partitioned. The first partitioner is the white line that goes across the region, dividing it into two subregions (these become children of the root node of the tree. At the next level, the yellow lines partition the two subregions creating two of their own children each. Finally the blue lines subdivide at the third level. Each region can contain data (di s) that can be points or other information that can then be searched for efficiently knowing the location of the partitioning lines.
-
Application of K-D Trees to representing a shape. Here the green square (left image) is a
@@ -38,7 +45,6 @@ Example
The entire image is now represented by the tree with enough information (leaf nodes will have
the region geometry and its color) to generate the image.
Applications: Refer to the Wikipedia page on K-D trees for additional information and applications.
-You will use the K-D TreeElement class structure as a subclass of the BinTreeElement defined in BRIDGES. You will use this structure along with the ColorGrid type to represent images using K-D Trees.
@@ -132,7 +138,7 @@We need to be able to compute how homogeneous a region is before deciding to partition that region. You will write two versions of this function
IsRegionHomogeneous ()
@@ -169,11 +175,11 @@Note that we are using the ColorGrid type to fill the image with the region colors (r, g and b), so that we can visualize it with BRIDGES. Follow the Colorgrid tutorials for filling in regions with the computed colors (as required by the ColorRegion() function above).
-The project can be extended in a number of ways to reinforce tree structures and explore applications:
BRIDGES Team: Contact the BRIDGES team for any issues with -the BRIDGES API. This is an active project.
-K-D Tree Element documentation
- - - -K-D Tree Element documentation
- - - -K-D Tree Element documentation
- - - +BRIDGES Team: Contact the BRIDGES team for any issues with the BRIDGES API. This is an active project.
+K-D Tree Element documentation +ColorGrid documentation +Color documentation +Bridges documentation
+K-D Tree Element documentation +ColorGrid documentation +Color documentation +Bridges class documentation
+K-D Tree Element documentation +ColorGrid documentation +Color documentation +Bridges documentation
diff --git a/assignments/data/24-ImageCompressionKdTree/README.md b/assignments/data/24-ImageCompressionKdTree/README.md index cc4522213..07ae9cfcf 100644 --- a/assignments/data/24-ImageCompressionKdTree/README.md +++ b/assignments/data/24-ImageCompressionKdTree/README.md @@ -1,16 +1,25 @@ +# Assignment 24 - Representing and Compressing Images Using K-D Trees + +## Example Output + + + + + +## Learning Outcomes + +1. Recursion +2. Data Visualization +3. K-D Tree -Representing and Compressing Images Using K-D Trees -=================================================== ## Goals -1. Work with and manipulate binary search trees; here we use a spatial search tree, which is - similar to quadtree or octree. -2. Introduce students to images, their representation and compression using approximate - representations. -3. Introduce students to BRIDGES Tree hierarchy, use of inheritance and polymorphism +1. Work with and manipulate binary search trees; here we use a spatial search tree, which is similar to quadtree or octree. +2. Introduce students to images, their representation and compression using approximate representations. +3. Introduce students to BRIDGES Tree hierarchy, use of inheritance and polymorphism -## Background +## Description K-D trees (K stands for the number of dimensions) are a spatial equivalent of the more familiar binary search trees, that usually have integer keys to facililtate efficient (log n) search). @@ -33,7 +42,7 @@ a 3 level partitioning: In the figures above, a 2D region is being partitioned. The first partitioner is the white line that goes across the region, dividing it into two subregions (these become children of the root node of the tree. At the next level, the yellow lines partition the two subregions creating two of their own children each. Finally the blue lines subdivide at the third level. Each region can contain data (di s) that can be points or other information that can then be searched for efficiently knowing the location of the partitioning lines. -## Example +### Example   @@ -55,15 +64,11 @@ the region geometry and its color) to generate the image. Applications: Refer to the Wikipedia page on **[K-D trees](https://en.wikipedia.org/wiki/K-d_tree)** for additional information and applications. -## Project - You will use the K-D TreeElement class structure as a subclass of the BinTreeElement defined in BRIDGES. You will use this structure along with the ColorGrid type to represent images using K-D Trees. - ### Tasks: - 1. *Preparation:* 1. Go through the BRIDGES API for both the **[K-D Tree Element](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_kd_tree_element.html)** and the **[ColorGrid](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color_grid.html)** types and look at the tutorial examples to understand its usage. In particular, understand @@ -143,7 +148,7 @@ the class hierarchy for tree structures (Java and Python users: check the Java o return nullptr; } -### Region Homogeneity: +#### Region Homogeneity: We need to be able to compute how homogeneous a region is before deciding to partition that region. You will write two versions of this function @@ -176,13 +181,14 @@ and return false, else return true. pick a value between first and the second third (between (10+40/3, 50-40/3). If the region width (max-min) is less than 3, then return true (homogeneous) to avoid degenerate cases). -### Visualization: +#### Visualization: Note that we are using the ColorGrid type to fill the image with the region colors (r, g and b), so that we can visualize it with BRIDGES. Follow the Colorgrid tutorials for filling in regions with the computed colors (as required by the ColorRegion() function above). -### Extensions + +## Extensions The project can be extended in a number of ways to reinforce tree structures and explore applications: @@ -196,35 +202,24 @@ applications: 3. Consider using other methods for homogeneity that might be more optimal from a compression perspective. -## Help -[BRIDGES Team:](http://bridgesuncc.github.io/) Contact the BRIDGES team for any issues with -the BRIDGES API. This is an active project. -#### for C++ +## Help +[BRIDGES Team:](http://bridgesuncc.github.io/) Contact the BRIDGES team for any issues with the BRIDGES API. This is an active project. +#### For C++ [K-D Tree Element documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_kd_tree_element.html) - [ColorGrid documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color_grid.html) - [Color documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color.html) - [Bridges documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html) -#### for Java +#### For Java [K-D Tree Element documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_kd_tree_element.html) - [ColorGrid documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color_grid.html) - [Color documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color.html) - [Bridges class documentation](http://bridgesuncc.github.io/doc/java-api/current/html/namespacebridges_1_1base.html) -#### for Python - +#### For Python [K-D Tree Element documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1kd__tree__element_1_1_k_d_tree_element.html) - [ColorGrid documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color__grid_1_1_color_grid.html) - [Color documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color_1_1_color.html) - [Bridges documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1bridges_1_1_bridges.html) diff --git a/assignments/data/24-ImageCompressionKdTree/c++.zip b/assignments/data/24-ImageCompressionKdTree/c++.zip index 3b8720853..ad57980de 100644 Binary files a/assignments/data/24-ImageCompressionKdTree/c++.zip and b/assignments/data/24-ImageCompressionKdTree/c++.zip differ diff --git a/assignments/data/24-ImageCompressionKdTree/java.zip b/assignments/data/24-ImageCompressionKdTree/java.zip index 23acd946a..fa227fcfb 100644 Binary files a/assignments/data/24-ImageCompressionKdTree/java.zip and b/assignments/data/24-ImageCompressionKdTree/java.zip differ diff --git a/assignments/data/24-ImageCompressionKdTree/python.zip b/assignments/data/24-ImageCompressionKdTree/python.zip index 917d28857..c4285cb27 100644 Binary files a/assignments/data/24-ImageCompressionKdTree/python.zip and b/assignments/data/24-ImageCompressionKdTree/python.zip differ diff --git a/assignments/data/25-Patterns/README.html b/assignments/data/25-Patterns/README.html index 083f1deed..f6fcdad88 100644 --- a/assignments/data/25-Patterns/README.html +++ b/assignments/data/25-Patterns/README.html @@ -1,12 +1,21 @@ -The BRIDGES ColorGrid class is an abstraction for representing 2D images. It serves as a convenient way to display operations on images or other two dimensional structures. A similar structure is used in the BRIDGES Game @@ -27,16 +36,17 @@
ColorGrid documentation +Color documentation +Bridges class documentation
ColorGrid documentation +Color documentation +Bridges class documentation
ColorGrid documentation +Color documentation +Bridges class documentation
diff --git a/assignments/data/25-Patterns/README.md b/assignments/data/25-Patterns/README.md index 975cfb89e..1d1f40654 100644 --- a/assignments/data/25-Patterns/README.md +++ b/assignments/data/25-Patterns/README.md @@ -1,15 +1,29 @@ -Patterns -======== - -Goals ------ -1) Learn how to modify and display a ColorGrid using Bridges -2) Learn how to set/change colors for each pixel in the grid -2) Practice using simple loops to display patterns using the BRIDGES - ColorGrid data structure - -ColorGrid ---------- +# Assignment 25 - Patterns + +## Example Output + +
+
+
+## Learning Outcomes
+
+1. 2D Arrays
+2. Loops
+3. Conditions
+4. Visualization
+
+
+## Goals
+
+1. Learn how to modify and display a ColorGrid using Bridges
+2. Learn how to set/change colors for each pixel in the grid
+3. Practice using simple loops to display patterns using the BRIDGES ColorGrid data structure
+
+
+## Description
+
+### ColorGrid
+
The BRIDGES ColorGrid class is an abstraction for representing 2D images.
It serves as a convenient way to display operations on images or other
two dimensional structures. A similar structure is used in the BRIDGES Game
@@ -29,27 +43,22 @@ mascot, team.
- Quadrants, Cut the image in four quadrants of different colors
- Or make a customized pattern of your own
-### Help
-#### for C++
+## Extensions
-[ColorGrid documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color_grid.html)
-[Color documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color.html)
+## Help
+#### for C++
+[ColorGrid documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color_grid.html)
+[Color documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_color.html)
[Bridges class documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html)
#### for Java
-
[ColorGrid documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color_grid.html)
-
[Color documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_color.html)
-
[Bridges class documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1connect_1_1_bridges.html)
#### for Python
-
[ColorGrid documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color__grid_1_1_color_grid.html)
-
[Color documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1color_1_1_color.html)
-
[Bridges class documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1bridges_1_1_bridges.html)
diff --git a/assignments/data/25-Patterns/c++.zip b/assignments/data/25-Patterns/c++.zip
index 4b99dc634..ac9744624 100644
Binary files a/assignments/data/25-Patterns/c++.zip and b/assignments/data/25-Patterns/c++.zip differ
diff --git a/assignments/data/25-Patterns/java.zip b/assignments/data/25-Patterns/java.zip
index 01b1b9da2..52601eaf5 100644
Binary files a/assignments/data/25-Patterns/java.zip and b/assignments/data/25-Patterns/java.zip differ
diff --git a/assignments/data/25-Patterns/python.zip b/assignments/data/25-Patterns/python.zip
index 1caba88d7..bfd2a512f 100644
Binary files a/assignments/data/25-Patterns/python.zip and b/assignments/data/25-Patterns/python.zip differ
diff --git a/assignments/data/26-TowersOfHanoi/README.html b/assignments/data/26-TowersOfHanoi/README.html
index 4b2fe1a80..fd5f9bf88 100644
--- a/assignments/data/26-TowersOfHanoi/README.html
+++ b/assignments/data/26-TowersOfHanoi/README.html
@@ -1,4 +1,11 @@
The purpose of the assignment is to learn to
Bridges.SymbolCollection documentation
-SymbolCollection documentation
-SymbolCollection documentation
+Bridges documentation +SymbolCollection documentation
+Bridges documentation +SymbolCollection documentation
+Bridges documentation +SymbolCollection documentation
diff --git a/assignments/data/26-TowersOfHanoi/README.md b/assignments/data/26-TowersOfHanoi/README.md index d029cc5d3..48e002045 100644 --- a/assignments/data/26-TowersOfHanoi/README.md +++ b/assignments/data/26-TowersOfHanoi/README.md @@ -1,17 +1,25 @@ -Assignment 26 - Towers of Hanoi -=============================== +# Assignment 26 - Towers of Hanoi -Goals ------ +## Example Output -The purpose of the assignment is to learn to +
+
+
+## Learning Outcomes
+
+1. Recursion
+2. ArrayLists
+
+## Goals
+
+The purpose of the assignment is to learn to
1. Display Symbols using `SymbolCollection`.
2. Solve a problem using logical steps.
3. Display multiple visualizations to `Bridges`.
-Programming part
-----------------
+
+## Description
#### Tasks
@@ -26,18 +34,20 @@ Programming part
2. A move consists of taking the top disk and moving it to another peg.
3. Disks that are larger may not be placed on smaller disks.
-### Help
-#### C++
-[Bridges documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html)
+## Extensions
+
+
+## Help
+
+#### For C++
+[Bridges documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html)
[SymbolCollection documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_symbol_collection.html)
-#### Java
+#### For Java
[Bridges documentation](http://bridgesuncc.github.io/doc/java-api/current/html/namespacebridges_1_1base.html)
-
[SymbolCollection documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_symbol_collection.html)
-#### Python
+#### For Python
[Bridges documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1bridges_1_1_bridges.html)
-
[SymbolCollection documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1symbol__collection_1_1_symbol_collection.html)
diff --git a/assignments/data/26-TowersOfHanoi/c++.zip b/assignments/data/26-TowersOfHanoi/c++.zip
index e6f0d06ba..1c0f1b19f 100644
Binary files a/assignments/data/26-TowersOfHanoi/c++.zip and b/assignments/data/26-TowersOfHanoi/c++.zip differ
diff --git a/assignments/data/26-TowersOfHanoi/java.zip b/assignments/data/26-TowersOfHanoi/java.zip
index 22d75e8d5..7136ff7ed 100644
Binary files a/assignments/data/26-TowersOfHanoi/java.zip and b/assignments/data/26-TowersOfHanoi/java.zip differ
diff --git a/assignments/data/26-TowersOfHanoi/python.zip b/assignments/data/26-TowersOfHanoi/python.zip
index d00623610..dc022833e 100644
Binary files a/assignments/data/26-TowersOfHanoi/python.zip and b/assignments/data/26-TowersOfHanoi/python.zip differ
diff --git a/assignments/data/27-GameGridBasic/README.html b/assignments/data/27-GameGridBasic/README.html
index 9fce34093..f72377dad 100644
--- a/assignments/data/27-GameGridBasic/README.html
+++ b/assignments/data/27-GameGridBasic/README.html
@@ -1,10 +1,17 @@
-###Tasks
+
+
+## Learning Outcomes
+1. Grid Manipulation
+2. Object Oriented Programming
+
+
+## Goals
1. Learn how to add the Bridges library to a project.
2. Practice using the Bridges variables and functions to draw sprites and colors on a game grid.
-Programming
------------
+
+## Description
###Tasks
@@ -19,7 +27,12 @@ Programming
- Run your code and follow the link in the output to view your grid.
- Make changes as needed to adjust how your grid looks.
-### Help
+
+## Extensions
+
+
+## Help
+
#### For C++
[NonBlockingGame documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1game_1_1_non_blocking_game.html)
#### For Java
diff --git a/assignments/data/27-GameGridBasic/c++.zip b/assignments/data/27-GameGridBasic/c++.zip
index 38248fb3b..9867e1c5c 100644
Binary files a/assignments/data/27-GameGridBasic/c++.zip and b/assignments/data/27-GameGridBasic/c++.zip differ
diff --git a/assignments/data/27-GameGridBasic/java.zip b/assignments/data/27-GameGridBasic/java.zip
index 972819245..6562da25d 100644
Binary files a/assignments/data/27-GameGridBasic/java.zip and b/assignments/data/27-GameGridBasic/java.zip differ
diff --git a/assignments/data/27-GameGridBasic/python.zip b/assignments/data/27-GameGridBasic/python.zip
index afc92db6f..9c6e92b18 100644
Binary files a/assignments/data/27-GameGridBasic/python.zip and b/assignments/data/27-GameGridBasic/python.zip differ
diff --git a/assignments/data/28-BigOhMatters/README.html b/assignments/data/28-BigOhMatters/README.html
index 6fe1a17fa..fd627e9da 100644
--- a/assignments/data/28-BigOhMatters/README.html
+++ b/assignments/data/28-BigOhMatters/README.html
@@ -1,11 +1,17 @@
-
The purpose of this assignment is to understand why algorithms are judged by their Big-Oh notations rather than a more precise model, or runtime measurement
-Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 105. (Don't use all values of n, take some values in the middle.)
@@ -14,7 +20,7 @@Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 104. (Don't use all values of n, take some values in the middle.)
@@ -23,7 +29,7 @@Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 102. (Don't use all values of n, take some values in the middle.)
@@ -33,18 +39,17 @@Does it really matter that you can get a slightly faster machine if you can get a lower BigOh complexity?
-Does it really matter that you can gain a factor of 100 if you can get a lower BigOh complexity?
-
Does it really matter that you can get a slightly faster machine if you can get a lower BigOh complexity? +Does it really matter that you can gain a factor of 100 if you can get a lower BigOh complexity?
+Bridges documentation +LineChart documentation
Bridges documentation +LineChart documentation
Bridges documentation +LineChart documentation
diff --git a/assignments/data/28-BigOhMatters/README.md b/assignments/data/28-BigOhMatters/README.md index 1e617fd23..c267be968 100644 --- a/assignments/data/28-BigOhMatters/README.md +++ b/assignments/data/28-BigOhMatters/README.md @@ -1,18 +1,24 @@ -Complexity Matters -================== +# Assignment 28 - Complexity Matters -Goal ----- +## Example Output + + + + +## Learning Outcomes +1. Big O Notation +2. Data Visualization + + +## Goals The purpose of this assignment is to understand why algorithms are judged by their Big-Oh notations rather than a more precise model, or runtime measurement -Programming Part ----------------- +## Description -### Tasks -#### Task 1 +### Task 1 Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 105. (Don't use all values @@ -22,7 +28,7 @@ of n, take some values in the middle.) 2. 5.104 n instructions on a machine at 1MHz 3. 102 n2 instruction on a machine at 100MHz -#### Task 2 +### Task 2 Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 104. (Don't use all values @@ -32,7 +38,7 @@ of n, take some values in the middle.) 2. 102 n2 instructions on a machine at 100MHz 3. n4 instructions on a machine at 10GHz -#### Task 3 +### Task 3 Using Bridges LineChart object, plot the runtime of an algorithm for problem size ranging from 1 to 102. (Don't use all values @@ -43,29 +49,25 @@ of n, take some values in the middle.) 3. n4 instructions on a machine at 10GHz 4. 2n instruction on a machine at 1PHz -#### Conclude +### Conclude Does it really matter that you can get a slightly faster machine if you can get a lower BigOh complexity? - Does it really matter that you can gain a factor of 100 if you can get a lower BigOh complexity? -##### Sample Output - +## Extensions + -### Help +## Help #### For C++ [Bridges documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html) - [LineChart documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_line_chart.html) #### For Java [Bridges documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1connect_1_1_bridges.html) - [LineChart documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_line_chart.html) #### For Python [Bridges documentation](http://bridgesuncc.github.io/doc/python-api/current/html/namespacebridges_1_1bst__element.html) - -[LineChart documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1line__chart_1_1_line_chart.html) \ No newline at end of file +[LineChart documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1line__chart_1_1_line_chart.html) diff --git a/assignments/data/28-BigOhMatters/c++.zip b/assignments/data/28-BigOhMatters/c++.zip index 5a3272339..9992eed3e 100644 Binary files a/assignments/data/28-BigOhMatters/c++.zip and b/assignments/data/28-BigOhMatters/c++.zip differ diff --git a/assignments/data/28-BigOhMatters/java.zip b/assignments/data/28-BigOhMatters/java.zip index 74f5962ad..cbe0a59a1 100644 Binary files a/assignments/data/28-BigOhMatters/java.zip and b/assignments/data/28-BigOhMatters/java.zip differ diff --git a/assignments/data/28-BigOhMatters/python.zip b/assignments/data/28-BigOhMatters/python.zip index 527bcce30..8e9e3b963 100644 Binary files a/assignments/data/28-BigOhMatters/python.zip and b/assignments/data/28-BigOhMatters/python.zip differ diff --git a/assignments/data/29-SortingBenchmark/README.html b/assignments/data/29-SortingBenchmark/README.html index cca09b4d3..4c6a6d04f 100644 --- a/assignments/data/29-SortingBenchmark/README.html +++ b/assignments/data/29-SortingBenchmark/README.html @@ -1,6 +1,15 @@ -
Understand the performance of sorting algorithms by implementing and benchmarking them.
+We will be sorting arrays of integers
Bridges documentation +BFSBenchmark documentation
Bridges documentation +BFSBenchmark documentation
SortingBenchmark documentation
+Bridges documentation +SortingBenchmark documentation
diff --git a/assignments/data/29-SortingBenchmark/README.md b/assignments/data/29-SortingBenchmark/README.md index f112757c5..99810e205 100644 --- a/assignments/data/29-SortingBenchmark/README.md +++ b/assignments/data/29-SortingBenchmark/README.md @@ -1,40 +1,43 @@ -Sorting Benchmark -================= +# Assignment 29 - Sorting Benchmark -#### Goal +## Example Output + + + + +## Learning Outcomes +1. Sorting Algorithm +2. Optimization +3. Data Visualization + +## Goals Understand the performance of sorting algorithms by implementing and benchmarking them. + +## Description ### Tasks We will be sorting arrays of integers - 1. Implement two quadratic sorting algorithms. 2. Implement two efficient sorting algorithms. 3. Benchmark the four algorithms against the standard sorting algorithm provided in the standard library, at small scale and at medium scale. -Sample Output -------------- - - - +## Extensions -### Help -### Help +## Help #### For C++ [Bridges documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1_bridges.html) - [BFSBenchmark documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1benchmark_1_1_b_f_s_benchmark.html) #### For Java [Bridges documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1connect_1_1_bridges.html) - [BFSBenchmark documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1benchmark_1_1_b_f_s_benchmark.html) #### For Python [Bridges documentation](http://bridgesuncc.github.io/doc/python-api/current/html/namespacebridges_1_1bst__element.html) +[SortingBenchmark documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1sorting__benchmark_1_1_sorting_benchmark.html) -[SortingBenchmark documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1sorting__benchmark_1_1_sorting_benchmark.html) \ No newline at end of file diff --git a/assignments/data/29-SortingBenchmark/c++.zip b/assignments/data/29-SortingBenchmark/c++.zip index 7fe5bcb04..c8a7884cf 100644 Binary files a/assignments/data/29-SortingBenchmark/c++.zip and b/assignments/data/29-SortingBenchmark/c++.zip differ diff --git a/assignments/data/29-SortingBenchmark/java.zip b/assignments/data/29-SortingBenchmark/java.zip index 87dd301d2..a8dd1566f 100644 Binary files a/assignments/data/29-SortingBenchmark/java.zip and b/assignments/data/29-SortingBenchmark/java.zip differ diff --git a/assignments/data/29-SortingBenchmark/python.zip b/assignments/data/29-SortingBenchmark/python.zip index 56cef39ef..739c936e8 100644 Binary files a/assignments/data/29-SortingBenchmark/python.zip and b/assignments/data/29-SortingBenchmark/python.zip differ diff --git a/assignments/data/3-GraphBaconNumber/c++.zip b/assignments/data/3-GraphBaconNumber/c++.zip index 7dba9c606..17ccb9967 100644 Binary files a/assignments/data/3-GraphBaconNumber/c++.zip and b/assignments/data/3-GraphBaconNumber/c++.zip differ diff --git a/assignments/data/3-GraphBaconNumber/java.zip b/assignments/data/3-GraphBaconNumber/java.zip index 7bd62fccc..87164ce5e 100644 Binary files a/assignments/data/3-GraphBaconNumber/java.zip and b/assignments/data/3-GraphBaconNumber/java.zip differ diff --git a/assignments/data/3-GraphBaconNumber/python.zip b/assignments/data/3-GraphBaconNumber/python.zip index cebb13528..28bc0576d 100644 Binary files a/assignments/data/3-GraphBaconNumber/python.zip and b/assignments/data/3-GraphBaconNumber/python.zip differ diff --git a/assignments/data/32-TicTacToe/c++.zip b/assignments/data/32-TicTacToe/c++.zip index 2c95210c3..a7de7f076 100644 Binary files a/assignments/data/32-TicTacToe/c++.zip and b/assignments/data/32-TicTacToe/c++.zip differ diff --git a/assignments/data/32-TicTacToe/java.zip b/assignments/data/32-TicTacToe/java.zip index 5cbb05978..43f437b17 100644 Binary files a/assignments/data/32-TicTacToe/java.zip and b/assignments/data/32-TicTacToe/java.zip differ diff --git a/assignments/data/32-TicTacToe/python.zip b/assignments/data/32-TicTacToe/python.zip index 3ade9e7ec..6e42d8b3a 100644 Binary files a/assignments/data/32-TicTacToe/python.zip and b/assignments/data/32-TicTacToe/python.zip differ diff --git a/assignments/data/33-AudioMixing/README.md b/assignments/data/33-AudioMixing/README.md index 093709bb0..d0fbbe3b9 100644 --- a/assignments/data/33-AudioMixing/README.md +++ b/assignments/data/33-AudioMixing/README.md @@ -52,4 +52,3 @@ The goal of this part is to fade one audio source out while another audio source #### For Python [AudioClip Documentation](https://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1audio__clip_1_1_audio_clip.html) - diff --git a/assignments/data/33-AudioMixing/c++.zip b/assignments/data/33-AudioMixing/c++.zip index dc9fa172a..d42c77915 100644 Binary files a/assignments/data/33-AudioMixing/c++.zip and b/assignments/data/33-AudioMixing/c++.zip differ diff --git a/assignments/data/33-AudioMixing/java.zip b/assignments/data/33-AudioMixing/java.zip index 89e1c8786..873e00254 100644 Binary files a/assignments/data/33-AudioMixing/java.zip and b/assignments/data/33-AudioMixing/java.zip differ diff --git a/assignments/data/33-AudioMixing/python.zip b/assignments/data/33-AudioMixing/python.zip index 0c73de917..e46c33546 100644 Binary files a/assignments/data/33-AudioMixing/python.zip and b/assignments/data/33-AudioMixing/python.zip differ diff --git a/assignments/data/34-GameTutorials/c++.zip b/assignments/data/34-GameTutorials/c++.zip index 2e791a38f..d417e8022 100644 Binary files a/assignments/data/34-GameTutorials/c++.zip and b/assignments/data/34-GameTutorials/c++.zip differ diff --git a/assignments/data/34-GameTutorials/java.zip b/assignments/data/34-GameTutorials/java.zip index 4db12ba38..c553a40e8 100644 Binary files a/assignments/data/34-GameTutorials/java.zip and b/assignments/data/34-GameTutorials/java.zip differ diff --git a/assignments/data/34-GameTutorials/python.zip b/assignments/data/34-GameTutorials/python.zip index 31e1a042b..ecb85e7a4 100644 Binary files a/assignments/data/34-GameTutorials/python.zip and b/assignments/data/34-GameTutorials/python.zip differ diff --git a/assignments/data/35-ConnectFour/c++.zip b/assignments/data/35-ConnectFour/c++.zip index ff515bd8c..4127b5462 100644 Binary files a/assignments/data/35-ConnectFour/c++.zip and b/assignments/data/35-ConnectFour/c++.zip differ diff --git a/assignments/data/35-ConnectFour/java.zip b/assignments/data/35-ConnectFour/java.zip index 30511ebc0..249f2c82b 100644 Binary files a/assignments/data/35-ConnectFour/java.zip and b/assignments/data/35-ConnectFour/java.zip differ diff --git a/assignments/data/35-ConnectFour/python.zip b/assignments/data/35-ConnectFour/python.zip index f18150dfd..03498c102 100644 Binary files a/assignments/data/35-ConnectFour/python.zip and b/assignments/data/35-ConnectFour/python.zip differ diff --git a/assignments/data/36-Pong/c++.zip b/assignments/data/36-Pong/c++.zip index 6c6e518ef..8563963a2 100644 Binary files a/assignments/data/36-Pong/c++.zip and b/assignments/data/36-Pong/c++.zip differ diff --git a/assignments/data/36-Pong/java.zip b/assignments/data/36-Pong/java.zip index 7dd9069a6..e01665e56 100644 Binary files a/assignments/data/36-Pong/java.zip and b/assignments/data/36-Pong/java.zip differ diff --git a/assignments/data/36-Pong/python.zip b/assignments/data/36-Pong/python.zip index d1d64b1fa..297e1f41a 100644 Binary files a/assignments/data/36-Pong/python.zip and b/assignments/data/36-Pong/python.zip differ diff --git a/assignments/data/37-SubsamplingBitdepth/README.html b/assignments/data/37-SubsamplingBitdepth/README.html new file mode 100644 index 000000000..d0fd61f7b --- /dev/null +++ b/assignments/data/37-SubsamplingBitdepth/README.html @@ -0,0 +1,35 @@ +Audio is made up of values telling speakers that play the audio how far to move in one of two directions. Bit depth tells you how many different possible values the audio can have at any specific point, ie -2.147B to 2.147B for 32 bit audio. Thats a ton of values! Even in 8 bit audio, the values range from -32k to 32k.
+When converting audio using code, converting those 2B values to 32k values can be done in a couple ways. For this assignment, we convert the numbers to binary (2^x instead of 10^x). If you want to read up on how binary works, please check the help section. Once in binary, we lose the numbers to the left until we have only x possible values.
+For an example in our base, we have 10,247,654. We want to transform this so it can fit within a 10k number range while. We lose the 1024 in the front so the value is 7,654. What this does is basically combine 1024 possible values into 1, closest together.
+How we convert bitdepth is rudimentary at best, but for audio it works just fine. You can hardely tell the difference between audioclips once transformed. Most audio you listen to is actually 24 or 16 bit audio, Youtube even uses this! Quality is not much of an issue, but the most noticable problem can come from white noise. Values close to 0 can be given more of an impact when converted to 8 bit, creating some noise when it wasn't supposed to appear. You'll notice this when you visualize the assignment!
+In this assignment, students will process audio by changing the sampling rate and bit depths for subsampling the audio file. Students will declare variables for sampling count (How many samples are taken per second) and bit depth. They will pass them to methods that visualizes the result.
+The purpose of this assignment is to learn to
generateSineSample() method. It should return a sample value according to the mathematical formula for a sine wave,
@@ -26,10 +28,10 @@ 
+
+## Goals
+
The purpose of this assignment is to learn to
- Use methods/functions to compartmentalize code
- Use loops to iterate over large quantities of items
- Apply simple mathematical concepts in code
- Understand and cast between data types
-Programming
------------
+## Description
+
### Tasks
- Complete the `generateSineSample()` method. It should return a sample value according to the mathematical formula for a sine wave,
which is `A * sin(2 * pi * f * t)`, where A is amplitude, f is frequency, and t is time.
@@ -28,10 +32,10 @@ Programming
- ac.setSample(channel, index, value), where ac is an AudioClip, sets the sample at the index to the value passed in.
See the documentation for language-specific details.
-### Help
-#### For Java
+## Help
+### For Java
[AudioClip documentation](http://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_audio_clip.html)
-#### For C++
+### For C++
[AudioClip documentation](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_audio_clip.html)
-#### For Python
+### For Python
[AudioClip documentation](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1audio__clip_1_1_audio_clip.html)
diff --git a/assignments/data/55-FrequencyPlayer/c++.zip b/assignments/data/55-FrequencyPlayer/c++.zip
index 18a7244db..361c0ce3d 100644
Binary files a/assignments/data/55-FrequencyPlayer/c++.zip and b/assignments/data/55-FrequencyPlayer/c++.zip differ
diff --git a/assignments/data/55-FrequencyPlayer/figures/defaultFreq.png b/assignments/data/55-FrequencyPlayer/figures/defaultFreq.png
new file mode 100644
index 000000000..e0bb8218b
Binary files /dev/null and b/assignments/data/55-FrequencyPlayer/figures/defaultFreq.png differ
diff --git a/assignments/data/55-FrequencyPlayer/java.zip b/assignments/data/55-FrequencyPlayer/java.zip
index 0697e5a15..f48551d5e 100644
Binary files a/assignments/data/55-FrequencyPlayer/java.zip and b/assignments/data/55-FrequencyPlayer/java.zip differ
diff --git a/assignments/data/55-FrequencyPlayer/python.zip b/assignments/data/55-FrequencyPlayer/python.zip
index 9484d7ad3..78faaec62 100644
Binary files a/assignments/data/55-FrequencyPlayer/python.zip and b/assignments/data/55-FrequencyPlayer/python.zip differ
diff --git a/assignments/data/56-2DIndexing/c++.zip b/assignments/data/56-2DIndexing/c++.zip
index 7a7173098..57f66632a 100644
Binary files a/assignments/data/56-2DIndexing/c++.zip and b/assignments/data/56-2DIndexing/c++.zip differ
diff --git a/assignments/data/56-2DIndexing/java.zip b/assignments/data/56-2DIndexing/java.zip
index e41782a8a..9a829fc2e 100644
Binary files a/assignments/data/56-2DIndexing/java.zip and b/assignments/data/56-2DIndexing/java.zip differ
diff --git a/assignments/data/56-2DIndexing/python.zip b/assignments/data/56-2DIndexing/python.zip
index 94ae049e7..0fa1fd74e 100644
Binary files a/assignments/data/56-2DIndexing/python.zip and b/assignments/data/56-2DIndexing/python.zip differ
diff --git a/assignments/data/59-ConvexHull_CityData/c++.zip b/assignments/data/59-ConvexHull_CityData/c++.zip
index b33655e4c..5946e7b82 100644
Binary files a/assignments/data/59-ConvexHull_CityData/c++.zip and b/assignments/data/59-ConvexHull_CityData/c++.zip differ
diff --git a/assignments/data/59-ConvexHull_CityData/java.zip b/assignments/data/59-ConvexHull_CityData/java.zip
index fd75ece18..40dff3fb9 100644
Binary files a/assignments/data/59-ConvexHull_CityData/java.zip and b/assignments/data/59-ConvexHull_CityData/java.zip differ
diff --git a/assignments/data/59-ConvexHull_CityData/python.zip b/assignments/data/59-ConvexHull_CityData/python.zip
index f77d6e419..a7bf7b708 100644
Binary files a/assignments/data/59-ConvexHull_CityData/python.zip and b/assignments/data/59-ConvexHull_CityData/python.zip differ
diff --git a/assignments/data/6-GridSquareFill/c++.zip b/assignments/data/6-GridSquareFill/c++.zip
index 27dfcdd89..2bf139440 100644
Binary files a/assignments/data/6-GridSquareFill/c++.zip and b/assignments/data/6-GridSquareFill/c++.zip differ
diff --git a/assignments/data/6-GridSquareFill/java.zip b/assignments/data/6-GridSquareFill/java.zip
index 4c8b7f06d..b08b3ffd0 100644
Binary files a/assignments/data/6-GridSquareFill/java.zip and b/assignments/data/6-GridSquareFill/java.zip differ
diff --git a/assignments/data/6-GridSquareFill/python.zip b/assignments/data/6-GridSquareFill/python.zip
index b2ebf4523..a49dc2dbc 100644
Binary files a/assignments/data/6-GridSquareFill/python.zip and b/assignments/data/6-GridSquareFill/python.zip differ
diff --git a/assignments/data/60-Quadtree-CityData/c++.zip b/assignments/data/60-Quadtree-CityData/c++.zip
index 7294abbe2..936892330 100644
Binary files a/assignments/data/60-Quadtree-CityData/c++.zip and b/assignments/data/60-Quadtree-CityData/c++.zip differ
diff --git a/assignments/data/60-Quadtree-CityData/java.zip b/assignments/data/60-Quadtree-CityData/java.zip
index ce79f29e5..2ab9a5739 100644
Binary files a/assignments/data/60-Quadtree-CityData/java.zip and b/assignments/data/60-Quadtree-CityData/java.zip differ
diff --git a/assignments/data/60-Quadtree-CityData/python.zip b/assignments/data/60-Quadtree-CityData/python.zip
index 05b7a09ea..efa740230 100644
Binary files a/assignments/data/60-Quadtree-CityData/python.zip and b/assignments/data/60-Quadtree-CityData/python.zip differ
diff --git a/assignments/data/64-Voronoi_Diagram/c++.zip b/assignments/data/64-Voronoi_Diagram/c++.zip
index 409ae4af6..75faac77a 100644
Binary files a/assignments/data/64-Voronoi_Diagram/c++.zip and b/assignments/data/64-Voronoi_Diagram/c++.zip differ
diff --git a/assignments/data/64-Voronoi_Diagram/java.zip b/assignments/data/64-Voronoi_Diagram/java.zip
index c2faa87ee..419afd5fb 100644
Binary files a/assignments/data/64-Voronoi_Diagram/java.zip and b/assignments/data/64-Voronoi_Diagram/java.zip differ
diff --git a/assignments/data/64-Voronoi_Diagram/python.zip b/assignments/data/64-Voronoi_Diagram/python.zip
index 9f1445c25..d2724024c 100644
Binary files a/assignments/data/64-Voronoi_Diagram/python.zip and b/assignments/data/64-Voronoi_Diagram/python.zip differ
diff --git a/assignments/data/65-Reddit/c++.zip b/assignments/data/65-Reddit/c++.zip
index a95d46b8d..0658b5e21 100644
Binary files a/assignments/data/65-Reddit/c++.zip and b/assignments/data/65-Reddit/c++.zip differ
diff --git a/assignments/data/65-Reddit/java.zip b/assignments/data/65-Reddit/java.zip
index ab7879127..9acb21a9e 100644
Binary files a/assignments/data/65-Reddit/java.zip and b/assignments/data/65-Reddit/java.zip differ
diff --git a/assignments/data/65-Reddit/python.zip b/assignments/data/65-Reddit/python.zip
index 17807c145..82cfea540 100644
Binary files a/assignments/data/65-Reddit/python.zip and b/assignments/data/65-Reddit/python.zip differ
diff --git a/assignments/data/66-Chess-Data/README.html b/assignments/data/66-Chess-Data/README.html
new file mode 100644
index 000000000..fc051c4a0
--- /dev/null
+++ b/assignments/data/66-Chess-Data/README.html
@@ -0,0 +1,26 @@
+The purpose of this assignment is to learn to
+
Music Theory Converting Notes to HZ
Bridges Audio Clip -Java Queue
+ +ToDo
+ToDo
+ diff --git a/assignments/data/68-MusicNotes-CS2/README.md b/assignments/data/68-MusicNotes-CS2/README.md index 09b3369fd..a96ac2d4d 100644 --- a/assignments/data/68-MusicNotes-CS2/README.md +++ b/assignments/data/68-MusicNotes-CS2/README.md @@ -36,13 +36,14 @@ Build a queue of notes from a file #### Java [Bridges Audio Clip](https://bridgesuncc.github.io/doc/java-api/current/html/classbridges_1_1base_1_1_audio_clip.html) + [Java Queue](https://docs.oracle.com/javase/8/docs/api/java/util/Queue.html) #### C++ -ToDo - +[Bridges Audio Clip](http://bridgesuncc.github.io/doc/cxx-api/current/html/classbridges_1_1datastructure_1_1_audio_clip.html) #### Python -ToDo +[Bridges Audio Clip](http://bridgesuncc.github.io/doc/python-api/current/html/classbridges_1_1audio__clip_1_1_audio_clip.html) + diff --git a/assignments/data/68-MusicNotes-CS2/c++.zip b/assignments/data/68-MusicNotes-CS2/c++.zip index bb020f194..6c6ec1ff9 100644 Binary files a/assignments/data/68-MusicNotes-CS2/c++.zip and b/assignments/data/68-MusicNotes-CS2/c++.zip differ diff --git a/assignments/data/68-MusicNotes-CS2/java.zip b/assignments/data/68-MusicNotes-CS2/java.zip index d6f081c0b..49a4db658 100644 Binary files a/assignments/data/68-MusicNotes-CS2/java.zip and b/assignments/data/68-MusicNotes-CS2/java.zip differ diff --git a/assignments/data/68-MusicNotes-CS2/python.zip b/assignments/data/68-MusicNotes-CS2/python.zip index e6ba172c6..cb4cf8439 100644 Binary files a/assignments/data/68-MusicNotes-CS2/python.zip and b/assignments/data/68-MusicNotes-CS2/python.zip differ diff --git a/assignments/data/69-SnakeQueue/c++.zip b/assignments/data/69-SnakeQueue/c++.zip index 4795e02b5..a9f131356 100644 Binary files a/assignments/data/69-SnakeQueue/c++.zip and b/assignments/data/69-SnakeQueue/c++.zip differ diff --git a/assignments/data/69-SnakeQueue/java.zip b/assignments/data/69-SnakeQueue/java.zip index dbb8daa92..78744574e 100644 Binary files a/assignments/data/69-SnakeQueue/java.zip and b/assignments/data/69-SnakeQueue/java.zip differ diff --git a/assignments/data/69-SnakeQueue/python.zip b/assignments/data/69-SnakeQueue/python.zip index e37a7f9f3..794515bda 100644 Binary files a/assignments/data/69-SnakeQueue/python.zip and b/assignments/data/69-SnakeQueue/python.zip differ diff --git a/assignments/data/7-GridLyrics/c++.zip b/assignments/data/7-GridLyrics/c++.zip index 974db4dc8..7c7f9f056 100644 Binary files a/assignments/data/7-GridLyrics/c++.zip and b/assignments/data/7-GridLyrics/c++.zip differ diff --git a/assignments/data/7-GridLyrics/java.zip b/assignments/data/7-GridLyrics/java.zip index 2925f11fc..16a47077b 100644 Binary files a/assignments/data/7-GridLyrics/java.zip and b/assignments/data/7-GridLyrics/java.zip differ diff --git a/assignments/data/7-GridLyrics/python.zip b/assignments/data/7-GridLyrics/python.zip index 225ed19c9..5b08c993b 100644 Binary files a/assignments/data/7-GridLyrics/python.zip and b/assignments/data/7-GridLyrics/python.zip differ diff --git a/assignments/data/70-WordleBot/c++.zip b/assignments/data/70-WordleBot/c++.zip index fb823c809..8c3b7d57a 100644 Binary files a/assignments/data/70-WordleBot/c++.zip and b/assignments/data/70-WordleBot/c++.zip differ diff --git a/assignments/data/70-WordleBot/java.zip b/assignments/data/70-WordleBot/java.zip index c33e11a9e..e15de0ed2 100644 Binary files a/assignments/data/70-WordleBot/java.zip and b/assignments/data/70-WordleBot/java.zip differ diff --git a/assignments/data/70-WordleBot/python.zip b/assignments/data/70-WordleBot/python.zip index ea582e193..3c1bd7004 100644 Binary files a/assignments/data/70-WordleBot/python.zip and b/assignments/data/70-WordleBot/python.zip differ diff --git a/assignments/data/71-PiEstimation/c++.zip b/assignments/data/71-PiEstimation/c++.zip index 2f361ff5b..948215e59 100644 Binary files a/assignments/data/71-PiEstimation/c++.zip and b/assignments/data/71-PiEstimation/c++.zip differ diff --git a/assignments/data/71-PiEstimation/java.zip b/assignments/data/71-PiEstimation/java.zip index d678db4f9..14271510e 100644 Binary files a/assignments/data/71-PiEstimation/java.zip and b/assignments/data/71-PiEstimation/java.zip differ diff --git a/assignments/data/71-PiEstimation/python.zip b/assignments/data/71-PiEstimation/python.zip index 923c26abd..71730411d 100644 Binary files a/assignments/data/71-PiEstimation/python.zip and b/assignments/data/71-PiEstimation/python.zip differ diff --git a/assignments/data/72-PixelDrawing/c++.zip b/assignments/data/72-PixelDrawing/c++.zip index 269ac3ebd..bba61e8d3 100644 Binary files a/assignments/data/72-PixelDrawing/c++.zip and b/assignments/data/72-PixelDrawing/c++.zip differ diff --git a/assignments/data/72-PixelDrawing/java.zip b/assignments/data/72-PixelDrawing/java.zip index caba3c423..d5b4cdb88 100644 Binary files a/assignments/data/72-PixelDrawing/java.zip and b/assignments/data/72-PixelDrawing/java.zip differ diff --git a/assignments/data/72-PixelDrawing/python.zip b/assignments/data/72-PixelDrawing/python.zip index e5b4bc71d..c11ee70f9 100644 Binary files a/assignments/data/72-PixelDrawing/python.zip and b/assignments/data/72-PixelDrawing/python.zip differ diff --git a/assignments/data/75-KochCurve/c++.zip b/assignments/data/75-KochCurve/c++.zip index 3515b7df6..4fe648698 100644 Binary files a/assignments/data/75-KochCurve/c++.zip and b/assignments/data/75-KochCurve/c++.zip differ diff --git a/assignments/data/75-KochCurve/java.zip b/assignments/data/75-KochCurve/java.zip index 61a72bbb3..54e9a4148 100644 Binary files a/assignments/data/75-KochCurve/java.zip and b/assignments/data/75-KochCurve/java.zip differ diff --git a/assignments/data/75-KochCurve/python.zip b/assignments/data/75-KochCurve/python.zip index 6cfd7b075..be0f2cbd2 100644 Binary files a/assignments/data/75-KochCurve/python.zip and b/assignments/data/75-KochCurve/python.zip differ diff --git a/assignments/data/76-Zcurve/c++.zip b/assignments/data/76-Zcurve/c++.zip index 6cb8695f0..263571071 100644 Binary files a/assignments/data/76-Zcurve/c++.zip and b/assignments/data/76-Zcurve/c++.zip differ diff --git a/assignments/data/76-Zcurve/java.zip b/assignments/data/76-Zcurve/java.zip index 3aebe9854..1e5db5214 100644 Binary files a/assignments/data/76-Zcurve/java.zip and b/assignments/data/76-Zcurve/java.zip differ diff --git a/assignments/data/76-Zcurve/python.zip b/assignments/data/76-Zcurve/python.zip index 09666ca24..f09f0421d 100644 Binary files a/assignments/data/76-Zcurve/python.zip and b/assignments/data/76-Zcurve/python.zip differ diff --git a/assignments/data/8-PQBook/README.html b/assignments/data/8-PQBook/README.html index 67e906bbc..c387e7c8e 100644 --- a/assignments/data/8-PQBook/README.html +++ b/assignments/data/8-PQBook/README.html @@ -5,7 +5,7 @@Input/Output
+
+
1D Arrays
2D Arrays
Simulation
Algorithms
Big Oh