Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. 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 following two functions:Which of...

Join the Discussion on the App

Consider the following two functions:

Which of the following is/are true?
1. f(n) is O(n³)
2. g(n) is O (n³)
3. 0(f(n)) is same as O(g(n))
4. g(n) is O{n²)

a)
3 and 4
b)
1,2 and 3
c)
1,2 and 4
d)
None of these

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

FREE This question is part of

Test: Algorithm Analysis & Asymptotic Notation- 1

Attempt Test

Attempt this Test

Verified Answer

Consider the following two functions:Which of the following is/are tru...

In this question total possibility is four but only two possibility will give solution and other two possibilities will not give solutions.
g(n) = O (f(n))
In case of 0 ≤ n < 100 & & 0 ≤n< 10,000
(it is also not possible)

in case of otherwise From the above two equations the conclusion is O(f (n)) is same as O(g(m)) and g(n) and f(n) will be O(n²).

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

Consider the following elements:5, 12, 3, 15, 4, 6, 10These elements are inserted into the max heap tree using two different methods. In method 1, elements are inserted one by one into heap and heap property is maintained at every step. In method 2, first, these elements are stored into an almost complete binary tree and then the max-heapify function is executed on it. Now find the number of elements that have different index positions into two heaps generated from given two methods _________. Correct answer is '2'. Can you explain this answer?

View answer

Consider the following functions:Which of the following is true?

View answer

In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements are executed. Consider the following for loops

View answer

Consider the following :int numreader = 0;mutex = semaphore (1);room empty (1);The above code is a proposed solution of the Readers/Writer problem.Consider which of the following statements is/are true?1. The code allow several writers to execute in the writers critical area at the same time2. The code allow several readers to execute in the readers critical area at the same time.

View answer

Consider the set of all functions f: {0,1, … ,2014} → {0,1, … ,2014} such that f(f(i)) = i, for all 0 ≤ i ≤ 2014. Consider the following statements:P. For each such function it must be the case that for every i, f(i) = i.Q. For each such function it must be the case that for some i, f(i) = i.R. Each such function must be onto.Q.Which one of the following is CORRECT?

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 following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. 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 following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. 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 following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer?.

Solutions for Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. 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 following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the following two functions:Which of the following is/are true?1. f(n) is O(n3)2. g(n) is O (n3)3. 0(f(n)) is same as O(g(n))4. g(n) is O{n2)a)3 and 4b)1,2 and 3c)1,2 and 4d)None of theseCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam