The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Answers by Arjun
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
GATEBOOK2019COA117
Suppose the functions $F$ and $G$ can be computed in $8$ and $3$ nanoseconds by functional units $U_F$ and $U_G$, respectively. Given three instances of $U_F$ and three instances of $U_G$, it is required to implement the computation $F(G(X_i))$ ... . Ignoring all other delays, the minimum time required to complete this computation is ( in nanoseconds): $28$ $33$ $43$ $49$
answered
10 hours
ago
in
CO & Architecture

49
views
gb2019coa1
+3
votes
2
GATEBOOK2019COA118
Consider a program being run on a processor. A modification in processor design caused $30\%$ of the program to speed up by ten times while three fourth of the remaining program has a speed up of $80$ and $40\%$ of the remaining part of the ... The remaining part of the program has a speedup of $1$. The overall speedup of the program exact to two decimal places is _________
answered
13 hours
ago
in
CO & Architecture

73
views
gb2019coa1
numericalanswers
+3
votes
3
TIFR2019B6
answered
14 hours
ago
in
Others

68
views
tifr2019
+1
vote
4
GATEBOOK2019COA28
Consider a database server which handles search queries with double indirect pointers, $88\%$ of its total active query handling time. An improvement is made and the indirection is removed with direct pointers which caused the search query handling time to be enhanced by $2000\%$. The overall speedup is: $4.33$ $6.1$ $9.5$ $12.6$
answered
3 days
ago
in
CO & Architecture

51
views
gb2019coa2
+1
vote
5
propositional logic(AAI exam)
answered
3 days
ago
in
Mathematical Logic

52
views
+2
votes
6
GATEBOOK2019DS112
Let the minimum number of stack(s) required to evaluate a prefix expression is $A$ and the value of the prefix expression $+2*34+/8215$ (all numbers are unit digit) evaluated using the same number of stack(s) is $B$. What are the values of $A$ and $B$? $1,4$ $2,6$ $1,6$ $2,4$
answered
Dec 9
in
DS

122
views
gb2019ds1
stack
+1
vote
7
GATEBOOK2019DS15
Consider following C program: #include <stdio.h> int main() { int i,j; int arr['A']['B'] = {{2,10},{4},2,2,3,{1},{4},{5}}; for (i = 0; i < 'A'; i++) { for (j = 0; j < 'B'; j++) printf("%d ", arr[i][j]); ... ; } How many rows of this $2D$ array contain at least one nonzero entry? (Assume that the character code of A' starts from $65$) $3$ $5$ $6$ $8$
answered
Dec 9
in
Programming

158
views
gb2019ds1
programminginc
+1
vote
8
GATEBOOK2019DS125
A stack is implemented using two queues. Initially the stack is empty. Then following sequence of operations are performed on stack: ... to simulate these stack operations is, (assuming $\text{pop}()$ is less costly between the two operations.): $28$ $31$ $35$ $37$
answered
Dec 9
in
Programming

74
views
gb2019ds1
stack
+1
vote
9
GATEBOOK2019DS18
Suppose you are given an array $S[1...n]$ and a procedure $\text{reverse}(S,i,j)$ which reverses the order of elements in $S$ between positions $i$ and $j$ (both inclusive). What does the following sequence do, where $1 < k \le n$ ... $S$ left by $k$ positions Leaves $S$ unchanged Reverses all elements of $S$ Rotates $S$ right by $2k1$ positions
answered
Dec 8
in
Programming

60
views
gb2019ds1
arrays
+3
votes
10
GATEBOOK2019DM14
Minesweeper is a singleplayer computer game invented by Robert Donner in 1989. A unary predicate mine is defined, where $\text{mine}(x)$ means that the cell $x$ ... $n$ mines in the game There are at most $n$ mines in the game None of the above
answered
Dec 1
in
Mathematical Logic

