4 votes 4 votes In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure for finding this? Linked List Array Dynamically growing Array Set DS go-ds-1 data-structures + – Arjun asked Oct 10, 2016 Arjun 778 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 10 votes 10 votes Byte means 8 bits. So, using an array of size 256 we can count the frequency of all possible (256) bytes and finally output the one with the maximum count. Arjun answered Oct 12, 2016 • selected Dec 24, 2017 by Hemant Parihar Arjun comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Markzuck commented Nov 17, 2018 reply Follow Share ok so sir, if size is fixed then always prefer static array over dynanmic? 0 votes 0 votes palashbehra5 commented Jan 8, 2022 reply Follow Share are we maintaining an eight-bit array, and updating it with every byte we transfer? 0 votes 0 votes jugnu1337 commented Oct 21, 2022 reply Follow Share @Arjun sir what happened if there is option of “STACK” and what is the "SET" in given option 1 votes 1 votes Please log in or register to add a comment.