0 Up votes0 Down votes

16 views1 pagesquestion bank for probability for Design and analysis of algorithm

Mar 04, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

question bank for probability for Design and analysis of algorithm

Attribution Non-Commercial (BY-NC)

16 views

question bank for probability for Design and analysis of algorithm

Attribution Non-Commercial (BY-NC)

- To Buy a Computer System
- HMM: Theorical recall and Application
- UT Dallas Syllabus for te3341.001.07f taught by John Fonseka (kjp)
- DISC 334-Management Science and Spreadsheet Modeling for UG Spring 2010-2011 Final
- SensIt 148 Guide
- Theory of Statistics
- Three Essays in Political Methodology
- Probability Generating Functions
- On Optimal Control of Wireless Networks With Multiuser Detection, Hybrid ARQ and Distortion Constraints
- PPT Render Ch 2
- Worksheet 3 for probability
- mit6 041f10 l04
- Mean field conditions for coalescing random walks
- Final Question Papers
- POWER MEASUREMENT AS SENSITIVITY ANALYSIS A UNIFIED APPROACH
- 1-s2.0-S0747563214004956-main.pdf
- assddeert
- Dice Problems
- Lecture-2
- Bayes Theorem

You are on page 1of 1

1. Balls are randomly (and independently) thrown into m bins kept at a place. 1. What is the expected number of balls to be thrown before the rst bin gets a ball? 2. After having thrown n balls, what is the expected number of balls in the rst bin? 3. What is the expected number of throws before the rst bin gets a second ball? (That is there is a collision in the rst bin - note the relationship with hashing.) 4. What is expected number of throws before at least one bin gets two balls? (number of insertions before the rst collision). 5. What is the expected number of throws before at least two bins get a ball? (Hint: Let X be a random variable denoting the number of throws after the rst throw necessary for a ball to land in a bin dierent from the bin into which the rst throw landed.). 6. Generalize the above question - what is the expected number of throws before k bins have at least one ball. 7. What is the expected number of throws before every bin gets a ball?. 2. Suppose you keep tossing a coin (with probability of head p) independently till you see exactly n heads. 1. For i n, what is the probability that i throws are required to get n heads? 2. Let X denote the random variable denoting the number of throws before you see n heads. Find E(X) = i i.P r(X = i). 3. Let X1 , X2 , .Xn denote random variables such that X1 denote the number of throws required for the rst head to appear, Xi+1 denote the number of throws required after the appearance of the ith head to obtain the (i + 1)th head, i 1. Show that E(X) of the previous question can be evaluated in a simpler way using these random variables using linearity of expectation. 3. Suppose X is a random variable that takes values from the set {0, 1, 2, ...}. Show that E(X) = P r(X 1) + P r(X 1) + P r(X 2) + ..... 4. Suppose there are 2 bins B1 and B2 . B1 contains 2 White and 3 Red balls. B2 contains 3 White and 4 Red balls. Suppose you pick B1 or B2 with probability 1/3 or 2/3 and then a ball randomly from the bin. 1. Describe all points in the sample space of the experiment. 2. Suppose you got a White ball, what is the conditional probability that the bin was B2 ? 5. Suppose we choose a number between 1 and 4 at random as our rst step. If you get 1, we will stop. Otherwise, if we get i {2, 3, 4}, we will choose an integer between 1 and i 1 at random again as our second step. We keep doing this till we choose 1. 1. Enumerate the sample space of this experiment. 2. Suppose you got a 1 in the second step, what is the (conditional) probability that you picked 4 in the rst step. 6. Mr. Markov is waiting the Poissonville bus stop where buses arrive with Probability 1/6 uniformly and independently at the strike of each minute. Assume Markov has arrived at the bus stop exactly at the strike of a minute. 1. What is the average wait time Mr. Markov spends in the bus stop? 2. Suppose a bus just left the previous second before Mr. Markov arrived, what is the expected wait time of Mr. Markov conditioned on this fact? 3. Suppose Mr. Chebyshev arrive exactly 3 minutes after the arrival of Mr. Markov. What is the probability that they get the same bus?

