@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

Testbook Question

Shivangi Verma asked in Algorithms Dec 23, 2016 retagged Jul 13, 2022 by makhdoom ghaya

258 views

0 votes

0 votes

algorithms
asymptotic-notation
testbook-test-series

Shivangi Verma asked in Algorithms Dec 23, 2016 retagged Jul 13, 2022 by makhdoom ghaya

by Shivangi Verma

258 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 vote

1 vote

Best answer

The complexity of T(n) by master's theorem shall be:

T(n)=θ(n^log₂7)=θ(n^2.807)

Complexity of T^'(n)=θ(n^log₄a)

Therefore, T(n)=T^'(n) means:

log₄a=2.807

a=4^2.807

a=48.975

pranjalgennext answered Dec 23, 2016 selected Dec 23, 2016 by Shivangi Verma

by pranjalgennext

1 comment

by Shivangi Verma

commented Dec 23, 2016

correct

0

0

Please log in or register to add a comment.

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

1 answer

1

Abhishek Kumar 38 asked in Algorithms Dec 15, 2018

344 views

Testbook Test Series: Algorithms - Asymptotic Analysis
a , c , d all three are right answer please explain if i am wrong.

Abhishek Kumar 38 asked in Algorithms Dec 15, 2018

by Abhishek Kumar 38

344 views

testbook-test-series
algorithms
asymptotic-notation

3 votes

3 votes

1 answer

2

mcjoshi asked in Algorithms Aug 30, 2016

1,594 views

TestBook : Which of the following sets is empty ?
Which of the following set is empty? $o (g(n)) \cap \omega (g(n))$ $O (g(n)) \cap \Omega (g(n))$ $o (g(n)) \cap O( g(n))$ $\omega (g(n)) \cap \Omega (g(n))$

mcjoshi asked in Algorithms Aug 30, 2016

1.6k views

algorithms
asymptotic-notation
easy
testbook-test-series

0 votes

0 votes

1 answer

3

Shubham Aggarwal asked in Algorithms Nov 13, 2018

1,229 views

test series - Testbook
Which of the following functions given by their recurrences grows the fastest asymptotically? $T(n) = 8T(n/4) + 100n^2$ $T(n) = 81T(n/9) + 10n^2$ $T(n) = 16T(n/4)+ 100(n \log n)^{1.99}$ $T(n) = 100T(n/100)+ n \log^2 n$

Shubham Aggarwal asked in Algorithms Nov 13, 2018

by Shubham Aggarwal

1.2k views

asymptotic-notation
recurrence-relation
testbook-test-series

0 votes

0 votes

0 answers

4

Sahil_Lather asked in Algorithms Jan 28, 2023

426 views

TestBook TestSeries Optimal Binary Search Tree Question
Construct OBST with the identifier set (a1, a2, a3) =(end , goto, print) with p(1..3) = (0.05, 0.2, 0.1) and q(0..3) = (0.2, 0.1,0.2, 0.05) What is the cost of a OBST ? What are the nodes present in the 2nd level of OBST if the root is present in level one ? 2.55 , print , goto 2.45 , goto , end 2.15, end, print 2.7, end, goto

Sahil_Lather asked in Algorithms Jan 28, 2023

by Sahil_Lather

426 views

algorithms
binary-search-tree
testbook-test-series

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax

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

Recent Posts

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!