Discover balajiathreya/mp3_tag_reader Open Source project

Stars
1
Language
Python
Created over 12 years ago
Updated over 12 years ago

balajiathreya

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

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

twitterhelper

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

Python

trimethelper

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

Python

MSCodingChallenge

Bunch of coding challenges from MS

Scala

personalwebsite

Source code for my personal website

Makefile

data-gov-in

Visualization of data from data.gov.in

JavaScript

tweetmap

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

JavaScript

trimetdashboard

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

JavaScript

GAEApp

ProjectEuler

Project Euler problems using scala

Scala

TSP

Travelling Sales Man

Java

dijkstra-s-algorithm-in-perl

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

Perl

inversion_counting

inversion counting using DC - CS 325 HW

Java

CS-311

code for operating systems projects CS 311

SortingAlgorithms

Sorting algorithms in java

Java

maximum_subarray_problem

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

Java

SimpleDatabase

Java

dailyprogrammer

One problem to be solved every day.

Java

analog-clock-time-rotation

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

Java

CrackingTheCodeInterview

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

Java

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.

Java

Prim-s-algorithm

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

balajiathreya/mp3_tag_reader

balajiathreya

Reviews

Repository Details

More Repositories