• Main Menu
  • Programming

    • Binary Tree – Deleting a Node

      Binary Tree – Deleting a Node

      The possibilities which may arise during deleting a node from a binary tree are as follows: Node is a terminal node: In this case, if the node is a left child of its parent, then the left pointer of its parent is set to NULL. Otherwise if the node is a right child of its

    • How to Declare a Constant in Java

      How to Declare a Constant in Java

      Java does not directly support constants. However, a static final variable is effectively a constant. The static modifier causes the variable to be available without loading an instance of the class where it is defined. The final modifier causes the variable to be unchangeable. Ex: public static final int FOUNDING_YEAR = 2001; Naming Standards for

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

    • Overloading Binary Operators

      Overloading Binary Operators

      Binary operators can be overloaded in a similar manner as unary operators. We should note the following features of an operator function for a binary operator: It receives only one class type argument explicitly, in case of a member function. For a friend function, two class types are received as arguments. It returns a class

    • Java

      Java

      Java was originally developed as an implementation of a programming language that would compile and complete its directive functions regardless of platform and language version. It was developed by James Gosling, a software developer employed by Sun Microsystems in June of 1991, whom released the first version of Java in 1995. The language is designed

    • Algorithm

      Algorithm

      The term algorithm is used in a variety of fields, including mathematics, computer programming, and linguistics. Its most well-accepted definition is something that consists of a finite list of instructions (which are well defined) that can be used to accomplish a task. Basically, when an algorithm is given some initial state, it will use the

    • Doubly Linked List

      Doubly Linked List

      In a doubly linked list, also called a two-way list, each node is divided into three parts: The first part, called the previous pointer field, contains the address of the preceding element in the list. The second part contains the information of the list. The third part, called the next pointer field, contains the address

    • Hex Editor

      Hex Editor

      A hex editor is a program edits compiled programs and binary data files. These editors are called hex editors because they most often present data in hexadecimal format. Hexadecimal is used because it is easier for most humans than working in binary. In addition, hexadecimal is frequently useful because computers tend to work with 8-bit

    • Format String Vulnerability

      Format String Vulnerability

      To understand what a format string vulnerability is, you first need to know what a format string is. A format string is a way of telling the C compiler how it should format numbers when it prints them. Format Strings in C In the C programming language there are a number of functions which accept

    • 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

    129 queries in 0.252 seconds.