You are on page 1of 2


SEMESTER 2 2017/2018

This assignment can be done in groups of up to five to six students. It can be neatly
handwritten or typed. If it is typed, it must be 12pt and in a readable font. If it is
handwritten, write your answer clearly and you may use a pencil to draw diagrams.
This assignment will carry 15 marks. For your work to be complete, you need to
explain your reasoning and make your computations clear as it may help you to get

The deadline for this assignment is 19 APRIL 2018 (Thursday). All work must be
submitted to FKI administration office (5th floor) before it closes. Please note that you
must also scan (if your assignment is handwritten) and upload your final
assignment to the Smart2ums. Late assignments will be evaluated minus 1% per
day submitted or uploaded after deadlines. Assignments submitted after deadlines will
only be marked if a valid argument for the late submission is presented.

All work that you turn in should be your own work; copying from others or allowing
others to copy from you is considered as cheating. Both the copier and the copiee
caught cheating on their assignments will get zero marks for the assignment.

Please download the Assignment Cover Sheet. You must submit your assignment with
this cover sheet attached.

1. Find the coefficient of w2 x 2 y 2 z 2 , in the expansion of
( 2w - x + 3 y + z - 2 )
( v + w - 2 x + y + 5 z + 3)
(10 Marks)
2. A pipeline is to be built that will link six cities. The cos(in hundreds of millions of
dollars) of constructing each potential link depends on distance and terrain and is
shown in the weighted graph below. Find a system of pipelines to connect all the
cities and yet minimize the total cost. Please explain the algorithm you use.

(10 Marks)

Label all vertices. Find the shortest path between A to T. Label all vertices. Figure 3 (10 Marks) 4. Figure 4 (10 Marks) Total: 40 Marks . Explain the Dijkstra’s algorithm using following graph (Figure 3). Explain the improved version of Dijkstra’s algorithm using following graph (Figure 4).3. Find the shortest path between A to E.