ii) Suppose we are having a queue with capacity 3 with values in the queue are 10,20and 30. Write the algorithm for enqueue and explain with a diagram the enqueueoperation in queue if we are inserting value 45 in the queue.i) Consider an array arr {10, 50, 70, 80, 130, 190, 200, 230, 290}.a. Find the location of the item 23 in the array using Binary Search with thehelp of diagram.b. How many searches are needed to find the element 23.c. What has to be done if the array is not sorted?

Answered: ii) Suppose we are having a queue with…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

ii) Suppose we are having a queue with capacity 3 with values in the queue are 10,20
and 30. Write the algorithm for enqueue and explain with a diagram the enqueue
operation in queue if we are inserting value 45 in the queue.
i) Consider an array arr {10, 50, 70, 80, 130, 190, 200, 230, 290}.
a. Find the location of the item 23 in the array using Binary Search with the
help of diagram.
b. How many searches are needed to find the element 23.
c. What has to be done if the array is not sorted?

Expert Solution

Step 1

Hey, since there are multiple questions posted, we will answer first question. If you want any specific question to be answered then please submit that question only or specify the question number in your message.

ii)

EXPLANATION:

Queue is a linear structure that follows a particular order in which the operations are performed.
They use First In First Out order.
Queue has two major functions. They are enqueue and dequeue.
Enqueue is used to add an item to the queue. If the queue is full, then it is an overflow condition.
Dequeue is used to remove an item from the queue. The items are removed in the same order which they are pushed. If the queue is empty then it is an underflow condition.
Front variable is used to get the front item from the queue.
Rear variable is used to get the last item from the queue.

Step 2

ENQUEUE OPERATION ALGORITHM:

procedure enqueue(item)

//Check if the queue is full

if queue is full

/*if the queue is full, it will generate overflow error and exit*/

return overflow

end if

//if the queue is not full, increment the rear pointer

rear<-rear+1

//Add the item to the queue location, where rear is pointing

queue[rear]<-item