archana77archana/N-Queens
N-Queens solved using backtracking in Elixir.
Discovered public repositories for archana77archana in the GitHub catalog.
N-Queens solved using backtracking in Elixir.
Movie aggregator with the use of reflections
Car service centre website
Movie Aggregator app written in Java. You can print the details as a pdf or a txt file
Identify email addresses or domains names that belong to colleges or universities. Help automate the process of approving or rejecting academic discounts.
Public repository.
Public repository.
Public repository.
Public repository.
A chat application which allows registration and login using usernames. It uses Mongo DB as the database. You can connect to your friends using their usernames.
This repository will help you when you are in the initial stages of learning python programming. Read and understand. Code it yourself!
The server starts listening and the client and server can start sending messages to each other.
Public repository.
A simple chat server which can be handled using console as well as GUI, and needs username
Given functional dependencies of the type a ® b, check if there is any extraneous attribute in a.
This repository contains the basic java programs that you always get to see.
It's a presentation framework based on the power of CSS3 transforms and transitions in modern browsers and inspired by the idea behind prezi.com.
Let's learn forking and pull requests!
evented I/O for v8 javascript
Simple HTML5 Charts using the <canvas> tag
A binary heap is a data structure created using a binary tree with two additional constraints: – The shape property : the tree is a complete binary tree ; that is all the levels of the tree, excepts possibly the l ast one (deepest) are fully filled, and if the last level of th e tree is not complete, the nodes of that level are filled from left to right.
An AVL Tree is a self balancing binary search tree.
Public repository.
Transactionata: Transactional dynamic test data for Rails Tests. Set up your models and factories in a block that will be executed once and then rolled back by hooking into ActiveRecord's built-in fixture transactions
A library for setting up Ruby objects as test data.
a modular Ruby webserver interface
Manage your application's gem dependencies with less pain
A binary clock is usually a clock which displays traditional sexagesimal time in a binary format.
OmniAuth is a flexible authentication system utilizing Rack middleware.
Flexible authentication solution for Rails with Warden.
Our app for NASA Space Apps Hackathon
Public repository.
The open source error catcher that's Airbrake API compliant
Project website and wiki for Ruby on Rails proposals to Google Summer of Code 2014
Ruby on Rails
My first App using rails. :D
A data structure accessed beginning at the root node. Each node is either a leaf or an internal node. An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure , and the leaves are depicted at the bottom .
A linked list is a data structure consisting of a group of nodes which together represent a sequence.
Tokenizer class uses Stack data structure. This is a program for balancing paranthesis.
A stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push , and removal of an entity, known as pop . A stack can be generally defined as a linear list of items in which all additions and deletions are restricted to one end that is top .
Data Structures are something which is really needed in our coding process. Whenever you need to have large data bases you use data structures. You have stack, linked lists, vectors, trees etc. as data structures which are efficient ways of storing data's.
Freedom is to fight for what you believe in