Advertisements
Advertisements
प्रश्न
State the principle by which the stack data structure works.
Advertisements
उत्तर
Last In First Out (LIFO)
APPEARS IN
संबंधित प्रश्न
Define:
(i) Tree
(ii) Binary Tree
(iii) Extended Binary
With suitable example explain how tree can be represented in Memory?
What is a Record ? How it is represented in Memory ?
Explain with a flowchart the following control structure:
Sequence Logic
Explain with a flowchart the following control structure:
Selection Logic
Explain with a flowchart the following control structure:
Iteration Logic
How linked list are represented in Memory?
Define the following term with reference to Tree:
Root
Define the following terms with reference to Tree : Sibling
Define the following term with reference to the Tree:
Depth
Define Array and Pointer Array in the data structure.
Explain Linear data Structure and Non-linear Data Structure.
Define Group Item
Define Entity.
What is Record?
What is Binary Tree ? Draw the Tree diagram for the expression.
B = (3R -5T)2 - (R + Q3)
Explain pointer Array with example.
The keyword used by a class to acquire the properties of an interface is:
A double ended queue is a linear data structure which enables the user to add and remove integers from either ends i.e., from front or rear.
The details for the class deQueue are given below:
| Class name | deQueue |
|
Data members/instance variables: |
|
| Qrr[] | array to hold integer elements |
| lim | maximum capacity of the dequeue |
| front | to point the index of the front end |
| rear | to point the index of the rear end |
|
Methods/Member functions: |
|
| deQueue(int 1) | constructor to initialise lim = 1, front = 0 and rear =0 |
| void addFront(int v) | to add integers in the dequeue at the front end if possible, otherwise display the message “OVERFLOW FROM FRONT” |
| void addRear(int v) | to add integers in the dequeue at the rear end if possible, otherwise, display the message “OVERFLOW FROM REAR” |
| int popFront() | removes and returns the integers from the front end of the dequeue if any, else returns — 999 |
| int popRear ( ) | removes and returns the integers from the rear end of the dequeue if any, else returns — 999 |
| void show( ) | displays the elements of the dequeue |
Specify the class deQueue giving details of the function void addFront(int) and int popFront(). Assume that the other functions have been defined. The main() function and algorithm need NOT be written.
