himasajeev Goto Github PK

16efl_20023798_leask_uber

Suppose that we think of the street network of a city as a graph, whose nodes are locations, and whose edges are labelled with the time it takes to traverse them. There are requests to the system which include a start location and a finish location, and a time stamp. Uber drivers fulfill requests in the order of their start time stamp, moves to the pickup location (one of the nodes, for simplicity), and then takes the passenger to the finish location they requested; and then fulfills the next outstanding request, and so on. You are given (a) the static data describing the city layout and street level transit times, and (b) a sequence of requests for service. The output of your algorithm is the total length of time that passengers spent waiting (i.e. a request start time was earlier than the arrival time of the Uber driver) and you should try to make this as small as possible. Start by assuming there are 2 Uber drivers, but discuss how you code (and results) would change if the number of drivers was an input to your system.

adaptive_hearing-aid

adaptive hearing aid, implemented in matlab

bookexchange

Book Exchange official website.

brain-tumor-detection

braint tumor detection using machine learning and image processing

c-skiplist

A simple skip list implementation in C

chapel

a Productive Parallel Programming Language

coding-problems

Solutions for various coding/algorithmic problems and many useful resources for learning algorithms and data structures

crypto-smp-2019

Repository for the Cryptography SMP 2019

dijkstrasshortestpath

dsa

Data structures and algorithms in C#

employee-appraisal-and-management

employee-appraisal-system

git-kep-2020

github-slideshow

A robot powered training repository :robot:

grpc

The C based gRPC (C++, Python, Ruby, Objective-C, PHP, C#)

http_proxy-server

http proxy server which handles GET request, user authentication and blacklisting of websites.Also implements caching.

ie-website

Website for The Institution of Engineers, NITK Chapter

ip-routing-using-xfast-trie

an efficient way to implement ip routing in routers

machine-learning-algorithms-from-scratch

Implementing machine learning algorithms from scratch.

ompl

The Open Motion Planning Library (OMPL)

shuttle-system-using-dijkstra-s-algorithm

will suggest an optimal path in nitk for a given time based on volume of students, traffic and distance using dijkstras algorithm

uber-passenger-ride-request-handling-algorithms

Algorithm's to minimize cumulative wait time for passengers when routing from node A to node B. Implements Dijkstra's algorithm with linked lists to form the graph used for finding the shortest path in a weighted graph. Uses a semi-clever heuristic algorithm for choosing which rider to serve first given the current riders waiting to be picked up, and their requested destination travel time that would be required.

weightedgraph

Working example of a weighted graph which implements dijikstra's algorithm to find shortest path between queries

wta-bookexchangewebsite