• Main Menu
  • Programming

    • SDLC Methodology

      SDLC Methodology

      SDLC (Systems Development Life Cycle) is the process of creating or modifying existing systems and the models and methodologies that are used in the process. In the fields of software engineering and information systems, SDLC denotes a framework of methodologies aimed at the creation of an information/software system, i.e. the software development process. SDLC covers

    • Java Servlet

      Java Servlet

      A Java Servlet is the Java technology used to extend and improve Web server functionality. Servlets are able to provide a platform independent way to build web-based applications founded upon components without the performance limitations found with comparable CGI applications. Since Java Servlets are platform and server independent, they can be deployed across the full

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

    • Breadth First Search Algorithm

      Breadth First Search Algorithm

      A breadth first search traversal method, visits all the successors of a visited node before visiting any successor of any of its child nodes. This is a contradiction to depth first traversal method; which visits the successor of a visited node before visiting any of its brothers, i.e., children of the same parent. A depth

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

    • JNI (Java Native Interface)

      JNI (Java Native Interface)

      The JNI (Java Native Interface) is a layer of Java that permits code executing or running in the JVM (Java Virtual Machine) to invoke and to be called by native libraries and applications written in other languages. The JNI is most commonly used with the C++, C, and Assembly programming languages. Typically, code developers will

    • 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

    • Disassembler

      Disassembler

      A disassembler is a software that is able to convert an executable language into an assembly language, allowing users to view the individual commands that make a program work. A disassembler is ideal for programming applications because it can be useful when a programmer is attempting to create a similar program to one he/she already

    • How to Debug Java

      How to Debug Java

      The ability to debug any modern programming language is a critical skill for programmers of all skill levels. Learning how to debug Java helps developers discover the causes of logic and non-trivial syntax errors that prevent proper execution of Java programs. The ability to step-through a Java program using a debugging environment provided by updated

    • 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

    programming
    328 queries in 0.321 seconds.