• Main Menu
  • Programming

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

    • 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 Doubly Linked List

      Deleting an Element from a Doubly 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). Deletion in the list can take place at the following positions. At the beginning of the list At the end of the list After a given element Before

    • 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

    • Race Condition

      Race Condition

      A race condition occurs when multiple processes access and manipulate the same data concurrently, and the outcome of the execution depends on the particular order in which the access takes place. A race condition is of interest to a hacker when the race condition can be utilized to gain privileged system access. Consider the following

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

    • Address Calculation Sort

      In this method, a function fn() is applied to each key. The result of this function determines into which of the several sub-files the record is to be placed. The function should have the property that x <= y, fn (x) <= fn (y). Such a function is called order preserving. Thus all of the

    • 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

    • Breadth First Search Algorithm

      Breadth First Search Algorithm

      A breadth first search traversal method, visits all the successors of a visited node before visiting any successor of any of its child nodes. This is a contradiction to depth first traversal method; which visits the successor of a visited node before visiting any of its brothers, i.e., children of the same parent. A depth

    • Type Conversion – Class to Class

      Type Conversion – Class to Class

      Now that we have understood how to convert basic data types to class types and vice-versa, it is time to learn how to convert objects of one class type to another class type. The conversion between objects of different classes can be done using either a one-argument constructor or a conversion function. The choice depends

    programming
    330 queries in 0.596 seconds.