(5*14)
What are the conditions under which operations on queue can take place?
at any five questions: -
Define FIFO. Mention its connection with stack.
What is the difference between circular linked list & singly linked list &
double linked list
How would you implement stack of queues?
Write about the followings and compare them: bubble sort and selection
What are the advantages and disadvantages of representing a group of items
as an array verses a linear linked list?
Describe the process of allocation of memory by malloc and ealloc
functions
Elaborate () root & subtree (ii) parent & children (iii) ancestors &
descendants (iv) leal & siblings
VIL
Answers
Answer:
oh oh oh oh oh oh oh oh oh oh oh h oh oh
Answer:
Queue is also an abstract data type or a linear data structure, just like stack data structure, in which the first element is inserted from one end called the REAR(also called tail), and the removal of existing element takes place from the other end called as FRONT(also called head).
This makes queue as FIFO(First in First Out) data structure, which means that element inserted first will be removed first.
Which is exactly how queue system works in real world. If you go to a ticket counter to buy movie tickets, and are first in the queue, then you will be the first one to get the tickets. Right? Same is the case with Queue data structure. Data inserted first, will leave the queue first.
The process to add an element into queue is called Enqueue and the process of removal of an element from queue is called Dequeue