Algorithmics

Page 1 of 2

ASIA PACIFIC INSTITUTE OF INFORMATION TECHNOLOGY Level 3 Algorithmics Individual Assignment

Intake : UC3F1107 CAI/CSE Lecturer : Sarfraz Nawaz Brohi Date Assigned: 9-September-2011 Date Due : 14-November-2011 This assignment consists of 1 section: Section A - Research Assignment (100 marks) Graph theory has many practical applications in the real world. One such application is to determine how a network of interconnected islands can be optimized in order to minimize the interconnection cost. For this specific assignment, this problem is represented by the following graph data: There are eight (8) islands in a lake. The state wants to connect these islands by building seven (7) bridges so that each island can be reached from any other island through one or more bridges. The cost of constructing a bridge is proportional to its length. The distances between the pairs of islands are given in the following table. Island 1 Island 2 Island 3 Island 4 Island 5 Island 6 Island 7 Island 8 Island 1 Island 2 240 Island 3 210 265 Island 4 340 175 260 Island 5 280 215 115 160 Island 6 200 180 350 330 360 Island 7 345 185 435 295 400 175 Island 8 120 155 195 230 170 205 305 -

You are required to address the following two (2) problems: i) Keeping the construction cost at a minimum, find out which seven (7) bridges to build. ii) There is a need to have bridges that connect islands 5, 7 and 6, 3. The number of bridges to be built is kept at seven (7). Having this constraint in place, find out the configuration that would keep construction cost at a minimum. Your assignment is to find an efficient solution to the GRAPH THEORY problems mentioned above and write a report on how the solution was derived. Both problems stated above need to be addressed.
Level 3 Asia Pacific Institute of Information Technology

Algorithmics

Page 2 of 2

You are to: 1. Compare the efficiency of solving these problems with brute-force, Prims, Kruskals, and Dijkstras algorithms in terms of big-O notation. Include pseudo-code with your explanations. 2. Determine what complexity class (P, NP, NP Hard, NP Complete) these problems belong to; provide the definition for this complexity class and provide justification as to why this problem belongs to this class. 3. Provide one or more non trivial standard problems that belong to the same complexity class as the problems mentioned above, and provide a clear, concise accurate definition of the problem chosen. Instructions Write a report describing the GRAPH THEORY problem above and its analysis. Your report should be between 6-10 pages long, double-spaced, 12-point font and 1 inch margins. You should cite all references using the appropriate referencing conventions. There will be a short interview with the lecturer to ensure understanding of materials submitted. General Rules and Guidelines Using algorithms and code segments from published sources or from others without proper citations will be considered to be plagiarism. You may discuss ideas to solve assignment problems with other class members. However, all assignments are to be thought out, written and implemented individually; direct copying of another's solution will automatically be brought to the attention of the Disciplinary Board.

Level 3

Asia Pacific Institute of Information Technology