Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged gate20152
0
votes
1
answer
GATE2015248 Video Solution
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... binary adder is implemented by using four full adders. The total propagation time of this 4bit binary adder in microseconds is ______.
asked
Apr 18
in
Digital Logic
by
admin
(
193
points)

28
views
gate20152
digitallogic
adder
normal
numericalanswers
videosolution
0
votes
0
answers
GATE201527 Video Solution
The minimum number of JK flipflops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0, ...) is _______.
asked
Apr 18
in
Digital Logic
by
admin
(
193
points)

9
views
gate20152
digitallogic
digitalcounter
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015234 Video Solution
Assume that the bandwidth for a $TCP$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $TCP$ window scale option is needed. Let $\beta$ be the maximum possible window size with ... $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$
asked
Apr 18
in
Computer Networks
by
admin
(
193
points)

8
views
gate20152
computernetworks
difficult
tcp
videosolution
0
votes
0
answers
GATE2015244 Video Solution
Consider the sequence of machine instruction given below: ... operand forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
asked
Apr 18
in
CO & Architecture
by
admin
(
193
points)

7
views
gate20152
coandarchitecture
pipelining
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015223 Video Solution
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
asked
Apr 18
in
Operating System
by
admin
(
193
points)

6
views
gate20152
operatingsystem
resourceallocation
easy
videosolution
0
votes
0
answers
GATE2015252 Video Solution
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ header ... will be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
asked
Apr 18
in
Computer Networks
by
admin
(
193
points)

6
views
gate20152
computernetworks
ippacket
normal
videosolution
0
votes
0
answers
GATE2015240 Video Solution
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
asked
Apr 18
in
Set Theory & Algebra
by
admin
(
193
points)

2
views
gate20152
settheory&algebra
functions
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015246 Video Solution
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); (write, ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
asked
Apr 18
in
Databases
by
admin
(
193
points)

7
views
gate20152
databases
transactions
normal
videosolution
0
votes
0
answers
GATE2015255 Video Solution
Which one of the following wellformed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
asked
Apr 18
in
Mathematical Logic
by
admin
(
193
points)

3
views
gate20152
mathematicallogic
normal
firstorderlogic
videosolution
0
votes
0
answers
GATE2015247 Video Solution
A computer system implements $8$ $\text{kilobyte}$ pages and a $32bit$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24$ $\text{megabytes}$, the length of the virtual address supported by the system is _______ bits.
asked
Apr 18
in
Operating System
by
admin
(
193
points)

3
views
gate20152
operatingsystem
virtualmemory
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015211 Video Solution
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (nk); return x; } The return value of $fun(5)$ is ______.
asked
Apr 18
in
Algorithms
by
admin
(
193
points)

11
views
gate20152
algorithms
identifyfunction
recurrence
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015225 Video Solution
A computer system implements a $40bit$ virtual address, page size of $8$ $\text{kilobytes}$, and a $128entry$ translation lookaside buffer ($TLB$) organized into $32$ sets each having $4$ ways. Assume that the $TLB$ tag does not store any process id. The minimum length of the $TLB$ tag in bits is ____.
asked
Apr 18
in
Operating System
by
admin
(
193
points)

3
views
gate20152
operatingsystem
virtualmemory
easy
numericalanswers
videosolution
0
votes
0
answers
GATE2015249 Video Solution
Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller's transfer time is $10$ times the disk transfer time, the average time (in milliseconds) to read or write a $512$byte sector of the disk is _____
asked
Apr 18
in
Operating System
by
admin
(
193
points)

5
views
gate20152
operatingsystem
disks
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015222 Video Solution
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
asked
Apr 18
in
Algorithms
by
admin
(
193
points)

