aasthadixit Goto Github PK
Name: Aastha Dixit
Type: User
Bio: I am a Cloud/Security enthusiast. I like to relax but my highly competitive nature and curiosity to know about everything unknown does'nt allow me to do so :)
Name: Aastha Dixit
Type: User
Bio: I am a Cloud/Security enthusiast. I like to relax but my highly competitive nature and curiosity to know about everything unknown does'nt allow me to do so :)
Idea is similar to an old arcade game called Breakout, with some variations.
This project was a POC of an idea proposed in Cloud world.
a highly detailed data model using Entity-Relationship concepts and Enhanced Entity Relationship concepts
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.
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 ...
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.
This repo contains those files used to Benchmark 4 IaaS providers - GCE, AWS, MS Azure, and CenturyLink.
A program that implements arithmetic with large integers, of arbitrary size.
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.
This repo contains files that finds the level order traversal of a BST.
This project has codes that implements various methods to find a minimum spanning tree such as Kruskal, Prim using Heaps, Prim using Indexed Heaps.
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.
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.
To successfully demonstrate that a predictive model with reasonable accuracy can be developed from the classification problem dataset.
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.
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.
This project has codes that implements various methods to find Single Source Shortest Path algorithms such as BFS, DAG, Dijkstras, and Bellman Ford.
A simple project to understand the techniques of User Interface Designing
It is a Python project implemented using NLP algorithms, which is particularly used for correcting typos.
The ultimate vim distribution
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
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.
Python API security testing tool from OpenStack Security Group
Templates used in OpenStack syntribos to test various OpenStack projects.
Payloads used in syntribos to run various tests on OpenStack Projects
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.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.