menu
Recent questions tagged gate2010
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2010
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2010
0
votes
0
answers
27
views
GATE2010-48 Video Solution
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$ ... ? $2 \hspace{0.1cm} nanoseconds$ $20 \hspace{0.1cm} nanoseconds$ $22 \hspace{0.1cm}nanoseconds$ $88 \hspace{0.1cm} nanoseconds$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
27
views
gate2010
co-and-architecture
cache-memory
normal
barc2017
video-solution
0
votes
0
answers
17
views
GATE2010-46 Video Solution
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$ ... 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$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
17
views
gate2010
operating-system
resource-allocation
normal
video-solution
0
votes
0
answers
14
views
GATE2010-49 Video Solution
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$ ... $888 \hspace{0.1cm} \text{nanoseconds}$ $902 \hspace{0.1cm} \text{nanoseconds}$ $968 \hspace{0.1cm} \text{nanoseconds}$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
14
views
gate2010
co-and-architecture
cache-memory
normal
video-solution
0
votes
0
answers
25
views
GATE2010-65 Video Solution
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$
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
25
views
gate2010
numerical-ability
combinatory
normal
video-solution
0
votes
0
answers
15
views
GATE2010-33 Video Solution
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ADD ... $13$ $15$ $17$ $19$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
15
views
gate2010
co-and-architecture
pipelining
normal
video-solution
0
votes
0
answers
9
views
GATE2010-20 Video Solution
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? 2-phase locking Time-stamp ordering I only II only Both I and II Neither I nor II
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
9
views
gate2010
databases
transactions
normal
video-solution
0
votes
0
answers
15
views
GATE2010-32 Video Solution
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
15
views
gate2010
digital-logic
circuit-output
normal
video-solution
0
votes
0
answers
23
views
GATE2010-7 Video Solution
The main memory unit with a capacity of $4$ $\text{megabytes}$ is built using $1M \times$ $\text{1-bit}$ DRAM chips. Each DRAM chip has 1K rows of cells with $1K$ cells in each row. The time taken for a single refresh operation is $100$ ... the memory unit is $100$ nanoseconds $100\times 2^{10}$ nanoseconds $100\times 2^{20}$ nanoseconds $3200\times 2^{20}$ nanoseconds
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
23
views
gate2010
digital-logic
memory-interfacing
normal
video-solution
0
votes
0
answers
28
views
GATE2010-34 Video Solution
The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ denote the ... $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
28
views
gate2010
algorithms
dynamic-programming
normal
video-solution
0
votes
0
answers
18
views
GATE2010-53 Video Solution
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$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
18
views
data-structures
hashing
normal
gate2010
video-solution
0
votes
0
answers
17
views
GATE2010-45 Video Solution
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
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
17
views
gate2010
operating-system
process-synchronization
normal
video-solution
1
vote
1
answer
34
views
GATE2010-18 Video Solution
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
34
views
gate2010
databases
b-tree
easy
video-solution
0
votes
0
answers
36
views
GATE2010-54 Video Solution
Consider a network with $6$ routers $R1$ to $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 routing table initialized ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
36
views
gate2010
computer-networks
routing
distance-vector-routing
normal
video-solution
1
vote
0
answers
103
views
GATE2010-37 Video Solution
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$
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
103
views
gate2010
compiler-design
target-code-generation
register-allocation
normal
video-solution
0
votes
0
answers
15
views
GATE2010-50 Video Solution
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\}$ ... minimum 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$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
15
views
gate2010
algorithms
spanning-tree
normal
video-solution
0
votes
0
answers
16
views
GATE2010-27 Video Solution
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$? $\left(\dfrac{1}{625}\right)$ $\left(\dfrac{4}{625}\right)$ $\left(\dfrac{12}{625}\right)$ $\left(\dfrac{16}{625}\right)$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
16
views
gate2010
probability
normal
video-solution
0
votes
0
answers
22
views
GATE2010-41 Video Solution
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}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
22
views
gate2010
theory-of-computation
finite-automata
normal
minimal-state-automata
video-solution
0
votes
0
answers
34
views
GATE2010-28 Video Solution
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? $7, 6, 5, 4, 4, 3, 2, 1$ $6, 6, 6, 6, 3, 3, 2, 2$ $7, 6, 6, 4, 4, 3, 2, 2$ $8, 7, 7, 6, 4, 2, 1, 1$ I and II III and IV IV only II and IV
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
34
views
gate2010
graph-theory
degree-of-graph
video-solution
0
votes
0
answers
19
views
GATE2010-23 Video Solution
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
19
views
gate2010
operating-system
process-synchronization
normal
video-solution
0
votes
0
answers
16
views
GATE2010-39 Video Solution
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^*$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2010
theory-of-computation
regular-expressions
normal
video-solution
0
votes
0
answers
22
views
GATE2010-30 Video Solution
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can fool ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
admin
asked
in
Mathematical Logic
Apr 18, 2020
by
admin
585
points
22
views
gate2010
mathematical-logic
easy
first-order-logic
video-solution
0
votes
0
answers
16
views
GATE2010-8 Video Solution
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is $(C3D8)_{16}$ $(187B)_{16}$ $(F878)_{16}$ $(987B)_{16}$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
16
views
gate2010
digital-logic
number-representation
normal
video-solution
0
votes
0
answers
20
views
GATE2010-17 Video Solution
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ ... $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
20
views
gate2010
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
normal
video-solution
0
votes
0
answers
14
views
GATE2010-51 Video Solution
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$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
14
views
gate2010
normal
algorithms
spanning-tree
video-solution
0
votes
0
answers
25
views
GATE2010-21,ISRO2017-60 Video Solution
The cyclomatic complexity of each of the modules A and B shown below is 10. What is the cyclomatic complexity of the sequential integration shown on the right hand side? 19 21 20 10
admin
asked
in
IS&Software Engineering
Apr 18, 2020
by
admin
585
points
25
views
gate2010
is&software-engineering
cyclomatic-complexity
easy
isro2017
video-solution
0
votes
0
answers
31
views
GATE2010-55 Video Solution
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$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
31
views
gate2010
computer-networks
routing
distance-vector-routing
normal
video-solution
0
votes
0
answers
16
views
GATE2010-10 Video Solution
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
16
views
gate2010
data-structures
binary-tree
normal
video-solution
0
votes
0
answers
19
views
GATE2010-12 Video Solution
Two alternative packages $A$ and $B$ are available for processing a database having $10^k$ records. Package $A$ requires $0.0001 n^2$ time units and package $B$ requires $10n\log_{10} n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
19
views
gate2010
algorithms
time-complexity
easy
video-solution
0
votes
0
answers
43
views
GATE2010-31 Video Solution
What is the boolean expression for the output $f$ of the combinational logic circuit of NOR gates given below? $\overline{Q+R}$ $\overline{P+Q}$ $\overline{P+R}$ $\overline{P+Q+R}$
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
43
views
gate2010
digital-logic
circuit-output
normal
video-solution
0
votes
0
answers
33
views
GATE2010-62 Video Solution
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on 1st January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the following facts: ... is not the youngest. There are no twins. In what order they were born (oldest first)? $HSIG$ $SGHI$ $IGSH$ $IHSG$
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
33
views
gate2010
numerical-ability
logical-reasoning
normal
video-solution
0
votes
0
answers
19
views
GATE2010-47 Video Solution
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$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
19
views
gate2010
computer-networks
subnetting
easy
video-solution
0
votes
0
answers
18
views
GATE2010-1 Video Solution
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $| S| = 2| T |$ $| S | = | T | - 1$ $| S| = | T | $ $| S | = | T| + 1$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
18
views
gate2010
graph-theory
normal
trees
video-solution
0
votes
0
answers
18
views
GATE2010-43 Video Solution
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$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
18
views
gate2010
databases
normal
natural-join
database-normalization
video-solution
0
votes
0
answers
15
views
GATE2010-40 Video Solution
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
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
15
views
gate2010
theory-of-computation
context-free-languages
identify-class-language
normal
video-solution
0
votes
0
answers
25
views
GATE2010-61 Video Solution
If $137 + 276 = 435$ how much is $731+672?$ $534$ $1403$ $1623$ $1513$
admin
asked
in
Numerical Ability
Apr 18, 2020
by
admin
585
points
25
views
gate2010
numerical-ability
normal
logical-reasoning
video-solution
0
votes
0
answers
20
views
GATE2010-25 Video Solution
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
20
views
gate2010
operating-system
process-scheduling
easy
video-solution
0
votes
0
answers
17
views
GATE2010-42 Video Solution
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$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
17
views
gate2010
databases
transactions
normal
video-solution
0
votes
0
answers
18
views
GATE2010-38 Video Solution
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)
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
18
views
gate2010
compiler-design
grammar
normal
video-solution
0
votes
0
answers
25
views
GATE2010-24 Video Solution
A system uses FIFO policy for system replacement. It has $4$ page frames with no pages loaded to begin with. The system first accesses $100$ distinct pages in some order and then accesses the same $100$ pages but now in the reverse order. How many page faults will occur? $196$ $192$ $197$ $195$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
25
views
gate2010
operating-system
page-replacement
normal
video-solution
0
votes
0
answers
30
views
GATE2010-36 Video Solution
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$;
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
30
views
gate2010
data-structures
linked-lists
normal
video-solution
Page:
1
2
next »
Ask a Question
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts