Login
Register
@
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
design and analysis of algorithms.
AIkiran01
asked
in
Algorithms
Jul 14, 2018
1,918
views
1
vote
1
vote
which of the following estimates are true? Explain with valid reasons.
a) (2n)! is theta (n)!
b) log((2n)!) is theta (log(n)!)
asymptotic-notation
algorithms
AIkiran01
asked
in
Algorithms
Jul 14, 2018
by
AIkiran01
1.9k
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
4
votes
4
votes
a) false
b) true
abhishekmehta4u
answered
Jul 14, 2018
by
abhishekmehta4u
comment
Follow
share this
4 Comments
Show 7 previous comments
by
Mayankprakash
commented
Jul 15, 2018
reply
Follow
share this
@shubham
To the previous reply of Abhishek can I tell f(n) = omega(g(n)) as g(n) is lower bound or smaller to f(n)?
Thanks
0
0
by
Shubham Shukla 6
commented
Jul 15, 2018
reply
Follow
share this
@mayanprakash yes that you can say..!
1
1
by
harishrajora
commented
Jul 17, 2018
reply
Follow
share this
Can anyone specify any particular source or pdf or anything by which it is mentioned how to solve these type of questions?
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
Rishav Kumar Singh
asked
in
Algorithms
Jul 26, 2018
419
views
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
Analyze the runtime of the following piece of code. Give a bound using Θ notation. function Pesky(n) r ←0; for i ←1 to n do for j ←1 to i do for k ← j to i+j do r ←r + 1; return r;
Rishav Kumar Singh
asked
in
Algorithms
Jul 26, 2018
by
Rishav Kumar Singh
419
views
asymptotic-notation
algorithms
1
vote
1
vote
2
answers
2
nbhatt
asked
in
Algorithms
Nov 3, 2022
386
views
Analysis of algorithms
Is ln(n!)=theta(n ln(n))?
nbhatt
asked
in
Algorithms
Nov 3, 2022
by
nbhatt
386
views
algorithms
asymptotic-notation
0
votes
0
votes
1
answer
3
nbhatt
asked
in
Algorithms
Nov 3, 2022
289
views
Analysis of algorithms
If big oh is possible for an algorithm but big Omega is not,then is it small o?
nbhatt
asked
in
Algorithms
Nov 3, 2022
by
nbhatt
289
views
algorithms
asymptotic-notation
1
vote
1
vote
1
answer
4
Rishav Kumar Singh
asked
in
Algorithms
Jul 25, 2018
6,242
views
GeeksForGeeks analysis-of-algorithms-question-19-2
Consider the following two functions. What are time complexities of the functions? int fun1(int n) { if (n <= 1) return n; return 2*fun1(n-1); } int fun2(int n) { if (n <= 1) return n; return fun2(n-1) + fun2(n-1); } (A) O(2^n) for both fun1 ... O(2^n) for fun2() (C) O(2^n) for fun1() and O(n) for fun2() (D) O(n) for both fun1() and fun2()
Rishav Kumar Singh
asked
in
Algorithms
Jul 25, 2018
by
Rishav Kumar Singh
6.2k
views
asymptotic-notation
algorithms
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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy