The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi

Mohd Radzi, Mohamad Khairul Ikhwan (2017) The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi. Degree thesis, Universiti Teknologi MARA, Terengganu.

Abstract

Nowadays the developments in technology are very fast. The technology company race each other to create a name in this field. Technological development also affects the detection field. Today many methods invented by experts in technology to facilitate the public to make any finding on whether static or dynamic detection. Coordinates are used to mark the position of an object by using the Global Positioning System (GPS). This project proposed to solve problem faced by computer science student to find the company that provide internship and most nearest to them. The data such as coordinate of the current student, the coordinate of company and the distance between nodes are collected. This application will calculate the data to find out distance for every company that are nearest to the student current position. However, for optimum distance, dijkstra algorithm has been used. This algorithm is one of the algorithms used for getting the lowest cost search path. In other words, dijkstra algorithm used to find the best route to arrive at the every company that are related for this project. As the output of this project, the list of company will be displayed and sorted based on distance. The nearest one will be at the top followed by another companies. Base on listed companies, the student can choose the best company for them to make the internship. For the future work, this application can run on another platform so that the students who are not android users can used this application. This application also should change into dynamic form so that this application can add and make the same process for the new register company.

Metadata

Item Type: Thesis (Degree)
Creators:
Creators
Email / ID Num.
Mohd Radzi, Mohamad Khairul Ikhwan
2014526231
Contributors:
Contribution
Name
Email / ID Num.
Thesis advisor
Ismail@Abdul Wahab, Zawawi
UNSPECIFIED
Subjects: Q Science > QA Mathematics > Instruments and machines
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science
Q Science > QA Mathematics > Online data processing
Q Science > QA Mathematics > Evolutionary programming (Computer science). Genetic algorithms
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Computer software
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Computer software > Application software
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Computer software > Development. UML (Computer science)
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Computer software > Software measurement
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Database management
Q Science > QA Mathematics > Web-based user interfaces. User interfaces (Computer systems)
Q Science > QA Mathematics > Web databases
Divisions: Universiti Teknologi MARA, Terengganu > Kuala Terengganu Campus > Faculty of Computer and Mathematical Sciences
Programme: Bachelor of Computer Science (Hons)
Keywords: Dijkstra Algorithm ; Global Positioning System (GPS) Detection ; Path ; Static ; Dynamic
Date: January 2017
URI: https://ir.uitm.edu.my/id/eprint/69421
Edit Item
Edit Item

Download

[thumbnail of 69421.pdf] Text
69421.pdf

Download (123kB)

Digital Copy

Digital (fulltext) is available at:

Physical Copy

Physical status and holdings:
Item Status:
On Shelf

ID Number

69421

Indexing

Statistic

Statistic details