Routing (Leaving Cert Applied Maths): Quizzes

📚Quizzes
Revision NotesModel AnswersQuizzesFlashcardsExam Questions
Routing
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

12 questions from this quiz

Show

What are routing problems in dynamic programming?

Optimisation to find best path

What is the primary goal when solving routing problems?

Maximising benefits/minimising costs

Why do routing problems use a backward approach?

Calculate exact values for future

What does 'Stage' represent in routing problems?

Time periods or decision points

What does 'State' represent in routing problems?

Possible positions at each stage

What does OVD stand for in the value formula?

Optimum Value from Destination

What is the value calculation formula?

Value=Profit−Travel+OVD\text{Value} = \text{Profit} - \text{Travel} + \text{OVD}

What is the OVD value for the final stage?

Zero

How do you trace the optimal solution?

Follow asterisked choices from start

What three types of information are needed for routing problems?

Timing, benefit, cost

What does 'Action' represent in routing problems?

Decisions you can make from a state

What formula is used for calculating value in the final stage?

Value=Profit−Travel+0\text{Value} = \text{Profit} - \text{Travel} + 0

Explore Leaving Cert Applied Maths Revision Notes by Topics

Optimal Paths

Optimal Paths

Dynamic Programming

Dynamic Programming

Explore Leaving Cert Applied Maths Model Answers by Topics

Optimal Paths

Optimal Paths

Dynamic Programming

Dynamic Programming

Explore Leaving Cert Applied Maths Flashcards by Topics

Optimal Paths

Optimal Paths

Dynamic Programming

Dynamic Programming

Explore Leaving Cert Applied Maths Exam Questions by Topics

Optimal Paths

Optimal Paths

Dynamic Programming

Dynamic Programming

Join 100,000+ Leaving Cert students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.