Register

NVS PGT 2016 exam

1,747 views
1 1 vote
In the _______method , after the station finds the line idle , it sends or refrains from sending based on probability

a)None-Persistent

b)One -Persistent

c) P-Persistent

d)Non-Persistent

1 Answer

Best answer
1 1 vote

ans is D

p persistent 

CSMA access modes[edit]

1-persistent 

1-persistent CSMA is an aggressive transmission algorithm. When the transmitting node is ready to transmit, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, then it senses the transmission medium continuously until it becomes idle, then transmits the message (a frame) unconditionally (i.e. with probability=1). In case of a collision, the sender waits for a random period of time and attempts the same procedure again. 1-persistent CSMA is used in CSMA/CD systems including Ethernet.

Non-persistent 

Non persistent CSMA is a non aggressive transmission algorithm. When the transmitting node is ready to transmit data, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, then it waits for a random period of time (during which it does not sense the transmission medium) before repeating the whole logic cycle (which started with sensing the transmission medium for idle or busy) again. This approach reduces collision, results in overall higher medium throughput but with a penalty of longer initial delay compared to 1–persistent.

P-persistent 

This is an approach between 1-persistent and non-persistent CSMA access modes. [2]When the transmitting node is ready to transmit data, it senses the transmission medium for idle or busy. If idle, then it transmits a frame with probability p. If busy, then it senses the transmission medium continuously until it becomes idle, then transmits with probability p. If the node does not transmit (the probability of this event is 1-p), it waits until the next available time slot. If the transmission medium is still not busy, it transmits again with the same probability p. This probabilistic hold-off repeats until the frame is finally transmitted or when the medium is found to become busy again (i.e. some other node has already started transmitting). In the latter case the node repeats the whole logic cycle (which started with sensing the transmission medium for idle or busy) again. p-persistent CSMA is used in CSMA/CA systems including Wi-Fi and other packet radio system

• edited by
Voting & Accepting an answer helps improve the community
← Previous · Example of operating...Next → · below are images sh...
← Previous in category · NW-Sliding Window Pr...Next in category → · NVS comp sc paper
Position:
Show:

Related questions

0 0 votes
0 0 answers
623
623 views
vivekgateoverflow asked Apr 1, 2017
623 views
DEar admin please upload kvs pgt and nvs pgt computer science questions in previous years question
DEar admin please upload kvs pgt and nvs pgt computer science questions in previous years question tag with answer thanku so much every one searching question an...
0 0 votes
2 2 answers
2.2k
2.2k views
Sanjay Sharma asked Jan 7, 2017
2,208 views
PGT KVS 2016
S1 : a small page size causes large page tables. S2 : internal fragmentation is increased with small pages S3: I/O transfers are more efficient with large pages.a)S1 is...
0 0 votes
0 0 answers
392
392 views
Sanjay Sharma asked Dec 11, 2016
392 views
NVS comp sc paper
0 0 votes
1 1 answer
1.2k
1.2k views
Sanjay Sharma asked Nov 16, 2021
1,219 views
PGT CS oops
In context of C++, which of thefollowing is valid statement ?(1) Friend function of class isalways a member function ofthat class.(2) Value of static data membercannot be...