diff --git a/pretext/AlgorithmAnalysis/Glossary.ptx b/pretext/AlgorithmAnalysis/Glossary.ptx
index 8b056da5..afbc3eed 100755
--- a/pretext/AlgorithmAnalysis/Glossary.ptx
+++ b/pretext/AlgorithmAnalysis/Glossary.ptx
@@ -116,5 +116,42 @@
                 </gi>
             
         </glossary>
+
+                  
+
+    <exercise label="matching_algorithmana0">
+        <statement><p>Drag the word on the left to its corresponding definition.</p></statement>
+        <feedback><p>Review classes and their properties.</p></feedback>
+    <matches>
+    <match order="1"><premise>algorithm</premise><response>Step-by-step list of instructions for solving a problem.</response></match>
+    <match order="2"><premise>average case</premise><response>When an algorithm performs between its worst and best case given a certain data set or circumstance.</response></match>
+    <match order="3"><premise>vector</premise><response>Sequence container storing data of a single type in a dynamically allocated array.</response></match>
+    <match order="4"><premise>worst case</premise><response>When an algorithm performs especially poorly given a certain data set or circumstance.</response></match>
+    <match order="5"><premise>dynamic size</premise><response>Able to change size automatically</response></match>
+    </matches></exercise> 
+
+    <exercise label="matching_algorithmana1">
+        <statement><p>Drag the word on the left to its corresponding definition.</p></statement>
+        <feedback><p>Review classes and their properties.</p></feedback>
+    <matches>
+    <match order="1"><premise>quadratic</premise><response>Function describing a relationship who's highest order is a number squared</response></match>
+    <match order="2"><premise>best case</premise><response>When an algorithm performs especially good given a certain data set or circumstance</response></match>
+    <match order="3"><premise>Big-O notation</premise><response>another term for order of magnitude</response></match>
+    <match order="4"><premise>brute force</premise><response>Technique that tries to exhaust all possibilities of a problem.</response></match>
+    <match order="5"><premise>contiguous</premise><response>Adjacent</response></match>
+    </matches></exercise> 
+
+    <exercise label="matching_algorithmana2">
+        <statement><p>Drag the word on the left to its corresponding definition.</p></statement>
+        <feedback><p>Review classes and their properties.</p></feedback>
+    <matches>
+    
+    <match order="1"><premise>hash table</premise><response>A collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.</response></match>
+    <match order="2"><premise>linear</premise><response>Function that grows in a one to one relationship with its input.</response></match>
+    <match order="3"><premise>logarithmic</premise><response>functions that are the inverse of exponential functions</response></match>
+    <match order="4"><premise>order of magnitude</premise><response>a function describing an algorithm's steps as the size of the problem increases.</response></match>
+    <match order="5"><premise>exponential</premise><response>Function represented as a number being raised to a power that increases.</response></match>
+    </matches></exercise> 
+        
     </section>