• Main Menu
  • Programming

    • Integer Overflow

      Integer Overflow

      An integer overflow, or integer wrapping, is a potential problem in a program based upon the fact that the value that can be held in a numeric datatype is limited by the data type’s size in bytes. ANSI C uses the following minimum sizes: data type size (bytes) char 1 short 2 int 2 long

    • cannot resolve symbol

      cannot resolve symbol

      “cannot resolve symbol” means that the Java compiler cannot locate a symbol referenced in your Java source code. The causes for this common error include: A missing class file A faulty CLASSPATH A symbol name is mispelled or miscapitalized A data type is incorrect, misspelled, or miscapitalized A method is called with the wrong number

    • Constructors in Derived Classes

      A constructor plays a vital role in initializing an object. An important note, while using constructors during inheritance, is that, as long as a base class constructor does not take any arguments, the derived class need not have a constructor function. However, if a base class contains a constructor with one or more arguments, then

    • 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

    • Java Decompiler

      Java Decompiler

      A Java decompiler is a special type of decompiler which takes a class file as input and produces Java source code as output. De-compilation is exactly the reverse process of compilation. However, decompilation will never produce an exact replica of the source code but does give back a major percentage. This is because quite a bit

    • 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.

    • Java Data Types

      Java Data Types

      Data types in the Java programming language are basically divided into two groups – primitive data types and object references. A primitive data type is a basic building block and has full built-in support. Many other languages also support composite data types, which are build on a combination of primitive data types and may or

    • Display Messages using Flashdata in CodeIgniter

      Flashdata is a functionality in the CodeIgniter framework that lets you make required data available for the next server request. It makes use of session, but unlike normal session behavior, the passed data is available only for the next server request and is automatically cleared thereafter. Therefore, Flashdata can be very useful in displaying notifications

    • 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

    • Deleting an Element from a Doubly Linked List

      Deleting an Element from a Doubly 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). Deletion in the list can take place at the following positions. At the beginning of the list At the end of the list After a given element Before

    311 queries in 0.450 seconds.