1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
docker41 [41]
3 years ago
6

In a packet voice communications system, a source transmits packets containing digitizedspeech to a receiver. Because transmissi

on errors occasionally occur, an acknowledgment (ACK)or a nonacknowledgment (NAK) is transmitted back to the source to indicate the status of eachreceived packet. When the transmitter gets a NAK, the packet is retransmitted.Voice packets are delay sensitive and a packet can be transmitted a maximum ofdtimes. If apacket transmission is an independent Bernoulli trial with success probabilityp, what is the PMFofT, the number of times a packet is transmitted

Computers and Technology
1 answer:
omeli [17]3 years ago
5 0

The answer & explanation for this question is given in the attachment below.

You might be interested in
What are the three algorithm constructs?
zubka84 [21]

Answer:

The algorithm constructs are sequence, decision/selection and repetition.

Explanation:

5 0
3 years ago
I want to sign up for brainly but it won't let me. It keeps saying "we can complete your registration at this time".
vekshin1
Try reinstalling the app or check if your wifi connection is good, if everything’s good but the app still doesn’t work then just use the website
5 0
3 years ago
(4 points.) Write an algorithm (i.e., step-by-step instructions) via which someone could walk or drive from some origin to some
Elis [28]

Answer:

The algorithm is as follows :

1. Record Current Position, Final Destination

2. While Current Position is not Final Destination, repeat the following:

2.1 If destination location is up then:

  2.1.1 If an obstacle is directly above you then:

     2.1.1.1 Look for alternate position (left, right, down)

     2.1.1.2 If alternate position is found then

        2.1.1.2.1 Move there

        2.1.1.2.2 Record Current Position

     2.1.1.3 If no alternate position is found then

        2.1.1.3.1 Call for help

        2.1.1.3.2 End

  2.1.2 If no obstacle is directly above you then:

     2.1.2.1 Move up

     2.1.2.1 Record Current Position

2.2 If destination location is down then:

  2.2.1 If an obstacle is directly below you then:

     2.2.1.1 Look for alternate position (left, right, up)

     2.2.1.2 If alternate position is found then

        2.1.1.2.1 Move there

        2.2.1.2.2 Record Current Position

     2.2.1.3 If no alternate position is found then

        2.2.1.3.1 Call for help

        2.2.1.3.2 End

  2.2.2 If no obstacle is directly below you then:

     2.2.2.1 Move down

     2.1.2.1 Record Current Position

2.3 If destination location is right then:

  2.3.1 If an obstacle is directly by your right then:

     2.3.1.1 Look for alternate position (down, up, left)

     2.3.1.2 If alternate position is found then

        2.3.1.2.1 Move there

        2.3.1.2.2 Record Current Position

     2.3.1.3 If no alternate position is found then

        2.3.1.3.1 Call for help

        2.3.1.3.2 End

  2.3.2 If no obstacle is directly by your right then:

     2.3.2.1 Move right

     2.3.2.1 Record Current Position

2.4 If destination location is left then:

  2.4.1 If an obstacle is directly by your left then:

     2.4.1.1 Look for alternate position (down, up, right)

     2.4.1.2 If alternate position is found then

        2.4.1.2.1 Move there

        2.4.1.2.2 Record Current Position

     2.4.1.3 If no alternate position is found then

        2.4.1.3.1 Call for help

        2.4.1.3.2 End

  2.4.2 If no obstacle is directly by your left then:

     2.4.2.1 Move left

     2.4.2.1 Record Current Position

Explanation:

<em>The algorithm is straight forward.</em>

<em>All it does is to check for available position and move into the position if there is any available.</em>

<em>It keeps checking and moving until an obstacle prevents it from moving.</em>

5 0
3 years ago
show how one version of the technology is an improvement over a previous iteration of that same technology
Romashka-Z-Leto [24]
This question has a ton of answers to it but, here are some basic ideas to help you out
- Cars 1900's vs today
- Computers 1980's vs today
- Guns 1800's vs today
- Televisions 1900's vs today
- Telescopes/Microscopes
7 0
3 years ago
Whats important about the points?
likoan [24]
You can earn ranks! That is important.
8 0
3 years ago
Read 2 more answers
Other questions:
  • Drag the correct type of update to its definition.
    5·1 answer
  • How do you reduce computer screen flicker
    11·1 answer
  • Cassie is worried about credential management on a network where users often have over six passwords to remember. She’s curren
    13·1 answer
  • Computers help eliminate the repetitiveness of manual tasks. How can this benefit you in your overall career?
    9·2 answers
  • According to which virtue do you need to secure information by limiting computer access to authorized personnel only?
    6·1 answer
  • JPG is considered a lossy file format. What does this mean?
    15·2 answers
  • In online education is intrinsically related to equity. Professionalism Communication Accessibility
    8·2 answers
  • You scan the network and find a counterfeit access point that is using the same SSID as an already existing access point. What i
    12·1 answer
  • Discuss seven multimedia keys​
    8·1 answer
  • When you run your Windows Form application, what is the lifespan of a global variable (also known as a "field" or "class" variab
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!