2. SFTW241 Programming Languages Architecture 2002~2003 Semester II Duration: 2003/2/11~ 2003/4/11 University of Macau Faculty of Science and Technology Computer and Information Science Year2 Class A Group A5 http://hk.geocities.com/sftw241_a5

3. Client Presentation Group A5

4. Leader: James Wu Secretary: Fanny Hao Liaison Member: Stella Leong Project Tracker: Justin Poon Web-page Administrator: Daniel Ieong Members of A5

5. Client presentation Review  James System introduction  Stella Technique  Justin Simulation  Fanny Wed Site and Conclusion  James

6. Part I Review Introduce how we selected the Project

7. Index (Ideas of Each Member):  James:  Bus route system  Daniel:  Golf – Booking Caddy  Justin:  Taxi Guide  Stella:  Take the driving license  Fanny:  Available Computers Searching System Index (Ideas of Each Member):

8. useful The number of customer that the software serve(the mark) The number of group member clear the operation that software do. The standard of selection

9. Golf – Booking Caddy By Daniel (Web-page Administrator)

10.  This program can check the caddy’s work times and check caddy who is work less, then send him to work. So all the caddies can work same times.  Good way:  It is good for the user to check the work times immediately and book the caddy systematically.  Bad way:  It will not give too many people to use it. Introduction

11.  We can choose  Check the caddy’s work times and booking times  Book the caddy.  If we choose ‘check times’  It will show a table and list all caddy booking time.  If we choose ‘book’ Program Running Steps

12.  We need to input your Member ID and password. Then input the caddy’s number, date and the time of the date. If the caddy is booked, it will give the user a message. If the user has not appoint a caddy. The program will check who is the less work times and will tell the user, then send him to work. So all the caddy will have the same work times. Program Running Steps

13. Available Computer Searching System By Fanny (Secretary)

14. It is difficult for students to look for a computer to use immediately. Sometimes, students need to go to all the computer rooms to look for the available computers. If they know which computer room that they can have available computers to use, they may go to the computer room directly. Introduction

15. Target of User: Students in University of Macau. Computer Rooms: NG02, NG03, N102A, N102, T107A, T107B, T120A, T120B.

16. Search for the available computers in University of Macau at the real time. Then, the student can go to the computer room directly. According to the simple statistics of the utility rate of computer rooms, students can know which day, which time and which location, there are more available computers for them to use. Functions

17. Since we use Text file (.txt) to save the data and be the source file, there will be convenient for us to edit or modify the data of the source file and not necessary to edit the program. Use some function to read the data form the source file to the Hash Table. Use some display function (e.g. w.open() ) to display the output and result. Technology

18. We banned this project. Reason: we find that there are some technology problems that we can’t solve. Result

19. Taxi Guide By Justin (Project Tracker)

20. The program is provided for the taxi customer, so that they can get the information about the fee before taking taxi. Objective

21. Giving the following information to the user about: The path from the starting point to the destination The fee The distant The time Function

22. We band this Project. Because we find this system need complex mathematic model, that include possibility and also have many unsure factor (like traffic jam) Result

23. Take the driving license By Stella Leong (Liaison Member)

24. In this program, if the user tell the time he want to get the license, the program can make a schedule for him. Tell him the time to - go through the formalities - take the driving course - take their examination This idea has been banned. Take the driving license

25. Part II System I ntroduction

26. After our discussion, we choose Bus Route System to be the subject of our problem. In this part, we will tell you something about:  Idea  Target  Function  Procedure Introduction

27. Nowadays, although private car is popular, there is a lot of people travel by bus Some people such as tourists may not know the bus route well Why did we choose this system?  Useful  Realistic  Convenient  Friendly  Extensible Idea

28. The targets are tourists and people who travel by bus In an international city, such as Macau, there are many tourists visit every day. This system is also convenient to the residents Target

29. Function We suppose that all the scenic spots and public facilities have their own bus stations. And for each location, there is a terminal  Scenic spot  Hotel  Hospital  Police station  Airport  Harbor

30. Through our system, the user can choose three different functions  A particular bus path  A bus route from a place to another place  The charge for bus Function

31. At first we would like to choose a real city, such as Macau, to implement our system. Afterward we found that the database is too enormous to control. Therefore, we decide a simulated city to execute this program. Function

32. When the users enter this system, the initial starting point is set the location he/she is The user can change other point to start Input the terminal point (destination) The user can select a particular bus company. Finish the input and send the request Procedure

33. The bus routes show on the map Dialog Box shows all the information, which contain:  Bus company name  Bus number  Bus route(starting point and terminal point are marked)  Number of station  Total fee Procedure

34. There may be several bus route pass same station, so the user may have more than one way to go to his/her destination. In our system, all the possible routes are provided, which include the shortest path. Procedure

35. Another function is searching a particular bus path At first, select bus number, no.5 for example Shows the whole particular bus route on the screen A dialog box is also provided Procedure

36. A special situation: there may be no bus can reach the selected point directly, so the user must transfer to other bus It is a trouble problem for the tourists. Our system can also help them to handle it. Procedure

37. If the system can not find a direct route, then the system will tell the user he/she should transfer to other bus in which bus stop The system adds more information in the dialog box. Such as  The transfer station  The transfer route  Which bus should be traveled by  Single fee and total fee

38. Further Extension Combine with Taxi Guide System  public transportation system in Macau  Find Taxi Routine  Useful for tourist, citizen  Broaden our target  More practicable

39.  Perhaps during the implementation, we will add this function is our project program if we can think out the way to handle those problems. Further Extension

40. Part III Technique

41. Different buses’ stop The information of the different buses’ route The company belongs The fee of a particular bus Data Base

42. Individual bus’ route data  link-list Connect bus stop to bus stop Make the data meaningful Running time O(N) Collection of bus’ route data  Hash table easy to handle Guarantee the running time still fix in O(N) Data Structure

43. Time for searching  large data, increasing running time  How to reduce the running time Index array (each bus stop)  To store which bus can pass through Data Structure

44. How to find a bus route  From the index array Starting bus stop Destination bus stop Find the common bus  From to the hash table Go to the corresponding bus route data Algorithm

45. No direct bus route from starting to destination  Search for common bus stop  The common bus stop is the one who the passenger change to the other bus A primitive concept for accessing the data  There would be some problems  Will solve during implementation Algorithm

46. Part IV Simulation

47. Part V Wed Site

48. Part VI Conclusion

49. Useful of our system  For the user  Find the indirect bus routine Challenge  Data Structure Searching Time Spotting The return of the bus route Conclusion

50. Second duration  Search the information  Implement the program emerge the problems solve the problems  Repeat the above steps to finish our program  Test the program  Modify the program Conclusion

51. Q & A

52. The End Thank you for your attention