menu
Recent questions tagged gate2012
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged gate2012
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged gate2012
0
votes
0
answers
37
views
GATE2012-45 Video Solution
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... . Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
37
views
gate2012
computer-networks
congestion-control
normal
video-solution
0
votes
0
answers
32
views
GATE2012-38 Video Solution
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
32
views
gate2012
graph-theory
normal
marks-to-all
counting
video-solution
0
votes
0
answers
35
views
GATE2012-32 Video Solution
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
35
views
gate2012
operating-system
process-synchronization
normal
video-solution
0
votes
0
answers
30
views
GATE2012-15 Video Solution
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used in ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
30
views
gate2012
databases
easy
sql
ambiguous
video-solution
0
votes
0
answers
32
views
GATE2012-34, ISRO-DEC2017-32 Video Solution
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
32
views
gate2012
computer-networks
subnetting
normal
isrodec2017
video-solution
0
votes
0
answers
24
views
GATE2012-39 Video Solution
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
24
views
gate2012
algorithms
sorting
normal
video-solution
1
vote
1
answer
24
views
GATE2012-50 Video Solution
Consider the following relations $A, B$ and $C:$ ... is the same as that of $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
24
views
gate2012
databases
joins
normal
video-solution
0
votes
0
answers
22
views
GATE2012-33 Video Solution
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
22
views
gate2012
probability
conditional-probability
normal
video-solution
1
vote
1
answer
26
views
GATE2012-44 Video Solution
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
26
views
gate2012
computer-networks
communication
normal
video-solution
0
votes
0
answers
30
views
GATE2012-40 Video Solution
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices $S$ and $T$. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex $v$ is updated only when a strictly shorter path to $v$ is discovered. $\text{SDT}$ $\text{SBDT}$ $\text{SACDT}$ $\text{SACET}$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
30
views
gate2012
algorithms
graph-algorithms
normal
video-solution
0
votes
0
answers
20
views
GATE2012-41 Video Solution
A file system with $300$ GByte disk uses a file descriptor with $8$ direct block addresses, $1$ indirect block address and $1$ doubly indirect block address. The size of each disk block is $128$ Bytes and the size of each disk block address is $8$ Bytes. ... file size in this file system is $3$ KBytes $35$ KBytes $280$ KBytes dependent on the size of the disk
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
20
views
gate2012
operating-system
disks
normal
video-solution
1
vote
1
answer
30
views
GATE2012-27 Video Solution
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
30
views
gate2012
databases
transactions
normal
video-solution
0
votes
0
answers
18
views
GATE2012-35 Video Solution
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
18
views
gate2012
data-structures
queue
normal
video-solution
0
votes
0
answers
21
views
GATE2012-29 Video Solution
Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ and $t'$. Which of the ... $T' = T$ with total weight $t' < t^2$ $T' \neq T$ but total weight $t' = t^2$ None of the above
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
21
views
gate2012
algorithms
spanning-tree
normal
marks-to-all
video-solution
0
votes
0
answers
26
views
GATE2012-20, ISRO2016-23 Video Solution
Register renaming is done in pipelined processors: as an alternative to register allocation at compile time for efficient access to function parameters and local variables to handle certain kinds of hazards as part of address translation
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
26
views
gate2012
co-and-architecture
pipelining
easy
isro2016
video-solution
0
votes
0
answers
14
views
GATE2012-19 Video Solution
The amount of ROM needed to implement a $4-bit$ multiplier is $64$ bits $128$ bits $1$ Kbits $2$ Kbits
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
14
views
gate2012
digital-logic
normal
rom
video-solution
0
votes
0
answers
16
views
GATE2012-12 Video Solution
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2012
finite-automata
easy
theory-of-computation
video-solution
0
votes
0
answers
22
views
GATE2012-54 Video Solution
A computer has a $256\text{-KByte}$, 4-way set associative, write back data cache with block size of $32\text{-Bytes}$. The processor sends $32\text{-bit}$ ... bit and $1$ replacement bit. The number of bits in the tag field of an address is $11$ $14$ $16$ $27$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
22
views
gate2012
co-and-architecture
cache-memory
normal
video-solution
0
votes
0
answers
30
views
GATE2012-9 Video Solution
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$
admin
asked
in
Calculus
Apr 18, 2020
by
admin
585
points
30
views
gate2012
calculus
maxima-minima
normal
nielit
video-solution
0
votes
0
answers
81
views
GATE2012-36 Video Solution
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... ... The correct set of activation records along with their access links is given by:
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
81
views
gate2012
compiler-design
runtime-environments
normal
video-solution
0
votes
0
answers
22
views
GATE2012-31 Video Solution
Consider the $3$ processes, $P1, P2$ and $P3$ ... $P1, P3, P2$ FCFS: $P1, P2, P3$ RR2: $P1, P3, P2$ FCFS: $P1, P3, P2$ RR2: $P1, P2, P3$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
22
views
gate2012
operating-system
process-scheduling
normal
video-solution
0
votes
0
answers
16
views
GATE2012-22 Video Solution
Which of the following transport layer protocols is used to support electronic mail? SMTP IP TCP UDP
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
16
views
gate2012
computer-networks
tcp
easy
video-solution
0
votes
0
answers
15
views
GATE2012-10 Video Solution
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
15
views
gate2012
computer-networks
application-layer-protocols
easy
video-solution
0
votes
0
answers
23
views
GATE2012-23 Video Solution
In the IPv4 addressing format, the number of networks allowed under Class $C$ addresses is: $2^{14}$ $2^{7}$ $2^{21}$ $2^{24}$
admin
asked
in
Computer Networks
Apr 18, 2020
by
admin
585
points
23
views
gate2012
computer-networks
ip-addressing
easy
video-solution
0
votes
0
answers
26
views
GATE2012-7 Video Solution
The decimal value $0.5$ in IEEE single precision floating point representation has fraction bits of $000\dots 000$ and exponent value of $0$ fraction bits of $000\dots 000$ and exponent value of $−1$ fraction bits of $100\dots 000$ and exponent value of $0$ no exact representation
admin
asked
in
Digital Logic
Apr 18, 2020
by
admin
585
points
26
views
gate2012
digital-logic
normal
number-representation
ieee-representation
video-solution
0
votes
0
answers
16
views
GATE2012-18 Video Solution
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
16
views
gate2012
algorithms
easy
asymptotic-notations
video-solution
0
votes
0
answers
23
views
GATE2012-46 Video Solution
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially completed ...
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
23
views
gate2012
theory-of-computation
finite-automata
normal
video-solution
0
votes
0
answers
20
views
GATE2012-51 Video Solution
Consider the following relations $A, B$ and $C:$ ... contain? SELECT A.Id FROM A WHERE A.Age > ALL (SELECT B.Age FROM B WHERE B.Name = Arun') $4$ $3$ $0$ $1$
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
20
views
gate2012
databases
sql
normal
video-solution
0
votes
0
answers
21
views
GATE2012-21 Video Solution
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
admin
asked
in
Probability
Apr 18, 2020
by
admin
585
points
21
views
gate2012
probability
random-variable
easy
video-solution
0
votes
0
answers
22
views
GATE2012-5 Video Solution
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is $\Theta(n\log n)$ $\Theta(n2^n)$ $\Theta(n)$ $\Theta(\log n)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
22
views
gate2012
data-structures
normal
binary-search-tree
video-solution
0
votes
0
answers
14
views
GATE2012-16 Video Solution
The recurrence relation capturing the optimal execution time of the $Towers \ of \ Hanoi$ problem with $n$ discs is $T(n) = 2T(n − 2) + 2$ $T (n) = 2T(n − 1) + n$ $T (n) = 2T(n/2) + 1$ $T (n) = 2T(n − 1) + 1$
admin
asked
in
Algorithms
Apr 18, 2020
by
admin
585
points
14
views
gate2012
algorithms
easy
recurrence
video-solution
0
votes
0
answers
16
views
GATE2012-48 Video Solution
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += ++ ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$
admin
asked
in
Programming
Apr 18, 2020
by
admin
585
points
16
views
gate2012
programming
programming-in-c
normal
video-solution
0
votes
0
answers
21
views
GATE2012-47 Video Solution
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. int height(treeptr n) { if(n == NULL) return -1; ... ; B2: $\max(h1, h2) $ B1: $(1+ \text{height}(n \to \text{ right}))$ ; B2: $\max(h1, h2)$
admin
asked
in
DS
Apr 18, 2020
by
admin
585
points
21
views
gate2012
data-structures
binary-tree
normal
video-solution
0
votes
0
answers
23
views
GATE2012-55 Video Solution
A computer has a $256$-$\text{KByte}$, 4-way set associative, write back data cache with block size of $32$ $\text{Bytes}$. The processor sends $32$ $\text{bit}$ addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, ... tag directory is: $160$ $\text{Kbits}$ $136$ $\text{Kbits}$ $40$ $\text{Kbits}$ $32$ $\text{Kbits}$
admin
asked
in
CO & Architecture
Apr 18, 2020
by
admin
585
points
23
views
normal
gate2012
co-and-architecture
cache-memory
video-solution
0
votes
0
answers
19
views
GATE2012-53 Video Solution
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$
admin
asked
in
Compiler Design
Apr 18, 2020
by
admin
585
points
19
views
normal
gate2012
compiler-design
parsing
video-solution
0
votes
0
answers
24
views
GATE2012-24 Video Solution
Which of the following problems are decidable? Does a given program ever produce an output? If $L$ is a context-free language, then, is $\bar{L}$ also context-free? If $L$ is a regular language, then, is $\bar{L}$ also regular? If $L$ is a recursive language, then, is $\bar{L}$ also recursive? $1, 2, 3, 4$ $1, 2$ $2, 3, 4$ $3, 4$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
24
views
gate2012
theory-of-computation
decidability
normal
video-solution
0
votes
0
answers
20
views
GATE2012-8 Video Solution
A process executes the code fork(); fork(); fork(); The total number of child processes created is $3$ $4$ $7$ $8$
admin
asked
in
Operating System
Apr 18, 2020
by
admin
585
points
20
views
gate2012
operating-system
easy
fork
video-solution
0
votes
0
answers
16
views
GATE2012-4 Video Solution
Assuming $P \neq NP$, which of the following is TRUE? $NP- \ complete = NP$ $NP-complete \cap P = \phi$ $NP-hard = NP$ $P = NP-complete$
admin
asked
in
Theory of Computation
Apr 18, 2020
by
admin
585
points
16
views
gate2012
theory-of-computation
p-np-npc-nph
video-solution
0
votes
0
answers
24
views
GATE2012-2 Video Solution
Which of the following is TRUE? Every relation in 3NF is also in BCNF A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R Every relation in BCNF is also in 3NF No relation can be in both BCNF and 3NF
admin
asked
in
Databases
Apr 18, 2020
by
admin
585
points
24
views
gate2012
databases
easy
database-normalization
video-solution
0
votes
0
answers
18
views
GATE2012-11 Video Solution
Let A be the $ 2 × 2 $ matrix with elements $a_{11} = a_{12} = a_{21} = +1 $ and $ a_{22} = −1 $ . Then the eigenvalues of the matrix $A^{19}$ are $1024$ and $−1024$ $1024\sqrt{2}$ and $−1024 \sqrt{2}$ $4 \sqrt{2}$ and $−4 \sqrt{2}$ $512 \sqrt{2}$ and $−512 \sqrt{2}$
admin
asked
in
Linear Algebra
Apr 18, 2020
by
admin
585
points
18
views
gate2012
linear-algebra
eigen-value
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