Randomized Algorithms - - Unit 11 - Week 10: ... https://onlinecourses-archive.nptel.ac.in/noc19_...

reviewer4@nptel.iitm.ac.in ▼

Courses » Randomized Algorithms Announcements Course Ask a Question Progress FAQ

Unit 11 - Week 10: Randomization and Data Structures

Register for
Certification exam Assessment 10
The due date for submitting this assignment has passed.
Course As per our records you have not submitted this Due on 2019-04-10, 23:59 IST.
outline
assignment.

How to access 1) Consider a treap T with 100 elements. Assume that the keys are numbers from 1 to 100. 1 point
the portal Assume that the priorities are also numbers from 1 to 100.
The maximum possible height of T is
Week 1:
Introduction to 99
Randomized
Algorthms 50

7
Week 2:
Probability 100
Review
No, the answer is incorrect.
Week 3: Score: 0
Moments and Accepted Answers:
Deviations
100

Week 4: 2) Consider a treap T with n elements. Assume that the keys are numbers from 1 to n. 1 point
Probabilistic Assume that the priorities randomly chosen, uniformly and independently for each key from [0, 1] .
Method
The expected height of T is

Week 5: Markov
Chains-I
O(n)
Week 6: Markov
Chain-II
O(n2 )
Week 7: Number
Theoretic O(1)
Algorithms

Week 8: Graph O(log n)

Theoretic
No, the answer is incorrect.
Algorithms
Score: 0

Week 9: Accepted Answers:

Approximate O(log n)
Counting
3)©Consider
2014 NPTEL
a treap T where
- Privacy & Terms - Honor
the keys are Code 1 to- 15. Assume that the height of T is 4. 1 point
- FAQs
numbers
A project
Week of10: The key value of the root node is In association with
Randomization
and Data 1
Structures
8 Funded by
Lesson 1:

1 of 3 Friday 21 June 2019 01:02 PM

Randomized Algorithms - - Unit 11 - Week 10: ... https://onlinecourses-archive.nptel.ac.in/noc19_...

Treaps Powered by
15
Lession 2:
7
Hashing

Quiz : No, the answer is incorrect.

Assessment 10 Score: 0
Accepted Answers:
Week 11:
8
Computational
Complexity 4) Let H be a 2−universal family of hash functions from set M = {0, 1, … , m} to 0 points
N = {0, 1, … , n} , with m ≥ n . Let x be any element of M .
Week 12:
Let X denote the number of elements y in M such that h(x) = h(y) where h is chosen uniformly at
Randomized
Algorithms random from H . Which of the following statements are true?

E[X] = m for some x.

E[X]χ ≤ m
n for every x

E[X] > m
n for every x

E[X] ≥ m
n some x
No, the answer is incorrect.
Score: 0
Accepted Answers:
E[X]χ ≤ m
n for every x
5) Assume that the size of the dynamic set is O(n). The expected time taken for searching 1 point
an element in a hash table of size O(n) is

(n log n)

(n)

(log n)

O(1)
No, the answer is incorrect.
Score: 0
Accepted Answers:
O(1)

Previous Page End

2 of 3 Friday 21 June 2019 01:02 PM

Randomized Algorithms - - Unit 11 - Week 10: ... https://onlinecourses-archive.nptel.ac.in/noc19_...

3 of 3 Friday 21 June 2019 01:02 PM