Advertisements
Advertisements
प्रश्न
The keyword used by a class to acquire the properties of an interface is:
पर्याय
import
implements
extends
include
Advertisements
उत्तर
implements
APPEARS IN
संबंधित प्रश्न
---data structure does not require contiguous memory allocation
(i) Array
(ii) String
(iii) Pointer Array
(iv) Linked List
What is Data Structure?
Write an algorithm to find smallest element in an Array.
What is a linked list?
Explain with a flowchart the following control structure:
Sequence Logic
How linked list are represented in Memory?
What is Array?
Write an algorithm for Traversing Linear Array.
What is Record?
Explain how records are represented in memory using an array?
___________ is very useful in situation when data is to be stored and retrieved in reverse order.
Write two features of each of doto structures:
1) Record
2) Linear array
3) Linked list
Explain pointer Array with example.
Explain memory representation of linked list with example.
State the principle by which the stack data structure works.
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.
Differentiate between a stack and a queue.
