Scribd
Upload
17 views1 page

Solutions To Quiz 1, Unit 3.4

Uploaded by

Satpal Jangra (JSHL-CRD3 E&A)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views1 page

Solutions To Quiz 1, Unit 3.4

Uploaded by

Satpal Jangra (JSHL-CRD3 E&A)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Solutions to Quiz 1, Unit 3.

4
1. If a sequence is compressible it is:

A. Random
B. Not Random

Solution: The answer is B. If a sequence is compressible, it possess some regularities, and


thus is not random.

2. How does the set of all possible algorithms compare with the set of all possible sequences
of 0’s and 1’s?

A. There are infinitely more algorithms than sequences.


B. There are the same number of algorithms and sequences.
C. There are infinitely more sequences than algorithms.

Solution: The answer is C. (The number of sequences is uncountably infinite and the
number of algorithms is countably infinite. )

3. For r = 4.0, a symbol sequence generated by the logistic equation is:

A. Generated by a deterministic process


B. As random as a coin toss
C. All of the above

Solution: The answer is C. The logistic equation with r = 4 is a deterministic process


that produces a random sequence.

You might also like