• Main Menu
  • Programming

    • Doubly Linked List – Traversing and Search

      Doubly Linked List – Traversing and Search

      Traversing a Doubly Linked List A doubly linked list can be traversed either way and that too very conveniently. Inorder traversal Reverse order traversal Inorder Traversal To traverse the doubly linked list, we walk the list from the beginning, and process each element until we reach the last element. .cf { font-family: Lucida Console; font-size:

    • Type Conversion – Class to Basic Type

      Type Conversion – Class to Basic Type

      The constructor handles the task of converting basic types to class types very well. But you cannot use constructors for converting class types to basic data types. Instead, you can define an overloaded casting operator that can be used to convert a class data type into a basic data type. The general form of an

    • 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

    • 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

    • 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

    • Depth First Search Algorithm

      Depth First Search Algorithm

      A DFS algorithm, as the name implies, is used to search deeper in the graph, whenever possible. The edges are explored, out of the most recently discovered vertex v that still has unexplored edges leaving it. When all of v's edges have been explored, the search backtracks to explore edges leaving the vertex from which

    • How to Declare a Constant in Java

      How to Declare a Constant in Java

      Java does not directly support constants. However, a static final variable is effectively a constant. The static modifier causes the variable to be available without loading an instance of the class where it is defined. The final modifier causes the variable to be unchangeable. Ex: public static final int FOUNDING_YEAR = 2001; Naming Standards for

    • cannot resolve symbol

      cannot resolve symbol

      “cannot resolve symbol” means that the Java compiler cannot locate a symbol referenced in your Java source code. The causes for this common error include: A missing class file A faulty CLASSPATH A symbol name is mispelled or miscapitalized A data type is incorrect, misspelled, or miscapitalized A method is called with the wrong number

    • Disassembler

      Disassembler

      A disassembler is a software that is able to convert an executable language into an assembly language, allowing users to view the individual commands that make a program work. A disassembler is ideal for programming applications because it can be useful when a programmer is attempting to create a similar program to one he/she already

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

    129 queries in 0.194 seconds.