0 votes 0 votes Is Time complexity of CRC algorithm is O(n)? n=no of bits in data field. crc , implememted in data link layer as trailer, as error detection and correction method,in Hardware. Algorithms algorithms computer-networks + – Learner_jai asked Feb 7, 2017 • recategorized Jul 6, 2022 by Lakshman Bhaiya Learner_jai 375 views answer comment Share Follow See 1 comment See all 1 1 comment reply Hemant Parihar commented Feb 8, 2017 reply Follow Share Yes i also think it should be O(n). As the data passes through the data link layer to physical layer CRC is caluculated. As the complete data is passed. CRC is completely caluculated. That's why we put the CRC in the end also. 1 votes 1 votes Please log in or register to add a comment.
