Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the case: f(n) = O(g(n)). Then, foll...

Join the Discussion on the App

Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.

Statement I: 2^f(n) = O(2^g(n))
Statement II: 2^g(n) = O(2^f(n))

a)
Both statements are true
b)
Both statements are false
c)
Statement I is true and Statement II is false
d)
Statement I is false and Statement II is true

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Practice Test: Computer Science Engineering (CSE) - 1

Attempt Test

Attempt this Test

Verified Answer

Consider the case: f(n) = O(g(n)). Then, following two statements are ...

if f(n) = n and g(n) = 2n. then f(n) = O(g(n)) here, 2^n = O(2^(2n)) = O(4^n), but not vice versa. Hence, I is true. II is false. -------------- Now, if f(n) = 2n and g(n) = n then also f(n) = O(g(n)) because we can ignore constant but, 2^(2n) != O(2^n), hence I is false, but II is true. In both of the above cases, f(n) = O(g(n)). But both the cases are counter of each other. Hence both I and II are wrong.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Given below are two statements:Statement I: Hardwired control unit can be optimized to produce fast mode of operation.Statement II: Indirect addressing mode needs two memory reference to fetch the operand.In the light of the above statements. choose the correct answer from the options given below

View answer

Consider the following statements about Bellman ford algorithm for finding shortest path in a directed connected graph G having integral edge weights.Statement I:It will always find out negative edge weight cycle in G reachable from source.Statement II:It will always give correct answer for the graph G.

View answer

Consider the following two statements with respect to the matrices.Am×n, Bn×m, Cn×n and Dn×n.Statement 1 : tr( AB) = tr(B

View answer

Direction: Two Statements I and II are given. These statements may be either independent causes or may be effects of independent causes or a common cause. One of these statements may be the effect of the other statements. Read both statements and decide which of the following answer choice correctly depicts the relationship between these two statements:Statement I. A large number of Primary Schools in the rural areas are run by only one teacher.Statement II. There has been a huge dropout from the primary schools in rural areas.

View answer

Consider the following two statements:Statement 1:Stop and Wait protocol is preferred for LANs compared to WANs.Statement 2:Stop and Wait protocol is good for bursty data transmission.Q. Which of the above two statements are true?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer?.

Solutions for Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case.Statement I:2f(n)= O(2g(n))Statement II:2g(n)= O(2f(n))a)Both statements are trueb)Both statements are falsec)Statement I is true and Statement II is falsed)Statement I is false and Statement II is trueCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam