• Main Menu
  • Programming

    • 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

    • 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

    • Java Operators

      Java Operators

      Java Operator Operator Description [ ] Array index () Method call . Member access ++ Prefix or postfix increment — Prefix or postfix decrement + – Unary plus, minus ~ Bitwise NOT ! Boolean (logical) NOT (type) Type cast new Object creation * / % Multiplication, division, remainder + – Addition, subtraction + String concatenation

    • 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

    • 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

    • 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

    • 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

    • Object

      Object

      A Java object is basically a set of data, data structures, and methods combined together to form a single entity. An object is an instance of class. Therefore, a class is said to be a blueprint of an object. Every object instantiated from a class will contain its own copy of member variables and member

    • How to Find Security Vulnerabilities in Source Code

      How to Find Security Vulnerabilities in Source Code

      The original, and still the best, method for finding security vulnerabilities in source code is to read and understand the source code. Source code security vulnerabilities will vary between languages and platforms. Items to look for in C code include: Potential vulnerability Function calls to examine for vulnerabilities Buffer overflows gets(), scanf(), sprintf(), strcat(), strcpy()

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

    120 queries in 0.404 seconds.