• retagged by
3,576 views
3 3 votes
Messages are transmitted through a communication channel using two signals. The transmission of one signal requires $1 $ microsecond, the transmission of other signal requires $2$ microseconds. Assume that each signal in a message is immediately followed by the next signal. The number of different messages consisting of sequences of these two signals that can be sent in $10 \mu s$ is _________ ?

Please explain ...?

1 Answer

2 2 votes

Let $T_{n}$ be the number of ways to send the messages in n microseconds.

If there is no message or message of 0 length , we can send it in 1 way (do nothing)

Initially we had a message,to send it  we have two choices like

 1) we can start with a signal of 1 microsecond , this leaves the message can be send in remaining n − 1 microseconds.

2) We can start with a signal of 2 microseconds , this leaves the message can be send in then send the remaining n−2 microsec.

So here the  recurrence relation is $T_{n} = T_{n−1} + T_{n−2}$ for n ≥ 2.

What about base conditions $T_{0}$  and   $T_{1}$

$T_{0}$ = 1 and $T_{1}$=1 as nothing can be sent in 1 way (above) and 1 micro second message can be sent in 1 way.

and 2 micro second  message in 2 ways (sending 1micro second message two times or sendind 2microsecond message at a time).

Compute $T_{10}$  you can find this.

• edited by
Position:
Show:

Related questions

3 3 votes
1 1 answer
1.8k
1.8k views
Ravi_1511 asked Nov 5, 2016
1,782 views
Q : Messages are tranmitted over communication channel using two signals. Transmittal of one signal requires 1 microsecod and transmittal of other signal requires 2 micro...
51 51 votes
6 answers 6 answers
13.9k
13.9k views
Misbah Ghaya asked Nov 29, 2016
13,870 views
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
43 43 votes
6 answers 6 answers
17.4k
17.4k views
Kathleen asked Sep 23, 2014
17,404 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
51 51 votes
8 answers 8 answers
18.0k
18.0k views
Kathleen asked Sep 14, 2014
17,956 views
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...