Analysis of Algorithm Chapter 5

Analysis of Algorithm Chapter 5

University

10 Qs

quiz-placeholder

Similar activities

Time and Space Complexity

Time and Space Complexity

University

13 Qs

Compiler Parsing Techniques

Compiler Parsing Techniques

University

10 Qs

Fundamentals of Algorithms - Unit I - Test 2

Fundamentals of Algorithms - Unit I - Test 2

University

10 Qs

Enterprise Architecture

Enterprise Architecture

University

15 Qs

Searching and Sorting

Searching and Sorting

University - Professional Development

15 Qs

computers

computers

University

7 Qs

Intermediate Excel

Intermediate Excel

University

10 Qs

Decode the Data! An Intro to Data Science

Decode the Data! An Intro to Data Science

University

7 Qs

Analysis of Algorithm Chapter 5

Analysis of Algorithm Chapter 5

Assessment

Quiz

Computers

University

Hard

Created by

วัชรศักดิ์ ศิริเสรีวรรณ

Used 5+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Which ones are the recurrence relation derived from Divide-and-Conquer Algorithm

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

T(n) = 6T(n/3) + n2 ∊ ϴ(f(n)) , f(n) = ?

n2

log36

n1+log32

n2logn

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the best case of Quick sort

well-ordered input

reverse-ordered input

choosing the pivot at the middle location

the chosen pivot is the median

choosing the pivot randomly

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The constant time of Quick sort is on which process of Quick sort ?

Pivot selection

Find the position of pivot

Bipartition of array

Sorting the array

5.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

Which ones are true about analysis of time complexity of Quick sort in average case ?

Given n elements of array, the probability of the pivot being to each position is 1/n

Given the pivot is at the kth location, the time of that case is T(n - k) + T(k - 1) + n

6.

MULTIPLE SELECT QUESTION

1 min • 2 pts

Given the time of the algorithm is aT(n/b) + nd , what are the approach we can use to reduce the time of this algorithm ?

reduce a when a < bd

reduce nd when a > bd

reduce a when a > bd

reduce nd when a < bd

7.

FILL IN THE BLANK QUESTION

1 min • 1 pt

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?