NEW
Font size
WorksheetsData Structures
Total questions: 15
Worksheet time: 9mins
Example of linear data structure except
array
tree
queue
stack
Which of these data structures is LIFO?
Stack
Queue
Binary Tree
Double linked list
int nums[ ] =
{2, 3, 5, 8, 9, 11};
How would you access the fourth element in nums
nums[8]
nums[3]
nums(4)
nums(3)
A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.
Linear Queue
Circular Queue
Priority Queue
In a stack, if a user tries to remove an element from empty stack it is called _________
Underflow
Stack is Empty
Overflow
None of the above
Pushing an element into stack already having five elements and stack size of 5, then stack becomes
Overflow
Crash
Underflow
None of the above
If the insertion and deletion happens from both the ends then the queue is called a______Queue
a) Deque
b) Header
c) Queue
d) Circular Queue
What is the value of the ROOT node in this Tree?
35
24
42
20
Can We Implement Stack Using Queue Data structure
Yes
No
It use pointer to link nodes.
Variable
Link List
Pointer
Trees
Act of adding values into a stack is called
Popping
Polling
Pushing
None
