Blog Archives

Tutorials, solutions, discussions on general programming …

Counter Application – Part Two

As mentioned in previous post that you can find here, this post will be about persisting our counter information into SQLite database that is part of Android system. Let’s start this post with creating pojo object that will hold counter

Posted in General Programming Tagged with: , ,

Deploy and manage your Maximo instances using AnjaCI solution

Do you have issues managing and deploying multiple instances of Maximo (development, test, qa, production, etc) during upgrades and changes? Simply when you have to restart your Maximo instances due to some issues? Whoever had opportunity to work as Maximo support

Posted in General Programming, Solutions Tagged with: , , , ,

Cordova – First Application – Part 2

Here we go with the second part of article series with title Cordova – First Application. In first part of this series I have explained details how to install Cordova, setup Cordova project in NetBeans and finally described some details about

Posted in General Programming Tagged with: , , , ,

Google Maps – Interactive creation of polygons on map

In this post I am going to present to you how to use Google Maps API V3 to create functionality to draw polygons using polyline, just like in example hosted here. User can simply click points on the map that will

Posted in General Programming Tagged with: , ,

Binary Search Tree – Part 3

Finally this is third article on BST and in this last one we are going to go trough implementation details of algorithm for removing element from binary tree, keep in mind that code below will rely on code that has been

Posted in General Programming Tagged with: , ,

Binary Search Tree – Part 2

It has been some time since I wrote first part of BST tutorial and now it is time go publish second part. In this second part we shall first discuss how algorithm for removal of certain value/node from BST works and in third and last

Posted in General Programming Tagged with: , ,

Binary Search Tree (BST) – Part 1

Binary Search Tree (BST) is a data structure organized in such way that each node has comparable key and also satisfies condition that each key in the node is greater than any key in nodes of a left sub-tree and

Posted in General Programming Tagged with: , , ,

Subscribe for Newsletter

Categories