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
Answers by sonapraneeth_a
5
votes
1
GATE CSE 2011 | Question: 55
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. The length of the path from $v_5$ to $v_6$ in the MST of previous question with $n=10$ is $11$ $25$ $31$ $41$
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...
11.7k
views
answered
Apr 28, 2016
Algorithms
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
+
–
0
votes
2
Algorithms
Given n linearly ordered distinct elements. What is the worst case running time to find ith smallest element (1<=i<=n) from those n elements? a) O(log n) b) O(n) c) O(n log n) d) O(n2)
Given n linearly ordered distinct elements. What is the worst case running time to find ith smallest element (1<=i<=n) from those n elements? a) O(log n)b) O(n)c) O(n lo...
1.2k
views
answered
Mar 9, 2016
Algorithms
algorithms
time-complexity
+
–
19
votes
3
GATE CSE 2008 | Question: 60
What is printed by the following C program? int f(int x, int *py, int **ppz) { int y, z; **ppz += 1; z = **ppz; // corrected z = *ppz; to z = **ppz; *py += 2; y = *py; x += 3; return x+y+z; } void main() { int c, *b, **a; c = 4; b = &c; a = &b; printf("%d", f(c, b, a)); } $18$ $19$ $21$ $22$
What is printed by the following C program?int f(int x, int *py, int ppz) { int y, z; ppz += 1; z = ppz; // corrected z = *ppz; to z = ppz; *py += 2; y = *py; x += 3;...
18.0k
views
answered
Jan 21, 2015
Programming in C
gatecse-2008
programming
programming-in-c
normal
parameter-passing
+
–
13
votes
4
GATE CSE 2008 | Question: 80
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a $\text{2-dimensional}$ Boolean array, ... $X[i, j] = X[i-1, j] \wedge X[i-1, j-a_i]$
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of...
11.7k
views
answered
Jan 21, 2015
Algorithms
gatecse-2008
algorithms
normal
dynamic-programming
+
–
27
votes
5
GATE CSE 2009 | Question: 31
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in following sequence: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$ ... seek time first policy is used? $95 \;\text{ms}$ $119\;\text{ms}$ $233\;\text{ms}$ $276\;\text{ms}$
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in following sequence:$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$Assuming that the head i...
8.5k
views
answered
Jan 21, 2015
Operating System
gatecse-2009
operating-system
disk-scheduling
normal
+
–
37
votes
6
GATE CSE 2009 | Question: 53
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the ... $\text{expr2} = \max\left(l\left(i-1, j-1\right), l\left(i,j\right)\right)$
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths ...
9.2k
views
answered
Jan 21, 2015
Algorithms
gatecse-2009
algorithms
normal
dynamic-programming
recursion
+
–
22
votes
7
GATE CSE 2009 | Question: 5, ISRO2017-57
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
$(1217)_8$ is equivalent to$(1217)_{16}$$(028F)_{16}$$(2297)_{10}$$(0B17)_{16}$
8.1k
views
answered
Jan 21, 2015
Digital Logic
gatecse-2009
digital-logic
number-representation
isro2017
+
–
28
votes
8
GATE CSE 2009 | Question: 21
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the ... following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is ev...
16.5k
views
answered
Jan 20, 2015
Probability
gatecse-2009
probability
normal
conditional-probability
+
–
7
votes
9
GATE CSE 2009 | Question: 22
For the composition table of a cyclic group shown below: ... $a,b$ are generators $b,c$ are generators $c,d$ are generators $d,a$ are generators
For the composition table of a cyclic group shown below:$$\begin{array}{|c|c|c|c|c|} \hline \textbf{*} & \textbf{a}& \textbf{b} &\textbf{c} & \textbf{d}\\\hline \textbf{a...
8.9k
views
answered
Jan 20, 2015
Set Theory & Algebra
gatecse-2009
set-theory&algebra
normal
group-theory
+
–
1
votes
10
GATE CSE 2009 | Question: 25
$\int^{\pi/4}_0 (1-\tan x)/(1+\tan x)\,dx $ $0$ $1$ $\ln 2$ $1/2 \ln 2$
$\int^{\pi/4}_0 (1-\tan x)/(1+\tan x)\,dx $$0$$1$ $\ln 2$$1/2 \ln 2$
5.8k
views
answered
Jan 20, 2015
Calculus
gatecse-2009
calculus
integration
normal
+
–
56
votes
11
GATE CSE 2009 | Question: 23
Which one of the following is the most appropriate logical formula to represent the statement? "Gold and silver ornaments are precious". The following notations are used: $G(x): x$ is a gold ornament $S(x): x$ is a silver ornament $P(x): x$ ... $\forall x((G(x) \vee S(x)) \implies P(x))$
Which one of the following is the most appropriate logical formula to represent the statement?"Gold and silver ornaments are precious".The following notations are used: ...
8.5k
views
answered
Jan 20, 2015
Mathematical Logic
gatecse-2009
mathematical-logic
easy
first-order-logic
+
–
31
votes
12
GATE CSE 2009 | Question: 4
Consider the binary relation $R = \left\{(x,y), (x,z), (z,x), (z,y)\right\}$ on the set $\{x,y,z\}$. Which one of the following is TRUE? $R$ is symmetric but NOT antisymmetric $R$ is NOT symmetric but antisymmetric $R$ is both symmetric and antisymmetric $R$ is neither symmetric nor antisymmetric
Consider the binary relation $R = \left\{(x,y), (x,z), (z,x), (z,y)\right\}$ on the set $\{x,y,z\}$. Which one of the following is TRUE?$R$ is symmetric but NOT antisymme...
5.1k
views
answered
Jan 20, 2015
Set Theory & Algebra
gatecse-2009
set-theory&algebra
easy
relations
+
–
2
votes
13
GATE CSE 2010 | Question: 5
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ? $0$ $e^{-2}$ $e^{-1/2}$ $1$
What is the value of $ \displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}$ ?$0$$e^{-2}$$e^{-1/2}$$1$
9.0k
views
answered
Jan 20, 2015
Calculus
gatecse-2010
calculus
limits
normal
+
–
33
votes
14
GATE CSE 2010 | Question: 31
What is the boolean expression for the output $f$ of the combinational logic circuit of NOR gates given below? $\overline{Q+R}$ $\overline{P+Q}$ $\overline{P+R}$ $\overline{P+Q+R}$
What is the boolean expression for the output $f$ of the combinational logic circuit of NOR gates given below?$\overline{Q+R}$$\overline{P+Q}$$\overline{P+R}$$\overline{P...
11.6k
views
answered
Jan 20, 2015
Digital Logic
gatecse-2010
digital-logic
circuit-output
normal
+
–
28
votes
15
GATE CSE 2011 | Question: 14
The simplified SOP (Sum of Product) from the Boolean expression $(P + \bar{Q} + \bar{R}) . (P + \bar{Q} + R) . (P + Q +\bar{R})$ is $(\bar{P}.Q+\bar{R})$ $(P+\bar{Q}.\bar{R})$ $(\bar{P}.Q+R)$ $(P.Q+R)$
The simplified SOP (Sum of Product) from the Boolean expression$$(P + \bar{Q} + \bar{R}) . (P + \bar{Q} + R) . (P + Q +\bar{R})$$ is $(\bar{P}.Q+\bar{R})$$(P+\bar{Q}.\bar...
9.7k
views
answered
Jan 19, 2015
Digital Logic
gatecse-2011
digital-logic
normal
min-sum-of-products-form
+
–
31
votes
16
GATE CSE 2011 | Question: 15
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is 9 8 512 258
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is98512258
15.0k
views
answered
Jan 19, 2015
Digital Logic
gatecse-2011
digital-logic
normal
digital-counter
+
–
38
votes
17
GATE CSE 2011 | Question: 26
Consider the languages $L1, \:L2 \:and \: L3$ ... Automata (PDA) can be used to recognize $L1$ and $L2$ $L1$ is a regular language All the three languages are context free Turing machines can be used to recognize all the languages
Consider the languages $L1, \:L2 \:and \: L3$ as given below.$L1=\{0^p 1^q \mid p, q \in N\}, \\ L2 = \{0^p 1^q \mid p, q \in N \:and \:p=q\} \: and, \\ L3 = \{0^p 1^q 0^...
9.3k
views
answered
Jan 19, 2015
Theory of Computation
gatecse-2011
theory-of-computation
identify-class-language
normal
+
–
51
votes
18
GATE CSE 2011 | Question: 27
Consider two binary operators $\text{ } \uparrow \text{'}$ and $\text{ } \downarrow \text{'}$ with the precedence of operator $\downarrow$ being lower than that of the operator $\uparrow$. Operator $\uparrow$ is right associative while operator ... Which one of the following represents the parse tree for expression $(7 \downarrow 3 \uparrow 4 \uparrow 3 \downarrow 2)$
Consider two binary operators $\text{‘} \uparrow \text{’}$ and $\text{‘} \downarrow \text{’}$ with the precedence of operator $\downarrow$ being lower than that ...
7.2k
views
answered
Jan 19, 2015
Compiler Design
gatecse-2011
compiler-design
parsing
normal
+
–
64
votes
19
GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$, and a predicate$$P\left(x\right) = \neg \left(x=1\right)\wedge \forall y \left...
13.3k
views
answered
Jan 19, 2015
Mathematical Logic
gatecse-2011
mathematical-logic
normal
first-order-logic
+
–
46
votes
20
GATE CSE 2011 | Question: 31
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ? $0$ $2$ $-i$ $i$
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ?$0$$2$$-i$$i$
10.9k
views
answered
Jan 19, 2015
Calculus
gatecse-2011
calculus
integration
normal
+
–
33
votes
21
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
12.7k
views
answered
Jan 19, 2015
Operating System
gatecse-2011
operating-system
process-scheduling
normal
+
–
41
votes
22
GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with d...
15.6k
views
answered
Jan 19, 2015
Algorithms
gatecse-2011
algorithms
dynamic-programming
normal
+
–
57
votes
23
GATE CSE 2011 | Question: 41
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline ... under ideal conditions when compared to the corresponding non-pipeline implementation? $4.0$ $2.5$ $1.1$ $3.0$
Consider an instruction pipeline with four stages $\text{(S1, S2, S3 and S4)}$ each with combinational circuit only. The pipeline registers are required between each stag...
13.7k
views
answered
Jan 19, 2015
CO and Architecture
gatecse-2011
co-and-architecture
pipelining
normal
+
–
32
votes
24
GATE CSE 2011 | Question: 40
Consider the matrix as given below. $\begin{bmatrix} 1 & 2 & 3 \\ 0 & 4 & 7 \\ 0 & 0 & 3\end{bmatrix}$ Which one of the following options provides the CORRECT values of the eigenvalues of the matrix? $1, 4, 3$ $3, 7, 3$ $7, 3, 2$ $1, 2, 3$
Consider the matrix as given below.$$\begin{bmatrix} 1 & 2 & 3 \\ 0 & 4 & 7 \\ 0 & 0 & 3\end{bmatrix}$$Which one of the following options provides the CORRECT values of...
5.2k
views
answered
Jan 19, 2015
Linear Algebra
gatecse-2011
linear-algebra
eigen-value
easy
+
–
45
votes
25
GATE CSE 2011 | Question: 54
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. ... spanning tree (MST) of such a graph with $n$ nodes? $\frac{1}{12} (11n^2 - 5 n)$ $n^2-n+1$ $6n-11$ $2n+1$
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...
17.2k
views
answered
Jan 19, 2015
Algorithms
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
+
–
5
votes
26
GATE CSE 2013 | Question: 8
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ?$\{\epsilon\}$$\phi$$a^*$$\{\epsilon, a\}$
18.9k
views
answered
Jan 18, 2015
Theory of Computation
gatecse-2013
theory-of-computation
normal
regular-language
+
–
30
votes
27
GATE CSE 2013 | Question: 5
In the following truth table, $V = 1$ ... What function does the truth table represent? Priority encoder Decoder Multiplexer Demultiplexer
In the following truth table, $V = 1$ if and only if the input is valid.$$\begin{array}{cc}\textbf{Inputs}&\textbf{Outputs}\\ \begin{array}{|c|c|c|c|} \hline{D_0}&D_1&D_2...
8.3k
views
answered
Jan 18, 2015
Digital Logic
gatecse-2013
digital-logic
normal
digital-circuits
+
–
47
votes
28
GATE CSE 2013 | Question: 3
Which one of the following does NOT equal $\begin{vmatrix} 1 & x & x^{2}\\ 1& y & y^{2}\\ 1 & z & z^{2} \end{vmatrix} \quad ?$ $\begin{vmatrix} 1& x(x+1)& x+1\\ 1& y(y+1) & y+1\\ 1& z(z+1) & z+1 \end{vmatrix}$ ...
Which one of the following does NOT equal $$\begin{vmatrix} 1 & x & x^{2}\\ 1& y & y^{2}\\ 1 & z & z^{2} \end{vmatrix} \quad ?$$$\begin{vmatrix} 1& x(x+1)& x+1\\ 1& y(y+1...
9.3k
views
answered
Jan 18, 2015
Linear Algebra
gatecse-2013
linear-algebra
normal
determinant
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register