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.
As in Stacks, a queue could be implemented using a Linked List. A queue can be implemented by the following declarations and algorithms:
To represent(create) a queue we require a one dimensional array of some maximum size(int queue_arra[MAX];) to hold the data items and two other variable (int rear = -1;int front = -1;) to point to the beginning and the end of the queue.
Data Structure is the branch of computer science that unleaches(set free) the knowledge of how the data should be organized, how the flow of data should be controlled and how a data structure should be designed and implemented to reduce the complexity and increase the efficiency of the algorithm.
Menus are an integral part of GUI(Graphical User Interface). Menus allow the user to perform actions with extra GUI components. In Swing GUIs, menus can only be attached to objects of the classes that provide method setJMenuBar.
Pointers are variables that contains memory addresses as their values.The & or address operator, is a unary operator that returns the address of its operand.
Floodfill function when executed fills an enclosed area with the colour and pattern to be inserted given by the user. The pattern to be filled is given through setfillstyle() function.
Vector can be used to implement dynamic Array. It can accommodate any number and any type of objects. It is used to store various objects into a single unit.