Advert

How to Install Java

Last edited by . Total of no comments in the discussion.

Many applications require the Java Runtime Environment (JRE) to run. The JRE must be downloaded and installed on each PC where you intend to run Java-based applications. Steps to Install Java on Microsoft Windows Go to the Java Software Download Page Select the proper version of Java for your computer Click the download button Click run Click run Check I accept the terms in the license agreement Click next Click next Click finish Click yes to restart Windows now or no to restart Windows later

Share on:

Algorithm

Last edited by . Total of no comments in the discussion.

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 list of instructions to produce a variety of different, and sequential, states – eventually leading to the final or terminating state. Although the term algorithm is most closely associated with modern day computing applications, its Read More

Share on:

break and continue Statements

Last edited by . Total of no comments in the discussion.

break Statement The break statement is used to alter the flow of control. When a break statement is executed in a while loop, for loop, do-while loop or switch statement, it causes immediate exit from that statement. Program execution continues with the next statement. Common uses of the break statement are to escape early from a loop or to skip the remainder of a switch statement. The program written below demonstrates the break statement in a for-loop. When the if-statement detects that x has become 5, break statement is executed. Read More

Share on:

Constructors and Destructors

Last edited by . Total of no comments in the discussion.

A member function with the same name as its class is called a constructor. It is used to initialize the objects of that class-type with a some initial value. If a class has a constructor, each of the objects of that class will be initialized before they are used within the program. A constructor for a class is needed, so that the compiler automatically initializes an object as soon as it is created. A class constructor is defined without any return-type. They are called whenever a program creates an object Read More

Share on:

Overloading Binary Operators

Last edited by . Total of 1 comment in the discussion.

Binary operators can be overloaded in a similar manner as unary operators. We should note the following features of an operator function for a binary operator: It receives only one class type argument explicitly, in case of a member function. For a friend function, two class types are received as arguments. It returns a class type. Consider the following expression: C = A + B; The above expression contains three objects namely A, B and C of which A and B are the operands while C is the one to Read More

Share on:

Type Conversion

Last edited by . Total of no comments in the discussion.

It is often seen in programming that variables of different data types are used in the same expressions e.g. float with integer or an integer with a double. In these cases, C++ automatically converts one data type to another as the situation demands. The data type to the right of the assignment operator is converted to the type of data to the left. For example, when assigning an int to a float, the int will be promoted to a float and then assigned. The type conversions are automatic as long Read More

Share on:

Trees

Last edited by . Total of no comments in the discussion.

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 arrays and linked lists Searching can be made as fast as in ordered arrays Insertion and deletion as fast as in linked lists Tree characteristics Consists of nodes connected by edges Nodes often represent entities Read More

Share on:

What Are the Benefits of PHP?

Last edited by . Total of 1 comment in the discussion.

The programming language called PHP is quickly rising to be one of the most preferred web browser programming languages due to its user-friendliness, efficiency, and user control. PHP allows a user to describe specific functions within the code in order to drastically control the way a web browser displays and organizes information. A user is able to mix PHP and HTML within the same document to reach the desired effect. In this article, we will talk about how PHP works and why it is preferred by the people who use Read More

Share on:

Disassembler

Last edited by . Total of 1 comment in the discussion.

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 has or combine features from two or more programs. Because an “assembler” converts assembly language into executable language, a “disassembler” is considered to be the exact opposite of an assembler.   How Disassemblers Work Disassemblers Read More

Share on:

Linear Search

Last edited by . Total of no comments in the discussion.

This method traverses a list sequentially to locate the search key. The algorithm that one chooses generally depends on the organization of the array elements. If the elements are in random order, then one should choose the linear search technique. Algorithm linearsearch (a,n,item,loc) Here "a" is an array of the size n. This algorithm finds the location of the element "item" in the array "a". If search item is found, it sets loc to the index of the element; otherwise, it sets loc to -1 Begin for i=0 to (n-1) Read More

Share on: