Java provides Logical Operator that may be used to form complex conditions for control structures by combining simple conditions. The logical operators(symbolic representation) are &&( logical AND), &(Boolean Logical AND),||(Logical OR), |(Boolean logical inclusive OR).^(Boolean logical exclusive OR) and !(logical NOT,also called logical negation operator)
The Selection sort technique is based upon the extension of the maximum/minimum technique. By means of a nest of for loop a pass through the array is made to locate the minimum value.
The Math class provides the random method. The random method generates a double value greater tha or equal to 0.0 but less than 1.0.
Circular Linked List is another remedy for the drawbacks of the Single Linked List besides Doubly Linked List. A Slight change to the structure of a linear list is made to convert it to circular linked list; link field in the last node contains a pointer back to the first not Null.
In the array implementation of lists, we will use array to hold the entries and a separate counter to keep track of the number of positions are occupied.
A function prototype tells the compiler the name of the function, the types of data returned by the function, the number of parameters(void odd(int Aa)) the function expects to receive, the types(int,float) of the parameters and the order in which these parameters are expected. The compiler uses function prototypes of validate function calls.
Cleardevice() function erases the graphics screen and moves the cursor position to home that is(0,0). Erasing here means filling current background colour. This function takes no arguments.
Two basic methods used in stack(LIFO….Last In First Out) are: statically (Array based implementation) and dynamically(pointer-based(Linked List) implementation).
There are two basic methods for the implementation of stacks--- one where the memory is used statically(by using Array) and the other where the memory is used dynamically(by Linked List).
Circular queue may be viewed as the array that holds the queue elements in circular rather than as a straight line. That means we may imagine that the first element of the array immediately follows the last elements.