R programming for analyzing flight dataset and flight scheduling

This article covers the steps to analyze flight dataset using R programming, including importing csv file, sorting dataset, finding mean and median, viewing density and plotting dataset. It also covers flight scheduling using Java programming. The article includes code snippets and screenshots for better understanding.

Major Assignment2: Part 1
Step1: Import the csv file in R.

Step2: Dimension of the dataset.

Step3: Sort the dataset into the table:
Step4: Count the column of the flight dataset:

Step5: origin is the column of the dataset and count the origin.
Step6: View the three Table of the flight dataset.
Step7: Find out the New Table and display the dataset and Column of the dataset.

Step8: Find out the mean and median of the dataset and maximum and minimum.

Major Assignment2: Part 2
Step9: View the density of the dataset.

Step10: Finally plot the dataset are given below output.

1.
2.
public class FlightScheduler
{
private HashMap<String, Runways> airports = new HashMap<String, Runways>();
private HashSet<Flight> flights = new HashSet<Flight>();
public FlightScheduler(LinkedList<Runways> portList, LinkedList<Flight> fltList) {
3.
package read;
import java.io.File;

import java.io.FileNotFoundException;
import java.util.Scanner;
public class CSV {
private static Scanner inputStream;
public static void main(String[] args) {
String FileName="nycflights.csv";
File file=new File(FileName);
try
{
inputStream = new Scanner(file);
while(inputStream.hasNext())
{
String rd=inputStream.next();
System.out.println(rd + "");
}
}
catch (FileNotFoundException e)
{
e.printStackTrace();
}
}
}

1.
.import java.util.*;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
public class part4
{
String csvFile = "nycflights.csv";
String line = "";
String cvsSplitBy = ",";

try (BufferedReader br = new BufferedReader(new FileReader(csvFile))) {
while ((line = br.readLine()) != null) {
String[] country = line.split(cvsSplitBy);
System.out.println("flight [origin= " + value[EWR] + " , destination=" + value[HNL] +
"]");
}
} catch (IOException e) {
e.printStackTrace();
}
int graph[][];
int way[][];
int origin[][];
int destination;
int edges;

int i;
public static void main(String args[]) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
System.out.println("sources : ");
destination = Integer.parseInt(br.readLine());
System.out.println("destination: ");
edges = Integer.parseInt(br.readLine());
for(int i = 0; i < edges; i++)
{
System.out.println("egdes " + (i + 1) + ":");
System.out.print("Source: ");
int s = Integer.parseInt(br.readLine());
origin--;
System.out.print("Destination: ");
int d = Integer.parseInt(br.readLine());
destination--;
System.out.print("edges: ");
int edges = Integer.parseInt(br.readLine());

graph[origin][destination] = edges;
graph[destination][origin] = edges;
}
System.out.println("The initial routes are: ");
System.out.print("the current origins are: ");
int origin = Integer.parseInt(br.readLine());
origin--;
System.out.print("the current distination: ");
int destination = Integer.parseInt(br.readLine());
destination--;
System.out.print("the new edges: ");
int edges = Integer.parseInt(br.readLine());
graph[origin][destination] = edges;
graph[destination][origin] = edges;
static void disp(String message)
{
System.out.println();
insert_tables();
update_tables();
System.out.println(message);

printing_tables();
System.out.println(****);
}
}
}
2.
reallocated flights.put(startingPort, new Itinerary(departure));
Runways currentPort = startingPort;
Itinerary Routecurrent;
int EWR=3;
int LGA=2
int JFK=4
int ECI=4
int min = 0;
while(optimized.size() < airports.size()) {

if(value(EWR)==value(airports))
{
Count=count*i;
for(Runways a : airports.values()) {
if(optimized.contains(a))
continue;
Routecurrent = reallocated flights.get(a);
if(Routecurrent != null) {
length = Routecurrent.getLength();
if(length < min || min == -1) {
currentPort = a;
min = length;
if(min == -1) {
}
}
}
}

1.
120835(As you mentioned already)
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
public class FlightScheduler
{
String csvFile = "nycflights.csv";
String line = "";
String cvsSplitBy = ",";
try (BufferedReader br = new BufferedReader(new FileReader(csvFile))) {

while ((line = br.readLine()) != null) {
// use comma as separator
String[] flight = line.split(cvsSplitBy);
System.out.println(" flight[year= " + month[1] + " , day=" + flight
code[] + "]");
}
} catch (IOException e) {
e.printStackTrace();
}
int day, int month, int year, String flightCode;
Scanner sc=new Scanner(System.in);
System.out.println("enter the day");
Sc.nextInt();
System.out.println("enter the month");
Sc.nextInt();
System.out.println("enter the year");
Sc.nextInt();

System.out.println("enter the flight code");
Sc.nextString();
private HashMap<String, Runways> airports = new
HashMap<String, Runways>();
private HashSet<Flight> flights = new HashSet<Flight>();
public FlightScheduler(LinkedList<Runways> portList,
LinkedList<Flight> fltList) {
for(Runways a : portList)
{
airports.put(a.getID(), a);
}
for(Flight f : fltList) {
flights.add(f);
}
}
void loadData(String flightDataFile)
{
return airports.size();

}
void reallocate()
{
return flights.size();
}
public Itinerary Schedule(String start, String end, String
departure) {
HashSet<Runways> optimized = new
HashSet<Runways>();
HashMap<Runways, Itinerary> reallocated flights = new
HashMap<Runways, Itinerary>();
Runways startingPort = airports.get(start);
if(startingPort == null) {
return new Itinerary(false);
}

Runways endingPort = airports.get(end);
if(endingPort == null) {
return new Itinerary(false);
}
reallocated flights.put(startingPort, new Itinerary
(departure));
Runways currentPort = startingPort;
Itinerary Routecurrent;
int EWR=3;
int LGA=2
int JFK=4
int ECI=4
int min = 0;
while(optimized.size() < airports.size()) {
for(Runways a : airports.values()) {
if(optimized.contains(a))

continue;
Routecurrent =
reallocated flights.get(a);
if(Routecurrent != null) {
length =
Routecurrent.getLength();
if(length < min || min
== -1) {
currentPort =
a;
min = length;
if(min == -1) {
}
}
}

}
boolean status = true;
if(!status)
{
System.out.println("rescheduled");
}
else
{
System.out.println("cancelled");
}
if(distance.containsKey(end))
reallocated flights.get(end).print();
return new Itinerary(false);
}
}
Screenshots for java codes: