@

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

GO Classes 2023 | IIITH Mock Test 1 | Question: 9

GO Classes asked in Algorithms Mar 26, 2023 edited Mar 26, 2023 by Lakshman Bhaiya

486 views

2 votes

2 votes

Let $T(n)=4 T(n / 3)+n^{\log _{3} 4}.$ What will be asymptotic bound on $T(n)?$

$T(n)=\Theta\left(n^{\log _{3} 4} \log n\right)$
$T(n)=\Theta(n \log n)$
$T(n)=\Theta\left(4^{\log _{3} n} \log \log n\right)$
None of these

goclasses2023-iiith-mock-1
goclasses
algorithms
asymptotic-notation
1-mark

GO Classes asked in Algorithms Mar 26, 2023 edited Mar 26, 2023 by Lakshman Bhaiya

486 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

3 votes

3 votes

$T(n)=\Theta\left(n^{\log _{3} 4} \lg n\right)$ by Case $2$ of the Master Method.

GO Classes answered Apr 8, 2023

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

7 votes

7 votes

1 answer

1

GO Classes asked in Algorithms Mar 26, 2023

970 views

GO Classes 2023 | IIITH Mock Test 1 | Question: 12
A list of $n$ arrays, each of length $n$, is passed to an algorithm like merge-sort. The algorithm recursively divides a set of arrays into two parts until there are only two arrays. If there are two arrays, then, as a base case, the algorithm combines or merges both in cost of ... $T(n)=2 T(n / 2)+n$ $T(n)=2 T(n / 2)+n^ 3$ None of these

GO Classes asked in Algorithms Mar 26, 2023

970 views

goclasses2023-iiith-mock-1
goclasses
algorithms
recurrence-relation
asymptotic-notation
time-complexity
merge-sort
1-mark

3 votes

3 votes

0 answers

2

GO Classes asked in Algorithms Mar 26, 2023

561 views

GO Classes 2023 | IIITH Mock Test 1 | Question: 13
Arrange the following functions in their increasing order of growth. In options $\log ^{2} n$ means $(\log n)^{2}$ $\log (n !), \log ^{2} n, (\lg n) !, e^{n}$ $\log (n !), \log ^{2} n, e^{n}, (\lg n) !$ $\log ^{2} n, \log (n !), (\lg n) !, e^{n}$ $\log ^{2} n, (\lg n) !, \log (n !), e^{n}$

GO Classes asked in Algorithms Mar 26, 2023

561 views

goclasses2023-iiith-mock-1
goclasses
algorithms
asymptotic-notation
time-complexity
1-mark

2 votes

2 votes

1 answer

3

GO Classes asked in Algorithms Mar 26, 2023

714 views

GO Classes 2023 | IIITH Mock Test 1 | Question: 45
Assume you have two positive functions $f$ and $g$ such that $f(n)$ is in $O(g(n))$. For each of the following statements, decide which one(s) is/are always TRUE. $2^{f(n)}$ is $O\left(2^{g(n)}\right)$ $f(n)^{2}$ is $O\left(g(n)^{2}\right)$ $f(n)=O\left((f(n))^{2}\right)$ $g(n)=\Omega(g(n))$

GO Classes asked in Algorithms Mar 26, 2023

714 views

goclasses2023-iiith-mock-1
goclasses
algorithms
asymptotic-notation
time-complexity
multiple-selects
1-mark

5 votes

5 votes

1 answer

4

GO Classes asked in Algorithms Mar 26, 2023

735 views

GO Classes 2023 | IIITH Mock Test 1 | Question: 50
For which of the following functions $f(n)$ and $g(n),$ it holds $:f(n)=O(g(n)).$ Every $\log$ below is base $2.$ $f(n)=2^{k \log n}\;, \quad g(n)=n^k$ $f(n)=2^n\;, \quad g(n)=2^{2 n}$ ... $f(n)=2^{\sqrt{\log n}}\;, \quad g(n)= (\log n)^{100}$

GO Classes asked in Algorithms Mar 26, 2023

735 views

goclasses2023-iiith-mock-1
goclasses
algorithms
logarithmic-function
asymptotic-notation
multiple-selects
1-mark

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!