Advertisements
Advertisements
प्रश्न
State the principle by which the stack data structure works.
Advertisements
उत्तर
Last In First Out (LIFO)
APPEARS IN
संबंधित प्रश्न
What is Data Structure?
Write an algorithm for the binary search method. Explain algorithm with a suitable example.
What is a linked list?
State algorithm for inserting an element in an Array.
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:
Iteration Logic
write difference between Linear Search and Binary Search.
How linked list are represented in Memory?
Define the following term with reference to the Tree:
Depth
Explain how records are represented in memory using an array?
Explain Binary Scarch algorithm with a suitable example.
What is Binary Tree ? Draw the Tree diagram for the expression.
B = (3R -5T)2 - (R + Q3)
Write two features of each of doto structures:
1) Record
2) Linear array
3) Linked list
Explain memory representation of linked list with example.
The keyword used by a class to acquire the properties of an interface is:
A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out).
Define a class Queue with the following details:
| Class name | Queue |
| Data member/instance variable: | |
| dat[ ] | array to hold the integer elements |
| cap | stores the maximum capacity of the queue |
| front | to point the index of the front |
| rear | to point the index of the rear |
| Member functions/methods: | |
| Queue(int max) | constructor to initialize the data member cap = max, front = rear = 0 and create the integer array |
| void add_dat(int v) | to add integers from the rear index if possible else display the message(“Queue full”) |
| int pop_dat( ) | to remove and return elements from front, if any, else returns -999 |
| void display() | to display elements of the queue |
Specify the class Queue giving the details of void add_dat(int) and int pop_dat( ). Assume that the other functions have been defined.
The main( ) function and algorithm need NOT be written.
