/
Which of the following is NOT an algorithm? Which of the following is NOT an algorithm?

Which of the following is NOT an algorithm? - PowerPoint Presentation

giovanna-bartolotta
giovanna-bartolotta . @giovanna-bartolotta
Follow
428 views
Uploaded On 2017-10-19

Which of the following is NOT an algorithm? - PPT Presentation

A set of instructions used to build a wardrobe A flow chart used to solve a quadratic equation A note to the milkman asking for 2 pints of milk 2 When would you use a matching algorithm To allocate jobs to five people ID: 597537

find picture section profit picture find profit section shortest graph finding point region path minimum orderto algorithm answer parallel

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Which of the following is NOT an algorit..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Which of the following is NOT an algorithm? A set of instructions used to build a wardrobeA flow chart used to solve a quadratic equationA note to the milkman asking for 2 pints of milk2. When would you use a matching algorithm?To allocate jobs to five peopleTo sort a group into alphabetical orderTo find the cheapest way of getting from Rotherham to Edinburgh by bus3. When would you use Djikstra’s algorithmTo allocate jobs to five peopleTo sort a group into alphabetical orderTo find the cheapest way of getting from Rotherham to Edinburgh by bus4. To find the minimum profit on a graph:Look for the last point in the region parallel to a profit lineLook for the first point in the region parallel to a profit lineLook for the first point in the region perpendicular to a profit lineHow would you begin to solve a route inspection problem? By identifying the odd nodes and finding shortest pairsBy finding a Hamiltonian cycle.By following a labelling procedure

Section 2: Multiple

choiceSlide2

Graphs that show the same information but are drawn differently are known as… A graph in which every vertex is directly connect by an edge to each of the other vertices is known as a ….. graph. In an activity network the top box represents … 4. The final node in an activity network is known as the ….. node 5. A method of finding the minimum spanning tree that cannot be applied to a matrix Section 3: DefinitionsThe last letter of each answer is the first letter of the next answer.Slide3

Find the length of the shortest path in picture 1 State the shortest path between S and T in question 1 Give an inequality for line 1 in picture 2. Which activities must be happening at 9.30 in picture 3? Give the results of the second pass for picture 2 Section 4: Quick calculationsSlide4

Section 1: Picture round1. Working values2. Linear programming3. The critical path/critical events4. The float5. BubblesortSlide5

Which of the following is NOT an algorithm? A set of instructions used to build a wardrobeA flow chart used to solve a quadratic equationA note to the milkman asking for 2 pints of milk2. When would you use a matching algorithm?To allocate jobs to five peopleTo sort a group into alphabetical orderTo find the cheapest way of getting from Rotherham to Edinburgh by bus3. When would you use Djikstra’s algorithmTo allocate jobs to five peopleTo sort a group into alphabetical orderTo find the cheapest way of getting from Rotherham to Edinburgh by bus4. To find the minimum profit on a graph:Look for the last point in the region parallel to a profit lineLook for the first point in the region parallel to a profit lineLook for the first point in the region perpendicular to a profit lineHow would you begin to solve a route inspection problem? By identifying the odd nodes and finding shortest pairsBy finding a Hamiltonian cycle.By following a labelling procedure

Section 2: Multiple

choiceSlide6

Graphs that show the same information but are drawn differently are known as… IsomorphicA graph in which every vertex is directly connect by an edge to each of the other vertices is known as a ….. graph. CompleteIn an activity network the top box represents … Early event times4. The final node in an activity network is known as the ….. node Sink5. A method of finding the minimum spanning tree that cannot be applied to a matrix KruskalsSection 3: DefinitionsThe last letter of each answer is the first letter of the next answer.Slide7

Find the length of the shortest path in picture 1 11State the shortest path between S and T in question 1 S – C – B – D – T Give an inequality for line 1 in picture 2. 3x + 5y ≥ 60Which activities must be happening at 9.30 in picture 3? F, E and GGive the results of the second pass for picture 2 18 11 15 24 30 37Section 4: Quick calculations