page 1 out of 3
page 1 out of 3
Question 1
Queue is shortly referred as
Question 2
What are the operations can be done in Queue Data Structure
Question 3
Processs of inserting an element in Queue Data Structure is
Question 4
Process of deleting an element from Queue Data Structure is
Question 5
Pushing an element after completing all its size(memory) in Queue, The termonology used is
Question 6
Removing an element from empty Queue is called as
Question 7
Which one of the following is an application of Queue Data Structure?
Question 8
How many Queues are required to implement Stack Data Structure.
Question 9
Consider the following operation performed on a stack of size 4.
Enqueue(1);
Enqueue(2);
Dequeue();
Enqueue(3);
Enqueue(4);
Enqueue(5);
Dequeue();
Dequeue();
Enqueue(6);
Dequeue();
Dequeue();
Enqueue(7);
Enqueue(1);
Enqueue(2);
Dequeue();
Enqueue(3);
Enqueue(4);
Enqueue(5);
Dequeue();
Dequeue();
Enqueue(6);
Dequeue();
Dequeue();
Enqueue(7);
After the completion of all operations, the number of elements presen
Question 10
What is the time complexity for Enqueue and Dequeue operation in Stack Data Structure?
page 1 out of 3
page 1 out of 3