aasthadixit Goto Github PK

android-breakout-game

Idea is similar to an old arcade game called Breakout, with some variations.

cloud-security

This project was a POC of an idea proposed in Cloud world.

comprehensive-payroll-system-database

a highly detailed data model using Entity-Relationship concepts and Enhanced Entity Relationship concepts

euler-path

Is a given graph Eulerian? A graph G is called Eulerian if it is connected and the degree of every vertex is an even number. It is known that such graphs have a cycle (not simple) that goes through every edge of the graph exactly once. A connected graph that has exactly 2 vertices of odd degree has an Eulerian path.

eulerian-tour

A graph G is called Eulerian if it is connected and the degree of every vertex is an even number. It is known that such graphs aways have a tour (a cycle that may not be simple) that goes through every edge of the graph exactly once. Such a tour (sometimes called a circuit) is called an Euler tour. If the graph is connected, and it has exactly ...

handling-large-numbers

This project has a custom and one of the efficient ways to handle large numbers using List Interface in JAVA. This code doesn't use any in built packages to represent Large Integers.

iaas-cloud-sp-benchmarking

This repo contains those files used to Benchmark 4 IaaS providers - GCE, AWS, MS Azure, and CenturyLink.

integer-arithmetic-with-arbitrarily-large-numbers

A program that implements arithmetic with large integers, of arbitrary size.

intersection-union-and-set-difference-of-a-set

In this repo, two linked lists implementing sorted sets, are analysed by performing union, intersection, and set difference of the sets. The comparable interface is learnt through this project.

level-ordering-in-trees

This repo contains files that finds the level order traversal of a BST.

minimum-spanning-trees

This project has codes that implements various methods to find a minimum spanning tree such as Kruskal, Prim using Heaps, Prim using Indexed Heaps.

most-efficient-fibonacci

Usually fibonacci implementations runs O(n) or O(n^2) times. This repo has a variant of Fibonacci algo that computes the result in O(log N) times.

nflix

permutations-and-combinations

This repo has the program for Combination and Permutations. 1. Permuation.java - has the code for take 2 and take 3 algorithms. 2. Combinations.java - has the code for combination algorithm. 3. Driver.java - contains the driver class and function.

predicting-blood-donations

To successfully demonstrate that a predictive model with reasonable accuracy can be developed from the classification problem dataset.

priorityqueue-and-minimum-spanning-trees

This project has a custom implementation of Priority Queue data structure. The data structure is a very useful tool to find the minimum spanning tree. This project has code for PQ and MST.

robot-simulation-for-better-ui-understanding

This project is a java based standalone application that simulates a ROBOT to understand user events, mouse clicks, optimisation of screen looks, scren controls etc.

shortest-path-algorithms

This project has codes that implements various methods to find Single Source Shortest Path algorithms such as BFS, DAG, Dijkstras, and Bellman Ford.

simple-ui-design

A simple project to understand the techniques of User Interface Designing

spellchecker

It is a Python project implemented using NLP algorithms, which is particularly used for correcting typos.

spf13-vim

The ultimate vim distribution

stockmarketwebprogramming

This project is a simulation of an online stock broking system. The main intention of this project was to use as many technologies as possible in a short span of time. JS, HTML, CSS, BootStrap, JQuery, AJAX, Rest API, PHP, JSON are the technologies used

study-of-merge-sort

This repo has the code that compares Merge Sort and Priority Queue Data Structure. The aim of this short project was to analyse these two techniques to sort elements, and use them at appropriate enterprise solutions.

syntribos

Python API security testing tool from OpenStack Security Group

syntribos-openstack-templates

Templates used in OpenStack syntribos to test various OpenStack projects.

syntribos-openstack-templates-1

syntribos-payloads

Payloads used in syntribos to run various tests on OpenStack Projects

topological-sorting

This project has code for topological sorting of a graph. There are two variations of computing the topological ordering and both the methods are written in this project.

twitter-sentiment-analysis

vimrc