Analysis of Algorithms (Recurrences)

10+ posts

Recent articles

Count ways to obtain given sum by repeated throws of a dice

Last updated: 09 April 2023

Given an integer N, the task is to find the number of ways to get the sum N by repeatedly throwing a dice.Examples:Input: N = 3Output: 4Explanation:The four possible ways ...read more

Dynamic Programming

Mathematical

Recursion

Analysis of Algorithms (Recurrences)

Memoization

DSA

Algorithms | Analysis of Algorithms (Recurrences) | Question 11

Last updated: 28 June 2021

Consider the following recurrence.T(n) = T([Tex]\sqrt{n}[/Tex]) + [Tex]\Theta(Log Log n)[/Tex]What is the value of recurrence? (A) [Tex]\Theta( (Log Log n) ^ 2)[/Tex](B) [ ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 11

Last updated: 28 June 2021

Consider the following recurrenceT(n) = 3T(n/5) + lgn * lgnWhat is the value of T(n)? (A) [Tex]\Theta(n ^ \log_5{3})[/Tex](B) [Tex]\Theta(n ^ \log_3{5})[/Tex](c) [Tex]\The ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Similar Topics

20.6k+ articles

7.6k+ articles

1.4k+ articles

970+ articles

300+ articles

40+ articles

Algorithms-Analysis of Algorithms (Recurrences)

10+ articles

Algorithms | Analysis of Algorithms (Recurrences) | Question 9

Last updated: 28 June 2021

The time complexity of the following C function is (assume n 0 (GATE CS 2004) [sourcecode language="c"]int recursive (mt n){ if (n == 1) return (1); else retu ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 8

Last updated: 28 June 2021

What is the time complexity of the following recursive function:[tabby title="c"][sourcecode language="c"]int DoSomething (int n) { if (n <= 2) return 1; else re ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 7

Last updated: 10 July 2018

The running time of the following algorithm Procedure A(n) If n <= 2 return(1) else return A([Tex]\lceil \sqrt{n} \rceil[/Tex]);is best described by (A) O(n) (B) O(l ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 6

Last updated: 28 June 2021

The running time of an algorithm is represented by the following recurrence relation: if n = 3 then T(n) = n else T(n) = T(n/3) + cnWhich one of the following re ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 11

Last updated: 28 June 2021

Consider the following recurrence:Which one of the following is true?(A) T(n) = [Tex]\theta[/Tex](loglogn)(B) T(n) = [Tex]\theta[/Tex](logn)(C) T(n) = [Tex]\theta[/Tex](sq...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 4

Last updated: 28 June 2021

Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1Which one of the following is false. ( GATE CS 2005)a) T(n) = O(n^2)b) T(n) = [Tex]\theta[/Tex](nLogn)c) T(n) = [Tex]\O ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 3

Last updated: 28 June 2021

What is the worst case time complexity of following implementation of subset sum problem.[sourcecode language="C"]// Returns true if there is a subset of set[] with sun eq ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 2

Last updated: 28 June 2021

What is the value of following recurrence. T(n) = 5T(n/5) + [Tex]\sqrt{n}[/Tex],T(1) = 1,T(0) = 0(A) Theta (n)(B) Theta (n^2)(C) Theta (sqrt(n))(D) Theta (nLogn) Answer: ( ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

Algorithms | Analysis of Algorithms (Recurrences) | Question 1

Last updated: 21 May 2019

What is the value of following recurrence.T(n) = T(n/4) + T(n/2) + cn2T(1) = cT(0) = 0Where c is a positive constant(A)O(n3)(B)O(n2)(C)O(n2 Logn)(D)O(nLogn) Answer: (B)Ex ...read more

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)