- To Buy a Computer SystemUploaded byferno101
- HMM: Theorical recall and ApplicationUploaded byMemnone
- UT Dallas Syllabus for te3341.001.07f taught by John Fonseka (kjp)Uploaded byUT Dallas Provost's Technology Group
- DISC 334-Management Science and Spreadsheet Modeling for UG Spring 2010-2011 FinalUploaded byrcheedarala
- SensIt 148 GuideUploaded byNavin Kumar
- Theory of StatisticsUploaded byLe Tung
- Three Essays in Political MethodologyUploaded byPTorbay
- Probability Generating FunctionsUploaded bybakken77
- On Optimal Control of Wireless Networks With Multiuser Detection, Hybrid ARQ and Distortion ConstraintsUploaded bysahathermal6633
- PPT Render Ch 2Uploaded byJen Quiambao
- Worksheet 3 for probabilityUploaded byjay1191
- mit6 041f10 l04Uploaded byapi-246008426
- Mean field conditions for coalescing random walksUploaded byRoberto Imbuzeiro Oliveira
- Final Question PapersUploaded byYogesh Anant Wagh
- POWER MEASUREMENT AS SENSITIVITY ANALYSIS A UNIFIED APPROACHUploaded byAna Rivera Castañon
- 1-s2.0-S0747563214004956-main.pdfUploaded byThodoris Argirakis
- assddeertUploaded byArka Mitra
- Dice ProblemsUploaded byRoumen Guha
- Lecture-2Uploaded byS.Waqquas
- Bayes TheoremUploaded byMuhammad Khiruzzaman
- REM: Resource-Efficient Mining for BlockchainsUploaded bythunderdome
- IntroductionUploaded byswapnil
- probability of dice when luck runs outUploaded byapi-439448139
- Odds.docxUploaded byootynetway
- pptUploaded byasad
- addmathe4syllUploaded byShravan Kumar
- UnemploymentUploaded byChelsea Rose
- Resilient Critical InfrstructureUploaded byslusaf
- Std12 Business Mathematics and Statistics EM Vol 2 Www.tntextbooks.in.PDFUploaded byShanmugasundaram
- chp 7 study guide.docUploaded byEmily Johnson

- FortiOS 6.0.2 SDN Connector Cisco ACI Administration GuideUploaded byPoncho
- Era 3aeb103vUploaded bylalithkumart
- ccsd 2012 master technology planUploaded byapi-231516879
- Regular ExpressionsUploaded bynadapez
- Locations of CrossBorder ExerciseUploaded byDavid Musselwhite
- winR32Uploaded byJulio Rafael
- App Cse & Ppmp Format - 2015Uploaded byDevin Carl Padilla Sagun
- Jvc Sp Uxg68Uploaded byeuioan
- MAST EDI SOP - Vendor EDI Processing GuideUploaded byKo Benny
- Pn SequenceUploaded bySaurabh Antapurkar
- datasheet mat lab.pdfUploaded byOscar Franco M
- Market Share: All Software Markets, Worldwide, 2013Uploaded byJoThorgen
- Project ManagementUploaded byBijay Uprety
- Mixed RealityUploaded byatom tux
- 00d2433Uploaded byVelmurugan Gurusamy Pandian
- Consultative Document on SSM Proposed XBRL Submission ProcessUploaded bytenglumlow
- 06_mn1780eu11mn_0001_om_toolsUploaded byRiZwan FadLy Tambun
- SCRIPT JOYSTICK UNITY.docxUploaded bysisnon
- ME2405 Mechatronics Lab ManualUploaded byThusith Wijayawardena
- A Distributed Resource Discovery Algorithm for P2P GridsUploaded byPooyanRezazade
- Postbox ShortcutsUploaded byAndy Bertolozzi
- Manual MCMLXXXIIUploaded bymanangel12
- PHCproposalsturtalUploaded bySuman Regmi
- Human Computer interaction the Fundamentals made EasyUploaded byzonenor
- Workshop 1aUploaded byaiyubi2
- Articulo Para EnviarUploaded byAna Well
- Data Domain and Symantec NetBackup 7.0 and Later Integration GuideUploaded byJosé Luiz Júnior
- IELTS Writing Actual Test in August 2017Uploaded byAudie Harrison Rojas
- DS2Uploaded bysatya20000
- Vikas Mishra Rf 7 Years Umts Gsm Optimization PlanningUploaded byVikas Mishra

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.