Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2014-set1
70
70 votes
9
answers
9 answers
27.5k
27.5k views
GATE CSE 2014 | Set 1 | Question: 55
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $...
go_editor
27.5k
views
asked
Sep 28, 2014
CO & Architecture
gatecse-2014-set1
co-and-architecture
numerical-answers
normal
speedup
+
–
68
68 votes
6
answers
6 answers
23.0k
23.0k views
GATE CSE 2014 | Set 1 | Question: 54
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id)You wan...
go_editor
23.0k
views
asked
Sep 28, 2014
Databases
gatecse-2014-set1
databases
sql
normal
+
–
84
84 votes
16
answers
16 answers
24.3k
24.3k views
GATE CSE 2014 | Set 1 | Question: 53
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE?$(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge...
go_editor
24.3k
views
asked
Sep 28, 2014
Mathematical Logic
gatecse-2014-set1
mathematical-logic
normal
propositional-logic
+
–
50
50 votes
5
answers
5 answers
14.2k
14.2k views
GATE CSE 2014 | Set 1 | Question: 52
An ordered $n-$tuple $(d_1, d_2,\ldots,d_n)$ with $d_1 \geq d_2 \geq \ldots \geq d_n$ is called graphic if there exists a simple undirected graph with $n$ vertices havin...
go_editor
14.2k
views
asked
Sep 28, 2014
Graph Theory
gatecse-2014-set1
graph-theory
normal
degree-of-graph
+
–
145
145 votes
17
answers
17 answers
40.0k
40.0k views
GATE CSE 2014 | Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...
go_editor
40.0k
views
asked
Sep 28, 2014
Graph Theory
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
+
–
84
84 votes
9
answers
9 answers
19.6k
19.6k views
GATE CSE 2014 | Set 1 | Question: 50
Let ܵ$S$ denote the set of all functions $f:\{0,1\}^4 \to \{0,1\}$. Denote by $N$ the number of functions from S to the set $\{0,1\}$. The value of $ \log_2 \log_2N $ is ...
go_editor
19.6k
views
asked
Sep 28, 2014
Set Theory & Algebra
gatecse-2014-set1
set-theory&algebra
functions
combinatory
numerical-answers
+
–
92
92 votes
17
answers
17 answers
22.6k
22.6k views
GATE CSE 2014 | Set 1 | Question: 49
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. ...
go_editor
22.6k
views
asked
Sep 28, 2014
Combinatory
gatecse-2014-set1
combinatory
numerical-answers
normal
+
–
56
56 votes
9
answers
9 answers
16.0k
16.0k views
GATE CSE 2014 | Set 1 | Question: 48
Four fair six-sided dice are rolled. The probability that the sum of the results being $22$ is $\dfrac{X}{1296}$. The value of $X$ is _______
go_editor
16.0k
views
asked
Sep 28, 2014
Probability
gatecse-2014-set1
probability
numerical-answers
normal
+
–
112
112 votes
12
12 answers
35.8k
35.8k views
GATE CSE 2014 | Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
go_editor
35.8k
views
asked
Sep 28, 2014
Calculus
gatecse-2014-set1
calculus
continuity
tricky
+
–
30
30 votes
5
answers
5 answers
10.0k
10.0k views
GATE CSE 2014 | Set 1 | Question: 46
The function $f(x) =x \sin x$ satisfies the following equation: $$f''(x) + f(x) +t \cos x = 0$$The value of $t$ is______.
go_editor
10.0k
views
asked
Sep 28, 2014
Calculus
gatecse-2014-set1
calculus
easy
numerical-answers
differentiation
+
–
51
51 votes
5
answers
5 answers
20.9k
20.9k views
GATE CSE 2014 | Set 1 | Question: 45
Consider the $4\text{-to-1}$ multiplexer with two select lines $ S_1$ and $ S_0 $ given belowThe minimal sum-of-products form of the Boolean expression for the output $F$...
go_editor
20.9k
views
asked
Sep 28, 2014
Digital Logic
gatecse-2014-set1
digital-logic
normal
multiplexer
min-sum-of-products-form
+
–
180
180 votes
13
answers
13 answers
37.0k
37.0k views
GATE CSE 2014 | Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses ...
go_editor
37.0k
views
asked
Sep 28, 2014
CO & Architecture
gatecse-2014-set1
co-and-architecture
cache-memory
normal
+
–
78
78 votes
11
answers
11 answers
33.2k
33.2k views
GATE CSE 2014 | Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
go_editor
33.2k
views
asked
Sep 28, 2014
CO & Architecture
gatecse-2014-set1
co-and-architecture
pipelining
numerical-answers
normal
speedup
+
–
111
111 votes
15
answers
15 answers
51.7k
51.7k views
GATE CSE 2014 | Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3H...
go_editor
51.7k
views
asked
Sep 28, 2014
Algorithms
gatecse-2014-set1
algorithms
time-complexity
normal
+
–
62
62 votes
6
answers
6 answers
21.6k
21.6k views
GATE CSE 2014 | Set 1 | Question: 41
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i...
go_editor
21.6k
views
asked
Sep 28, 2014
Algorithms
gatecse-2014-set1
algorithms
identify-function
normal
+
–
50
50 votes
5
answers
5 answers
16.5k
16.5k views
GATE CSE 2014 | Set 1 | Question: 40
Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$. The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5...
go_editor
16.5k
views
asked
Sep 28, 2014
Data Structures
gatecse-2014-set1
data-structures
hashing
normal
+
–
137
137 votes
18
answers
18 answers
79.4k
79.4k views
GATE CSE 2014 | Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
go_editor
79.4k
views
asked
Sep 28, 2014
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
sorting
+
–
14
14 votes
5
answers
5 answers
11.5k
11.5k views
GATE CSE 2014 | Set 1 | Question: 38
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the...
go_editor
11.5k
views
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set1
algorithms
p-np-npc-nph
normal
out-of-gatecse-syllabus
+
–
68
68 votes
13
answers
13 answers
18.3k
18.3k views
GATE CSE 2014 | Set 1 | Question: 37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I p...
go_editor
18.3k
views
asked
Sep 28, 2014
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
algorithm-design
+
–
76
76 votes
6
answers
6 answers
30.8k
30.8k views
GATE CSE 2014 | Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
go_editor
30.8k
views
asked
Sep 28, 2014
Theory of Computation
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
+
–
47
47 votes
5
answers
5 answers
13.5k
13.5k views
GATE CSE 2014 | Set 1 | Question: 35
Let $L$ be a language and $\bar{L}$ be its complement. Which one of the following is NOT a viable possibility?Neither $L$ nor $\bar{L}$ is recursively enumerable $(r.e.)...
go_editor
13.5k
views
asked
Sep 26, 2014
Theory of Computation
gatecse-2014-set1
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
+
–
56
56 votes
7
answers
7 answers
47.9k
47.9k views
GATE CSE 2014 | Set 1 | Question: 34
A canonical set of items is given below$S \to L . R $$Q \to R.$On input symbol $<$ the set hasa shift-reduce conflict and a reduce-reduce conflict.a shift-reduce conflict...
go_editor
47.9k
views
asked
Sep 26, 2014
Compiler Design
gatecse-2014-set1
compiler-design
parsing
normal
lr-parser
+
–
33
33 votes
4
answers
4 answers
11.6k
11.6k views
GATE CSE 2014 | Set 1 | Question: 33
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using ...
go_editor
11.6k
views
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
page-replacement
numerical-answers
+
–
37
37 votes
4
answers
4 answers
13.4k
13.4k views
GATE CSE 2014 | Set 1 | Question: 32
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.$$\small \begin{array}{|c|c|c|} \hline \textbf{...
go_editor
13.4k
views
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
process-scheduling
numerical-answers
normal
+
–
69
69 votes
6
answers
6 answers
36.1k
36.1k views
GATE CSE 2014 | Set 1 | Question: 31
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types $X, Y,$ and $Z$ to three processes $P0, P1,$ a...
go_editor
36.1k
views
asked
Sep 26, 2014
Operating System
gatecse-2014-set1
operating-system
resource-allocation
normal
+
–
63
63 votes
5
answers
5 answers
21.8k
21.8k views
GATE CSE 2014 | Set 1 | Question: 30
Given the following two statements: S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ S2: $AB \to C, D \to E, E \to C$ is ...
go_editor
21.8k
views
asked
Sep 26, 2014
Databases
gatecse-2014-set1
databases
database-normalization
normal
+
–
37
37 votes
4
answers
4 answers
14.7k
14.7k views
GATE CSE 2014 | Set 1 | Question: 29
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by $r(x)$ and $w(x)$ respectiv...
go_editor
14.7k
views
asked
Sep 26, 2014
Databases
gatecse-2014-set1
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
68
68 votes
8
answers
8 answers
42.5k
42.5k views
GATE CSE 2014 | Set 1 | Question: 28
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\...
go_editor
42.5k
views
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
sliding-window
numerical-answers
normal
+
–
117
117 votes
13
answers
13 answers
55.9k
55.9k views
GATE CSE 2014 | Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...
go_editor
55.9k
views
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
+
–
14
14 votes
6
answers
6 answers
21.2k
21.2k views
GATE CSE 2014 | Set 1 | Question: 26
Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is $2 \times10^8m/s$ and the to...
go_editor
21.2k
views
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
token-ring
numerical-answers
out-of-gatecse-syllabus
+
–
Page:
1
2
3
next »