• Main Menu
  • Programming

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

    • 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

    • Function Templates

      Like class templates, we can also define function templates that could be used to create a family of functions with different argument types. The general format of a function template is as follows: template <class T> return-type function-name( argument of type T ) { // body of function with Type T } The function template

    • Iterations

      An Iteration involves repeating some portion of a program, a specified number of time or until a particular condition is reached. This repetitive operation in C and C++ is achieved through for, while and do-while loop. How does a for loop work? A for loop is the easiest iteration loop to understand the C and

    • Java Method

      Java Method

      Java Method is very much similar to a normal method or a function written within a class definition. Java method is basically a set of statements group together to perform a specific task. This method is included in a class. An object instantiated from a class can call methods of that class. Every Java method

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

    • 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

    • Shell Sort

      Shell Sort

      Invented by Donald Shell in 1959, Shell sort is the most efficient of the O(n2) class of sorting algorithms. It is also the most complex of the O(n2) algorithms. This algorithm is similar to bubble sort in the sense that it also moves elements by exchanges. Shell sort begins by comparing elements that are at

    • Trees

      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

    • The Prim Algorithm

      The Prim Algorithm

      Given a connected weighted graph G, it is often desired to create a spanning tree T for G such that the sum of the weights of the tree edges in T is as small as possible. Such a tree is called as minimum spanning tree and represents the most inexpensive way of connecting all the

    programming