150
views
gb2019dm1
discretemathematics
mathematicallogic
quantifiers
0
votes
11
GATE201242
Consider the virtual page reference string $\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$ on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ ... $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$ $\text{OPTIMAL} = \text{LRU}$ $\text{OPTIMAL} = \text{FIFO}$
answered
Nov 21
in
Operating System

1.7k
views
gate2012
operatingsystem
pagereplacement
normal
0
votes
12
IIT Kanpur
An address sequence S experiences 100 compulsory cache misses. The sequence S experiences 500 misses when it is passed through a 32 KB fullyassociative cache. The sequence S experiences 1000 misses when it is passed through a 32 KB 8way setassociative cache ... of conflict misses that the sequence S experiences when it is passed through a 32 KB 8way setassociative cache is _________
answered
Nov 21
in
Written Exam

124
views
+3
votes
13
Raghuramkrishnan
T1 T2 T3 R(X) W(X) commit W(X) commit R(X) commit is this transaction conflict serializable and view serializable?
answered
Nov 18
in
Databases

196
views
databases
transactions
serializability
conflictserializable
+3
votes
14
GATEBOOK2019CN211
$IPv6$ uses $16$byte addresses. If a block of $1$ million addresses is allocated every picosecond, how long will the addresses last? $10^{13}$ years $10^{14}$ years $10^{15}$ years $10^{16}$ years
answered
Nov 18
in
Computer Networks

85
views
gb2019cn2
computernetworks
ipv6
networklayer
+4
votes
15
GATEBOOK2019DM210
How many license plates with $3$ decimal digits followed by $3$ letters do not contain both the number $0$ and the letter $\text{O}$? $17047279$ $14074279$ $17074279$ $12436759$
answered
Nov 18
in
Combinatory

88
views
gb2019dm2
discretemathematics
permutationsandcombinations
+1
vote
16
GATEBOOK2019DM29
How many bit strings of length $6$ have more zeroes than ones?
answered
Nov 18
in
Combinatory

34
views
gb2019dm2
discretemathematics
numericalanswers
+13
votes
17
GATEBOOK2019TOC17
If the language accepted by a DFA contains binary strings divisible by $12$ (in decimal), the minimum number of states in it will be ______
answered
Nov 15
in
Theory of Computation

384
views
gb2019toc1
numericalanswers
+1
vote
18
2nd Normal form
Hello, I know this type of question has been asked but I am not getting this. I have a confusion in FD bc>d should it be in 2nd normal form or not. R={a,b,c,d} FD={ab>c,bc>d} Ck={ab} I want to know whether this is in second normal form or not. Thanks in advance.
answered
Nov 14
in
Databases

31
views
+1
vote
19
GATEBOOK2019CN111
A system uses the StopandWait ARQ protocol. If each packet carries $1000 \text{ bits}$ of data, how long does it take to send $1$ million bits of data if the distance between the sender and receiver is $5000 \text{ km}$ and the propagation speed is $2 \times 10^8$? ... or control frame is lost or damaged ? $51 \text{ sec}$ $26 \text{ sec}$ $50 \text{ sec}$ $25 \text{ sec}$
answered
Nov 12
in
Computer Networks

63
views
gb2019cn1
computernetworks
datalinklayer
stopandwait
+2
votes
20
GATEBOOK2019DM110
Assuming a nonempty universe, the formula $(\forall x P(x) \vee \exists y P(y))$ is equivalent to $\exists x (P(x))$ $ (\forall x P(x))$ $ \neg (\forall x P(x))$ $ \neg (\exists x (P(x))$
answered
Nov 11
in
Mathematical Logic

82
views
gb2019dm1
discretemathematics
propositionallogic
mathematicallogic
+6
votes
21
GATE199010b
One giga bytes of data are to be organized as an indexedsequential file with a uniform blocking factor 8. Assuming a block size of 1 Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing that would be ... the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
answered
Nov 10
in
Databases

531
views
gate1990
descriptive
databases
indexing
Page:
1
2
3
4
5
6
...
43
next »
44,484
questions
49,937
answers
165,588
comments
65,905
users