Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by vermavijay1986
8
answers
1
GATE IT 2006 | Question: 47
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the ... are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is fi...
11.2k
views
commented
Oct 17, 2022
Algorithms
gateit-2006
algorithms
graph-algorithms
normal
graph-search
depth-first-search
+
–
2
answers
2
GATE CSE 2022 | GA Question: 2
A function $y(x)$ is defined in the interval $[0, 1]$ on the $x - $ ... the curve for the interval $[0, 1]$ on the $x - $ axis? $\frac{5}{6}$ $\frac{6}{5}$ $\frac{13}{6}$ $\frac{6}{13}$
A function $y(x)$ is defined in the interval $[0, 1]$ on the $x – $ axis as$$y(x) = \left\{\begin{matrix} 2& \text{if} & 0 \leq x < \frac{1}{3} \\ 3& \text{if}& \frac{1...
6.2k
views
comment edited
Mar 8, 2022
Quantitative Aptitude
gatecse-2022
quantitative-aptitude
functions
area
1-mark
+
–
3
answers
3
GATE CSE 2022 | Question: 31
Consider three floating point numbers $\textit{A, B}$ and $\textit{C}$ stored in registers $\text{R}_{\text{A}}, \text{R}_{\text{B}}$ and $\text{R}_{\text{C}},$ respectively as per $\textsf{IEEE-754}$ single precision floating point format. The $\text{32-bit}$ content stored in ... $\textit{A + C} = 0$ $\textit{C = A + B}$ $\textit{B =3C}$ $\textit{(B - C)} > 0$
Consider three floating point numbers $\textit{A, B}$ and $\textit{C}$ stored in registers $\text{R}_{\text{A}}, \text{R}_{\text{B}}$ and $\text{R}_{\text{C}},$ respectiv...
8.6k
views
answered
Mar 5, 2022
Digital Logic
gatecse-2022
digital-logic
number-system
number-representation
2-marks
+
–
5
answers
4
GATE CSE 2022 | Question: 20
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
Consider a simple undirected graph of $10$ vertices. If the graph is disconnected, then the maximum number of edges it can have is _______________ .
8.9k
views
answered
Mar 5, 2022
Graph Theory
gatecse-2022
numerical-answers
graph-theory
graph-connectivity
1-mark
+
–
2
answers
5
GATE CSE 2022 | Question: 8
Let $\text{R1}$ and $\text{R2}$ be two $4 - \text{bit}$ registers that store numbers in $2\text{'s}$ complement form. For the operation $\text{R1 + R2},$ which one of the following values of $\text{R1}$ and $\text{R2}$ ... and $\text{R2 = 1010}$ $\text{R1 = 0011}$ and $\text{R2 = 0100}$ $\text{R1 = 1001}$ and $\text{R2 = 1111}$
Let $\text{R1}$ and $\text{R2}$ be two $4 – \text{bit}$ registers that store numbers in $2\text{’s}$ complement form. For the operation $\text{R1 + R2},$ which one of...
8.9k
views
answer edited
Feb 24, 2022
Digital Logic
gatecse-2022
digital-logic
number-system
number-representation
1-mark
+
–
4
answers
6
GATE IT 2006 | Question: 14
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ tuples and $r_{2}$ contains $2500$ tuples. The maximum size of the join $r_1⋈ r_2$ is : $2000$ $2500$ $4500$ $5000$
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ ...
17.5k
views
commented
Sep 5, 2021
Databases
gateit-2006
databases
joins
natural-join
normal
+
–
7
answers
7
GATE CSE 2006 | Question: 11
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanning tree of $G$ is: $n-1$ $2n-2$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$ $n^2$
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanni...
14.9k
views
commented
Jan 15, 2021
Algorithms
gatecse-2006
algorithms
spanning-tree
normal
+
–
10
answers
8
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...
22.9k
views
answered
Oct 15, 2020
Algorithms
gatecse-2000
algorithms
asymptotic-notation
normal
+
–
4
answers
9
GATE CSE 2020 | Question: 29
Consider three registers $R1$, $R2$, and $R3$ that store numbers in $\textsf{IEEE-754}$ single precision floating point format. Assume that $R1$ and $R2$ contain the values (in hexadecimal notation) $\textsf{0x42200000}$ ... what is the value stored in $R3$? $\textsf{0x40800000}$ $\textsf{0xC0800000}$ $\textsf{0x83400000}$ $\textsf{0xC8500000}$
Consider three registers $R1$, $R2$, and $R3$ that store numbers in $\textsf{IEEE-754}$ single precision floating point format. Assume that $R1$ and $R2$ contain the valu...
18.5k
views
commented
Feb 26, 2020
Digital Logic
gatecse-2020
floating-point-representation
digital-logic
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register