Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gatecse-2016-set2
94
votes
11
answers
1
GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
17.6k
views
gatecse-2016-set2
co-and-architecture
data-path
normal
numerical-answers
24
votes
1
answer
2
GATE CSE 2016 Set 2 | Question: 47
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. ... The average turn around time of these processes is ___________ milliseconds.
Akash Kanase
asked
in
Operating System
Feb 12, 2016
by
Akash Kanase
7.1k
views
gatecse-2016-set2
operating-system
process-scheduling
normal
numerical-answers
46
votes
4
answers
3
GATE CSE 2016 Set 2 | Question: 32
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
14.8k
views
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
83
votes
4
answers
4
GATE CSE 2016 Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$
Akash Kanase
asked
in
Algorithms
Feb 12, 2016
by
Akash Kanase
15.4k
views
gatecse-2016-set2
algorithms
graph-algorithms
normal
63
votes
6
answers
5
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
Akash Kanase
asked
in
Mathematical Logic
Feb 12, 2016
by
Akash Kanase
13.2k
views
gatecse-2016-set2
mathematical-logic
first-order-logic
normal
43
votes
5
answers
6
GATE CSE 2016 Set 2 | Question: 43
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are context-free. $L_{1}$ is context ... $L_{2}$ is context-free while $L_{1}$ is not context-free. Neither $L_{1}$ nor $L_{2}$ is context-free.
Akash Kanase
asked
in
Theory of Computation
Feb 12, 2016
by
Akash Kanase
16.0k
views
gatecse-2016-set2
theory-of-computation
context-free-language
normal
48
votes
1
answer
7
GATE CSE 2016 Set 2 | Question: 52
Consider the following database table named water_schemes: ... total_avg (capacity) as select avg (capacity) from total select name from total, total_avg where total.capacity ≥ total_avg.capacity
Akash Kanase
asked
in
Databases
Feb 12, 2016
by
Akash Kanase
8.3k
views
gatecse-2016-set2
databases
sql
normal
numerical-answers
48
votes
7
answers
8
GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions: $P:$ $R$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.
Akash Kanase
asked
in
Set Theory & Algebra
Feb 12, 2016
by
Akash Kanase
11.5k
views
gatecse-2016-set2
set-theory&algebra
relations
normal
36
votes
5
answers
9
GATE CSE 2016 Set 2 | Question: 37
Consider the following program: int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n-1), p[0] - p[1]); } int main () { int a[] = {3, 5, 2, 6, 4}; printf(" %d", f(a, 5)); } Note: $\max (x, y)$ returns the maximum of $x$ and $y$. The value printed by this program is ________.
Akash Kanase
asked
in
Programming
Feb 12, 2016
by
Akash Kanase
10.4k
views
gatecse-2016-set2
programming-in-c
normal
numerical-answers
recursion
64
votes
4
answers
10
GATE CSE 2016 Set 2 | Question: 31
Consider a processor with $64$ registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and twelve-bit immediate value. Each ... program has $100$ instructions, the amount of memory (in bytes) consumed by the program text is _________.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
16.9k
views
gatecse-2016-set2
instruction-format
machine-instructions
co-and-architecture
normal
numerical-answers
40
votes
8
answers
11
GATE CSE 2016 Set 2 | Question: 48
Consider the following two-process synchronization solution. ... synchronization solution. This solution violates mutual exclusion requirement. This solution violates progress requirement. This solution violates bounded wait requirement.
Akash Kanase
asked
in
Operating System
Feb 12, 2016
by
Akash Kanase
11.4k
views
gatecse-2016-set2
operating-system
process-synchronization
normal
40
votes
1
answer
12
GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2
Akash Kanase
asked
in
Compiler Design
Feb 12, 2016
by
Akash Kanase
6.7k
views
gatecse-2016-set2
compiler-design
grammar
normal
55
votes
6
answers
13
GATE CSE 2016 Set 2 | Question: 36
Consider the following New-order strategy for traversing a binary tree: Visit the root; Visit the right subtree using New-order; Visit the left subtree using New-order; The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is given ... $1 \ 7 \ 6 * + \ 2 \ 5 \ 4 \ 3 \ * \ - \wedge -$
Akash Kanase
asked
in
DS
Feb 12, 2016
by
Akash Kanase
13.0k
views
gatecse-2016-set2
data-structures
binary-tree
normal
101
votes
7
answers
14
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
Akash Kanase
asked
in
Theory of Computation
Feb 12, 2016
by
Akash Kanase
28.5k
views
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
82
votes
9
answers
15
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Akash Kanase
asked
in
Set Theory & Algebra
Feb 12, 2016
by
Akash Kanase
12.4k
views
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
37
votes
4
answers
16
GATE CSE 2016 Set 2 | Question: 45
Which one of the following grammars is free from left recursion? $S \rightarrow AB$ $A \rightarrow Aa \mid b$ $B \rightarrow c$ $S \rightarrow Ab \mid Bb \mid c$ $A \rightarrow Bd \mid \epsilon$ $B \rightarrow e$ $S \rightarrow Aa \mid B$ ... $ B \rightarrow d$ $S \rightarrow Aa \mid Bb \mid c$ $A \rightarrow Bd \mid \epsilon$ $B \rightarrow Ae \mid \epsilon$
Akash Kanase
asked
in
Compiler Design
Feb 12, 2016
by
Akash Kanase
7.9k
views
gatecse-2016-set2
compiler-design
grammar
easy
34
votes
3
answers
17
GATE CSE 2016 Set 2 | Question: 54
For the $\text{IEEE 802.11 MAC}$ protocol for wireless communication, which of the following statements is/are TRUE? At least three non-overlapping channels are available for transmissions. The RTS-CTS mechanism is used for collision detection. Unicast frames are ACKed. All I, II, and III I and III only II and III only II only
Akash Kanase
asked
in
Computer Networks
Feb 12, 2016
by
Akash Kanase
14.4k
views
gatecse-2016-set2
computer-networks
wifi
normal
57
votes
13
answers
18
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
11.2k
views
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
72
votes
3
answers
19
GATE CSE 2016 Set 2 | Question: 42
Consider the following two statements: If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false
Akash Kanase
asked
in
Theory of Computation
Feb 12, 2016
by
Akash Kanase
18.5k
views
gatecse-2016-set2
theory-of-computation
finite-automata
normal
57
votes
6
answers
20
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
Akash Kanase
asked
in
Databases
Feb 12, 2016
by
Akash Kanase
17.1k
views
gatecse-2016-set2
databases
transaction-and-concurrency
normal
30
votes
5
answers
21
GATE CSE 2016 Set 2 | Question: 53
A network has a data transmission bandwidth of $20 \times 10^{6}$ bits per second. It uses CSMA/CD in the MAC layer. The maximum signal propagation time from one node to another node is $40$ microseconds. The minimum size of a frame in the network is __________ bytes.
Akash Kanase
asked
in
Computer Networks
Feb 12, 2016
by
Akash Kanase
6.7k
views
gatecse-2016-set2
computer-networks
csma-cd
numerical-answers
normal
42
votes
8
answers
22
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
Akash Kanase
asked
in
Combinatory
Feb 12, 2016
by
Akash Kanase
13.7k
views
gatecse-2016-set2
modular-arithmetic
normal
numerical-answers
39
votes
7
answers
23
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
Akash Kanase
asked
in
Algorithms
Feb 12, 2016
by
Akash Kanase
17.5k
views
gatecse-2016-set2
dynamic-programming
algorithms
normal
numerical-answers
151
votes
16
answers
24
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
Akash Kanase
asked
in
DS
Feb 12, 2016
by
Akash Kanase
39.2k
views
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
62
votes
5
answers
25
GATE CSE 2016 Set 2 | Question: 34
A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.
Akash Kanase
asked
in
DS
Feb 12, 2016
by
Akash Kanase
21.2k
views
gatecse-2016-set2
data-structures
heap
normal
numerical-answers
58
votes
2
answers
26
GATE CSE 2016 Set 2 | Question: 39
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
Akash Kanase
asked
in
Algorithms
Feb 12, 2016
by
Akash Kanase
12.0k
views
gatecse-2016-set2
algorithms
time-complexity
recurrence-relation
normal
numerical-answers
70
votes
8
answers
27
GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
15.1k
views
gatecse-2016-set2
co-and-architecture
pipelining
normal
numerical-answers
46
votes
7
answers
28
GATE CSE 2016 Set 2 | Question: 35
The following function computes $X^{Y}$ for positive integers $X$ and $Y$. int exp (int X, int Y) { int res =1, a = X, b = Y; while (b != 0) { if (b % 2 == 0) {a = a * a; b = b/2; } else {res = res * a; b = b - 1; } } return res; } Which one of the following ... $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
Akash Kanase
asked
in
Programming
Feb 12, 2016
by
Akash Kanase
10.8k
views
gatecse-2016-set2
programming
loop-invariants
normal
49
votes
6
answers
29
GATE CSE 2016 Set 2 | Question: 55
Consider a $128 \times 10^3$ bits/second satellite communication link with one way propagation delay of $150$ milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of $1$ kilobyte ... acknowledgement. The minimum number of bits required for the sequence number field to achieve $100 \%$ utilization is ________.
Akash Kanase
asked
in
Computer Networks
Feb 12, 2016
by
Akash Kanase
17.3k
views
gatecse-2016-set2
computer-networks
sliding-window
normal
numerical-answers
44
votes
10
answers
30
GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______
Akash Kanase
asked
in
Operating System
Feb 12, 2016
by
Akash Kanase
12.3k
views
gatecse-2016-set2
operating-system
semaphore
normal
numerical-answers
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged gatecse-2016-set2
Recent Blog Comments
Great work
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...