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
0
votes
8
answers
321
MadeEasy Test Series: Algorithms - Shortest Paths
Consider the following statements For every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to $t$. At the termination of the Bellman-ford algorithm, ... shortest path is found for a vertex for which shortest path is well-defined. Which of the above statements are true?
Consider the following statementsFor every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to...
vaishali jhalani
4.5k
views
vaishali jhalani
asked
Nov 6, 2016
Algorithms
made-easy-test-series
algorithms
shortest-path
descriptive
+
–
2
votes
8
answers
322
ME-Quick Sort
KISHALAY DAS
2.3k
views
KISHALAY DAS
asked
Nov 3, 2016
Algorithms
algorithms
made-easy-test-series
quick-sort
numerical-answers
+
–
1
votes
8
answers
323
Virtual Gate Test Series: Digital Logic - NAND Gates
The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______
The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______
Hradesh patel
15.8k
views
Hradesh patel
asked
Oct 5, 2016
Digital Logic
digital-logic
combinational-circuit
nand-gates
virtual-gate-test-series
+
–
3
votes
8
answers
324
UGC NET CSE | June 2016 | Part 3 | Question: 55
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation $R_M$ defined by M as all states that are reachable from the start state. $R_M$ has ___ equivalence classes. 2 4 5 6
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation $R_M$ defined by M as all states th...
go_editor
7.4k
views
go_editor
asked
Aug 20, 2016
Theory of Computation
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
regular-language
+
–
18
votes
8
answers
325
ISRO2016-38
What is the highest type number that can be assigned to the following grammar? $S\to Aa,A\to Ba,B \to abc$ Type 0 Type 1 Type 2 Type 3
What is the highest type number that can be assigned to the following grammar?$$S\to Aa,A\to Ba,B \to abc$$Type 0Type 1Type 2Type 3
Anu
17.6k
views
Anu
asked
Jul 4, 2016
Theory of Computation
theory-of-computation
identify-class-language
isro2016
+
–
13
votes
8
answers
326
ISRO2015-69
If n has 3, then the statement a[++n]=n++; assigns 3 to a[5] assigns 4 to a[5] assigns 4 to a[4] what is assigned is compiler dependent
If n has 3, then the statement a[++n]=n++;assigns 3 to a[5]assigns 4 to a[5]assigns 4 to a[4]what is assigned is compiler dependent
milankamilya
8.7k
views
milankamilya
asked
Jun 14, 2016
Programming in C
isro2015
programming-in-c
non-gate
undefined-behaviour
+
–
55
votes
8
answers
327
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The ...
go_editor
20.2k
views
go_editor
asked
Apr 24, 2016
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
43
votes
8
answers
328
GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in $G$ is: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding set...
go_editor
9.2k
views
go_editor
asked
Apr 24, 2016
Graph Theory
gatecse-2006
graph-theory
normal
graph-connectivity
+
–
73
votes
8
answers
329
GATE CSE 2010 | Question: 49
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... cache to $L1$ cache. What is the total time taken for these transfers? $222$ nanoseconds $888$ nanoseconds $902$ nanoseconds $968$ nanoseconds
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cac...
go_editor
26.5k
views
go_editor
asked
Apr 21, 2016
CO and Architecture
gatecse-2010
co-and-architecture
cache-memory
normal
+
–
40
votes
8
answers
330
GATE CSE 2010 | Question: 55
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. Suppose the weights of all unused links are changed to $2$ and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused? $0$ $1$ $2$ $3$
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram.Suppose the weights of all unused links are changed...
go_editor
13.3k
views
go_editor
asked
Apr 21, 2016
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
10
votes
8
answers
331
GATE2013 CE: GA-9
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increased by $30\%.$ By what percentage the price should be increased to maintained the same profit level. $5$ $10$ $15$ $30$
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning total profit of Rs. $500$. Later, the total cost increas...
Akash Kanase
8.1k
views
Akash Kanase
asked
Feb 16, 2016
Quantitative Aptitude
quantitative-aptitude
gate2013-ce
profit-loss
+
–
59
votes
8
answers
332
GATE CSE 2016 Set 1 | Question: 42
Consider the following context-free grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generated by $G_1$ and $G_2$ ... $\{ a^mb^n \mid m > 0 \text{ or } n>0\}$
Consider the following context-free grammars;$G_1 : S \to aS \mid B, B \to b \mid bB$$G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$W...
Sandeep Singh
27.0k
views
Sandeep Singh
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
73
votes
8
answers
333
GATE CSE 2016 Set 1 | Question: 32
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equiva...
Sandeep Singh
25.9k
views
Sandeep Singh
asked
Feb 12, 2016
CO and Architecture
gatecse-2016-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
62
votes
8
answers
334
GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...
Sandeep Singh
22.8k
views
Sandeep Singh
asked
Feb 12, 2016
Algorithms
gatecse-2016-set1
algorithms
minimum-spanning-tree
normal
+
–
76
votes
8
answers
335
GATE CSE 2016 Set 1 | Question: 1
Let $p, q, r, s$ represents the following propositions. $p:x\in\left\{8, 9, 10, 11, 12\right\}$ $q:$ $x$ is a composite number. $r:$ $x$ is a perfect square. $s:$ $x$ is a prime number. The integer $x\geq2$ which satisfies $\neg\left(\left(p\Rightarrow q\right) \wedge \left(\neg r \vee \neg s\right)\right)$ is ____________.
Let $p, q, r, s$ represents the following propositions.$p:x\in\left\{8, 9, 10, 11, 12\right\}$$q:$ $x$ is a composite number.$r:$ $x$ is a perfect square.$s:$ $x$ is a pr...
Sandeep Singh
13.2k
views
Sandeep Singh
asked
Feb 12, 2016
Mathematical Logic
gatecse-2016-set1
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
50
votes
8
answers
336
GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions: $P:$ $R$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions:$P:$ $R$ ...
Akash Kanase
14.8k
views
Akash Kanase
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
relations
normal
+
–
42
votes
8
answers
337
GATE CSE 2016 Set 2 | Question: 48
Consider the following two-process synchronization solution. ... synchronization solution. This solution violates mutual exclusion requirement. This solution violates progress requirement. This solution violates bounded wait requirement.
Consider the following two-process synchronization solution.$$\begin{array}{l|l}\hline \text{PROCESS 0 } & \text{Process 1 }\\ \\ \text{Entry: loop while (turn == 1);...
Akash Kanase
15.3k
views
Akash Kanase
asked
Feb 12, 2016
Operating System
gatecse-2016-set2
operating-system
process-synchronization
normal
+
–
85
votes
8
answers
338
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
Akash Kanase
16.8k
views
Akash Kanase
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
75
votes
8
answers
339
GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...
Akash Kanase
19.4k
views
Akash Kanase
asked
Feb 12, 2016
CO and Architecture
gatecse-2016-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
49
votes
8
answers
340
GATE CSE 2016 Set 2 | Question: 11
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}...
Akash Kanase
13.3k
views
Akash Kanase
asked
Feb 12, 2016
Algorithms
gatecse-2016-set2
algorithms
graph-algorithms
normal
numerical-answers
graph-search
+
–
Page:
« prev
1
...
12
13
14
15
16
17
18
19
20
21
22
...
3233
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register