Advertisements
Advertisements
प्रश्न
State the principle by which the stack data structure works.
Advertisements
उत्तर
Last In First Out (LIFO)
APPEARS IN
संबंधित प्रश्न
Write an algorithm to find smallest element in an Array.
Define:
(i) Tree
(ii) Binary Tree
(iii) Extended Binary
Write an algorithm for the binary search method. Explain algorithm with a suitable example.
What is a linked list?
What is a Record ? How it is represented in Memory ?
A record is collection of_______
(i) Files
(ii) Arrays
(iii) Fields
(iv) Maps
Explain with a flowchart the following control structure:
Iteration Logic
write difference between Linear Search and Binary Search.
Define the following term with reference to the Tree:
Depth
Data items are divided into sub-item is called as ________.
(i) Group Item
(ii) Elementary Item
(iii) Nodes
(iv) Arrays
What is Array?
What is a binary tree?
With suitable example show the relationship between Total Number of Nodes and Depth of Binary Tree.
What is Record?
___________ is very useful in situation when data is to be stored and retrieved in reverse order.
Explain Binary Scarch algorithm with a suitable example.
Explain pointer Array with example.
Explain memory representation of linked list with example.
The keyword used by a class to acquire the properties of an interface is:
