QuickHull and divide and conquer algorithm

By Hassnain Jamil -

Requirements:

In one place there is a treasure with diamonds. To get someone to treasure should avoid an area with
mines. We want to find, from the starting point, the shortest path to reach the treasure and does not
pass through the minefield. However, it may go scratch the minefield, practically on the mines
around the minefield.

The input will be a file in the following form (without the comments):
Integer coordinates exept the third line that is a single integer representing the number of diamonds.
8 23 //starting point
130 28//coordinates of the treasure
156 // the number of the diamonds
23 108 // the 1st mine
50 99 // 2nd mine
108 107 // 3rd mine
52 54
115 107
…

Write a code such that:


  1. Finding the shortest path from the initial point and print the following message. The shortest distance is 122.16872656315464 The shortest path is:(8.0,23.0) -->(56.0,23.0) --> (130.0,28.0)
  2. Among the diamonds there is one fake that weighs less than the others (all the other diamonds have exactly the same weight). We have at our disposal a weighing scale (like the one in the image)

Write code that calculates the minimum number of weightings, in order to find the fake diamond. It
must print the following message.

Number of weightings: 5
Instructions
  • Write code in Java 1.7 or 1.8. The only input argument must be the input file.
  • If you use any free code from the internet it should be noted specific.
  • The complexity of a) in the Middle Case it must be O(n logn) and the complexity of b)
  • must be O(n).
  • The source code must have inline comments and extended javadoc comments over every method. You should explain the reasoning of each step and make analysis of complexity.
The weighing scale can be simulated with the following

int scale() {
        Random randomGenerator = new Random();
        int x = randomGenerator.nextInt(100);
        if (x < 34) {
            return 1; // to the left
        } else if (x < 67) {
            return 0; //equal
        } else {
            return -1; // to the right
        }
    }


CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1

Comments

Post a Comment

Popular posts from this blog

[SOLVED] Tape for a Turing Machine using Doubly-linked List in Java with full source code

By Anonymous -
Tape for a Turing Machine (Doubly-linked List) Short exercise in which you will code part of an existing project. In this case, you will be working with a doubly-linked list. To make this topic more interesting, the list that you work on will be part of a Turing Machine. A Turing Machine is a kind of very simple, abstract computing device that was introduced in the 1930's by Alan Turing as a way of studying computation and its limitations. The classes that you need for the lab are in a package named turing. You will define a new class named Tape in this package. You can find the Java source in the code directory. You should copy this directory into an Eclipse project. There will be errors, since the existing classes depend on the Tape class, which you have not yet written. Don't forget the Javadoc comments. A Class for Turing Machine Tapes A Turing machine works on a "tape" that is used for both input and output. The tape is made up of little squares called cell...
Read more

[SOLVED] ICT285 Databases TMA 2017 Assignment 1 | Relational Algebra, Database Design & Implementation

By Anonymous -
Relational Algebra A database records information about athletes competing at the Olympics. An athlete competes for a particular country in one or more events. Events take place at a scheduled day and time in a particular venue. The result (rank) is recorded for all athletes in the final of the event. The medal (gold, silver or bronze) is also recorded for the medal winners in the event. Note that we are not considering team sports or heats in this example – only individuals competing in the finals. The schema for this database is as follows: (Note that primary keys are shown underlined, foreign keys in bold). ATHLETE ( AthleteNo , AthleteName, CountryName) COUNTRY ( CountryName , NumberOfCompetitors) EVENT (EventName, ScheduledStart, VenueName ) VENUE (VenueName, City, Capacity) FINAL ( AthleteNo , EventName , Rank, Medal) Provide relational algebra (NOT SQL) queries to find the following informaList the name and country of all athletes. List the event name and scheduled...
Read more