• Main Menu
  • Programming

    • 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

    • 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

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

    • Circular Queue

      Circular Queue

      The difficulty of managing front and rear in an array-based non-circular queue can be overcome if we treat the queue position with index 0 as if it comes after the last position (in our case, index 9), i.e., we treat the queue as circular. Note that we use the same array declaration of the queue.

    • Java vs. JavaScript

      Java vs. JavaScript

      Java and JavaScript are two different programming languages meant for different purposes and functionality. Java is an application programming language designed to write stand-alone Java programs and web applications running on the Internet. JavaScript is a client-side scripting language specifically designed to work with various web technologies, but on the client’s end. To understand the

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

    • 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

    128 queries in 0.476 seconds.