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:

书目详细资料
主要作者:	Mohd Radzi, Mohamad Khairul Ikhwan
格式:	Thesis
语言:	English
出版:	2017
主题:	Instruments and machines Online data processing Computer software Application software Software measurement Algorithms Database management Web databases
在线阅读:	https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf
标签:	添加标签没有标签, 成为第一个标记此记录!

id	my-uitm-ir.69421
record_format	uketd_dc
spelling	my-uitm-ir.694212022-10-31T03:35:08Z The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi 2017-01 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 https://ir.uitm.edu.my/id/eprint/69421/ https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf text en public degree Universiti Teknologi MARA, Terengganu Faculty of Computer and Mathematical Sciences Ismail@Abdul Wahab, Zawawi
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Ismail@Abdul Wahab, Zawawi
topic	Instruments and machines Instruments and machines Online data processing Instruments and machines Computer software Application software Instruments and machines Software measurement Algorithms Database management Instruments and machines Web databases
spellingShingle	Instruments and machines Instruments and machines Online data processing Instruments and machines Computer software Application software Instruments and machines Software measurement Algorithms Database management Instruments and machines 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
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
qualification_level	Bachelor degree
author	Mohd Radzi, Mohamad Khairul Ikhwan
author_facet	Mohd Radzi, Mohamad Khairul Ikhwan
author_sort	Mohd Radzi, Mohamad Khairul Ikhwan
title	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_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_sort	shortest route of the potential companies for internship using dijkstra’s algorithm / mohamad khairul ikhwan mohd radzi
granting_institution	Universiti Teknologi MARA, Terengganu
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2017
url	https://ir.uitm.edu.my/id/eprint/69421/1/69421.pdf
_version_	1783735877916164096

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

相似书籍