Free and Open source SCM Attendance Management System is a complete system for any organization to take attendance of its staff. It is written in PHP and released as an open source project under GPL v3. This software is web based and easier to setup. First install and set up WAMP or LAMP depending upon the [...]
A stack is LIFO (Last-In First Out) structure. In contrast, a queue is a FIFO (First-In First-Out ) structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that [...]
To begin with Android applications development, you need to install the SDK and some related required components. This tutorial is about installing Android SDK on Eclipse. So you should have Eclipse already installed on your Computer. If you don’t know how to install eclipse, then you can download Eclipse from www.eclipse.org and can find instructions on how to [...]
This is a basic android application for beginners with source code. When you run it, you’ll see a simple screen with a button. If you click button, the Flash light on your android device will be on and and when you press the button again, the torch (flash) light will be off. Android learners and [...]
This is a basic android application for beginners with source code. When you run it, you’ll see a simple screen with an image and a button. If you click button, the image will switch and another image will be displayed and a funny message will also appear. Android learners and beginners can use this application for developing more advanced application.
I have compiled a list of some of the best e-learning websites for PHP that are sorted from easy (basic) to hard (advanced) manner that will guide you and will help you in learning PHP from scratch to advanced level.If you are new to PHP, then start from the 4 or 5 resources given below, If you are an intermediate programmer and want to learn advaned PHP concepts then try consulting the resources from 6 to 10.
Binary Search Trees (BSTs) are an important data structure for dynamic sets. Binary trees offer short paths from root. A node has up to two children that is why it is called binary tree. Data in binary tree is organized by value. A node in binary tree has following elements: A key (value) an identifying field inducing a total ordering; left pointer to a left child (may be NULL); right pointer to a right child (may be NULL); p pointer to a parent node (NULL for root).
Social media addiction have been well documented. And the truth is, we are feeling like we might have a touch of Facebook addiction. Sometimes we go to cyber cafe or any other places just to open our Facebook account but forget to log out. No need to worry about it, there is a way to log it out from any other computer. Follow the given steps and you are done.
Bucket sort (bin sort) is categorized into linear time sorting algorithms. In bucket sort, no comparisons needed between elements. But it depends on assumption about the numbers being sorted.
Bucket sort takes input as n real numbers in the range of 0 and 1. Basic idea of bucket sort is that it create n linked [...]
Quick sort is one of the fastest sorting algorithms known. It sorts O(n log n) in the average case while sorts O(n2) in the worst case. But in practice, it’s quick because the worst case doesn’t happen often. This based on divide-and-conquer strategy. It takes an array A that is to be sorted. The array [...]
A heap can be seen as a complete binary tree. You can think of unfilled (black nodes as given in image below) slots as null pointers.Heaps also satisfy the heap property:
A[Parent(i)] > A[i] for all nodes i > 1
Heaps can also be represented as an array. To represent a complete binary tree as [...]