Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Others
0
votes
0
answers
1261
IITB Practice Set: 28
Consider the following algorithm. What does the above algorithm compute?
Consider the following algorithm.What does the above algorithm compute?
admin
74
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1262
IITB Practice Set: 29
The input is an array $A$ of size $n\geq 5$. As output we require indices $i < j < k$ such that either $A[i] \leq A[ j] \leq A[k]\text{ or }A[i] \geq A[ j] \geq A[k]$. The worst case complexity of the best algorithm for this problem is $\theta$ ______ .
The input is an array $A$ of size $n\geq 5$. As output we require indices $i < j < k$ such that either $A[i] \leq A[ j] \leq A[k]\text{ or }A[i] \geq A[ j] \geq A[k]$. Th...
admin
93
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1263
IITB Practice Set: 30
How many ordered pairs of positive integers $(a,b)$ are there such that $\text{lcm}(a,b) = n \text{ and gcd}(a,b) = 1?$ Express your answer in terms of the prime factorization of $n$, given as $n = p_1^{d_1} \dots p_t^{d_t}.$
How many ordered pairs of positive integers $(a,b)$ are there such that $\text{lcm}(a,b) = n \text{ and gcd}(a,b) = 1?$Express your answer in terms of the prime factoriza...
admin
98
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1264
IITB Practice Set: 31
In the function below, $A[]$ is an array of integers, sorted in non-decreasing order (repeated elements possible). The function is expected to return the number of integers missing in the subarray $A[i..j]$, i.e., the number of integers larger than $A[i]$ and smaller than $A[j]$ ... much time does the call missing$(A,i,j)$ take? $O(\sqrt{n})$ $O(d\sqrt{n})$ $O(n)$ $O(dn)$
In the function below, $A[]$ is an array of integers, sorted in non-decreasing order (repeated elements possible). The function is expected to return the number of intege...
admin
146
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1265
IITB Practice Set: 32
In the function below, $A[]$ is an array of integers, sorted in non-decreasing order (repeated elements possible). The function is expected to return the number of integers missing in the subarray $A[i..j]$, i.e., the number of integers larger than $A[i]$ and smaller than $A[j]$ ... $O(\sqrt{n})$ $O(d\sqrt{n})$ $O(n)$ $O(dn)$
In the function below, $A[]$ is an array of integers, sorted in non-decreasing order (repeated elements possible). The function is expected to return the number of intege...
admin
99
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1266
IITB Practice Set: 33
Consider the following $C$ program, with a few blanks. #include <stdio.h> void foo(int *t, int *n) { *t = ________(&n); return; } int main() { int s, t; scanf("%d", &t); foo(&s, ______); printf("%d" ... return 0; } Fill in the blanks so that the program compiles correctly and prints the value of $t$ read via the $\textsf{scanf}$ statement.
Consider the following $C$ program, with a few blanks.#include <stdio.h void foo(int *t, int *n) { *t = ________(&n); return; } int main() { int s, t; scanf("%d", &t); fo...
admin
99
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1267
IITB Practice Set: 34
We wish to write a $C$ function that prints a square with N \# symbols on each side of the square. For example, if $N = 4$, the program should print the pattern shown at the right of the (incomplete) code shown below. Fill in the blank in the $C$ function by choosing the right option from the ... (min(i,j) > 0) || (max(i,j) == N-1) (min(i,j) > 0) || (max(i,j) < N-1)
We wish to write a $C$ function that prints a square with N \# symbols on each side of the square. For example, if $N = 4$, the program should print the pattern shown at ...
admin
86
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
1
answer
1268
IITB Practice Set: 35
Consider the $C++$ code fragment below. int A = ____________; bool x = (A/100 >= 8) && !(A%10 > 4) && (A%5 == 1); (a) ______ is the $\textbf{maximum three digit (in decimal notation)}$ value of $A$ such that $x$ evaluates to true.
Consider the $C++$ code fragment below.int A = ____________; bool x = (A/100 >= 8) && !(A%10 4) && (A%5 == 1);(a) ______ is the $\textbf{maximum three digit (in decimal ...
admin
209
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1269
IITB Practice Set: 36
______ is the integer value printed by the following $C++$ program. #include <iostream> // for std::cout #include <algorithm> // for std::max using namespace std; int f(int *p, int n) { if (n <= 1) return 0; else return max(f(p+1,n-1),p[1]-p[0]); } int main() { int a[] = {3,5,12,6,8}; cout << f(a,5); return 0; }
______ is the integer value printed by the following $C++$ program.#include <iostream // for std::cout #include <algorithm // for std::max using namespace std; int f(int ...
admin
136
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1270
IITB Practice Set: 37
______ is the $\textbf{minimum three digit (in decimal notation)}$ value of $K$ for which the following loop (part of a $C++$ program) iterates at least $1000$ times. unsigned int K=________; for(int x=10,y=K; x!=y; x++,y--) cout << "#";
______ is the $\textbf{minimum three digit (in decimal notation)}$ value of $K$ for which the followingloop (part of a $C++$ program) iterates at least $1000$ times.unsig...
admin
85
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1271
IITB Practice Set: 38
For purposes of this question, assume that signed integers are represented using $32$ bits in $2's$ complement notation. Assume further that the following $C$ program is compiled and run on a $32$-bit machine running a $32$-bit operating system. #include < ... %x",a>>3); return 0; } The output printed by the program (in hexadecimal notation) is $0\text{x}$ ______
For purposes of this question, assume that signed integers are represented using $32$ bits in $2’s$ complement notation. Assume further that the following $C$ program i...
admin
95
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1272
IITB Practice Set: 39
Which of the following statement(s) is/are $\textbf{TRUE}$? In the classic $5$-stage instruction pipeline, the earliest stage in which a branch predictor can be employed is the decode stage. In the classic $5$-stage instruction pipeline, an exception ... a control hazard. $\textbf{LOAD}$ forwarding (bypassing) does not eliminate all read-after-write $\textbf{(RAW)}$ hazards.
Which of the following statement(s) is/are $\textbf{TRUE}$?In the classic $5$-stage instruction pipeline, the earliest stage in which a branch predictor can be employedis...
admin
65
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
0
answers
1273
IITB Practice Set: 40
Which of the following statement(s) is/are $\textbf{TRUE}$? For a given cache size, capacity misses with the Least Recently Used $\textbf{(LRU)}$ replacement policy are lower than the perfect Beladys replacement policy. In a multi-level cache ... that a three-level cache hierarchy can perform worse than a two-level cache hierarchy in terms of average memory access time.
Which of the following statement(s) is/are $\textbf{TRUE}$?For a given cache size, capacity misses with the Least Recently Used $\textbf{(LRU)}$ replacement policy arelow...
admin
130
views
admin
asked
Nov 30, 2021
Others
iitb-practice-set
+
–
0
votes
1
answer
1274
TIFR2021-Maths-A: 1
For each positive integer $n$, let $s_n=\frac{1}{\sqrt{4n^2-1^2}}+\frac{1}{\sqrt{4n^2-2^2}}+\dots+\frac{1}{\sqrt{4n^2-n^2}}$ Then the $\displaystyle \lim_{n\rightarrow \infty}s_n$ equals $\pi/2$ $\pi/6$ $1/2$ $\infty$
For each positive integer $n$, let$$s_n=\frac{1}{\sqrt{4n^2-1^2}}+\frac{1}{\sqrt{4n^2-2^2}}+\dots+\frac{1}{\sqrt{4n^2-n^2}}$$Then the $\displaystyle \lim_{n\rightarrow \i...
soujanyareddy13
532
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
0
votes
0
answers
1275
TIFR2021-Maths-A: 2
The number of bijective maps $g:\mathbb{N}\rightarrow\mathbb{N}$ such that $\sum_{n=1}^\infty\frac{g(n)}{n^2}<\infty$ is $0$ $1$ $2$ $\infty$
The number of bijective maps $g:\mathbb{N}\rightarrow\mathbb{N}$ such that$$\sum_{n=1}^\infty\frac{g(n)}{n^2}<\infty$$is$0$$1$$2$$\infty$
soujanyareddy13
257
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
2
votes
1
answer
1276
TIFR2021-Maths-A: 3
The value of $\displaystyle\lim_{n\rightarrow\infty}\prod_{k=2}^{n}\left(1-\frac{1}{k^2}\right)$ is $1/2$ $1$ $1/4$ $0$
The value of $$\displaystyle\lim_{n\rightarrow\infty}\prod_{k=2}^{n}\left(1-\frac{1}{k^2}\right)$$is$1/2$$1$$1/4$$0$
soujanyareddy13
302
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
0
votes
0
answers
1277
TIFR2021-Maths-A: 4
The set $S=\{x\in \mathbb{R}|x>0\text{ and } (1+x^2) \tan(2x)=x\}$ is empty nonempty but finite countably infinite uncountable
The set $$S=\{x\in \mathbb{R}|x>0\text{ and } (1+x^2) \tan(2x)=x\}$$isemptynonempty but finitecountably infiniteuncountable
soujanyareddy13
185
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
0
votes
0
answers
1278
TIFR2021-Maths-A: 5
The dimension of the real vector space $V=\{f:(-1,1)\rightarrow\mathbb{R}|f$ is infinitely differentiable on $(-1,1)$ and $f^{(n)}(0)=0$ for all $n\geq 0\}$ is $0$ $1$ greater than one, but finite infinite
The dimension of the real vector space$V=\{f:(-1,1)\rightarrow\mathbb{R}|f$ is infinitely differentiable on $(-1,1)$ and $f^{(n)}(0)=0$ for all $n\geq 0\}$is$0$$1$greater...
soujanyareddy13
234
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
0
votes
0
answers
1279
TIFR2021-Maths-A: 6
For a positive integer $n$, let $a_n$ denote the unique positive real root of $x^n+x^{n-1}+\dots+x-1=0.$ Then the sequence $\{a_n\}^{\infty}_{n=1}$ is unbounded $\displaystyle \lim_{n\rightarrow \infty} a_n=0$ $\displaystyle \lim_{n\rightarrow \infty} a_n=1/2$ $\displaystyle \lim_{n\rightarrow \infty} a_n$ does not exist
For a positive integer $n$, let $a_n$ denote the unique positive real root of $x^n+x^{n-1}+\dots+x-1=0.$ Thenthe sequence $\{a_n\}^{\infty}_{n=1}$ is unbounded$\displayst...
soujanyareddy13
189
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
0
votes
0
answers
1280
TIFR2021-Maths-A: 7
Let $A$ be the set of all real numbers $\lambda \in [0,1]$ such that $\displaystyle\lim_{p\rightarrow 0}\frac{\log(\lambda2^p+(1-\lambda)3^p)}{p}=\lambda \log2+(1-\lambda)\log3$ Then $A=\{0,1\}$ $A=\{0,\frac{1}{2},1\}$ $A=\{0,\frac{1}{3},\frac{1}{2},\frac{2}{3},1\}$ $A=[0,1]$
Let $A$ be the set of all real numbers $\lambda \in [0,1]$ such that$$\displaystyle\lim_{p\rightarrow 0}\frac{\log(\lambda2^p+(1-\lambda)3^p)}{p}=\lambda \log2+(1-\lambda...
soujanyareddy13
128
views
soujanyareddy13
asked
Sep 27, 2021
Others
tifrmaths2021
+
–
Page:
« prev
1
...
59
60
61
62
63
64
65
66
67
68
69
...
137
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register