Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adds index terms to back matter of PreTeXt book #5

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Adds index terms to back matter of PreTeXt book #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 20 additions & 18 deletions pretext/AlgorithmAnalysis/Glossary.ptx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,94 +2,96 @@
<title>Glossary</title>
<glossary sorted="False">


<gi>
<title>algorithm</title>

<p>a generic, step-by-step list of instructions for solving a problem</p>
<p><idx>algorithm</idx>a generic, step-by-step list of instructions for solving a problem</p>

</gi>

<gi>
<title>average case</title>

<p>refers to when an algorithm performs between its worst and best case given a certain data set or circumstance</p>
<p><idx>average case</idx>refers to when an algorithm performs between its worst and best case given a certain data set or circumstance</p>

</gi>
<gi>
<title>best case</title>

<p>refers to when an algorithm performs especially good given a certain data set or circumstance</p>
<p><idx>best case</idx><idx>best case</idx>refers to when an algorithm performs especially good given a certain data set or circumstance</p>

</gi>
<gi>
<title>Big-O notation</title>

<p>another term for order of magnitude; written as <math>O(f(n))</math></p>
<p><idx>Big-O notation</idx><idx>Big-O notation</idx>another term for order of magnitude; written as <math>O(f(n))</math></p>

</gi>
<gi>
<title>brute force</title>

<p>technique that tries to exhaust all possibilities of a problem</p>
<p><idx>brute force</idx><idx>brute force</idx>technique that tries to exhaust all possibilities of a problem</p>

</gi>
<gi>
<title><c classes="code">contains</c></title>

<p>A hash operation used to check if a table contains a specific element.</p>
<p><idx>contains</idx>A hash operation used to check if a table contains a specific element.</p>

</gi>
<gi>
<title>contiguous</title>

<p>adjacent or next to</p>
<p><idx>contiguous</idx><idx></idx>adjacent or next to</p>

</gi>
<gi>
<title>dynamic size</title>

<p>able to change size automatically</p>
<p><idx>dynamic size</idx><idx></idx>able to change size automatically</p>

</gi>
<gi>
<title>exponential</title>

<p>function represented as a number being raised to a power that increases like <math>f(n)= 2^{n}</math></p>
<p><idx>exponential</idx>function represented as a number being raised to a power that increases like <math>f(n)= 2^{n}</math></p>

</gi>
<gi>
<title><c classes="code">get_item</c></title>

<p>A hash operation used to retrieve the information associated with a hash key.</p>
<p><idx>get_item</idx>A hash operation used to retrieve the information associated with a hash key.</p>

</gi>
<gi>
<title>hash table</title>

<p>a collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.</p>
<p><idx>hash table</idx>a collection consisting of key-value pairs with an associated hash function that maps the key to the associated value.</p>

</gi>
<gi>
<title>linear</title>

<p>function that grows in a one to one relationship with its input like <math>f(n) = n</math></p>
<p><idx>linear</idx>function that grows in a one to one relationship with its input like <math>f(n) = n</math></p>

</gi>
<gi>
<title>logarithmic</title>

<p>functions that are the inverse of exponential functions usually presented as <math>f(n) = logn</math></p>
<p><idx>logarithmic</idx>functions that are the inverse of exponential functions usually presented as <math>f(n) = logn</math></p>

</gi>
<gi>
<title>order of magnitude</title>

