5 years ago in UGC CS - December 2012

# Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ?

[A] 122 & 22
[B] 111 & 11
[C] 133 & 33
[D] 144 & 44

## Overall Stats

Attempted 12
Correct 4
Incorrect 5
Viewed 3

Viswanathan S - 1 year ago

can anyone explain this

Viswanathan S - 1 year ago

Viswanathan S is saying 133 & 33 is correct answer

Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying 122 & 22 is correct answer

purushotham - 2 years ago

purushotham from India is saying 111 & 11 is correct answer

Nazia Sayed - 2 years ago

Nazia Sayed from Mumbai, India is saying 133 & 33 is correct answer

## Related Questions

### In DML, RECONNCT command cannot be used with

• [A] OPTIONAL Set
• [B] FIXED Set
• [C] MANDATOR Set
• [D] All of the above

### The design issue of Datalink Layer in OSI Reference Model is

• [A] Framing
• [B] Representation of bits
• [C] Synchronization of bits
• [D] Connection control

### The Power Set of the set {Ã˜}

• [A] �?
• [B] { �?, {�?}}
• [C] {0}
• [D] {o, �?,{�?}}

### AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits.

• [A] 5, 7, 15
• [B] 10, 12, 14
• [C] 5, 6, 7
• [D] 20, 12, 14

### Which of the following memory allocation scheme suffers from external fragmentation ?

• [A] Segmentation
• [B] Pure demand paging
• [C] Swapping
• [D] Paging