Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by srestha
1
votes
801
GATE2014 EC-4: GA-8
Industrial consumption of power doubled from $2000-2001$ to $2010-2011$. Find the annual rate of increase in percent assuming it to be uniform over the years. $5.6$ $7.2$ $10.0$ $12.2$
Industrial consumption of power doubled from $2000-2001$ to $2010-2011$. Find the annual rate of increase in percent assuming it to be uniform over the years. $5.6$ $7.2$...
2.8k
views
answered
Mar 18, 2016
Quantitative Aptitude
gate2014-ec-4
percentage
normal
quantitative-aptitude
+
–
0
votes
802
GATE2014 EC-4: GA-3
While receiving the award, the scientist said, "I feel vindicated". Which of the following is closest in meaning to the word 'vindicated'? Punished Substantiated Appreciated Chastened
While receiving the award, the scientist said, "I feel vindicated". Which of the following is closest in meaning to the word 'vindicated'?PunishedSubstantiated Appreciate...
1.8k
views
answered
Mar 17, 2016
Verbal Aptitude
gate2014-ec-4
verbal-aptitude
meaning
normal
+
–
6
votes
803
GATE2014 EC-4: GA-1
Which of the following options is the closest in meaning to the word underlined in the sentence below? In a democracy, everybody has the freedom to disagree with the government. Dissent Descent Decent Decadent
Which of the following options is the closest in meaning to the word underlined in the sentence below?In a democracy, everybody has the freedom to disagree with the gover...
1.4k
views
answered
Mar 17, 2016
Verbal Aptitude
gate2014-ec-4
verbal-aptitude
meaning
normal
+
–
11
votes
804
GATE2014 EC-3: GA-9
A firm producing air purifiers sold $200$ units in $2012$. The following pie chart presents the share of raw material, labour, energy, plant & machinery, and transportation costs in the total manufacturing cost of the firm in $2012$. The expenditure on labour in ... the company registered a profit of Rs.$10$ lakhs in $2012$, at what price (in Rs) was each air purifier sold?
A firm producing air purifiers sold $200$ units in $2012$. The following pie chart presents the share of raw material, labour, energy, plant & machinery, and transportati...
4.0k
views
answered
Mar 17, 2016
Quantitative Aptitude
gate2014-ec-3
quantitative-aptitude
data-interpretation
pie-chart
numerical-answers
+
–
9
votes
805
GATE2014 EC-3: GA-8
A man can row at $8$ km per hour in still water. If it takes him thrice as long to row upstream, as to row downstream, then find the stream velocity in km per hour.
A man can row at $8$ km per hour in still water. If it takes him thrice as long to row upstream, as to row downstream, then find the stream velocity in km per hour.
4.1k
views
answered
Mar 17, 2016
Quantitative Aptitude
gate2014-ec-3
quantitative-aptitude
speed-time-distance
normal
numerical-answers
+
–
16
votes
806
GATE2014 EC-3: GA-7
The multi-level hierarchical pie chart shows the population of animals in a reserve forest. The correct conclusions from this information are: (i) Butterflies are birds (ii) There are more tigers in this forest than red ants (iii) All reptiles in this forest are either snakes or crocodiles (iv) ... (i), (ii), (iii) and (iv) (i), (iii) and (iv) only (i), (ii) and (iii) only
The multi-level hierarchical pie chart shows the population of animals in a reserve forest. The correct conclusions from this information are:(i) Butterflies are birds(ii...
2.7k
views
answered
Mar 17, 2016
Quantitative Aptitude
gate2014-ec-3
quantitative-aptitude
data-interpretation
pie-chart
normal
+
–
159
votes
807
GATE CSE 2014 Set 1 | Question: 49
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. The set of all possible $1-$pennants is ${(1)}$, the set of all possible ... $(1,2)$ is not the same as the pennant $(2,1)$. The number of $10-$pennants is________
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. ...
11.3k
views
answered
Mar 9, 2016
Combinatory
gatecse-2014-set1
combinatory
numerical-answers
normal
+
–
0
votes
808
output of this program is
int main(){ int n=1,sum =0; while(n<=10){ sum += n++*n++; } printf("Sum = %d\n",sum); return 0 } ans is 165 . i got 190.please explain??
int main(){ int n=1,sum =0; while(n<=10){ sum += n++*n++; } printf("Sum = %d\n",sum); return 0 }ans is 165 . i got 190.please explain??
1.0k
views
answered
Feb 27, 2016
Programming in C
programming-in-c
+
–
10
votes
809
GATE2012 CY: GA-8
The data given in the following table summarizes the monthly budget of an average household. ... $10\%$ $14\%$ $81\%$ $86\%$
The data given in the following table summarizes the monthly budget of an average household.$$\begin{array}{|l|c|c|} \hline \textbf{Category} & \textbf{Amount(Rs.)} \\\hl...
2.6k
views
answered
Feb 21, 2016
Quantitative Aptitude
gate2012-cy
quantitative-aptitude
percentage
+
–
41
votes
810
GATE IT 2007 | Question: 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: $isEmpty (Q)$ - returns true if the queue is empty, false otherwise. $delete (Q)$ - deletes the element at the front of the queue ... the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:$isEmpty (Q)$ — returns true if the queue is empty...
16.1k
views
answered
Jan 22, 2016
DS
gateit-2007
data-structures
queue
normal
+
–
52
votes
811
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
16.4k
views
answered
Jan 6, 2016
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
+
–
43
votes
812
GATE CSE 2015 Set 1 | Question: 31
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) ++p; for (k = 1; k < p; k = k * 2) ++q; } return q; } Which one of the following most closely approximates the return value of the function $\text{fun1}$? $n^3$ $n(\log n)^2$ $n \log n$ $n \log(\log n)$
Consider the following C function.int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j 1; j = j/2) ++p; for (k = 1; k < p; k = k * 2)...
20.6k
views
answered
Jan 5, 2016
Algorithms
gatecse-2015-set1
algorithms
normal
identify-function
+
–
1
votes
813
Lattice
815
views
answered
Jan 5, 2016
Set Theory & Algebra
set-theory&algebra
lattice
+
–
10
votes
814
GATE CSE 1999 | Question: 8
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $3$rd smallest elements in minimum number of comparisons.
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $...
5.1k
views
answered
Jan 5, 2016
Algorithms
gate1999
algorithms
sorting
normal
descriptive
+
–
18
votes
815
GATE CSE 2004 | Question: 41
Consider the following C program main() { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x>0 and y>0*/ m = x; n = y; while(m != n) { if (m > n) m = m-n; else n = n-m; } printf(" ... $x+y$ using repeated subtraction $x \mod y$ using repeated subtraction the greatest common divisor of $x$ and $y$ the least common multiple of $x$ and $y$
Consider the following C programmain() { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x>0 and y>0*/ m = x; n = y; while(m != n) { if (m n) m = m-n; else n = n-m; } ...
7.6k
views
answered
Jan 5, 2016
Algorithms
gatecse-2004
algorithms
normal
identify-function
+
–
0
votes
816
Pipeline MAL , throughput , Efficiency
Given Collision Vector : (1010) What are permissible and forbidden latencies Calculate MAL Calculate throughput ? Calculate Efficiency of pipeline ? Also Draw a state diagram ? I have a doubt in State diagram construction Could someone explain ... applying to 1011 Isn't it ? Someone pls explain this . and also how to calculate Efficiency and throughput
Given Collision Vector : (1010)What are permissible and forbidden latenciesCalculate MALCalculate throughput ?Calculate Efficiency of pipeline ?Also Draw a state diagram...
4.1k
views
answered
Jan 2, 2016
CO and Architecture
pipelining
+
–
31
votes
817
GATE IT 2008 | Question: 83
Consider the code fragment written in C below : void f (int n) { if (n <= 1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } } Which of the following implementations will produce the same output for $f(173)$ as the above code? ... { printf ("%d", n%2); f (n/2); } } Both $P1$ and $P2$ $P2$ only $P1$ only Neither $P1$ nor $P2$
Consider the code fragment written in C below : void f (int n) { if (n <= 1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } }Which of the following im...
8.7k
views
answered
Jan 2, 2016
Algorithms
gateit-2008
algorithms
recursion
identify-function
normal
+
–
3
votes
818
Commitee.
Find number of ways of selecting a commitee of 10 members out of 6 men and 7 women of which atleast 4 women are included. a)231 b)25200 c)325 d)286
Find number of ways of selecting a commitee of 10 members out of 6 men and 7 women of which atleast 4 women are included.a)231 b)25200 c)325 d)286
355
views
answered
Jan 2, 2016
Combinatory
combinatory
+
–
18
votes
819
GATE CSE 2008 | Question: 42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at ... least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$?For...
23.4k
views
answered
Jan 2, 2016
Graph Theory
gatecse-2008
graph-connectivity
normal
+
–
5
votes
820
The value of a and b such that
$\lim_{x \to 0} \frac{ a sin ^2x + b log ( cos x) }{ x^4} = \frac{1}{2}$ a) - 1, -2 b) 1, 2 c) -1,2 d) 1,-2
$\lim_{x \to 0} \frac{ a sin ^2x + b log ( cos x) }{ x^4} = \frac{1}{2}$a) - 1, -2 b) 1, 2c) -1,2 d) 1,-2
12.2k
views
answered
Jan 1, 2016
Calculus
calculus
limits
+
–
0
votes
821
Sparse dense
437
views
answered
Dec 31, 2015
Databases
databases
+
–
4
votes
822
different independent eigen vectors
In A = (aij)nxn where aij = 1 ∀ i,j then number of different independent Eigen Vectors of A are _________ . (a) 1 (b) n-1 (c) 2 (d) n
In A = (aij)nxn where aij = 1 ∀ i,j then number of different independent Eigen Vectors of A are _________ . (a) 1(b) n-1(c) 2(d) n
1.5k
views
answered
Dec 31, 2015
Linear Algebra
eigen-value
linear-algebra
engineering-mathematics
+
–
3
votes
823
Probability question on a pair of dice
I think the ans should be C, but the given answer is A. Anyone can explain please?
I think the ans should be C, but the given answer is A. Anyone can explain please?
791
views
answered
Dec 31, 2015
Combinatory
engineering-mathematics
probability
+
–
0
votes
824
Let A and B be disjoint, R.E. languages. Let A' U B' also be recursive enumerable. What can you say about A and B?
Let $A$ and $B$ be disjoint, R.E. languages. Let $\bar A \cup \bar B$ also be recursive enumerable. What can you say about $A$ and $B$?(a) Neither A nor B is decidable is...
3.0k
views
answered
Dec 30, 2015
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
825
counter
The initial state of a MOD 16 down counter is 0110 . After 37 clock pulses, the state of the counter will be 0001 1011 1101 1010
The initial state of a MOD 16 down counter is 0110 . After 37 clock pulses, the state of the counter will be0001101111011010
6.0k
views
answered
Dec 29, 2015
Digital Logic
digital-counter
+
–
3
votes
826
If an ethernet destination address is
1.7k
views
answered
Dec 29, 2015
Computer Networks
computer-networks
ethernet
+
–
2
votes
827
link list
842
views
answered
Dec 27, 2015
DS
linked-list
+
–
0
votes
828
graph theory
How many non-isomorphic simple graph are there with 5 vertices and 3 edges?how to approach this qus....
How many non-isomorphic simple graph are there with 5 vertices and 3 edges?how to approach this qus....
389
views
answered
Dec 26, 2015
Graph Theory
graph-theory
+
–
18
votes
829
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram:For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \we...
17.0k
views
answered
Dec 26, 2015
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
normal
lattice
+
–
46
votes
830
GATE CSE 2015 Set 1 | Question: 45
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the ... that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from ...
18.0k
views
answered
Dec 25, 2015
Algorithms
gatecse-2015-set1
algorithms
graph-algorithms
normal
graph-search
+
–
Page:
« prev
1
...
22
23
24
25
26
27
28
29
30
31
32
...
36
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register