• Main Menu
  • Programming

    • How to Enable JavaScript

      How to Enable JavaScript

      JavaScript is the most widely used client-side scripting language. Almost all websites these days make use of JavaScript directly or via 3rd-party frameworks like JQuery, Prototype, Bootstrap, MooTools, YahooGUI, etc. JavaScript is mostly used for advance web functionality like validations, animation, Ajax-based calling, making flexible interfaces, etc. Therefore, it is important to make sure that

    • 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

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

    • 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

    • Random Number Vulnerability

      Random Number Vulnerability

      Computers are deterministic and are therefore predictable. Computers cannot, in and of themselves, generate truly random numbers. In the absence of outside input, computers can only create pseudo-random numbers.  In the words of John Von Neumann, “Anyone attempting to produce random numbers by purely arithmetic means is, of course, in a state of sin.” A

    • 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

    • How to Sign a Java Applet

      How to Sign a Java Applet

      Java applets are designed to run in a restricted environment known as Sandbox. This confinement helps avoid malicious activities and breach of security from intentionally harmful applets. Therefore, an applet cannot access or communicate with any outside-the-sandbox resource unless granted permission by the user. The trustworthiness of an applet is showcased by signing it with

    • 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

    • Traversing and Searching a Linear Linked List

      Traversing and Searching a Linear Linked List

      Traversing a list A linear list can be traversed in two ways In order traversal Reverse order traversal In order Traversal To traverse the linear linked list, we walk the list using the pointers, and process each element until we reach the last element. .cf { font-family: Lucida Console; font-size: 9pt; color: black; background: white;

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

    320 queries in 0.480 seconds.