Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2010
73
votes
8
answers
1
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.3k
views
go_editor
asked
Apr 21, 2016
CO and Architecture
gatecse-2010
co-and-architecture
cache-memory
normal
+
–
37
votes
5
answers
2
GATE CSE 2010 | Question: 51
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
go_editor
14.9k
views
go_editor
asked
Apr 21, 2016
Algorithms
gatecse-2010
normal
algorithms
spanning-tree
+
–
73
votes
10
answers
3
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...
go_editor
27.3k
views
go_editor
asked
Apr 21, 2016
DS
data-structures
hashing
normal
gatecse-2010
+
–
40
votes
8
answers
4
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.1k
views
go_editor
asked
Apr 21, 2016
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
55
votes
9
answers
5
GATE CSE 2010 | Question: 65
Given digits $ 2, 2, 3, 3, 3, 4, 4, 4, 4$ how many distinct $4$ digit numbers greater than $3000$ can be formed? $50$ $51$ $52$ $54$
Given digits $ 2, 2, 3, 3, 3, 4, 4, 4, 4$ how many distinct $4$ digit numbers greater than $3000$ can be formed?$50$$51$$52$$54$
go_editor
17.4k
views
go_editor
asked
Sep 30, 2014
Quantitative Aptitude
gatecse-2010
quantitative-aptitude
combinatory
normal
+
–
14
votes
3
answers
6
GATE CSE 2010 | Question: 64
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team has $2$ skilled, $6$ semi-skilled and $5$ unskilled workers, how long it will take to build the wall? $20$ days $18$ days $16$ days $15$ days
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team...
go_editor
6.5k
views
go_editor
asked
Sep 30, 2014
Quantitative Aptitude
gatecse-2010
quantitative-aptitude
normal
work-time
+
–
15
votes
2
answers
7
GATE CSE 2010 | Question: 63
Modern warfare has changed from large scale clashes of armies to suppression of civilian populations. Chemical agents that do their work silently appear to be suited to such warfare; and regretfully, there exist people in military establishments ... of chemical agents in warfare would be undesirable. People in military establishments like to use chemical agents in war.
Modern warfare has changed from large scale clashes of armies to suppression of civilian populations. Chemical agents that do their work silently appear to be suited to s...
go_editor
4.0k
views
go_editor
asked
Sep 30, 2014
Verbal Aptitude
gatecse-2010
verbal-aptitude
passage-reading
normal
+
–
33
votes
4
answers
8
GATE CSE 2010 | Question: 62
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the ... no twins. In what order they were born (oldest first)? $\text{HSIG}$ $\text{SGHI}$ $\text{IGSH}$ $\text{IHSG}$
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive...
go_editor
11.3k
views
go_editor
asked
Sep 30, 2014
Analytical Aptitude
gatecse-2010
analytical-aptitude
logical-reasoning
normal
+
–
19
votes
3
answers
9
GATE CSE 2010 | Question: 61
If $137 + 276 = 435$ how much is $731+672?$ $534$ $1403$ $1623$ $1513$
If $137 + 276 = 435$ how much is $731+672?$$534$$1403$$1623$$1513$
go_editor
8.6k
views
go_editor
asked
Sep 30, 2014
Analytical Aptitude
gatecse-2010
analytical-aptitude
normal
logical-reasoning
+
–
11
votes
3
answers
10
GATE CSE 2010 | Question: 60
The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in the original pair. Unemployed : Worker fallow : land unaware : sleeper wit : jester renovated : house
The question below consists of a pair of related words followed by four pairs of words. Select the pair that best expresses the relation in the original pair.Unemployed :...
go_editor
4.9k
views
go_editor
asked
Sep 30, 2014
Verbal Aptitude
gatecse-2010
verbal-aptitude
word-pairs
normal
+
–
12
votes
5
answers
11
GATE CSE 2010 | Question: 59
$25$ persons are in a room. $15$ of them play hockey, $17$ of them play football and $10$ of them play both hockey and football. Then the number of persons playing neither hockey nor football is: $2$ $17$ $13$ $3$
$25$ persons are in a room. $15$ of them play hockey, $17$ of them play football and $10$ of them play both hockey and football. Then the number of persons playing neithe...
go_editor
6.6k
views
go_editor
asked
Sep 30, 2014
Quantitative Aptitude
gatecse-2010
quantitative-aptitude
easy
set-theory&algebra
venn-diagram
+
–
7
votes
1
answer
12
GATE CSE 2010 | Question: 58
Choose the most appropriate word from the options given below to complete the following sentence: If we manage to __________ our natural resources, we would leave a better planet for our children. uphold restrain cherish conserve
Choose the most appropriate word from the options given below to complete the following sentence:If we manage to __________ our natural resources, we would leave a better...
go_editor
3.9k
views
go_editor
asked
Sep 30, 2014
Verbal Aptitude
gatecse-2010
verbal-aptitude
most-appropriate-word
easy
+
–
10
votes
1
answer
13
GATE CSE 2010 | Question: 57
Which of the following options is the closest in meaning to the word given below: Circuitous cyclic indirect confusing crooked
Which of the following options is the closest in meaning to the word given below:Circuitouscyclicindirectconfusingcrooked
go_editor
3.3k
views
go_editor
asked
Sep 30, 2014
Verbal Aptitude
gatecse-2010
verbal-aptitude
meaning
normal
+
–
11
votes
3
answers
14
GATE CSE 2010 | Question: 56
Choose the most appropriate word from the options given below to complete the following sentence: His rather casual remarks on politics ________ his lack of seriousness about the subject. masked belied betrayed suppressed
Choose the most appropriate word from the options given below to complete the following sentence:His rather casual remarks on politics ________ his lack of seriousness ab...
go_editor
5.6k
views
go_editor
asked
Sep 30, 2014
Verbal Aptitude
gatecse-2010
verbal-aptitude
most-appropriate-word
normal
+
–
61
votes
7
answers
15
GATE CSE 2010 | Question: 54
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram.All the routers use the distance ...
go_editor
23.7k
views
go_editor
asked
Sep 30, 2014
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
23
votes
3
answers
16
GATE CSE 2010 | Question: 52
A hash table of length $10$ uses open addressing with hash function $h(k) = k \mod 10$, and linear probing. After inserting $6$ ... $34, 42, 23, 52, 33, 46$ $46, 34, 42, 23, 52, 33$ $42, 46, 33, 23, 34, 52$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \mod 10$, and linear probing. After inserting $6$ values into an empty hash table, the table...
go_editor
6.6k
views
go_editor
asked
Sep 30, 2014
DS
gatecse-2010
data-structures
hashing
normal
+
–
43
votes
8
answers
17
GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...
go_editor
23.9k
views
go_editor
asked
Sep 30, 2014
Algorithms
gatecse-2010
algorithms
spanning-tree
normal
+
–
80
votes
8
answers
18
GATE CSE 2010 | Question: 48
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$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ 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
42.6k
views
go_editor
asked
Sep 30, 2014
CO and Architecture
gatecse-2010
co-and-architecture
cache-memory
normal
barc2017
+
–
35
votes
4
answers
19
GATE CSE 2010 | Question: 47
Suppose computers $A$ and $B$ have $IP$ addresses $10.105.1.113$ and $10.105.1.91$ respectively and they both use same netmask $N$. Which of the values of $N$ given below should not be used if $A$ and $B$ should belong to the same network? $255.255.255.0$ $255.255.255.128$ $255.255.255.192$ $255.255.255.224$
Suppose computers $A$ and $B$ have $IP$ addresses $10.105.1.113$ and $10.105.1.91$ respectively and they both use same netmask $N$. Which of the values of $N$ given below...
go_editor
15.1k
views
go_editor
asked
Sep 30, 2014
Computer Networks
gatecse-2010
computer-networks
subnetting
easy
+
–
149
votes
6
answers
20
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...
go_editor
29.2k
views
go_editor
asked
Sep 30, 2014
Operating System
gatecse-2010
operating-system
resource-allocation
normal
+
–
61
votes
6
answers
21
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
go_editor
26.2k
views
go_editor
asked
Sep 30, 2014
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
11
votes
3
answers
22
GATE CSE 2010 | Question: 44
The following program is to be tested for statement coverage: begin if (a==b) {S1; exit;} else if (c==d) {S2;} else {S3; exit;} S4; end The test cases T1, T2, T3 and T4 given below are expressed in terms of the properties satisfied by the values of ... of the test suites given below ensures coverage of statements S1, S2, S3 and S4? T1, T2, T3 T2, T4 T3, T4 T1, T2, T4
The following program is to be tested for statement coverage:begin if (a==b) {S1; exit;} else if (c==d) {S2;} else {S3; exit;} S4; endThe test cases T1, T2, T3 and T4 giv...
go_editor
6.2k
views
go_editor
asked
Sep 30, 2014
IS&Software Engineering
gatecse-2010
is&software-engineering
software-testing
normal
+
–
42
votes
8
answers
23
GATE CSE 2010 | Question: 43
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains $200$ tuples and the relation $S$ contains $100$ tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? $100$ $200$ $300$ $2000$
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$$A \to C$The relation $R$ contains $200$ tuples and the relation $S$ con...
go_editor
13.2k
views
go_editor
asked
Sep 30, 2014
Databases
gatecse-2010
databases
normal
natural-join
database-normalization
+
–
31
votes
4
answers
24
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
go_editor
10.6k
views
go_editor
asked
Sep 30, 2014
Databases
gatecse-2010
databases
transaction-and-concurrency
normal
+
–
62
votes
9
answers
25
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automati...
go_editor
24.0k
views
go_editor
asked
Sep 30, 2014
Theory of Computation
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
41
votes
1
answer
26
GATE CSE 2010 | Question: 40
Consider the languages $L1=\{0^i1^j\ \mid i \neq j\}, $ $L2=\{0^i1^j\mid i=j\},$ $L3=\{0^i1^j \mid i=2j+1\},$ $L4=\{0^i1^j \mid i\neq2j\}$ Only $L2$ is context free. Only $L2$ and $L3$ are context free. Only $L1$ and $L2$ are context free. All are context free
Consider the languages$L1=\{0^i1^j\ \mid i \neq j\}, $$L2=\{0^i1^j\mid i=j\},$$L3=\{0^i1^j \mid i=2j+1\},$$L4=\{0^i1^j \mid i\neq2j\}$Only $L2$ is context free.Only $L2$ ...
go_editor
11.9k
views
go_editor
asked
Sep 30, 2014
Theory of Computation
gatecse-2010
theory-of-computation
context-free-language
identify-class-language
normal
+
–
68
votes
10
answers
27
GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular express...
go_editor
22.4k
views
go_editor
asked
Sep 30, 2014
Theory of Computation
gatecse-2010
theory-of-computation
regular-expression
normal
+
–
40
votes
2
answers
28
GATE CSE 2010 | Question: 38
The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1)
The grammar $ S \to aSa \mid bS \mid c$ is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)
go_editor
12.9k
views
go_editor
asked
Sep 30, 2014
Compiler Design
gatecse-2010
compiler-design
grammar
normal
+
–
64
votes
7
answers
29
GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
The program below uses six temporary variables $a, b, c, d, e, f$.a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + fAssuming tha...
go_editor
21.8k
views
go_editor
asked
Sep 30, 2014
Compiler Design
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
+
–
41
votes
2
answers
30
GATE CSE 2010 | Question: 36
The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. typedef struct node { int value; struct node *next; ... $q \rightarrow next = NULL; p \rightarrow next = head; head = p$;
The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified l...
go_editor
10.9k
views
go_editor
asked
Sep 30, 2014
DS
gatecse-2010
data-structures
linked-list
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register