<p>function describing the part <math>T(n)</math> that increases the fastest as the value of n increases (a function describing an algorithm's steps as the size of the problem increases).</p>
<p><idx>order of magnitude</idx>function describing the part <math>T(n)</math> that increases the fastest as the value of n increases (a function describing an algorithm's steps as the size of the problem increases).</p>

</gi>
<gi>
<title>quadratic</title>

<p>function describing a relationship who's highest order is a number squared</p>
<p><idx>quadratic</idx>function describing a relationship who's highest order is a number squared</p>
<blockquote>
<p>simplified: <math>f(n) = x^{2}</math></p>
<p>complex: <math>ax^{2} + bx + c</math></p>
Expand All @@ -99,19 +101,19 @@
<gi>
<title><c classes="code">set_item</c></title>

<p>A hash operation used to add an item to your table.</p>
<p><idx>set_item</idx>A hash operation used to add an item to your table.</p>

</gi>
<gi>
<title>vector</title>

<p>sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.</p>
<p><idx>vector</idx>sequence container storing data of a single type that is stored in a dynamically allocated array which can change in size.</p>

</gi>
<gi>
<title>worst case</title>

<p>refers to when an algorithm performs especially poorly given a certain data set or circumstance</p>
<p><idx>worst case</idx>refers to when an algorithm performs especially poorly given a certain data set or circumstance</p>

</gi>

Expand Down
46 changes: 23 additions & 23 deletions pretext/Graphs/Glossary.ptx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,139 +5,139 @@
<gi>
<title>acyclic graph</title>

<p>A graph with no cycles</p>
<p><idx>acyclic graph</idx>A graph with no cycles</p>

</gi>
<gi>
<title>adjacency list</title>

<p>A list implementation where we keep a master list of all the vertices in the Graph object and then each vertex object in the graph maintains a list of the other vertices that it is connected to</p>
<p><idx>adjacency list</idx>A list implementation where we keep a master list of all the vertices in the Graph object and then each vertex object in the graph maintains a list of the other vertices that it is connected to</p>

</gi>
<gi>
<title>adjacency matrix</title>

<p>A matrix implementation where each of the rows and columns represent a vertex in the graph, and where if two vertices are connected by an edge, they are considered adjacent.</p>
<p><idx>adjacency matrix</idx>A matrix implementation where each of the rows and columns represent a vertex in the graph, and where if two vertices are connected by an edge, they are considered adjacent.</p>

</gi>
<gi>
<title>adjacent</title>

<p>When two vertices are connected by an edge.</p>
<p><idx>adjacent</idx>When two vertices are connected by an edge.</p>

</gi>
<gi>
<title>breadth first search (BFS)</title>

<p>A search that proceeds to look through the edges in a graph to find all the vertices in that graph for which there is a path from the starting point.</p>
<p><idx>breadth first search</idx>A search that proceeds to look through the edges in a graph to find all the vertices in that graph for which there is a path from the starting point.</p>

</gi>
<gi>
<title>cycle</title>

<p>A cycle in a directed graph is a path that starts and ends at the same vertex.</p>
<p><idx>cycle</idx>A cycle in a directed graph is a path that starts and ends at the same vertex.</p>

</gi>
<gi>
<title>cyclic graph</title>

<p>A graph with at least one cycle in it.</p>
<p><idx>cyclic graph</idx>A graph with at least one cycle in it.</p>

</gi>
<gi>
<title>depth first forest</title>

<p>The result of the groups of trees produced by a depth first search algorithm.</p>
<p><idx>depth first forest</idx>The result of the groups of trees produced by a depth first search algorithm.</p>

</gi>
<gi>
<title>depth first search (DFS)</title>

<p>A search type where the goal is to create the deepest depth first tree, without any branches.</p>
<p><idx>depth first search</idx>A search type where the goal is to create the deepest depth first tree, without any branches.</p>

</gi>
<gi>
<title>digraph</title>

<p>see directed graph</p>
<p><idx>digraph</idx>see directed graph</p>

</gi>
<gi>
<title>directed acyclic graph (DAG)</title>

<p>A directed acyclic graph, which is a directed graph with no cycles.</p>
<p><idx>directed acyclic graph</idx>A directed acyclic graph, which is a directed graph with no cycles.</p>

</gi>
<gi>
<title>directed graph</title>

<p>A graph in which all the edges are one-way.</p>
<p><idx>directed graph</idx>A graph in which all the edges are one-way.</p>

</gi>
<gi>
<title>edge cost</title>

<p>The weight associated with an arc in a graph.</p>
<p><idx>edge cost</idx>The weight associated with an arc in a graph.</p>

</gi>
<gi>
<title>edge</title>

<p>An edge (also called an <q>arc</q>) connects two vertices to show that there is a relationship between them. Edges may be one-way or two-way.</p>
<p><idx>edge</idx>An edge (also called an <q>arc</q>) connects two vertices to show that there is a relationship between them. Edges may be one-way or two-way.</p>

</gi>
<gi>
<title>parenthesis property</title>

<p>All the children of a particular node in the depth first tree have a later discovery time and an earlier finish time than their parent.</p>
<p><idx>parenthesis property</idx>All the children of a particular node in the depth first tree have a later discovery time and an earlier finish time than their parent.</p>

</gi>
<gi>
<title>path</title>

<p>A path in a graph is a sequence of vertices that are connected by edges.</p>
<p><idx>path</idx>A path in a graph is a sequence of vertices that are connected by edges.</p>

</gi>
<gi>
<title>shortest path</title>

<p>The most succinct passage from one edge to another.</p>
<p><idx>shortest path</idx>The most succinct passage from one edge to another.</p>

</gi>
<gi>
<title>spanning tree</title>

<p>An acyclic subset of edges that connects all the vertices.</p>
<p><idx>spanning tree</idx>An acyclic subset of edges that connects all the vertices.</p>

</gi>
<gi>
<title>strongly connected components (SCC)</title>

<p>The largest subset of vertices C&#8834;V such that for every pair of vertices v,w&#8712;C we have a path from v to w and a path from w to v.</p>
<p><idx>strongly connected components</idx>The largest subset of vertices C&#8834;V such that for every pair of vertices v,w&#8712;C we have a path from v to w and a path from w to v.</p>

</gi>
<gi>
<title>topological sorting</title>

<p>A topological sort takes a directed acyclic graph and produces a linear ordering of all its vertices such that if the graph G contains an edge (v,w) then the vertex v comes before the vertex w in the ordering.</p>
<p><idx>topological sorting</idx>A topological sort takes a directed acyclic graph and produces a linear ordering of all its vertices such that if the graph G contains an edge (v,w) then the vertex v comes before the vertex w in the ordering.</p>

</gi>
<gi>
<title>uncontrolled flooding</title>

<p>Each message starts with a time to live (<c>ttl</c>) value set to some number greater than or equal to the number of edges between the broadcast host and its most distant listener. Each router gets a copy of the message and passes the message on to <em>all</em> of its neighboring routers. When the message is passed on the <c>ttl</c> is decreased. Each router continues to send copies of the message to all its neighbors until the <c>ttl</c> value reaches 0.</p>
<p><idx>controlled flooding</idx>Each message starts with a time to live (<c>ttl</c>) value set to some number greater than or equal to the number of edges between the broadcast host and its most distant listener. Each router gets a copy of the message and passes the message on to <em>all</em> of its neighboring routers. When the message is passed on the <c>ttl</c> is decreased. Each router continues to send copies of the message to all its neighbors until the <c>ttl</c> value reaches 0.</p>

</gi>
<gi>
<title>vertex</title>

<p>A vertex (also called a <q>node</q>) is a fundamental part of a graph. It can have a name (also called a <q>Key</q>). A vertex may also have additional information also called a (<q>payload</q>).</p>
<p><idx>vertex</idx>A vertex (also called a <q>node</q>) is a fundamental part of a graph. It can have a name (also called a <q>Key</q>). A vertex may also have additional information also called a (<q>payload</q>).</p>

</gi>
<gi>
<title>weight</title>

<p>Shows that there is a cost to go from one vertex to another</p>
<p><idx>weight</idx>Shows that there is a cost to go from one vertex to another</p>

</gi>

Expand Down
Loading