Overview (Leaving Cert Applied Maths): Quizzes

📚Quizzes
Overview
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 does Dijkstra's algorithm find in a network?

The shortest route between two points

What permanent label is assigned to the source node at the start of Dijkstra's algorithm?

Zero

In Dijkstra's algorithm, which node is selected next to become permanent?

Node with smallest provisional distance

What does Dijkstra's algorithm guarantee?

The truly shortest path

What does early time represent in project timing?

Earliest an activity can begin

What is float in project scheduling?

Difference between early & late times

How are critical activities identified?

Where early time equals late time

What do activities with zero float lie on?

The critical path

What does a Gantt chart display?

Project timeline visually

In resource optimization, which activities should be assigned workers first?

Critical activities

What does Bellman's principle of optimality state?

Any segment of optimal path is optimal

In Bellman's principle, from which direction should you work?

Backwards from final destination

Explore Leaving Cert Applied Maths Revision Notes by Topics

Explore Leaving Cert Applied Maths Model Answers by Topics

Explore Leaving Cert Applied Maths Flashcards by Topics

Explore Leaving Cert Applied Maths Exam Questions by Topics

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

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