menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Sep 2019
Satbir
567 Points
Bikram
566 Points
GAITONDE
348 Points
Vimal Patel
87 Points
Shaik Masthan
38 Points
BLACK_CLOUD
14 Points
sekhar_1621
13 Points
OgbeborBeatrice
13 Points
RAMYA.F
9 Points
vkw1111
9 Points
Made easy test series.
0
votes
9
views
Let $g(n) = \Omega(n)$, $f(n) = O(n)$ and $h(n) = \theta(n)$ then what is the time complexity of $[g(n) f(n) + h(n)]$
How to solve such questions?
algorithms
time-complexity
asked
Sep 11
in
Algorithms
`JEET
144
points
9
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
I think that we can only say that time complexity is $\Omega (n)$ as we can not find upper bound from information given can figure out just lower bound.
answered
Sep 11
Vimal Patel
199
points
ask related question
comment
Please
log in
or
register
to add a comment.
...