Ace Practice booklet
closed

Ankush Tiwari asked Jul 27, 2016 • closed Aug 15, 2017 by Tesla!

665 views

1 votes

closed with the note: Violation of community guidelines https://gateoverflow.in/blog/2113

T(n)=sqrt(2T(n/2))+logn

Algorithms
ace-booklet
time-complexity
recurrence-relation

+ –

Ankush Tiwari asked Jul 27, 2016 • closed Aug 15, 2017 by Tesla!

Ankush Tiwari

665 views

See all

4 4 Comments

rude

commented Jul 27, 2016

do not worry this will never be asked in gate. this is shit.

5 votes

One

commented Sep 9, 2016

right rude haha :)

0 votes

Shubhanshu

commented Aug 15, 2017

Do you mean to say:-

$T(n) = \sqrt2T(\sqrt\frac{n}{2}) + logn$

0 votes

sumit goyal 1

commented Aug 15, 2017

:P lol

0 votes

Please log in or register to add a comment.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

2 answers

APOORV PANSE asked Jun 1, 2016

3,016 views

Analysis of code fragment to find time complexity [ACE Gate Practice Booklet Volume 1 Page 127 Question 32]

Consider the following c fragment : void DAA(n) { int i,j,k,x=0; for (i=1 ; i <=n ; i++) for (j=1 ; j <= i * i ; j++) { if ( j mod i == 0 ) for ( k = 1 ; k <= j ; k++) x=...

APOORV PANSE

3.0k views

APOORV PANSE asked Jun 1, 2016

Algorithms
asymptotic-notation
time-complexity
algorithms
ace-booklet

+ –

0 votes

2 answers

APOORV PANSE asked Jun 2, 2016

2,041 views

Find the Space complexity of following Code [Ace Gate Practice Booklet Vol-1 Page 127]
Find the time and Space complexity of code below : void fun(n) { if (n==1) then call A(); else { fun(n/2); fun(n/2); call B(n); } } Please note that B(n) takes O(n) time and A(n) takes O(1) time respectively. ... above code would be : $T(n) = 2T(n/2)+O(n)$ which is $O(nlog(n))$ But What will be space complexity ?

Find the time and Space complexity of code below : void fun(n) { if (n==1) then call A(); else { fun(n/2); fun(n/2); call B(n); } } Please note that B(n) takes O(n) time ...

APOORV PANSE

2.0k views

APOORV PANSE asked Jun 2, 2016

Algorithms
space-complexity
algorithms
ace-booklet

+ –

0 votes

2 answers

Shivam_j asked Oct 16, 2022

705 views

Ace Gate practice booklet Volume 1
Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme

Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme

Shivam_j

705 views

Shivam_j asked Oct 16, 2022

Computer Networks
ace-booklet
computer-networks
subnetting
easy

+ –

4 votes

3 answers

`JEET asked May 26, 2019

1,146 views

ACE ACADEMY BOOKLET QUESTION
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping subsets $S$ and $T$. Which of the following is true? There are at least two edges that ... $S$ and one end point in $T$ There are exactly one edge that have one end point in $S$ and one end point in $T$

Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping su...

`JEET

1.1k views

`JEET asked May 26, 2019

Graph Theory
graph-theory
ace-booklet

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

4 4 Comments reply

Please log in or register to add a comment.

0 Answers

Related questions

4 4 Comments