1:Compare the array and linked list implementations of queues. What are the advantages and disadvantages of each implementation? Consider memory space, the complexity of the implementation, and the time efficiencies of the implementations.

2: Consider a scenario in which the requests for service arrive periodically at a fixed rate (in other words, constant arrival rate). Is a queue necessary in such a scenario? Why or why not?

3: Let us say your company has a collection of identical Web servers to handle incoming Web transactions. How would you distribute the incoming processing requests?

4: Do a Web search and explain what happens to a queuing system in a Web server when it is hit by denial of service attack.

5: Let us make the queuing the system more flexible: Servers are dynamically added and deleted depending on the queue length. When the queue length exceeds a particular limit, a new server is added. When the queue length goes below another lower limit, a server is deleted. Discuss the impact on waiting time when the arrival rate, the threshold for adding a server and the threshold for deleting a server are changed.