Discrete Mathematics, Graph Theory and Decision Maths notes
18 notes by 12 users
This page gathers a small set of community-made notes on algorithms, graphs, matching and linear programming. They support university students and professional candidates practicing algorithms, school students studying graphs, and teachers looking for material across school and university levels. Explore the notes and pick a topic to study.
Select topic
- Logic, Proofs and Boolean Algebra6
- Sets, Relations and Functions17
- Combinatorics and Recurrence Relations5
- Sorting, Searching and Bin Packing Algorithms6
- Graph Terminology and Types36
- Graph Paths, Cycles and Route Problems11
- Planar Graphs and Graph Coloring5
- Trees and Minimum Spanning Trees9
- Graph and Network Algorithms23
- Linear Programming15
- Constrained Optimization and Lagrange Multipliers6
- Game Theory13
Notes
-
Mathematics: Decision 1 (Notes 1 of 1) An algorithm is a set of instructions for solving a problem. The order of an algorithm tells you how 'efficient' an algorithm is. It tells you how the time the algorithm takes to run changes as the number of input val...
-
Summary of Chapter 1 1 Algorithms can be given in words or flowcharts.2 Unordered lists can be sorted using a bubble sort or a quick sort.3 In a bubble sort, you compare adjacent items in a list. If they are in order, ...
-
Summary of Chapter 2 1 A graph consists of vertices(nodes) which are connected by edges(arcs). 2 A subgraph is part of a graph. 3 If a graph has a number associated with each edge (its weight) then the graph is a weighted graph (network)....
-
Linear Programming Linear ProgrammingIn this topic we look at maximising profits or minimising costs subject to constraints.Formulating the Problem-Decision Variables: the qualities to be decided-Objective Function: profit/cost to be ma...
-
D1 Section 1 Algorithm Flow ChartsRemeber to take your time and follow the chart exactly, reading all of the boxes each time. Lower Boundgives the minimum Number of Bins needed add up the height/weight (etc.) of the items and divi...
-
Section 2 A graph is made up of points (nodes/vertices) joined by lines (edges/arcs). Weighted Graphs/Networks have a number on Each Arc Digraphs/Directed Graphs have Directed Edges
-
Linear Programming Critical Path AnalysisKey TermsObjective function- the maximising or minimising inequality that involves money e.g. profit, cost, revenueDecision variables- numbers of each things that can be varied (variables), varia...
-
cs 6.042 Lecture 10 : Hamiltonian path : path where every node is visited only once. Tournament Graph: an edge from one node to other basically mean that a given vertex has beaten othe...
-
Summary of Chapter 5 1 A complex project may be broken down into a number of separate activities. The completion of an activity is described as an event.2 Some activities may only be started once other activities are completed. This ...
-
Untitled Linear programming (LP) is a mathematical method used to find the optimal outcome (like maximum profit or minimum cost) for a given problem, subject to certain constraints. It is widely used in fields like economics, ...
-
Chapter Notes[3] Ch 10 - Matching MarketsStable Marriages Given a set of n males and m females we wish to find a matching of men and women that is at least pareto optimal i.e. stable meaning that no women or man would have the in...
-
Set theory A set is a collection of objects with no order or repetition ℕ - the set of natural numbers (positive integers) ℤ - the set of integers (all integers) ℚ - the set of rational numbers ( anything that can be shown as a ...
-
Summary of Chapter 3 1 Kruskal's algorithm and Prim's algorithm can be used to find a minimum spanning tree, but they take different approaches.2 To use Kruskal's algorithm, you sort the arcs into ascending order of weight and u...
-
Tree Properties Definition. A tree is a connected and acyclic (that is, without cycles) graph. Definition. A forest is a graph where each connected component is a tree. Definition. A leaf in a tree (or forest) is a node with degree &...
-
Summary of Chapter 4 1 A graph is traversable if it is possible to traverse (travel along) every arc just once without taking your pen from the paper.2 A graph is traversable if all the valencies are even.3 A graph is semi-traversabl...
-
Summary of Chapter 6 1 To formulate a problem as a linear programming problem: define the decision variables (x, y, z, etc.) state the objective (maximise or minimise, together with an algebraic expression) write the constraints as inequa...
-
Explaining Simplex (3 mark question) Explaining Simplex Geometrically : With each iteration made you move from one point within the feasible region to the nextP increases after each iteration. ( This is because the point of simplex is to find the maximum...
-
Simplex Tableau 1.First you need to look at what you're trying to work out. This could be inequalities or maximising or minimising the simplex tableau.2. You need to introduce your slack variables beacuse there are what will help min...
More Discrete Mathematics, Graph Theory and Decision Maths resources
About discrete mathematics, graph theory and decision maths notes
GoConqr OriginalDiscrete Mathematics, Graph Theory and Decision Maths notes
These notes cover algorithms, graphs, project activities and matching. The opening chapter summaries introduce sorting methods and graph vocabulary. Later notes cover minimum spanning trees and traversable graphs. There are also notes titled Linear Programming, as well as material on set theory and tree properties.
How to study with notes
For an introduction to algorithms, start with the first chapter summary. It describes algorithms in words or flowcharts and introduces bubble sort and quick sort. For graph vocabulary, the second chapter summary explains vertices, edges and weighted graphs.
Read a short section, then close the note and write down the terms or steps you remember. Reopen it to check what you missed. If you want a visual overview, switch to a mind map on the unit page; for short recall practice, use flashcards.
Choose a note that matches the topic you are studying and work through it at your own pace.
Frequently asked questions
Which note is a good place to start?
The first chapter summary is a useful starting point for algorithms: it introduces flowcharts, bubble sort and quick sort. If you are working on graphs instead, the second chapter summary starts with vertices and edges and introduces weighted graphs. Both offer short points to study and check.
Are these notes free to use?
Yes. Every note listed here is free to open and study without an account. The resources were made by GoConqr users, rather than by GoConqr. A free account also lets you save quiz scores and make your own quizzes, mind maps, flashcards and notes.
Which levels do the notes suit?
The collection includes school and university-level material, with notes relevant to A-level decision mathematics as well as university study. University students and professional candidates can use notes on topics such as matching and algorithms, while school students can study graph terms and decision methods.