Core3 Numerical solutions 31/01/12

Flipchart

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpYmZiMzJjNzAtNTdjZi00Nzk2LWFlMDUtZWI2YmUzNGEzYmY0&hl=en_GB

Exam questions

https://docs.google.com/leaf?id=0B2J1T-insOmpM2FkZjIxMmMtNDIwMi00Y2VjLWJlOGItNmIwNDg2NDY2MTI2&hl=en_GB

(question 4,5,6 for homework)

D1 Worked solutions

May 2010

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpMDc4NWU2NTktYWM1NS00YjRiLTkzZDYtYjMwMWYyNWZiNWYz&hl=en_US

January 2010

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpY2VkNjA2YWEtNWU2NS00OTQ2LThhNDktNzc0MzdiM2E2MTlj&hl=en_US

May 2009

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpMDFkMjYyY2MtMTQwNC00NzljLThjYjUtYjE3YWNkMjQ0YWE2&hl=en_US

January 2009

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpNjE0NDM1OTMtYWVjZS00OGVjLThjMWEtZTFkYzQxMTcwZmYx&hl=en_US

Mock paper

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpNjI0ZDFlODAtMjNhNy00OTU4LTk2YjEtNjk0MTBkNWJhZTBj&hl=en_US

Practice paper A

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpNmE3OGU2NTgtNjdmMC00ZTQ1LWFkMzktOTljMTI1MWJjNGQw&hl=en_US

Practice paper B

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpY2I0YzIwMGQtMDE2Yy00MjkxLWI1MDQtNGU1MGFiNGM5MjRk&hl=en_US

D1 Algorithms revision and linear programming 15/11/11

• Revision of.....
• Binary search algorithm
• Bubble sort, quick sort
• Bin packing

• And....
• Linear programming

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpYTAyYjg4NzAtOTM4My00MzU4LTk5M2ItNTkyOGZhODRiMGNi&hl=en_US

D1 Critical path analysis 01/11/11

• Precedence/dependence tables
• Drawing network from precedence table
• Early and late event times
• Slack on events
• Float on activities
• Critical activities
• Critical path
• Cascade (Gannt) chart

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpOTJiMzkzYTItODE4MC00OWE3LWIzMTEtNzljZTIzMmQzMDll&hl=en_US

D1 Matchings 18/10/11

• Reminder of bipartite graphs
• Matchings - trivial, maximal, complete
• Alternating paths to improve matchings
• Exam questions involving matchings

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpMWQzNzJhMjQtZDZhYi00OTFkLTlkOWUtMWUxNmM4NDQxZTYz&hl=en_US

D1 Shortest path 11/10/11

• Using Dijkstra's algorithm to find shortest path

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpYTg5ZTY0Y2QtZDAzMC00NjI1LTk4MWUtYzhmNDU1ZWNkMTM3&hl=en_US

D1 Route inspection 04/10/11

• Reminder of traversable (Eulerian) and semi-traversable (semi-Eulerian) graphs
• The route inspection problem
• Examples of using the route inspection problem

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpMzhlZmYxMGEtZWUxNS00N2U0LThhMjItMjBjZjc3OTNmMDNm&hl=en_US