0
Bssv
Wiki User
∙ 9y ago
Add your answer:
Earn +20 pts
Limitations of queue in data structure?
A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed.Some Applications:1) Serving requests of a single shared resource (printer, disk, CPU), transferring data asynchronously (data not necessarily received at same rate as sent) between two processes (IO buffers), e.g., pipes, file IO, sockets.2) Call center phone systems will use a queue to hold people in line until a service representative is free.3) Buffers on MP3 players and portable CD players, iPod playlist. Playlist for jukebox - add songs to the end, play from the front of the list.4) When programming a real-time system that can be interrupted (e.g., by a mouse click or wireless connection), it is necessary to attend to the interrupts immediately, before proceeding with the current activity. If the interrupts should be handles in the same order they arrive, then a FIFO queue is the appropriate data structure.
Difference between message oriented middleware and remote procedure call?
Feature MOM RPC Metaphor post office like Telephone like Cilent server time relationships ASynchronous Synchronous Client server sequence No sequence server must first comes up before the client talks to it. Partner needed No Yes Message filtering yes No Load balancing Single queue is needed Require TP monitor implement FIFO policy Performance Slow Fast Style queued call return
Insert algorithm for circular queue in data structures?
In a standard queue data structure re-buffering problem occurs for each dequeue operation. To solve this problem by joining the front and rear ends of a queue to make the queue as a circular queueCircular queue is a linear data structure. It follows FIFO principle.In circular queue the last node is connected back to the first node to make a circle.Circular linked list fallow the First In First Out principleElements are added at the rear end and the elements are deleted at front end of the queueBoth the front and the rear pointers points to the beginning of the array.It is also called as "Ring buffer".Items can inserted and deleted from a queue in O(1) time.Circular Queue can be created in three ways they are· Using single linked list· Using double linked list· Using arraysUsing single linked list:It is an extension for the basic single linked list. In circular linked list Instead of storing a Null value in the last node of a single linked list, store the address of the 1st node (root) forms a circular linked list. Using circular linked list it is possible to directly traverse to the first node after reaching the last node.The following figure shows circular single linked list:Using double linked listIn double linked list the right side pointer points to the next node address or the address of first node and left side pointer points to the previous node address or the address of last node of a list. Hence the above list is known as circular double linked list.The following figure shows Circular Double linked list :-Algorithm for creating circular linked list :-Step 1) startStep 2) create anode with the following fields to store information and the address of the next node.Structure nodebeginint infopointer to structure node called nextendStep 3) create a class called clist with the member variables of pointer to structure nodes called root, prev, next and the member functions create ( ) to create the circular linked list and display ( ) to display the circular linked list.Step 4) create an object called 'C' of clist typeStep 5) call C. create ( ) member functionStep 6) call C. display ( ) member functionStep 7) stopAlgorithm for create ( ) function:-Step 1) allocate the memory for newnodenewnode = new (node )Step 2) newnode->next=newnode. // circularStep 3) Repeat the steps from 4 to 5 until choice = 'n'Step 4) if (root=NULL)root = prev=newnode // prev is a running pointer which points last node of a listelsenewnode->next = rootprev->next = newnodeprev = newnodeStep 5) Read the choiceStep 6) returnAlgorithm for display ( ) function :-Step 1) startStep 2) declare a variable of pointer to structure node called temp, assign root to temptemp = rootStep 3) display temp->infoStep 4) temp = temp->nextStep 5) repeat the steps 6 until temp = rootStep 6) display temp infoStep 7) temp=temp->nextStep 8) returnUsing arrayIn arrays the range of a subscript is 0 to n-1 where n is the maximum size. To make the array as a circular array by making the subscript 0 as the next address of the subscript n-1 by using the formula subscript = (subscript +1) % maximum size. In circular queue the front and rear pointer are updated by using the above formula.The following figure shows circular array:Algorithm for Enqueue operation using arrayStep 1. startStep 2. if (front == (rear+1)%max)Print error "circular queue overflow "Step 3. else{ rear = (rear+1)%maxQ[rear] = element;If (front == -1 ) f = 0;}Step 4. stopAlgorithm for Dequeue operation using arrayStep 1. startStep 2. if ((front == rear) && (rear == -1))Print error "circular queue underflow "Step 3. else{ element = Q[front]If (front == rear) front=rear = -1ElseFront = (front + 1) % max}Step 4. stop
What is format of mp5 games?
Call of Duty
How objets call from class in java?
if we are acessing static members we can call them directly,while coming to non static members inorder to call object we have to call by using new operator......
What do you call a line of waiters?
queue
What do you call lines of waiters?
queue
How do you get invisible in call of duty world at war?
You can't be invisible.
What is the nick name of a blackhole?
It can be call 'Invisible Star' because it is invisible.
Why are the call centers started?
Call centers are stared in a lot of developing companies due to small pay there. Most of the big companies in the world have moved their customer service to such call centers. So regardless of what part of the world you are in, when you call to get help with your computer or tv, your calls are answered from such call centers.
Which companies offer services for call centers?
There are quite a few companies that offer services for call centers. One place is Verizon Wireless as they hire call centers to have work done for them.
What do they call a line of people?
Some call a line of people a "queue" (pron. kyew). Others just call it a line.
What do you call a line of people awaiting their turns?
A Queue I believe.
Where are most of the telemarketing call centers located?
Most telemarketing call centers are located outside the U.S because of outsourcing being cheaper for business. One Country widely known for call centers is India.
What did they call The Invisible Man parents?
His transparents
What's in India?
Call Centers !!
How many call centers are there?
105
