The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi
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 stati...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | en |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf https://ir.uitm.edu.my/id/eprint/69421/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833074296471158784 |
|---|---|
| author | Mohd Radzi, Mohamad Khairul Ikhwan |
| author_facet | Mohd Radzi, Mohamad Khairul Ikhwan |
| author_sort | Mohd Radzi, Mohamad Khairul Ikhwan |
| building | Tun Abdul Razak Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknologi Mara |
| content_source | UiTM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | 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. |
| format | Thesis |
| id | my.uitm.ir-69421 |
| institution | Universiti Teknologi Mara |
| language | en |
| publishDate | 2017 |
| record_format | eprints |
| spelling | my.uitm.ir-694212022-10-31T03:35:08Z https://ir.uitm.edu.my/id/eprint/69421/ The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi Mohd Radzi, Mohamad Khairul Ikhwan Instruments and machines Electronic Computers. Computer Science Online data processing Evolutionary programming (Computer science). Genetic algorithms Computer software Application software Development. UML (Computer science) Software measurement Algorithms Database management Web-based user interfaces. User interfaces (Computer systems) Web databases 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. 2017-01 Thesis NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi. (2017) Degree thesis, thesis, Universiti Teknologi MARA, Terengganu. |
| spellingShingle | Instruments and machines Electronic Computers. Computer Science Online data processing Evolutionary programming (Computer science). Genetic algorithms Computer software Application software Development. UML (Computer science) Software measurement Algorithms Database management Web-based user interfaces. User interfaces (Computer systems) Web databases Mohd Radzi, Mohamad Khairul Ikhwan The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title | The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title_full | The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title_fullStr | The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title_full_unstemmed | The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title_short | The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi |
| title_sort | shortest route of the potential companies for internship using dijkstra’s algorithm / mohamad khairul ikhwan mohd radzi |
| topic | Instruments and machines Electronic Computers. Computer Science Online data processing Evolutionary programming (Computer science). Genetic algorithms Computer software Application software Development. UML (Computer science) Software measurement Algorithms Database management Web-based user interfaces. User interfaces (Computer systems) Web databases |
| url | https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf https://ir.uitm.edu.my/id/eprint/69421/ |
| url_provider | http://ir.uitm.edu.my/ |