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
Most answered questions in Others
1
votes
3
answers
41
What can be the strategy to reduce negative marks in GATE?
Soumyashree
3.4k
views
Soumyashree
asked
Jan 13, 2016
5
votes
3
answers
42
BUGS in the Virtual Calculator for GATE 2016
There are may be BUGS in the GATE Calculator if you spot any please help other to get aware of them too. Check out the Virtual Calculator here : Your browser does not support iframes.
There are may be BUGS in the GATE Calculator if you spot any please help other to get aware of them too.Check out the Virtual Calculator here : Your browser does not supp...
amarVashishth
1.7k
views
amarVashishth
asked
Nov 7, 2015
Others
calculator
+
–
14
votes
3
answers
43
How to find logarithmic values in GATE Exam?
Hello y'all. How can I find log values in Gate exam? Do they provide any calculator or log tables? Also, is there any manual way to find log values. Example What will be the values of log2(6729) ? how would one solve this in gate exam. Thanks!
Hello y'all. How can I find log values in Gate exam? Do they provide any calculator or log tables?Also, is there any manual way to find log values.Example What will be th...
iarnav
2.1k
views
iarnav
asked
Oct 22, 2015
0
votes
2
answers
44
GATE DS&AI 2024 | Question: 9
Euclidean distance based $k$-means clustering algorithm was run on a dataset of $100$ points with $k=3$. If the points $\left[\begin{array}{l}1 \\ 1\end{array}\right]$ and $\left[\begin{array}{c}-1 \\ 1\end{array}\right]$ ... $\left[\begin{array}{l}2 \\ 0\end{array}\right]$ $\left[\begin{array}{l}0 \\ 1\end{array}\right]$
Euclidean distance based $k$-means clustering algorithm was run on a dataset of $100$ points with $k=3$. If the points $\left[\begin{array}{l}1 \\ 1\end...
Arjun
736
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
45
GATE DS&AI 2024 | Question: 14
Consider five random variables $U, V, W, X$, and $Y$ whose joint distribution satisfies: \[ P(U, V, W, X, Y)=P(U) P(V) P(W \mid U, V) P(X \mid W) P(Y \mid W) \] Which ONE of the following statements is FALSE? ... $U$ given $W$ $U$ and $V$ are conditionally independent given $W$ $Y$ and $X$ are conditionally independent given $W$
Consider five random variables $U, V, W, X$, and $Y$ whose joint distribution satisfies:\[P(U, V, W, X, Y)=P(U) P(V) P(W \mid U, V) P(X \mid W) P(Y \mid...
Arjun
811
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
46
GATE DS&AI 2024 | Question: 24
The sample average of $50$ data points is $40$. The updated sample average after including a new data point taking the value of $142$ is $\_\_\_\_\_\_\_\_$.
The sample average of $50$ data points is $40$. The updated sample average after including a new data point taking the value of $142$ is $\_\_\_\_\_\_\_\_$.
Arjun
692
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
numerical-answers
+
–
0
votes
2
answers
47
GATE DS&AI 2024 | Question: 29
Consider the function computes $(X)$ whose pseudocode is given below: computes $(X)$ $S[1] \leftarrow 1$ for $i \leftarrow 2$ to length $(X)$ $S[i] \leftarrow 1$ if $X[i-1] \leq X[i]$ $S[i] \leftarrow S[i]+S[i-1]$ end if end for return $S$ Which ONE of the following values is ... for $X=[6,3,5,4,10]$ ? $[1,1,2,3,4]$ $[1,1,2,3,3]$ $[1,1,2,1,2]$ $[1,1,2,1,5]$
Consider the function computes $(X)$ whose pseudocode is given below:computes $(X)$$S \leftarrow 1$for $i \leftarrow 2$ to length $(X)$$S[i] \leftarrow 1$...
Arjun
602
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
48
GATE DS&AI 2024 | Question: 32
Consider the table below, where the $(i, j)^{t h}$ element of the table is the distance between points $x_{i}$ and $x_{j}$. Single linkage clustering is performed on data points, $x_{1}, x_{2}, x_{3}, x_{4}, x_{5}$. \begin{array} ... & 3 & 5 & 1 & 0 \\ \hline \end{array} Which ONE of the following is the correct representation of the clusters produced?
Consider the table below, where the $(i, j)^{t h}$ element of the table is the distance between points $x_{i}$ and $x_{j}$. Single linkage clustering is performed on data...
Arjun
635
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
49
GATE DS&AI 2024 | Question: 40
Consider the function $f: \mathbb{R} \rightarrow \mathbb{R}$ where $\mathbb{R}$ is the set of all real numbers. \[ f(x)=\frac{x^{4}}{4}-\frac{2 x^{3}}{3}-\frac{3 x^{2}}{2}+1 \] Which of the following statements is/are TRUE? $x=0$ is a local maximum of $f$ $x=3$ is a local minimum of $f$ $x=-1$ is a local maximum of $f$ $x=0$ is a local minimum of $f$
Consider the function $f: \mathbb{R} \rightarrow \mathbb{R}$ where $\mathbb{R}$ is the set of all real numbers.\[f(x)=\frac{x^{4}}{4}-\frac{2 x^{3}}{3}-\fr...
Arjun
707
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
50
GATE DS&AI 2024 | Question: 42
Let $H, I, L$, and $N$ represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively in a rooted binary tree. Which of the following statements is/are always TRUE? $L \leq I+1$ $H+1 \leq N \leq 2^{H+1}-1$ $H \leq I \leq 2^{H}-1$ $H \leq L \leq 2^{H-1}$
Let $H, I, L$, and $N$ represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively in a rooted binary tree...
Arjun
822
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
+
–
0
votes
2
answers
51
GATE DS&AI 2024 | Question: 54
Given the following Bayesian Network consisting of four Bernoulli random variables and the associated conditional probability tables: \begin{array}{|c|c|} \hline & P(\cdot) \\ \hline U=0 & 0.5 \\ \hline U=1 & 0.5 \\ \hline \end{array} \begin{array}{|c|c|c|} \ ... The value of $P(U=1, V=1, W=1, Z=1)= \_\_\_\_\_\_\_$ (rounded off to three decimal places).
Given the following Bayesian Network consisting of four Bernoulli random variables and the associated conditional probability tables:\begin{array}{|c|c|}\hline & P(\cdot)...
Arjun
1.0k
views
Arjun
asked
Feb 16
Others
gate-ds-ai-2024
numerical-answers
+
–
0
votes
2
answers
52
UGC NET CSE | June 2008 | Part 2 | Question: 12
Consider the following declaration in $\mathrm{C}$ : char a[]; char * p; Which of the following statement is not a valid statement? $\mathrm{p}=\mathrm{a}$; $\mathrm{p}=\mathrm{a}+2$; $\mathrm{a}=\mathrm{p}$; $\mathrm{p}=\& \mathrm{a}[2]$
Consider the following declaration in $\mathrm{C}$ :char a[]; char * p;Which of the following statement is not a valid statement?$\mathrm{p}=\mathrm{a}$;$\mathrm{p}=\math...
admin
100
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
+
–
0
votes
2
answers
53
UGC NET CSE | June 2008 | Part 2 | Question: 13
Consider the following $\mathrm{C}$ code : {int a = 5, b=9; float r; r= b /a ;} What is the value of $\text{r}$ ? $1.8$ $1.0$ $2.0$ $0.0$
Consider the following $\mathrm{C}$ code :{int a = 5, b=9; float r; r= b /a ;}What is the value of $\text{r}$ ?$1.8$$1.0$$2.0$$0.0$
admin
119
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
+
–
0
votes
2
answers
54
UGC NET CSE | June 2008 | Part 2 | Question: 28
For a channel of $3 \mathrm{KHz}$ bandwidth and signal to noise ratio of $30 \mathrm{~dB}$, the maximum data rate is: $3000 \mathrm{bps}$ $6000 \mathrm{bps}$ $15000 \mathrm{bps}$ $30000 \mathrm{bps}$
For a channel of $3 \mathrm{KHz}$ bandwidth and signal to noise ratio of $30 \mathrm{~dB}$, the maximum data rate is:$3000 \mathrm{bps}$$6000 \mathrm{bps}$$15000 \mathrm{...
admin
184
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
+
–
1
votes
2
answers
55
GATE Data Science and Artificial Intelligence 2024 | Sample Paper | Question: 1
Let $\text{b}$ be the branching factor of a search tree. If the optimal goal is reached after $\text{d}$ actions from the initial state, in the worst case, how many times will the initial state be expanded for iterative deepening depth-first ... $\text{IDDFS}$ $\text{-b}^{d}, \mathrm{IDA}^{*}\text{-b}^{d}$.
Let $\text{b}$ be the branching factor of a search tree. If the optimal goal is reached after $\text{d}$ actions from the initial state, in the worst case, how many times...
admin
3.9k
views
admin
asked
Oct 21, 2023
Others
gateda-sample-paper-2024
depth-first-search
+
–
0
votes
2
answers
56
UGC NET CSE | June 2023 | Part 2: 8
In a multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average. The probability that no request is made in $45$ minutes is $\mathrm{e}^{-15}$ $\mathrm{e}^{-5}$ $1-\mathrm{e}^{-5}$ $1-\mathrm{e}^{-10}$
In a multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average. The probability that no request is made in $45$ minutes is$\...
admin
203
views
admin
asked
Jul 28, 2023
Others
ugcnetcse-june2023-paper2
+
–
0
votes
2
answers
57
UGC NET CSE | June 2023 | Part 2: 71
Given the basic $\text{E R}$ diagram and relational model, which of the the following is incorrect? An attribute of an entity can have more than one value An attribute of an entity can be composite In a row of relational table, an attribute can have more than one value In a row of a relational table, an attribute can have exactly one value or a NULL value
Given the basic $\text{E R}$ diagram and relational model, which of the the following is incorrect?An attribute of an entity can have more than one valueAn attribute of a...
admin
186
views
admin
asked
Jul 28, 2023
Others
ugcnetcse-june2023-paper2
+
–
0
votes
2
answers
58
UGC NET CSE | June 2023 | Part 2: 83
Let $R=\{x \mid x \in N, x$ is multiple of $3$ and $x \leq 100\}$ and $S=\{x, x \in N, x$ is a multiple of $5$ and $x<100\}$. What is the number of elements in $(R \cap S) \times(S \cap R) ?$ $36$ $33$ $20$ $6$
Let $R=\{x \mid x \in N, x$ is multiple of $3$ and $x \leq 100\}$ and $S=\{x, x \in N, x$ is a multiple of $5$ and $x<100\}$. What is the number of elements in $(R \cap S...
admin
177
views
admin
asked
Jul 28, 2023
Others
ugcnetcse-june2023-paper2
+
–
0
votes
2
answers
59
ISI 2019 | PCB CS | Question: 11
Consider an array of length $n$ consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear before all the positive integers, using $O(n)$ time and only constant amount of extra space.
Consider an array of length $n$ consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear bef...
admin
334
views
admin
asked
Aug 8, 2022
Others
isi2019-pcb-cs
descriptive
+
–
2
votes
2
answers
60
ISI 2019 | PCB CS | Question: 15
Consider a max-heap of $n$ distinct integers, $n \geq 4$, stored in an array $\mathcal{A}[1 \ldots n]$. The second minimum of $\mathcal{A}$ is the integer that is less than all integers in $\mathcal{A}$ except the minimum of $\mathcal{A}$. Find all possible array indices of $\mathcal{A}$ in which the second minimum can occur. Justify your answer.
Consider a max-heap of $n$ distinct integers, $n \geq 4$, stored in an array $\mathcal{A}[1 \ldots n]$. The second minimum of $\mathcal{A}$ is the integer that is less th...
admin
151
views
admin
asked
Aug 8, 2022
Others
isi2019-pcb-cs
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
136
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register