Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 = i n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct 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 following C-function:Suppose we ...

Join the Discussion on the App

Consider the following C-function:

Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:

a)
O(1)
b)
O(n)
c)
O(n!)
d)
O(nⁿ)

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

FREE This question is part of

Test: Asymptotic Worst Case Time & Space Complexity- 3

Attempt Test

Attempt this Test

Verified Answer

Consider the following C-function:Suppose we modify the above function...

Space complexity now is also O(n). We would need an array of size O(n). The space required for recursive calls would be O(1) as the values would be taken from stored array rather than making function calls again and again.

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 C-function:double foo (int n){ int i; double sum; if (n = = 0) return 1.0; else { sum = 0.0; for (i = 0; i < n; i++) sum += foo (i); return sum; }}Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be

View answer

double foo(int n){int i;double sum;if(n == 0){return 1.0;}else{sum = 0.0;for(i = 0; i < n; i++){sum += foo(i);}return sum;}}Suppose we modify the above function foo() and stores the value of foo(i) 0 <= i < n, as and when they are computed. With this modification the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be

View answer

Let A[1, ..., n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is θ(m). Consider the following program fragment written in a C like language:counter = 0;for (i = 1; i < = n; i++){ if (A[i] == 1) counter++; else { f(counter); counter = 0; }}The complexity of this program fragment is

View answer

Let A[1, n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is (m). Consider the following program fragment written in a C like language:counter = 0;for (i=1; i=n; i++){ if a[i] == 1) counter++;else {f (counter);counter = 0;}}The complexity of this program fragment is

View answer

Consider following three function written in C style :Q.Which of the following is true :i) Time Complexity of fun1() is (n3)ii) Time Complexity of fun3() is (n3)iii) Time Complexity of fun2() is (1)iv) Time Complexity of fun1() is O(log n)v) Time Complexity of fun3() is (n2)

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 C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct 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 following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct 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 following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer?.

Solutions for Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct 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 following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the following C-function:Suppose we modify the above function foo() and store the values of foo (i), 0 < = i < n, as and when they are computed. With this modification, the time complexity for function foo() is significantly reduced. The space complexity of the modified function would be:a)O(1)b)O(n)c)O(n!)d)O(nn)Correct 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