filmov
tv
GATE CS 2013,Q31: Consider the following function:int unknown(int n){ int i, j, k=0; for (i=n/2; i
Показать описание
GATE CS 2013,Q31: Consider the following function:
int unknown(int n){
int i, j, k=0;
for (i=n/2; i≤n; i++)
for (j=2; j ≤ n; j=j*2)
k = k + n/2;
return (k);
}
The return value of the function is
(A) Θ(n^2) (B) Θ(n^2log n) (C) Θ(n^3) (D) Θ(n^3logn)
Ans : (B) Θ(n2log n)
----------------------------------------------------
----------------------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------------
-------------------------------------------------------------------
-----------------------------------------------------------------------
#Algorithm#GATE_CSE#GATECS2013#GATECSEPYQ
int unknown(int n){
int i, j, k=0;
for (i=n/2; i≤n; i++)
for (j=2; j ≤ n; j=j*2)
k = k + n/2;
return (k);
}
The return value of the function is
(A) Θ(n^2) (B) Θ(n^2log n) (C) Θ(n^3) (D) Θ(n^3logn)
Ans : (B) Θ(n2log n)
----------------------------------------------------
----------------------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------
----------------------------------------------------------------------
-------------------------------------------------------------------
-----------------------------------------------------------------------
#Algorithm#GATE_CSE#GATECS2013#GATECSEPYQ
0:05:49
GATE CS 2013,Q31: Consider the following function:int unknown(int n){ int i, j, k=0; for (i=n/2; i
0:03:21
GATE CSE 2013
0:02:12
GATE CSE 2013 Q ||Algorithms || GATE Insights Version: CSE
0:03:07
GATE CSE 2013
0:05:23
Algorithm GATE-2013 Problem Solution
0:04:55
GATE CSE 2013
0:12:31
GATE CSE PYQ Consider the following function: int unknown(int n) { int i, j, k = 0;
0:00:16
Gate Algorithm question in Computer science | Consider the following two functions #shorts
0:02:05
GATE CS 2014 Set 3 | Q40 : Consider a hash table with 100 slots. Collisions are resolved using chain...
0:02:52
GATE CS 2016 Set 1 | Q 14:Let G be a weighted connected undirected graph with distinct positive edge...
0:03:49
GATE 2013 | ALGORITHMS | HEAP SORT | TIME | SOLUTIONS ADDA | GATE TEST SERIES | EXPLAINED BY VIVEK
0:01:28
GATE CSE 2009 Q ||Algorithms || GATE Insights Version: CSE
0:12:46
GATE CSE 2013 || COMPUTER ORGANIZATION || GATE Insights Version: CSE
0:05:35
GATE CSE 2019 Q ||Algorithms || GATE Insights Version: CSE
0:03:08
GATE CSE 1996 Q ||Algorithms || GATE Insights Version: CSE
0:02:16
GATE CSE 1991
0:06:28
GATE 2021 CS SET2 Q31.The relation scheme given below is used to store information [DBMS] [SOLVED!]
0:05:37
GATE - 2006 | OS | Q-31 | Consider three processes with compute time bursts times | GATE2IIT
0:04:24
GATE CS 2013 | Q27 : What is the logical translation of the following statement?“None of my friends...
0:06:15
GATE CSE 2010 Q ||Algorithms || GATE Insights Version: CSE
0:03:43
GATE CSE 2016 SET 1
0:04:00
GATE CS 2013 | Q1:A binary operation ⊕ on a set of integers is defined as x⊕y=x^2+y^2. Which one of...
0:02:51
GATE CSE 1995
0:03:19
GATE CSE 2007 Q || C PROGRAMMING ||Data Structure || GATE Insights Version: CSE
Комментарии