# Applet Methods

JApplet is a class that represents the Swing Applet. It is a subclass of Applet class and must extended by   all the applets that use Swing.

Reversing  a Linked list is the useful operation in which we change next to prev, prev to current and current to next.

# Reverse String using Stack

Stack is LIFO(LAST IN FIRST OUT) linear data structure. It can have 2 operations 1)Push(add a new item)  2)Pop(delete an item).In this example I have shown how  to reverse a string from last character to the first (example…..RAM  OUTPUT IS MAR)

# Queue Operations

## Queue Operations are......

Enqueue—Add an item(new item in back side) to the end of the queue.

Dequeue—Remove an item from the front.

Queue Front—Who is first?

Queueu End—Who is last?

# Nested Loops

Nested loop means loop within a loop one is inner loop(inside the body) and other is outer loop(two loops).Inner loop is placed inside outer loop.

# Logical Operators

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)

# Program of Sorting using Selection Sort

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.

# Generate Random Numbers

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.

# Program of Circular Linked List

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.

# Program of List using Array

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.

Page 3 of 30