Cisco | Code-a-thon | OA | 28 June 2023

PROBLEM 1   Implement a prototype of a UDP network protocol. There is a 2d array of size n × 2, requests. At time t = requests[i][0], requests[i][1] packets are to be sent over the network. The network can hold at most max packets packets in the pipeline. it delivers the data to the client at rate packets per second, Le. rate packets are removed from the queue and delivered to the client every second. if the number of packets ...