Advertisements
Advertisements
Question
The keyword used by a class to acquire the properties of an interface is:
Options
import
implements
extends
include
Solution
implements
APPEARS IN
RELATED QUESTIONS
Write an algorithm to find smallest element in an Array.
Define:
(i) Tree
(ii) Binary Tree
(iii) Extended Binary
With suitable example explain how tree can be represented in Memory?
State algorithm for inserting an element in an Array.
Explain with flowchart the following control structure : Sequence Logic
write difference between Linear Search and Binary Search.
How linked list are represented in Memory ?
Define the following terms with reference to Tree : Depth
Explain Linear data Structure and Non-linear Data Structure.
Define Elementary Item
What is Record
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.
