Cebu City touring system (Record no. 47292)

000 -LEADER
fixed length control field 01931nam a2200169Ia 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200308073525.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190927s9999 xx 000 0 und d
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number T P171 2013
100 ## - MAIN ENTRY--PERSONAL NAME
Preferred name for the person Palad, Flora May A.
245 #0 - TITLE STATEMENT
Title Cebu City touring system
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of Publication Cebu City
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of Publisher CIT-U
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Date of Publication 2013
520 ## - SUMMARY, ETC.
Summary, etc This paper presented a common solution for non-Cebu City residents especially foreigners since they are not familiar with the place, Metro Cebu City. This will be a big help for them since they don?t need to ask anyone anymore which can also lead them to a wrong place. It is a system that advice a path from the current location to the desired location being inputted. Automating this system can help develop the tourism of the city.<br/><br/>Every street that consists of various points was being inputted manually inside the system. Each Street has its own name, estimated distance from one point to one point, its landmark and its type. Schools, Hospitals, Buildings, Malls, Markets, Entertainments, Churches, Tourist Spots, Hotels and others can be considered as landmark as long as it is within Cebu City and in the map. It also has a Node which the name of the street, its index, its distance, its heuristic value, path cost, its node parent and node child.<br/><br/>After getting the starting point and end point, the system used the A* Algorithm. The starting point which is the current point checks if it is equal to the end point , if not it checks for the adjacent points and gets the shortest adjacent using F=G+H. G is the current distance taken from starting point to the current, while H is the heuristic value, the estimated value from the current point to the end and check again. The system will then stop seeking if the end point was already visited. And then the system will now give the shortest path by following the node parent of the last node being saved.
526 ## - STUDY PROGRAM INFORMATION NOTE
-- 000-099
942 ## - ADDED ENTRY ELEMENTS
Item type RESERVED BOOKS
Source of classification or shelving scheme
Holdings
Withdrawn status Lost status Damaged status Not for loan Permanent Location Current Location Date acquired Full call number Barcode Date last seen Price effective from Item type
        COLLEGE LIBRARY COLLEGE LIBRARY 2019-09-27 T P171 2013 T1719 2019-09-27 2019-09-27 RESERVED BOOKS