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
10
votes
8
answers
301
ISI2017-MMA-29
Suppose the rank of the matrix $\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
Suppose the rank of the matrix$$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$is $2$ for some real numbers $a$ and $b$. Then $b$ equals$1$$3$$1/2$$1/3$
jjayantamahata
2.9k
views
jjayantamahata
asked
Mar 29, 2018
Linear Algebra
isi2017-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
43
votes
8
answers
302
GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forward...
gatecse
19.9k
views
gatecse
asked
Feb 14, 2018
Computer Networks
gatecse-2018
computer-networks
ip-addressing
numerical-answers
2-marks
+
–
60
votes
8
answers
303
GATE CSE 2018 | Question: 50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$...
gatecse
24.3k
views
gatecse
asked
Feb 14, 2018
CO and Architecture
gatecse-2018
co-and-architecture
pipelining
numerical-answers
2-marks
+
–
35
votes
8
answers
304
GATE CSE 2018 | Question: 45
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers.Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else {...
gatecse
13.5k
views
gatecse
asked
Feb 14, 2018
Algorithms
gatecse-2018
numerical-answers
algorithms
recursion
2-marks
+
–
36
votes
8
answers
305
GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a ti...
gatecse
11.2k
views
gatecse
asked
Feb 14, 2018
Probability
gatecse-2018
probability
normal
numerical-answers
1-mark
+
–
1
votes
8
answers
306
#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...
Anjan
2.0k
views
Anjan
asked
Jan 9, 2018
Compiler Design
compiler-design
static-single-assignment
+
–
10
votes
8
answers
307
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
Arjun
13.3k
views
Arjun
asked
May 9, 2017
Algorithms
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
+
–
44
votes
8
answers
308
GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). T...
khushtak
19.4k
views
khushtak
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
pipelining
normal
numerical-answers
+
–
74
votes
8
answers
309
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
khushtak
17.6k
views
khushtak
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
31
votes
8
answers
310
GATE CSE 2017 Set 1 | Question: 01
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below?$p \Rightarrow q$$q \Rightarrow p$$\left ( ...
khushtak
9.2k
views
khushtak
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
+
–
47
votes
8
answers
311
GATE CSE 2017 Set 2 | Question: 52
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is $2,$ then the largest among the absolute values of the eigenvalues of $M$ is _______
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \ma...
Madhav
15.8k
views
Madhav
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
+
–
29
votes
8
answers
312
GATE CSE 2017 Set 2 | Question: 53
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache lines is used with this machine. The size of the tag field in bits is _______
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size $32$ bytes. Assume that a direct mapped cache having $512$ cache line...
Madhav
9.7k
views
Madhav
asked
Feb 14, 2017
CO and Architecture
gatecse-2017-set2
co-and-architecture
cache-memory
numerical-answers
+
–
23
votes
8
answers
313
GATE CSE 2017 Set 2 | Question: GA-7
There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If you are permitted to open just one box and then pull out and inspect ... three boxes? The box labeled Apples' The box labeled Apples and Oranges' The box labeled Oranges' Cannot be determined
There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If ...
Arjun
11.0k
views
Arjun
asked
Feb 14, 2017
Analytical Aptitude
gatecse-2017-set2
analytical-aptitude
normal
tricky
logical-reasoning
+
–
20
votes
8
answers
314
GATE CSE 2017 Set 1 | Question: GA-5
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is $0.3^{k}$ $0.6^{k}$ $0.7^{k}$ $0.9^{k}$
The probability that a $k$-digit number does NOT contain the digits $0, 5,$ or $9$ is$0.3^{k}$$0.6^{k}$$0.7^{k}$$0.9^{k}$
Arjun
8.8k
views
Arjun
asked
Feb 14, 2017
Quantitative Aptitude
gatecse-2017-set1
general-aptitude
quantitative-aptitude
probability
easy
+
–
20
votes
8
answers
315
GATE CSE 2017 Set 2 | Question: 6
Which of the following statements about parser is/are CORRECT? $\text{Canonical LR}$ is more powerful than $\text{SLR}$ $\text{SLR}$ is more powerful than $\text{LALR}$ $\text{SLR}$ is more powerful than $\text{Canonical LR}$ I only II only III only II and III only
Which of the following statements about parser is/are CORRECT?$\text{Canonical LR}$ is more powerful than $\text{SLR}$$\text{SLR}$ is more powerful than $\text{LALR}$$\te...
Arjun
8.0k
views
Arjun
asked
Feb 14, 2017
Compiler Design
gatecse-2017-set2
compiler-design
parsing
lr-parser
+
–
48
votes
8
answers
316
GATE CSE 2017 Set 1 | Question: 37
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals.$G_{1}:S\rightarrow aSb \mid T, T \rightarrow...
Arjun
12.4k
views
Arjun
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
identify-class-language
normal
+
–
76
votes
8
answers
317
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
Arjun
22.0k
views
Arjun
asked
Feb 14, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
4
votes
8
answers
318
Subnet mask-NID
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ? shouldn't it be 190 but the answer given is 222? anyone help
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ?sho...
reena_kandari
5.6k
views
reena_kandari
asked
Feb 6, 2017
Computer Networks
computer-networks
network-addressing
subnetting
+
–
17
votes
8
answers
319
Heap..
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. -------------------------------------------------------------------------------------------------------------------------- 2)The number of min heap trees are possible with 15 elements_________________
1)The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________. 2)The...
srestha
7.6k
views
srestha
asked
Jan 3, 2017
Programming in C
binary-heap
+
–
32
votes
8
answers
320
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
makhdoom ghaya
12.1k
views
makhdoom ghaya
asked
Nov 27, 2016
Theory of Computation
gate1989
easy
theory-of-computation
closure-property
multiple-selects
+
–
Page:
« prev
1
...
11
12
13
14
15
16
17
18
19
20
21
...
3238
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register