Data Structures & Algorithms (IT 103)
Fundamentals of Data Structures & Algorithms
Output 1
Fundamentals of Data Structures and
Algorithm – Output 1
▪ Problem
▪ Content, Format & Rating
▪ Grading System
▪ Individual Grade Computation
Output Problem
Problem :
Given the discussion on Introduction to Data
Structures and Algorithm, create a simple program
that will satisfy the given requirements below.
1. Create a simple program using java programming
language under console interface.
2. The program should display a map based from
Image 1 : Map Reference.
Image 1 : Map Reference
Output Problem
Problem :
3. At the initial execution of the program :
a. generate random data (distance in meters; 10-100
value) from and to of each location.
b. randomize your position at the map
4. Create a simple interface showing the created Map
and display its details.
Image 1 : Map Reference
Output Problem
Problem :
5. Display your current location in the map.
6. Create an option/menu that will prompt the user to
select which location he/she would like to visit.
7. Display all the possible route to attain the location.
8. Calculate for the total distance from location A to
location B for all possible route.
Image 1 : Map Reference
Output Problem
Problem :
9. Display the results of the calculation and the program
should be able to recommend the shortest path from
location A to location B.
10. Calculate for the time needed to arrive at the destination
given the speed of .1 meter per min. Display the time
needed in hour.
11. Implement 1D array for storing data and values needed
in the program.
Image 1 : Map Reference
Content, Format and Rating
Content, Format & Rating
• Follow the given content and format below in documenting your output.
1. Title
2. Description
3. Flowchart
4. Timeline
Content, Format and Rating
Content, Format & Rating
• Follow the given content and format below in documenting your output.
5. Screenshot of Codes
6. Screenshot of Demonstration
7. Demonstration via Video Presentation
8. List of Group Members and Rating by Group Leader
Grading System
Grading System
• Output will be rated by 80% from the program and 20% documentation.
• In rating the program output, below criteria will be used :
Criteria %
Functionality 65%
Design and Interface 10%
Presentation & Delivery 5%
Grading System
Grading System
• In rating the required functionality of the program, it will rated as 0 or 1 for
every cited program requirements.
• Take note that the program will be created on Java Programming Language, under console
interface and implementing 1D array data structure thus; violating the specific instruction will
results to rating of 50 as the output final grade added the grade for documentation.
Grading System
Grading System
Item Indicator Weight Value
Indicator No. 2 5
Indicator No. 3 10
Indicator No. 4 5
Indicator No. 5 5
Indicator No. 6 5
Indicator No. 7 5
Indicator No. 8 5
Indicator No. 9 10
Indicator No. 10 10
Indicator No. 11 5
TOTAL 65
Individual Grade Computation
Individual Grade Formula
• Individual Grade will be computed based from the formula below:
Members
IG=AVG((Rated by GL),(Group Output Grade))
Leaders
IG=AVG((100),(Group Output Grade))
THANK YOU!

Midterm_Fundamentals-of-Data-Structures-Algorithms-Lecture-1-W2-W5_Group-Output-1.pdf

  • 1.
    Data Structures &Algorithms (IT 103) Fundamentals of Data Structures & Algorithms Output 1
  • 2.
    Fundamentals of DataStructures and Algorithm – Output 1 ▪ Problem ▪ Content, Format & Rating ▪ Grading System ▪ Individual Grade Computation
  • 3.
    Output Problem Problem : Giventhe discussion on Introduction to Data Structures and Algorithm, create a simple program that will satisfy the given requirements below. 1. Create a simple program using java programming language under console interface. 2. The program should display a map based from Image 1 : Map Reference. Image 1 : Map Reference
  • 4.
    Output Problem Problem : 3.At the initial execution of the program : a. generate random data (distance in meters; 10-100 value) from and to of each location. b. randomize your position at the map 4. Create a simple interface showing the created Map and display its details. Image 1 : Map Reference
  • 5.
    Output Problem Problem : 5.Display your current location in the map. 6. Create an option/menu that will prompt the user to select which location he/she would like to visit. 7. Display all the possible route to attain the location. 8. Calculate for the total distance from location A to location B for all possible route. Image 1 : Map Reference
  • 6.
    Output Problem Problem : 9.Display the results of the calculation and the program should be able to recommend the shortest path from location A to location B. 10. Calculate for the time needed to arrive at the destination given the speed of .1 meter per min. Display the time needed in hour. 11. Implement 1D array for storing data and values needed in the program. Image 1 : Map Reference
  • 7.
    Content, Format andRating Content, Format & Rating • Follow the given content and format below in documenting your output. 1. Title 2. Description 3. Flowchart 4. Timeline
  • 8.
    Content, Format andRating Content, Format & Rating • Follow the given content and format below in documenting your output. 5. Screenshot of Codes 6. Screenshot of Demonstration 7. Demonstration via Video Presentation 8. List of Group Members and Rating by Group Leader
  • 9.
    Grading System Grading System •Output will be rated by 80% from the program and 20% documentation. • In rating the program output, below criteria will be used : Criteria % Functionality 65% Design and Interface 10% Presentation & Delivery 5%
  • 10.
    Grading System Grading System •In rating the required functionality of the program, it will rated as 0 or 1 for every cited program requirements. • Take note that the program will be created on Java Programming Language, under console interface and implementing 1D array data structure thus; violating the specific instruction will results to rating of 50 as the output final grade added the grade for documentation.
  • 11.
    Grading System Grading System ItemIndicator Weight Value Indicator No. 2 5 Indicator No. 3 10 Indicator No. 4 5 Indicator No. 5 5 Indicator No. 6 5 Indicator No. 7 5 Indicator No. 8 5 Indicator No. 9 10 Indicator No. 10 10 Indicator No. 11 5 TOTAL 65
  • 12.
    Individual Grade Computation IndividualGrade Formula • Individual Grade will be computed based from the formula below: Members IG=AVG((Rated by GL),(Group Output Grade)) Leaders IG=AVG((100),(Group Output Grade))
  • 13.