Scribd
Upload
41 views1 page

Tutorial 4: 1 Instructions

The document provides instructions and questions for a tutorial scheduled to take place the following week. It contains 7 questions rated with difficulty levels. The questions cover topics like the expected length of the longest streak of 0s in a binary string, proving numbers are distinct when multiplied by a relative prime number, efficiently permuting an array using random numbers, analyzing a matrix multiplication verification algorithm for different value sets, the expected number of correctly guessed cards when picking randomly without and with memory, and calculating a probability involving randomly picking distinct numbers between 1 and 100.

Uploaded by

SAINATH THOTA
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
41 views1 page

Tutorial 4: 1 Instructions

The document provides instructions and questions for a tutorial scheduled to take place the following week. It contains 7 questions rated with difficulty levels. The questions cover topics like the expected length of the longest streak of 0s in a binary string, proving numbers are distinct when multiplied by a relative prime number, efficiently permuting an array using random numbers, analyzing a matrix multiplication verification algorithm for different value sets, the expected number of correctly guessed cards when picking randomly without and with memory, and calculating a probability involving randomly picking distinct numbers between 1 and 100.

Uploaded by

SAINATH THOTA
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

Tutorial 4

PNC
September 7, 2017

1 Instructions
1. The tutorial will be discussed in the class next week. The exact date will be mailed to you.

2. In case of any doubt or clarification wrt any question, please open a thread on the google
group [email protected] and initiate a discussion.

2 Questions
1. Given a binary string of length n, what is the expected length of the longest streak of 0s that
one can see? (Rating ***)
2. If a and n are relatively prime, then prove that a, 2a, 3a.........(n−1)a, are all distinct. (Rating
***)

3. Assuming you have a function which gives you random numbers from 1 to n, devise an
efficient algorithm to permute an array containing k elements. (Rating **)
4. We discussed matrix multiplication verification in the class. In the discussed algorithm, we
picked 100 vectors uniformly at random from Zn2 where Z = {0, 1}. Discuss the same analysis
for the following cases:

• We pick vectors from Znk where k = 3, 4, 5, ......


• We pick vectors from Z where Z is the set of integers.
(Rating **)
5. Assume you have a deck of cards, you flip all the cards and keep them on a table. Pick a card,
guess its value and keep it separately. Pick another card, guess it, separate it. Assuming you
have no memory power, that is, you can not remember what all cards you have seen till now,
what is the expected number of cards guessed correctly? (Rating ***)
6. In the above question, assuming that you can remember the cards that have already been
separated, what is the expected number of correctly guessed cards? (Rating **)

7. If we pick five numbers uniformly at random from the set 1,2,3...100 without repetitions.
What is the probability that every number picked is strictly less than the previous number?
(Rating **)

You might also like