4
views
gate20152
algorithms
timecomplexity
easy
videosolution
0
votes
0
answers
GATE2015226 Video Solution
Let $f(x)=x^{\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the Xaxis, when $x$ varies from $1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[1, 1]$ $f$ is not bounded in $[1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
asked
Apr 18
in
Calculus
by
admin
(
193
points)

4
views
gate20152
continuity
functions
normal
videosolution
0
votes
0
answers
GATE2015242 Video Solution
Consider a processor with byteaddressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack pointer ( ... value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
asked
Apr 18
in
CO & Architecture
by
admin
(
193
points)

16
views
gate20152
coandarchitecture
machineinstructions
easy
videosolution
0
votes
0
answers
GATE2015210 Video Solution
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
asked
Apr 18
in
DS
by
admin
(
193
points)

5
views
gate20152
datastructures
binarytree
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015237 Video Solution
The number of minterms after minimizing the following Boolean expression is _______. [D'+AB'+A'C+AC'D+A'C'D]'
asked
Apr 18
in
Digital Logic
by
admin
(
193
points)

3
views
gate20152
digitallogic
booleanalgebra
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015235 Video Solution
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding nonterminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... ? $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
asked
Apr 18
in
Theory of Computation
by
admin
(
193
points)

7
views
gate20152
theoryofcomputation
regulargrammar
normal
videosolution
0
votes
0
answers
GATE20152GA7 Video Solution
Four branches of a company are located at $M$, $N$, $O$ and $P$. $M$ is north of $N$ at a distance of $4 km$; $P$ is south of $O$ at a distance of $2$ $km$; $N$ is southeast of O by $1 km$. What is the distance between $M$ and $P$ in $km$? $5.34$ $6.74$ $28.5$ $45.49$
asked
Apr 18
in
Numerical Ability
by
admin
(
193
points)

4
views
gate20152
numericalability
normal
directionsense
videosolution
0
votes
0
answers
GATE20152GA8 Video Solution
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$
asked
Apr 18
in
Numerical Ability
by
admin
(
193
points)

3
views
gate20152
numericalability
geometry
difficult
videosolution
0
votes
0
answers
GATE2015245 Video Solution
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the left ... and $(a, $ left_end$, k)$ $(a, n$left_end$1, k$left_end$1)$ and $(a, $left_end$, k)$
asked
Apr 18
in
Algorithms
by
admin
(
193
points)

4
views
gate20152
algorithms
normal
sorting
videosolution
0
votes
0
answers
GATE2015217 Video Solution
Consider a complete binary tree where the left and right subtrees of the root are maxheaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
asked
Apr 18
in
DS
by
admin
(
193
points)

2
views
gate20152
datastructures
heap
normal
videosolution
0
votes
0
answers
GATE2015233 Video Solution
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$
asked
Apr 18
in
DS
by
admin
(
193
points)

4
views
gate20152
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE2015224 Video Solution
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.
asked
Apr 18
in
CO & Architecture
by
admin
(
193
points)

6
views
gate20152
coandarchitecture
cachememory
easy
numericalanswers
videosolution
0
votes
0
answers
GATE201528 Video Solution
A link has transmission speed of $10^6$ bits/sec. It uses data packets of size $1000$ $\text{bytes}$ each. Assume that the acknowledgment has negligible transmission delay and that its propagation delay is the same as the data propagation delay. Also ... $\text{%}$. The value of the one way propagation delay (in milliseconds) is_____.
asked
Apr 18
in
Computer Networks
by
admin
(
193
points)

3
views
gate20152
computernetworks
macprotocol
stopandwait
normal
numericalanswers
videosolution
0
votes
0
answers
GATE201526 Video Solution
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.
asked
Apr 18
in
Databases
by
admin
(
193
points)

3
views
gate20152
databases
btree
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015215 Video Solution
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
asked
Apr 18
in
Programming
by
admin
(
193
points)

3
views
gate20152
programming
programminginc
normal
videosolution
0
votes
0
answers
GATE2015221 Video Solution
Consider the following statements. The complement of every Turing decidable language is Turing decidable There exists some language which is in NP but is not Turing decidable If L is a language in NP, L is Turing decidable Which of the above statements is/are true? Only II Only III Only I and II Only I and III
asked
Apr 18
in
Theory of Computation
by
admin
(
193
points)

4
views
gate20152
theoryofcomputation
decidability
easy
videosolution
0
votes
0
answers
GATE2015231 Video Solution
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... . The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
asked
Apr 18
in
DS
by
admin
(
193
points)

3
views
gate20152
databases
arrays
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2015241 Video Solution
Consider the following routing table at an IP router: $\begin{array}{lll} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96.170.0} & \text{255.255.254.0} & \text{Interface $ ... iic, iiie, ivd ia, iid, iiib, ive ib, iic, iiid, ive ib, iic, iiie, ivd
asked
Apr 18
in
Computer Networks
by
admin
(
193
points)

3
views
gate20152
computernetworks
subnetting
easy
videosolution
0
votes
0
answers
GATE2015250 Video Solution
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
asked
Apr 18
in
Graph Theory
by
admin
(
193
points)

4
views
gate20152
graphtheory
graphconnectivity
easy
videosolution
0
votes
0
answers
GATE2015251 Video Solution
Which of the following is/are regular languages? $L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } w, x > 0\right\}, w^R \text{ is the reverse of string } w$ $L_2: \left\{ a^nb^m \mid m \neq n \text { and } m, n \geq 0 \right\}$ $L_3: \left\{ a^pb^qc^r \mid p, q, r \geq 0 \right\}$ $L_1$ and $L_3$ only $L_2$ only $L_2$ and $L_3$ only $L_3$ only
asked
Apr 18
in
Theory of Computation
by
admin
(
193
points)

4
views
gate20152
theoryofcomputation
normal
regularlanguages
videosolution
0
votes
0
answers
GATE201529 Video Solution
The number of divisors of $2100$ is ____.
asked
Apr 18
in
Set Theory & Algebra
by
admin
(
193
points)

5
views
gate20152
settheory&algebra
numbertheory
easy
numericalanswers
videosolution
0
votes
0
answers
GATE2015214 Video Solution
In the context of abstractsyntaxtree (AST) and controlflowgraph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ is ... an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program
asked
Apr 18
in
Compiler Design
by
admin
(
193
points)

6
views
gate20152
compilerdesign
easy
abstractsyntaxtree
videosolution
0
votes
0
answers
GATE2015238 Video Solution
Consider the C program below #include <stdio.h> int *A, stkTop; int stkFunc (int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case 1: size = val; break; case 0: if (stkTop < size ) A[stkTop++]=val; break; default: if ... (0, 10); printf ("%d\n", stkFunc(1, 0)+ stkFunc(1, 0)); } The value printed by the above program is ________.
asked
Apr 18
in
DS
by
admin
(
193
points)

4
views
gate20152
datastructures
stack
easy
numericalanswers
videosolution
0
votes
0
answers
GATE2015253 Video Solution
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
asked
Apr 18
in
Theory of Computation
by
admin
(
193
points)

5
views
gate20152
theoryofcomputation
finiteautomata
normal
numericalanswers
minimalstateautomata
videosolution
0
votes
0
answers
GATE201521 Video Solution
Consider the following transaction involving two bank accounts $x$ and $y$. read(x); x:=x50; write (x); read(y); y:=y+50; write(y) The constraint that the sum of the accounts $x$ and $y$ should remain constant is that of Atomicity Consistency Isolation Durability
asked
Apr 18
in
Databases
by
admin
(
193
points)

8
views
gate20152
databases
transactions
easy
videosolution
0
votes
0
answers
GATE2015220 Video Solution
Identify the correct order in which a server process must invoke the function calls accept, bind, listen, and recv according to UNIX socket API. listen, accept, bind, recv bind, listen, accept, recv bind, accept, listen, recv accept, listen, bind, recv
asked
Apr 18
in
Computer Networks
by
admin
(
193
points)

2
views
gate20152
computernetworks
sockets
easy
videosolution
0
votes
0
answers
GATE2015254 Video Solution
Let $X$ and $Y$ denote the sets containing 2 and 20 distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be randomly chosen from $F$. The probability of $f$ being onetoone is ______.
asked
Apr 18
in
Set Theory & Algebra
by
admin
(
193
points)

5
views
gate20152
settheory&algebra
functions
normal
numericalanswers
videosolution
Page:
1
2
next »
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
Recent Blog Comments
Thanks, Can you tell me till when this might get...
8,430
questions
2,707
answers
13,232
comments
95,451
users