vannekari abhiram's repositories
SpeedyQr
SpeedyQR is your go-to solution for quick and efficient QR code generation,SpeedyQR allows you to generate QR codes in seconds.you can share information or web links it can generate QrCode in seconds
gitlearning
understanding git and github
Hacktoberfest
Hacktoberfest OPEN FIRST Pull Request š
movies-correlation
In this repository we are going to find the relations between different movies based on the various factors
tableaudashboard
created various dashboards using tableau
gsoc
Resources, activity, discussions for Wagtailās participation to Google Summer of Code
Submitty
Homework Submission, Automated Grading, and TA grading system.
element-web
A glossy Matrix collaboration client for the web.
Anki-Android
AnkiDroid: Anki flashcards on Android. Your secret trick to achieve superhuman information retention.
python-twitch-chatbot
A custom, 100% Python Twitch Chatbot that stores chat/viewership data in a PostgreSQL database.
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.
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
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.
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.
vannekariabhiram
Config files for my GitHub profile.
Trip-Planner-App-
Android Mobile Application that helps the user to record his/her planned trips with the start and end Geo-points, accompanied with the date and time of the trip and notes.
Digital-Clock-in-Python
Create Digital clock in Python using Tkinter