Advertisements
Advertisements
प्रश्न
The keyword used by a class to acquire the properties of an interface is:
विकल्प
import
implements
extends
include
उत्तर
implements
APPEARS IN
संबंधित प्रश्न
---data structure does not require contiguous memory allocation
(i) Array
(ii) String
(iii) Pointer Array
(iv) Linked List
Write an algorithm to find smallest element in an Array.
Explain with flowchart the following control structure : Selection Logic
Explain with flowchart the following control structure : Iteration Logic
Explain Bubble Sort Algorithm with. suitable example.
Define the following terms with reference to Tree : Leaf
Define the following terms with reference to Tree : Depth
Data items are divided into sub-item is called as ________.
(i) Group Item
(ii) Elementary Item
(iii) Nodes
(iv) Arrays
Define Array and Pointer Array in the data structure.
Define Elementary Item
With suitable example show the relationship between Total Number of Nodes and Depth of Binary Tree.
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.
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.
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.
Differentiate between a stack and a queue.
