• Main Menu
  • Programming

    • Setup PhoneGap for Android on Eclipse

      Setup PhoneGap for Android on Eclipse

      I recently started learning to make Android apps using PhoneGap. I use the Eclipse IDE for development. In this article, I will explain the steps to setup PhoneGap for Android using the Eclipse IDE. This tutorial is meant for Windows. I used the following components: Eclipse Classic 4.2.0 Android SDK ADT Plugin for Eclipse PhoneGap

    • JDK (Java Development Kit)

      JDK (Java Development Kit)

      The JDK (Java Development Kit) most commonly refers to an implementation of the Java SE or Java 2 SE. It can also refer to Java EE or Java ME implementations released by Oracle in the form of binary products targeted to Java developers that work on the Windows, Mac OS X, Linux, or Solaris platforms.

    • Address Calculation Sort

      In this method, a function fn() is applied to each key. The result of this function determines into which of the several sub-files the record is to be placed. The function should have the property that x <= y, fn (x) <= fn (y). Such a function is called order preserving. Thus all of the

    • Deleting an Element from a Heap

      Deleting an Element from a Heap

      Deleting an Element from the Heap Deletion always occurs at the root of the heap. If we delete the root element it creates a hole or vacant space at the root position. Because the heap must be complete, we fill the hole with the last element of the heap. Although the heap becomes complete, i.e.

    • Type Conversion – Basic to Class Type

      Type Conversion – Basic to Class Type

      The conversion from basic to user defined data types can be done using constructors. Consider the following constructor: .cf { font-family: Lucida Console; font-size: 9pt; color: black; background: white; } .cl { margin: 0px; } .cb1 { color: green; } .cb2 { color: blue; } .cb3 { color: maroon; }   String :: String(char *a)

    • Binary Tree – Searching a Node

      Binary Tree – Searching a Node

      An element in a binary search tree can be searched very quickly. A search operation on binary tree is similar to applying binary search technique to a sorted linear array. The element to be searched will be first compared with root node. If it matches with the root node then the search terminates. Otherwise search

    • Uninstall Java

      Uninstall Java

      Computer users sometimes need to uninstall Java, for various reasons. In case of upgrading Java, you needn’t remove the previous version of Java. Instead, you can simply run the executable of the newer Java version and the upgrade will automatically happen. However if you wish to uninstall Java, below are the methods for different platforms.

    • Deleting an Element from a Linear Linked List

      Deleting an Element from a Linear Linked List

      To delete an element from the list, first the pointers are set properly and then the memory occupied by the node to be deleted is deallocated (freed). This tutorial covers the deletion of a node from the following three positions: At the beginning of the list At the end of the list After a given

    • Doubly Linked List – Traversing and Search

      Doubly Linked List – Traversing and Search

      Traversing a Doubly Linked List A doubly linked list can be traversed either way and that too very conveniently. Inorder traversal Reverse order traversal Inorder Traversal To traverse the doubly linked list, we walk the list from the beginning, and process each element until we reach the last element. .cf { font-family: Lucida Console; font-size:

    • Circular Queue

      Circular Queue

      The difficulty of managing front and rear in an array-based non-circular queue can be overcome if we treat the queue position with index 0 as if it comes after the last position (in our case, index 9), i.e., we treat the queue as circular. Note that we use the same array declaration of the queue.

    328 queries in 0.527 seconds.