Advertisements
Advertisements
प्रश्न
State the principle by which the stack data structure works.
Advertisements
उत्तर
Last In First Out (LIFO)
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.
Define:
(i) Tree
(ii) Binary Tree
(iii) Extended Binary
With suitable example explain how tree can be represented in Memory?
A record is collection of_______
(i) Files
(ii) Arrays
(iii) Fields
(iv) Maps
Explain with flowchart the following control structure : Selection Logic
write difference between Linear Search and Binary Search.
Data items are divided into sub-item is called as ________.
(i) Group Item
(ii) Elementary Item
(iii) Nodes
(iv) Arrays
Write an algorithm for Traversing Linear Array.
Define Array and Pointer Array in the data structure.
Explain Linear data Structure and Non-linear Data Structure.
Define Group Item
Define Elementary Item
Define Entity.
What is Binary Tree?
___________ is very useful in situation when data is to be stored and retrieved in reverse order.
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)
Explain pointer Array with example.
