Discover @balajiathreya Open Source projects

Balaji Athreya (@balajiathreya)

balajiathreya

Stars
23
Global Rank 587,022 (Top 21 %)
Followers 3
Following 7
Registered about 13 years ago
Most used languages

Java
42.9 %

Python
14.3 %

JavaScript
14.3 %

Scala
9.5 %

C
9.5 %

Perl
4.8 %

Makefile 4.8 %
Location 🇺🇸 United States
Country Total Rank 104,666
Country Ranking

Scala
2,593

Makefile 3,004

Perl
4,305

twitterhelper

A backend for http://twitterhelper.balajiathreya.com. Contains services accessing Twitter api

trimethelper

Uses Trimet developer API and Twitter API to track Trimet delays and arrivals in real-time

MSCodingChallenge

Bunch of coding challenges from MS

personalwebsite

Source code for my personal website

data-gov-in

Visualization of data from data.gov.in

tweetmap

Pick a location on the map and see trending topics near that location

trimetdashboard

Trimet Dashboard - a dashboard built using angular js displaying arrivals at my favorite TRIMET location ids

GAEApp

ProjectEuler

Project Euler problems using scala

TSP

Travelling Sales Man

dijkstra-s-algorithm-in-perl

dijkstra's algorithm in perl - output requires some formatting though

mp3_tag_reader

A python util that reads audio tags from audio files, creates folders for each album and moves the files to the album folders. The mp3 player in Galaxy Nexus sucks when it comes to identifying mp3 tags

inversion_counting

inversion counting using DC - CS 325 HW

CS-311

code for operating systems projects CS 311

SortingAlgorithms

Sorting algorithms in java

maximum_subarray_problem

Maxium sub array probelm using BF,DP and DC. HW for CS 325

SimpleDatabase

dailyprogrammer

One problem to be solved every day.

analog-clock-time-rotation

a java program that computes the number of rotation needed so that 2 analog clocks have the same time.

CrackingTheCodeInterview

Solution for problems from Cracking the code interview, 4th edition

BTreeSortingValidator

A B-tree is a generalization of a binary search tree, where each node has n keys and n+1 children and n can be different for each node. The keys are sorted the same as in a binary search tree. For each key k in the tree, all children to the left must have keys less than k, and all children to the right must have keys greater than k. Write a method that validates whether a B-tree is correctly sorted. You do NOT need to validate whether the tree is balanced. Use the following model for a node in the B-tree.

Prim-s-algorithm

Implementation of Prim's algorithm in 3 flavors - serial, pthreads and C++ AMP