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-2014-set2
62
votes
4
answers
1
GATE CSE 2014 Set 2 | Question: 55
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for $100$ nanoseconds (ns) by the data, address, and control signals. ... bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________
go_editor
asked
in
Operating System
Sep 28, 2014
by
go_editor
16.9k
views
gatecse-2014-set2
operating-system
memory-management
numerical-answers
normal
71
votes
6
answers
2
GATE CSE 2014 Set 2 | Question: 54
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R. ... a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R
go_editor
asked
in
Databases
Sep 28, 2014
by
go_editor
14.7k
views
gatecse-2014-set2
databases
sql
normal
25
votes
5
answers
3
GATE CSE 2014 Set 2 | Question: 53
Which one of the following Boolean expressions is NOT a tautology? $((\,a\,\to\,b\,)\,\wedge\,(\,b\,\to\,c))\,\to\,(\,a\,\to\,c)$ $(\,a\,\to\,c\,)\,\to\,(\,\sim b\,\to\,(a\,\wedge\,c))$ $(\,a\,\wedge\,b\,\wedge\,c)\,\to\,(\,c\vee\,a)$ $a\,\to\,(b\,\to\,a)$
go_editor
asked
in
Mathematical Logic
Sep 28, 2014
by
go_editor
7.0k
views
gatecse-2014-set2
mathematical-logic
propositional-logic
normal
41
votes
3
answers
4
GATE CSE 2014 Set 2 | Question: 52
The number of distinct minimum spanning trees for the weighted graph below is _____
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
10.5k
views
gatecse-2014-set2
algorithms
spanning-tree
numerical-answers
normal
41
votes
6
answers
5
GATE CSE 2014 Set 2 | Question: 51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
go_editor
asked
in
Graph Theory
Sep 28, 2014
by
go_editor
13.9k
views
gatecse-2014-set2
graph-theory
numerical-answers
normal
graph-isomorphism
non-gate
66
votes
7
answers
6
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
go_editor
asked
in
Set Theory & Algebra
Sep 28, 2014
by
go_editor
11.3k
views
gatecse-2014-set2
set-theory&algebra
normal
set-theory
24
votes
3
answers
7
GATE CSE 2014 Set 2 | Question: 49
The number of distinct positive integral factors of $2014$ is _____________
go_editor
asked
in
Set Theory & Algebra
Sep 28, 2014
by
go_editor
7.5k
views
gatecse-2014-set2
set-theory&algebra
easy
numerical-answers
number-theory
32
votes
4
answers
8
GATE CSE 2014 Set 2 | Question: 48
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
go_editor
asked
in
Probability
Sep 28, 2014
by
go_editor
10.1k
views
gatecse-2014-set2
probability
numerical-answers
normal
78
votes
9
answers
9
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
go_editor
asked
in
Linear Algebra
Sep 28, 2014
by
go_editor
28.5k
views
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
7
votes
1
answer
10
GATE CSE 2014 Set 2 | Question: 46
In the Newton-Raphson method, an initial guess of $x_0= 2 $ is made and the sequence $x_0,x_1,x_2\:\dots$ is obtained for the function $0.75x^3-2x^2-2x+4=0$ Consider the statements $x_3\:=\:0$ The method converges to a solution in a finite number of iterations. Which of the following is TRUE? Only I Only II Both I and II Neither I nor II
go_editor
asked
in
Numerical Methods
Sep 28, 2014
by
go_editor
1.4k
views
gatecse-2014-set2
numerical-methods
newton-raphson
normal
non-gate
34
votes
5
answers
11
GATE CSE 2014 Set 2 | Question: 45
The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ for biased exponent and ... . The representation of $X$ in hexadecimal notation is $\text{C1640000H}$ $\text{416C0000H}$ $\text{41640000H}$ $\text{C16C0000H}$
go_editor
asked
in
Digital Logic
Sep 28, 2014
by
go_editor
8.9k
views
gatecse-2014-set2
digital-logic
number-representation
normal
ieee-representation
36
votes
2
answers
12
GATE CSE 2014 Set 2 | Question: 44
If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected? Width of tag comparator Width of set index decoder Width of way selection multiplexer Width of processor to main memory data bus
go_editor
asked
in
CO and Architecture
Sep 28, 2014
by
go_editor
7.9k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
71
votes
4
answers
13
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
go_editor
asked
in
CO and Architecture
Sep 28, 2014
by
go_editor
16.0k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
34
votes
4
answers
14
GATE CSE 2014 Set 2 | Question: 42
Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE? The function returns $0$ for all ... . The function returns $0$ when $j = 50$. The function will exhaust the runtime stack or run into an infinite loop when $j = 50$.
go_editor
asked
in
Programming
Sep 28, 2014
by
go_editor
7.0k
views
gatecse-2014-set2
programming
programming-in-c
44
votes
8
answers
15
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
go_editor
asked
in
DS
Sep 28, 2014
by
go_editor
19.2k
views
gatecse-2014-set2
data-structures
stack
easy
47
votes
2
answers
16
GATE CSE 2014 Set 2 | Question: 40
Consider the following function. double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value $q$ (to $2$ decimals) such that $f(q)$ will return $q$:_____.
go_editor
asked
in
Programming
Sep 28, 2014
by
go_editor
10.3k
views
gatecse-2014-set2
programming
recursion
numerical-answers
normal
41
votes
7
answers
17
GATE CSE 2014 Set 2 | Question: 39
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.
go_editor
asked
in
Compiler Design
Sep 28, 2014
by
go_editor
6.7k
views
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
73
votes
8
answers
18
GATE CSE 2014 Set 2 | Question: 38
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
19.6k
views
gatecse-2014-set2
algorithms
sorting
normal
numerical-answers
40
votes
7
answers
19
GATE CSE 2014 Set 2 | Question: 37
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
12.4k
views
gatecse-2014-set2
algorithms
normal
numerical-answers
dynamic-programming
103
votes
6
answers
20
GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
19.0k
views
gatecse-2014-set2
theory-of-computation
normal
regular-language
87
votes
5
answers
21
GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
23.5k
views
gatecse-2014-set2
theory-of-computation
turing-machine
normal
89
votes
9
answers
22
GATE CSE 2014 Set 2 | Question: 34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 ... as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
go_editor
asked
in
Compiler Design
Sep 28, 2014
by
go_editor
18.2k
views
gatecse-2014-set2
compiler-design
intermediate-code
programming-in-c
normal
68
votes
10
answers
23
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
go_editor
asked
in
Operating System
Sep 28, 2014
by
go_editor
21.5k
views
gatecse-2014-set2
operating-system
page-replacement
ambiguous
40
votes
4
answers
24
GATE CSE 2014 Set 2 | Question: 32
Three processes $A$, $B$ and $C$ each execute a loop of $100$ iterations. In each iteration of the loop, a process performs a single computation that requires $t_c$ CPU milliseconds and then initiates a single I/O operation that lasts ... slice of $50$ milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.
go_editor
asked
in
Operating System
Sep 28, 2014
by
go_editor
8.5k
views
gatecse-2014-set2
operating-system
process-scheduling
numerical-answers
normal
41
votes
3
answers
25
GATE CSE 2014 Set 2 | Question: 31
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while( ... the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlock-free operation.
go_editor
asked
in
Operating System
Sep 28, 2014
by
go_editor
10.2k
views
gatecse-2014-set2
operating-system
process-synchronization
normal
39
votes
6
answers
26
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
go_editor
asked
in
Databases
Sep 28, 2014
by
go_editor
16.1k
views
gatecse-2014-set2
databases
normal
joins
49
votes
3
answers
27
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
go_editor
asked
in
Databases
Sep 28, 2014
by
go_editor
23.1k
views
gatecse-2014-set2
databases
transaction-and-concurrency
normal
11
votes
3
answers
28
GATE CSE 2014 Set 2 | Question: 28
A graphical HTML browser resident at a network client machine $Q$ accesses a static HTML webpage from a HTTP server $S$. The static HTML page has exactly one static embedded image which is also at $S$. Assuming no caching, which one of the following ... HTTP request from $Q$ to $S$ is sufficient, and this is possible without any TCP connection between $Q$ and $S$
go_editor
asked
in
Web Technologies
Sep 28, 2014
by
go_editor
5.2k
views
gatecse-2014-set2
web-technologies
html
easy
50
votes
5
answers
29
GATE CSE 2014 Set 2 | Question: 27
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$. $Q-R1-R2-R3-H$ $H$ acts as an $\text{HTTP}\ server$, and $Q$ connects to $H$ via $\text{HTTP}$ and downloads a file. Session layer ... $R2$ alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$
go_editor
asked
in
Computer Networks
Sep 28, 2014
by
go_editor
11.2k
views
gatecse-2014-set2
computer-networks
network-security
normal
out-of-gate-syllabus
53
votes
4
answers
30
GATE CSE 2014 Set 2 | Question: 26
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is $10^6$ bytes / sec. A user on host $A$ sends a file of size $10^3$ bytes to host $B$ through routers $R1$ and $R2$ in three different ways. ... . Which one of the following is CORRECT? $T1<T2<T3$ $T1>T2>T3$ $T2=T3, T3<T1$ $T1=T3, T3> T2$
go_editor
asked
in
Computer Networks
Sep 28, 2014
by
go_editor
14.9k
views
gatecse-2014-set2
computer-networks
network-switching
normal
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged gatecse-2014-set2
Recent Blog Comments
please add GO Classes 2023 Computer Networks...
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...