• Main Menu
  • Programming

    • 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

    • How to Check the Java Version

      How to Check the Java Version

      It is quite important to know which version of Java is installed on your computer, especially if you are developing applications and software on the Java platform. Using an outdated version of Java may hinder your Java development or even render web pages inappropriately in your browser. Below are few straightforward ways to check which

    • Inserting in a Doubly Linked List

      Inserting in a Doubly Linked List

      Inserting an Element To insert an element in the list, the first task is to allocate memory for a new node, assign the element to be inserted to the info field of the node, and then the new node is placed at the appropriate position by adjusting appropriate pointers. Insertion in the list can take

    • How to Enable Java

      How to Enable Java

      The Java Virtual Machine (JVM) is a collection of software programs and data modules that forms part of the Java and Java 2 platforms. JVM works across all platforms and it alters Java bytecode into machine understandable code and executes it. It acts as a clone of a Java processor allowing Java bytecode to be

    • Trees


      Arrays, linked lists, stacks and queues are used to represent linear and tabular data. These structures are not suitable for representing hierarchical data. In hierarchical data we have ancestors, descendants superiors, subordinates, etc Family Structure Business Corporate Structure Federal Government Structure Introduction to Trees Fundamental data storage structures used in programming Combine advantages of ordered

    • Exception Handling

      Exception Handling

      There are two kinds of exceptions, namely, synchronous exceptions and asynchronous exceptions. Errors such as “out-of-range index” and “over-flow” belong to the synchronous type exceptions. The errors that are caused by events beyond the control of the program (such as keyboard interrupts) are called asynchronous exceptions. The proposed exception handling mechanism in C++ is designed

    • SQL Injection Attack / Vulnerability

      SQL Injection Attack / Vulnerability

      A SQL injection vulnerability can occur when a poorly-written program uses user-provided data in a database query without first validating the input. This is most-often found within web pages with dynamic content. There are some excellent tutorials and descriptive articles on this subject, as well as many vulnerability postings for different applications from full-disclosure websites.

    • 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

    • 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

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

    126 queries in 0.401 seconds.