vannekariabhiram Goto Github PK

anki-android

AnkiDroid: Anki flashcards on Android. Your secret trick to achieve superhuman information retention.

digital-clock-in-python

Create Digital clock in Python using Tkinter

django-webapp

This is a web-app created using Python, Django. By using this user can login, upload files and also can view and download files uploaded by other users.

dynamic-search-algorithm

Dynamic routing is an adaptive routing algorithm, and it is a process where a router can forward data through a different route. The term is most associated with data networking to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, so if other path choices are available. Dynamic routing allows many routes to remain valid in response to the change.

edit-distance

The Edit distance is a problem to measure how much two strings are different from one another by counting the minimum number of operations required to convert one string into the other. Edit distance problem can be solved by many different approaches . But the most efficient approach to solve the Edit distance problem is Dynamic programming approach which takes the O(N * M) time complexity, where N and M are sizes of the strings.

element-web

A glossy Matrix collaboration client for the web.

gitlearning

understanding git and github

gsoc

Resources, activity, discussions for Wagtail’s participation to Google Summer of Code

javascript-basic-projects

leetcode

leetcode-1

linear-regression

movie-analysis

movies-correlation

In this repository we are going to find the relations between different movies based on the various factors

python-twitch-chatbot

A custom, 100% Python Twitch Chatbot that stores chat/viewership data in a PostgreSQL database.

shortest-path-between-nodes

In computer networks, the shortest path algorithms aim to find the optimal paths between the network nodes so that routing cost is minimized. They are direct applications of the shortest path algorithms proposed in graph theory. In shortest path routing, the topology communication network is defined using a directed weighted graph. The nodes in the graph define switching components and the directed arcs in the graph define communication connection between switching components. Each arc has a weight that defines the cost of sharing a packet between two nodes in a specific direction

stocks-prediction-and-analysis

submitty

Homework Submission, Automated Grading, and TA grading system.

tableaudashboard

created various dashboards using tableau

vannekariabhiram

Config files for my GitHub profile.