1 votes 1 votes Computer Networks computer-networks csma-cd + – Na462 asked Jan 12, 2019 Na462 858 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Na462 commented Jan 12, 2019 reply Follow Share Why C is correct 0 votes 0 votes Na462 commented Jan 12, 2019 reply Follow Share In persistent CSMA, we sense the medium if medium is busy we wait if its free we send with a probability p in that slot or differ to next slot with probability 1-p, but here in first line it says that it transmits immediately and then do as stated 0 votes 0 votes aambazinga commented Jan 12, 2019 reply Follow Share Yeah you're right none of these is the answer 0 votes 0 votes darshan-at commented Oct 6, 2020 reply Follow Share C is correct answer because in both way algorithm is same. When a node senses the channel and founds busy then it wait for channel to become free and then it again senses the channel ,if idle then it will send the packet with probability p or else with probability 1-p it will not send the packet. In other case also , When a node senses the channel and founds idle then it will send the packet with probability p or else with probability 1-p it will not send the packet. If it founds busy then it waits for channel to become free. Both cases are of p persistent CSMA Reference of both : 1 https://www.tutorialspoint.com/p-persistent-csma-protocol 2 https://www.geeksforgeeks.org/difference-between-1-persistent-and-p-persistent-csma/ 0 votes 0 votes Please log in or register to add a comment.